{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:35BQ3FBR34PVYCH32P4FHM7HAD","short_pith_number":"pith:35BQ3FBR","schema_version":"1.0","canonical_sha256":"df430d9431df1f5c08fbd3f853b3e700d0997f18f31d803ae514f5f34b5ef3f2","source":{"kind":"arxiv","id":"2508.03253","version":2},"attestation_state":"computed","paper":{"title":"Approximate Proportionality in Online Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.GT","authors_text":"Davin Choo, Derek Khu, Nicholas Teh, Tzeh Yuan Neoh, Tze-Yang Poon, Winston Fu","submitted_at":"2025-08-05T09:31:42Z","abstract_excerpt":"We study the online fair division problem, where indivisible goods arrive sequentially and must be allocated immediately and irrevocably. Prior work establishes strong impossibility results for approximating classic notions such as envy-freeness up to one good (EF1) and maximin share (MMS) in this setting, but the approximability of proportionality up to one good (PROP1) has remained unresolved. We resolve this gap in two steps. First, we show that three natural greedy allocation rules (standard baselines in fair division) fail to guarantee any multiplicative approximation to PROP1 against an "},"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":"2508.03253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-05T09:31:42Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"cdc1b1f8a09ef335f53c95c30256a3b55e958636211918221a4d36340c4eae10","abstract_canon_sha256":"0763bcf752aedc39c5bc7872bab8b2f8599e8f5c33214b635e1f44a12f407ce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:04:54.722464Z","signature_b64":"8q0NaZJuZtwMKe9b9Q6rrBBfqyMN/qnEZVKuy6EhXaY9pRJxOp2i6AUGdl6442kHRK1VVEdnAPSED0IZKGArCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df430d9431df1f5c08fbd3f853b3e700d0997f18f31d803ae514f5f34b5ef3f2","last_reissued_at":"2026-05-29T01:04:54.722020Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:04:54.722020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Proportionality in Online Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.GT","authors_text":"Davin Choo, Derek Khu, Nicholas Teh, Tzeh Yuan Neoh, Tze-Yang Poon, Winston Fu","submitted_at":"2025-08-05T09:31:42Z","abstract_excerpt":"We study the online fair division problem, where indivisible goods arrive sequentially and must be allocated immediately and irrevocably. Prior work establishes strong impossibility results for approximating classic notions such as envy-freeness up to one good (EF1) and maximin share (MMS) in this setting, but the approximability of proportionality up to one good (PROP1) has remained unresolved. We resolve this gap in two steps. First, we show that three natural greedy allocation rules (standard baselines in fair division) fail to guarantee any multiplicative approximation to PROP1 against an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03253","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/2508.03253/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":"2508.03253","created_at":"2026-05-29T01:04:54.722077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.03253v2","created_at":"2026-05-29T01:04:54.722077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03253","created_at":"2026-05-29T01:04:54.722077+00:00"},{"alias_kind":"pith_short_12","alias_value":"35BQ3FBR34PV","created_at":"2026-05-29T01:04:54.722077+00:00"},{"alias_kind":"pith_short_16","alias_value":"35BQ3FBR34PVYCH3","created_at":"2026-05-29T01:04:54.722077+00:00"},{"alias_kind":"pith_short_8","alias_value":"35BQ3FBR","created_at":"2026-05-29T01:04:54.722077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11157","citing_title":"The Price of Proportional Representation in Temporal Voting","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD","json":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD.json","graph_json":"https://pith.science/api/pith-number/35BQ3FBR34PVYCH32P4FHM7HAD/graph.json","events_json":"https://pith.science/api/pith-number/35BQ3FBR34PVYCH32P4FHM7HAD/events.json","paper":"https://pith.science/paper/35BQ3FBR"},"agent_actions":{"view_html":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD","download_json":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD.json","view_paper":"https://pith.science/paper/35BQ3FBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.03253&json=true","fetch_graph":"https://pith.science/api/pith-number/35BQ3FBR34PVYCH32P4FHM7HAD/graph.json","fetch_events":"https://pith.science/api/pith-number/35BQ3FBR34PVYCH32P4FHM7HAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD/action/storage_attestation","attest_author":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD/action/author_attestation","sign_citation":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD/action/citation_signature","submit_replication":"https://pith.science/pith/35BQ3FBR34PVYCH32P4FHM7HAD/action/replication_record"}},"created_at":"2026-05-29T01:04:54.722077+00:00","updated_at":"2026-05-29T01:04:54.722077+00:00"}