{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MRFXLB7XRURPXA4VMKXDK6MHGC","short_pith_number":"pith:MRFXLB7X","canonical_record":{"source":{"id":"2605.27999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-27T05:45:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5d6a755a146344f5b401509537d4ae08ef547c7127ddcffca0cc0507a4c7db4c","abstract_canon_sha256":"0dc77ffabfa1fbbcaf7647359bc3b731e3cfbafbffc47211ac6e01cf3699531b"},"schema_version":"1.0"},"canonical_sha256":"644b7587f78d22fb839562ae357987308fea5cea62132b992022bc228fbfa18e","source":{"kind":"arxiv","id":"2605.27999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27999","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27999v1","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27999","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"MRFXLB7XRURP","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"MRFXLB7XRURPXA4V","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"MRFXLB7X","created_at":"2026-05-28T01:04:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MRFXLB7XRURPXA4VMKXDK6MHGC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.27999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-27T05:45:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5d6a755a146344f5b401509537d4ae08ef547c7127ddcffca0cc0507a4c7db4c","abstract_canon_sha256":"0dc77ffabfa1fbbcaf7647359bc3b731e3cfbafbffc47211ac6e01cf3699531b"},"schema_version":"1.0"},"canonical_sha256":"644b7587f78d22fb839562ae357987308fea5cea62132b992022bc228fbfa18e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:55.655281Z","signature_b64":"b8Hq91fTy3Yg3kEvHdEvHZTb/bFg9IUsRsdLGTsC7R+BNz1noVIOfnrE9C7JygnkvTI/bNHJvcQRLqjVPpZZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"644b7587f78d22fb839562ae357987308fea5cea62132b992022bc228fbfa18e","last_reissued_at":"2026-05-28T01:04:55.654869Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:55.654869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.27999","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KfZLAd67VRKb065EYcJlkjuB2r3EXL0BHyB/IweSUHIKQ/4W1oqTTQq5aOno3BUT4A8yZbtv1qLrpuXWupwZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:45:44.735789Z"},"content_sha256":"9523e0276d04daabb99cc79bffb4f6b6b605786fb48266bd5a8a9dc518ae45d4","schema_version":"1.0","event_id":"sha256:9523e0276d04daabb99cc79bffb4f6b6b605786fb48266bd5a8a9dc518ae45d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MRFXLB7XRURPXA4VMKXDK6MHGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Assign Prediction Tasks to Agents with Capacity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.HC","authors_text":"Padhraic Smyth, Saatvik Kher, Shang Wu","submitted_at":"2026-05-27T05:45:47Z","abstract_excerpt":"We address the problem of learning to assign prediction tasks to one agent from a set of available human or AI agents. In particular, we focus on the sequential learning of agent expertise and assignment policies where each agent is constrained to handle a fraction of tasks. We provide a general theoretical characterization of this problem in terms of agent capacities, differences in agent expertise, and task context. We then develop a framework of sequential explore-exploit policy-learning algorithms that seek to maximize overall performance. Experimental results over a variety of tabular, im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27999","kind":"arxiv","version":1},"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/2605.27999/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYtOLGxNQXhNS84Ny5ovYpQ7BwxZdYgPSRBO0JXxrMFvJuwUZO9Z5p42AeNBm8jgmQ4drZW4v1dOFsj4waqhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:45:44.736157Z"},"content_sha256":"924e51f4bd67a49a6742af4e8f22a266d1885e91b7fd761a208e7a0bfa0228b2","schema_version":"1.0","event_id":"sha256:924e51f4bd67a49a6742af4e8f22a266d1885e91b7fd761a208e7a0bfa0228b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRFXLB7XRURPXA4VMKXDK6MHGC/bundle.json","state_url":"https://pith.science/pith/MRFXLB7XRURPXA4VMKXDK6MHGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRFXLB7XRURPXA4VMKXDK6MHGC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T00:45:44Z","links":{"resolver":"https://pith.science/pith/MRFXLB7XRURPXA4VMKXDK6MHGC","bundle":"https://pith.science/pith/MRFXLB7XRURPXA4VMKXDK6MHGC/bundle.json","state":"https://pith.science/pith/MRFXLB7XRURPXA4VMKXDK6MHGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRFXLB7XRURPXA4VMKXDK6MHGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MRFXLB7XRURPXA4VMKXDK6MHGC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0dc77ffabfa1fbbcaf7647359bc3b731e3cfbafbffc47211ac6e01cf3699531b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-27T05:45:47Z","title_canon_sha256":"5d6a755a146344f5b401509537d4ae08ef547c7127ddcffca0cc0507a4c7db4c"},"schema_version":"1.0","source":{"id":"2605.27999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27999","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27999v1","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27999","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"MRFXLB7XRURP","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"MRFXLB7XRURPXA4V","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"MRFXLB7X","created_at":"2026-05-28T01:04:55Z"}],"graph_snapshots":[{"event_id":"sha256:924e51f4bd67a49a6742af4e8f22a266d1885e91b7fd761a208e7a0bfa0228b2","target":"graph","created_at":"2026-05-28T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.27999/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of learning to assign prediction tasks to one agent from a set of available human or AI agents. In particular, we focus on the sequential learning of agent expertise and assignment policies where each agent is constrained to handle a fraction of tasks. We provide a general theoretical characterization of this problem in terms of agent capacities, differences in agent expertise, and task context. We then develop a framework of sequential explore-exploit policy-learning algorithms that seek to maximize overall performance. Experimental results over a variety of tabular, im","authors_text":"Padhraic Smyth, Saatvik Kher, Shang Wu","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-27T05:45:47Z","title":"Learning to Assign Prediction Tasks to Agents with Capacity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27999","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9523e0276d04daabb99cc79bffb4f6b6b605786fb48266bd5a8a9dc518ae45d4","target":"record","created_at":"2026-05-28T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0dc77ffabfa1fbbcaf7647359bc3b731e3cfbafbffc47211ac6e01cf3699531b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.HC","submitted_at":"2026-05-27T05:45:47Z","title_canon_sha256":"5d6a755a146344f5b401509537d4ae08ef547c7127ddcffca0cc0507a4c7db4c"},"schema_version":"1.0","source":{"id":"2605.27999","kind":"arxiv","version":1}},"canonical_sha256":"644b7587f78d22fb839562ae357987308fea5cea62132b992022bc228fbfa18e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"644b7587f78d22fb839562ae357987308fea5cea62132b992022bc228fbfa18e","first_computed_at":"2026-05-28T01:04:55.654869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:55.654869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b8Hq91fTy3Yg3kEvHdEvHZTb/bFg9IUsRsdLGTsC7R+BNz1noVIOfnrE9C7JygnkvTI/bNHJvcQRLqjVPpZZDA==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:55.655281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9523e0276d04daabb99cc79bffb4f6b6b605786fb48266bd5a8a9dc518ae45d4","sha256:924e51f4bd67a49a6742af4e8f22a266d1885e91b7fd761a208e7a0bfa0228b2"],"state_sha256":"e66345f47799830654f8279745ad3b71b08e1c58629289cb4bcde10e91dfe22f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVovcYdaaFDFzOc5koNDmCW1ydmfyy2SHWVU8oCYH13z7SeFenttaNlpqEN+H9AXz11uz3EqMgNA/fsrmHvHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:45:44.738198Z","bundle_sha256":"86d52958302efe9ec3c2cc3fc401e9cc4f9f4f9a752d37fa3b671ae90336553b"}}