{"schema_version":"papers/paper-detail-v1","title":"Learning to Assign Prediction Tasks to Agents with Capacity Constraints","surface":"papers","opportunity_kernel":{"paper_id":"417d2cb5-d30d-4468-b8b5-2c9717e9a877","title":"Learning to Assign Prediction Tasks to Agents with Capacity Constraints","authors":["Shang Wu","Saatvik Kher","Padhraic Smyth"],"arxiv_id":"2605.27999v1","doi":null,"published_at":"2026-05-27T05:45:47.000Z","score_object":{"overall":{"value":7,"scale":"0-10","confidence":0.85,"confidence_reason":"Aligned to persisted papers.viability_score for public contract consistency.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-28T16:19:50.543Z","fresh_until":"2026-06-27T16:19:50.543Z","is_stale":false,"source_count":1,"missingness":[]},"technical":{"value":1.4,"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-05-28T16:21:00.631Z","fresh_until":"2026-06-11T16:21:00.631Z","is_stale":false,"source_count":1,"missingness":["reproducibility_results.reproducibility_score","deployability_scores.score"]},"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-05-28T16:19:50.543Z","fresh_until":"2026-06-27T16:19:50.543Z","is_stale":false,"source_count":1,"missingness":[]},"market":{"value":2,"scale":"0-10","confidence":0.45,"confidence_reason":"Heuristic market score materialized from paper metadata, repo availability, and deployability.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-28T17:06:37.596Z","fresh_until":"2026-06-11T17:06:37.596Z","is_stale":false,"source_count":1,"missingness":[]},"team":{"value":3.8,"scale":"0-10","confidence":0.42,"confidence_reason":"Heuristic fallback from paper author count and extracted affiliations.","model_version":"phase0-backfill-v1","pipeline_version":"phase0-kernel-v1","computed_at":"2026-05-28T16:19:50.543Z","fresh_until":"2026-06-11T16:19:50.543Z","is_stale":false,"source_count":2,"missingness":[]},"methodology":{"value":4.3,"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-05-28T16:21:00.631Z","fresh_until":"2026-06-27T16:21:00.631Z","is_stale":false,"source_count":2,"missingness":[]}},"evidence_receipt":{"freshness":"fresh","proof_status":"unverified","repo_status":"missing","references_count":0,"source_count":3,"coverage":0.5,"missingness":["repo_url","references","proof_status"],"unresolved_unknowns":["proof verification has not been recorded yet"],"last_verification_at":"2026-05-28T17:06:37.596Z"},"lineage_hash":"507e68122b96fd849095ae3e5eb3bf2aef582d94420a16dab64a581492dc2b98"},"distribution":null,"replication_evidence":[],"author_dna":[]}