{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VQF3WB45AQMHXPLJ2GTYBBJQWP","short_pith_number":"pith:VQF3WB45","schema_version":"1.0","canonical_sha256":"ac0bbb079d04187bbd69d1a7808530b3c375de2758f836445b9b65651835473b","source":{"kind":"arxiv","id":"2311.13765","version":2},"attestation_state":"computed","paper":{"title":"Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"math.OC","authors_text":"Bill Tang, \\c{C}a\\u{g}{\\i}l Ko\\c{c}yi\\u{g}it, Eric Rice, Phebe Vayanos","submitted_at":"2023-11-23T01:40:41Z","abstract_excerpt":"We study the problem of allocating scarce societal resources of different types (e.g., permanent housing, deceased donor kidneys for transplantation, ventilators) to heterogeneous allocatees on a waitlist (e.g., people experiencing homelessness, individuals suffering from end-stage renal disease, Covid-19 patients) based on their observed covariates. We leverage administrative data collected in deployment to design an online policy that maximizes expected outcomes while satisfying budget constraints, in the long run. Our proposed policy waitlists each individual for the resource maximizing the"},"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":"2311.13765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-23T01:40:41Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"de7593de38f458b1fad9f67231da165b6b46772c05db8eef55d9c593cdf5ee57","abstract_canon_sha256":"7c5d8c231ec6e3e77e2d637f9f0bb9ecafb51a5436a64f54509df3b75ada5de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:12.150722Z","signature_b64":"KHa0uxhVDPU87FALtfoAYF0paClELLJiPn8pf5ZI+sUdO6MPhGMKQ2gqo/F4+QPFnL0cBWM6vmhJdBls188mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac0bbb079d04187bbd69d1a7808530b3c375de2758f836445b9b65651835473b","last_reissued_at":"2026-07-05T11:52:12.150306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:12.150306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"math.OC","authors_text":"Bill Tang, \\c{C}a\\u{g}{\\i}l Ko\\c{c}yi\\u{g}it, Eric Rice, Phebe Vayanos","submitted_at":"2023-11-23T01:40:41Z","abstract_excerpt":"We study the problem of allocating scarce societal resources of different types (e.g., permanent housing, deceased donor kidneys for transplantation, ventilators) to heterogeneous allocatees on a waitlist (e.g., people experiencing homelessness, individuals suffering from end-stage renal disease, Covid-19 patients) based on their observed covariates. We leverage administrative data collected in deployment to design an online policy that maximizes expected outcomes while satisfying budget constraints, in the long run. Our proposed policy waitlists each individual for the resource maximizing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13765","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/2311.13765/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":"2311.13765","created_at":"2026-07-05T11:52:12.150368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13765v2","created_at":"2026-07-05T11:52:12.150368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13765","created_at":"2026-07-05T11:52:12.150368+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQF3WB45AQMH","created_at":"2026-07-05T11:52:12.150368+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQF3WB45AQMHXPLJ","created_at":"2026-07-05T11:52:12.150368+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQF3WB45","created_at":"2026-07-05T11:52:12.150368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06830","citing_title":"Learning Fair Demand Models","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP","json":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP.json","graph_json":"https://pith.science/api/pith-number/VQF3WB45AQMHXPLJ2GTYBBJQWP/graph.json","events_json":"https://pith.science/api/pith-number/VQF3WB45AQMHXPLJ2GTYBBJQWP/events.json","paper":"https://pith.science/paper/VQF3WB45"},"agent_actions":{"view_html":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP","download_json":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP.json","view_paper":"https://pith.science/paper/VQF3WB45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13765&json=true","fetch_graph":"https://pith.science/api/pith-number/VQF3WB45AQMHXPLJ2GTYBBJQWP/graph.json","fetch_events":"https://pith.science/api/pith-number/VQF3WB45AQMHXPLJ2GTYBBJQWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP/action/storage_attestation","attest_author":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP/action/author_attestation","sign_citation":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP/action/citation_signature","submit_replication":"https://pith.science/pith/VQF3WB45AQMHXPLJ2GTYBBJQWP/action/replication_record"}},"created_at":"2026-07-05T11:52:12.150368+00:00","updated_at":"2026-07-05T11:52:12.150368+00:00"}