{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UMYRYYQ2L63PVYXH5CCZ52PGJN","short_pith_number":"pith:UMYRYYQ2","schema_version":"1.0","canonical_sha256":"a3311c621a5fb6fae2e7e8859ee9e64b7d5c2b7d18564636032987f64e3b8cd2","source":{"kind":"arxiv","id":"2408.02403","version":1},"attestation_state":"computed","paper":{"title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Luofeng Liao, Yuan Gao, Zongjun Yang","submitted_at":"2024-08-05T11:55:41Z","abstract_excerpt":"We investigate the online fair allocation problem with sequentially arriving items under various input models, with the goal of balancing fairness and efficiency. We propose the unconstrained PACE (Pacing According to Current Estimated utility) algorithm, a parameter-free allocation dynamic that requires no prior knowledge of the input while using only integral allocations. PACE attains near-optimal convergence or approximation guarantees under stationary, stochastic-but-nonstationary, and adversarial input types, thereby achieving the first best-of-many-worlds guarantee in online fair allocat"},"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":"2408.02403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-08-05T11:55:41Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"62f9d3df7051690000e67a85a435ec4a7a5972507a4573b02f6d06918f6ec75f","abstract_canon_sha256":"1c731365938098ebe638d8d218d5b456d31e1b3188a990b0428e91f292edcd73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:52:12.213819Z","signature_b64":"xBzbe3N7lF6ieJ1JlVkW6GLvI7Vu5mSM5C3+0VW9Vpa5qqTQYVftLGlAUJ0ZMdha8L7cBkQRVY+NtJGawhc6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3311c621a5fb6fae2e7e8859ee9e64b7d5c2b7d18564636032987f64e3b8cd2","last_reissued_at":"2026-07-05T08:52:12.213428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:52:12.213428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Luofeng Liao, Yuan Gao, Zongjun Yang","submitted_at":"2024-08-05T11:55:41Z","abstract_excerpt":"We investigate the online fair allocation problem with sequentially arriving items under various input models, with the goal of balancing fairness and efficiency. We propose the unconstrained PACE (Pacing According to Current Estimated utility) algorithm, a parameter-free allocation dynamic that requires no prior knowledge of the input while using only integral allocations. PACE attains near-optimal convergence or approximation guarantees under stationary, stochastic-but-nonstationary, and adversarial input types, thereby achieving the first best-of-many-worlds guarantee in online fair allocat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.02403","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/2408.02403/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":"2408.02403","created_at":"2026-07-05T08:52:12.213483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.02403v1","created_at":"2026-07-05T08:52:12.213483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.02403","created_at":"2026-07-05T08:52:12.213483+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMYRYYQ2L63P","created_at":"2026-07-05T08:52:12.213483+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMYRYYQ2L63PVYXH","created_at":"2026-07-05T08:52:12.213483+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMYRYYQ2","created_at":"2026-07-05T08:52:12.213483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09473","citing_title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN","json":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN.json","graph_json":"https://pith.science/api/pith-number/UMYRYYQ2L63PVYXH5CCZ52PGJN/graph.json","events_json":"https://pith.science/api/pith-number/UMYRYYQ2L63PVYXH5CCZ52PGJN/events.json","paper":"https://pith.science/paper/UMYRYYQ2"},"agent_actions":{"view_html":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN","download_json":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN.json","view_paper":"https://pith.science/paper/UMYRYYQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.02403&json=true","fetch_graph":"https://pith.science/api/pith-number/UMYRYYQ2L63PVYXH5CCZ52PGJN/graph.json","fetch_events":"https://pith.science/api/pith-number/UMYRYYQ2L63PVYXH5CCZ52PGJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN/action/storage_attestation","attest_author":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN/action/author_attestation","sign_citation":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN/action/citation_signature","submit_replication":"https://pith.science/pith/UMYRYYQ2L63PVYXH5CCZ52PGJN/action/replication_record"}},"created_at":"2026-07-05T08:52:12.213483+00:00","updated_at":"2026-07-05T08:52:12.213483+00:00"}