{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3PH6MI47X4ODDVVAVUTG5YCJXO","short_pith_number":"pith:3PH6MI47","schema_version":"1.0","canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","source":{"kind":"arxiv","id":"2406.02402","version":3},"attestation_state":"computed","paper":{"title":"Online Fair Allocation of Perishable Resources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"math.OC","authors_text":"Chamsi Hssaine, Sean R. Sinclair, Siddhartha Banerjee","submitted_at":"2024-06-04T15:14:10Z","abstract_excerpt":"We consider a practically motivated variant of the canonical online fair allocation problem: a decision-maker has a budget of perishable resources to allocate over a fixed number of rounds. Each round sees a random number of arrivals, and the decision-maker must commit to an allocation for these individuals before moving on to the next round. The goal is to construct a sequence of allocations that is envy-free and efficient. Our work makes two important contributions toward this problem: we first derive strong lower bounds on the optimal envy-efficiency trade-off, demonstrating that a decision"},"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":"2406.02402","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T15:14:10Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"5f10b25a6abbf7c65be4d7ae4d4c4fbacee2d1d2adfc0f858a2ff5b9d1714de8","abstract_canon_sha256":"21b98f47c2e22af8fe7db20c362f9289cca61a5ea1b7356760be86aad2af3785"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:03.559599Z","signature_b64":"2HcYIcJgEvU3bC3buerRVU1bvLX52fXc3bnsQFLjMOAG60pk4O5DQXBQlqGwVX/DkCu0BOB/b8KXcacHK2XSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbcfe6239fbf1c31d6a0ad266ee049bb8f20b211de8859b93071552ff2a51a62","last_reissued_at":"2026-07-07T02:17:03.558684Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:03.558684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Fair Allocation of Perishable Resources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"math.OC","authors_text":"Chamsi Hssaine, Sean R. Sinclair, Siddhartha Banerjee","submitted_at":"2024-06-04T15:14:10Z","abstract_excerpt":"We consider a practically motivated variant of the canonical online fair allocation problem: a decision-maker has a budget of perishable resources to allocate over a fixed number of rounds. Each round sees a random number of arrivals, and the decision-maker must commit to an allocation for these individuals before moving on to the next round. The goal is to construct a sequence of allocations that is envy-free and efficient. Our work makes two important contributions toward this problem: we first derive strong lower bounds on the optimal envy-efficiency trade-off, demonstrating that a decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02402","kind":"arxiv","version":3},"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/2406.02402/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":"2406.02402","created_at":"2026-07-07T02:17:03.558818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02402v3","created_at":"2026-07-07T02:17:03.558818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02402","created_at":"2026-07-07T02:17:03.558818+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PH6MI47X4OD","created_at":"2026-07-07T02:17:03.558818+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PH6MI47X4ODDVVA","created_at":"2026-07-07T02:17:03.558818+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PH6MI47","created_at":"2026-07-07T02:17:03.558818+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22174","citing_title":"Online Fair Division for Personalized $2$-Value Instances","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO","json":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO.json","graph_json":"https://pith.science/api/pith-number/3PH6MI47X4ODDVVAVUTG5YCJXO/graph.json","events_json":"https://pith.science/api/pith-number/3PH6MI47X4ODDVVAVUTG5YCJXO/events.json","paper":"https://pith.science/paper/3PH6MI47"},"agent_actions":{"view_html":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO","download_json":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO.json","view_paper":"https://pith.science/paper/3PH6MI47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02402&json=true","fetch_graph":"https://pith.science/api/pith-number/3PH6MI47X4ODDVVAVUTG5YCJXO/graph.json","fetch_events":"https://pith.science/api/pith-number/3PH6MI47X4ODDVVAVUTG5YCJXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/action/storage_attestation","attest_author":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/action/author_attestation","sign_citation":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/action/citation_signature","submit_replication":"https://pith.science/pith/3PH6MI47X4ODDVVAVUTG5YCJXO/action/replication_record"}},"created_at":"2026-07-07T02:17:03.558818+00:00","updated_at":"2026-07-07T02:17:03.558818+00:00"}