{"schema_version":"papers/paper-detail-v1","title":"Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach","surface":"papers","opportunity_kernel":{"paper_id":"b5d0cb5f-3f5d-4d75-8e3f-d7c1521a5f32","title":"Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach","authors":["Abdelkrim Alahyane","Céline Comte","Matthieu Jonckheere"],"arxiv_id":"2603.26231v1","doi":null,"published_at":"2026-03-27T09:53:53.000Z","score_object":{"overall":{"value":4,"scale":"0-10","confidence":0.85,"confidence_reason":"Backfilled from persisted papers.viability_score.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-04-02T02:30:40.136Z","fresh_until":"2026-05-02T02:30:40.136Z","is_stale":true,"source_count":1,"missingness":[]},"technical":{"value":2,"scale":"0-10","confidence":0.55,"confidence_reason":"Backfilled from paper_extraction_scorecards.reconstruction_score.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-03-30T21:58:46.434Z","fresh_until":"2026-04-13T21:58:46.434Z","is_stale":true,"source_count":1,"missingness":[]},"commercial":{"value":4,"scale":"0-10","confidence":0.75,"confidence_reason":"Backfilled from persisted commercial_flags and repo availability.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-04-02T02:30:40.136Z","fresh_until":"2026-05-02T02:30:40.136Z","is_stale":true,"source_count":1,"missingness":[]},"market":{"value":0,"scale":"0-10","confidence":0.15,"confidence_reason":"No persisted distribution_readiness_scores row was available; marked low confidence.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-04-02T02:30:40.136Z","fresh_until":"2026-04-16T02:30:40.136Z","is_stale":true,"source_count":0,"missingness":["distribution_readiness_scores.score"]},"team":{"value":10,"scale":"0-10","confidence":0.15,"confidence_reason":"No persisted team-quality evidence was available; marked low confidence.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-04-02T02:30:40.136Z","fresh_until":"2026-04-16T02:30:40.136Z","is_stale":true,"source_count":0,"missingness":["engineer_profiles.builder_score","author_startups"]},"methodology":{"value":9.65,"scale":"0-10","confidence":0.82,"confidence_reason":"Backfilled from paper_extraction_scorecards.total_score.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-03-30T21:58:46.434Z","fresh_until":"2026-04-29T21:58:46.434Z","is_stale":true,"source_count":2,"missingness":[]}},"evidence_receipt":{"freshness":"stale","proof_status":"unverified","repo_status":"missing","references_count":10,"source_count":3,"coverage":0.5,"missingness":["repo_url","proof_status","distribution_readiness_scores"],"unresolved_unknowns":["distribution readiness has not been computed yet","proof verification has not been recorded yet"],"last_verification_at":"2026-03-30T21:58:46.434Z"},"lineage_hash":"1ec53defcc224f6a2198e555a7325835a26c429e6cc5208e626dcdd5f476df81"},"distribution":null,"replication_evidence":[],"author_dna":[]}