{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A74273NP6UIQG4WCKWX7QFNK2C","short_pith_number":"pith:A74273NP","schema_version":"1.0","canonical_sha256":"07f9afedaff5110372c255aff815aad0a8d164b2a28381c6ef08fdd10286a81a","source":{"kind":"arxiv","id":"2403.02683","version":2},"attestation_state":"computed","paper":{"title":"Learning to Defer to a Population: A Meta-Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Patra, Dharmesh Tailor, Eric Nalisnick, Putra Manggala, Rajeev Verma","submitted_at":"2024-03-05T06:10:28Z","abstract_excerpt":"The learning to defer (L2D) framework allows autonomous systems to be safe and robust by allocating difficult decisions to a human expert. All existing work on L2D assumes that each expert is well-identified, and if any expert were to change, the system should be re-trained. In this work, we alleviate this constraint, formulating an L2D system that can cope with never-before-seen experts at test-time. We accomplish this by using meta-learning, considering both optimization- and model-based variants. Given a small context set to characterize the currently available expert, our framework can qui"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.02683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-05T06:10:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4fe169434a09be78b7d789c771a44cb938ef998bb20e0cc67ab8bb4eab8bd674","abstract_canon_sha256":"c33ca7a15436a6e370f719892fadab1bcd7cd024b623138b5c7f7ce519ccabb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:05.934349Z","signature_b64":"6LfQgqsbiV7wk6k3gBrO/OU9Omth2WzELFFRQ49NtosnCGMHIZ+UT0qo+SruKoPrpU6J6XM3nF20k4+Xof6nBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f9afedaff5110372c255aff815aad0a8d164b2a28381c6ef08fdd10286a81a","last_reissued_at":"2026-07-05T08:18:05.933882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:05.933882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Defer to a Population: A Meta-Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Patra, Dharmesh Tailor, Eric Nalisnick, Putra Manggala, Rajeev Verma","submitted_at":"2024-03-05T06:10:28Z","abstract_excerpt":"The learning to defer (L2D) framework allows autonomous systems to be safe and robust by allocating difficult decisions to a human expert. All existing work on L2D assumes that each expert is well-identified, and if any expert were to change, the system should be re-trained. In this work, we alleviate this constraint, formulating an L2D system that can cope with never-before-seen experts at test-time. We accomplish this by using meta-learning, considering both optimization- and model-based variants. Given a small context set to characterize the currently available expert, our framework can qui"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02683","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02683/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.02683","created_at":"2026-07-05T08:18:05.933939+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02683v2","created_at":"2026-07-05T08:18:05.933939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02683","created_at":"2026-07-05T08:18:05.933939+00:00"},{"alias_kind":"pith_short_12","alias_value":"A74273NP6UIQ","created_at":"2026-07-05T08:18:05.933939+00:00"},{"alias_kind":"pith_short_16","alias_value":"A74273NP6UIQG4WC","created_at":"2026-07-05T08:18:05.933939+00:00"},{"alias_kind":"pith_short_8","alias_value":"A74273NP","created_at":"2026-07-05T08:18:05.933939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14753","citing_title":"Cost-Aware Routing for Efficient Text-To-Image Generation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C","json":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C.json","graph_json":"https://pith.science/api/pith-number/A74273NP6UIQG4WCKWX7QFNK2C/graph.json","events_json":"https://pith.science/api/pith-number/A74273NP6UIQG4WCKWX7QFNK2C/events.json","paper":"https://pith.science/paper/A74273NP"},"agent_actions":{"view_html":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C","download_json":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C.json","view_paper":"https://pith.science/paper/A74273NP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02683&json=true","fetch_graph":"https://pith.science/api/pith-number/A74273NP6UIQG4WCKWX7QFNK2C/graph.json","fetch_events":"https://pith.science/api/pith-number/A74273NP6UIQG4WCKWX7QFNK2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C/action/storage_attestation","attest_author":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C/action/author_attestation","sign_citation":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C/action/citation_signature","submit_replication":"https://pith.science/pith/A74273NP6UIQG4WCKWX7QFNK2C/action/replication_record"}},"created_at":"2026-07-05T08:18:05.933939+00:00","updated_at":"2026-07-05T08:18:05.933939+00:00"}