{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OUY5D6SRGL6RDDWGNUSPEENSVJ","short_pith_number":"pith:OUY5D6SR","schema_version":"1.0","canonical_sha256":"7531d1fa5132fd118ec66d24f211b2aa4ea76c667d44377e55f96222e85c2edf","source":{"kind":"arxiv","id":"2607.23310","version":1},"attestation_state":"computed","paper":{"title":"Online Fair Division with Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","econ.TH"],"primary_cat":"cs.GT","authors_text":"Michael J. Wooldridge, Nicholas Teh, Paul W. Goldberg, Saar Cohen","submitted_at":"2026-07-25T17:53:10Z","abstract_excerpt":"We study an online variant of discrete fair division under generalized assignment budget constraints. Goods arrive one at a time and must be assigned irrevocably to a feasible agent or to charity, which holds all unallocated goods, while fairness is evaluated only against budget-feasible subsets of every recipient's bundle. We first show that, without additional structure, no deterministic online algorithm can guarantee any fixed approximation to feasible envy-freeness, even in highly symmetric instances. We then identify bounded density spread as a structural condition that restores meaningfu"},"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":"2607.23310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-25T17:53:10Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA","econ.TH"],"title_canon_sha256":"f50a2e4eacf7b02c92f8d43bd4575d1f86e0c1e8ca5c799ede4f31d8ce642636","abstract_canon_sha256":"f8a0a20d2e980c92358348e5245a78f67dea02e44cdd7a6a00ee906106cc753c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:22:47.145427Z","signature_b64":"6BE1PtemyWZwl+3CF2+VTftdqYHC3SRm6FXjI4EXz4rGZRlAj/eko1FWG4jg9vpze8umAKRNsynknWZsIghKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7531d1fa5132fd118ec66d24f211b2aa4ea76c667d44377e55f96222e85c2edf","last_reissued_at":"2026-07-28T01:22:47.144610Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:22:47.144610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Fair Division with Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","econ.TH"],"primary_cat":"cs.GT","authors_text":"Michael J. Wooldridge, Nicholas Teh, Paul W. Goldberg, Saar Cohen","submitted_at":"2026-07-25T17:53:10Z","abstract_excerpt":"We study an online variant of discrete fair division under generalized assignment budget constraints. Goods arrive one at a time and must be assigned irrevocably to a feasible agent or to charity, which holds all unallocated goods, while fairness is evaluated only against budget-feasible subsets of every recipient's bundle. We first show that, without additional structure, no deterministic online algorithm can guarantee any fixed approximation to feasible envy-freeness, even in highly symmetric instances. We then identify bounded density spread as a structural condition that restores meaningfu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23310","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/2607.23310/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":"2607.23310","created_at":"2026-07-28T01:22:47.145033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23310v1","created_at":"2026-07-28T01:22:47.145033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23310","created_at":"2026-07-28T01:22:47.145033+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUY5D6SRGL6R","created_at":"2026-07-28T01:22:47.145033+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUY5D6SRGL6RDDWG","created_at":"2026-07-28T01:22:47.145033+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUY5D6SR","created_at":"2026-07-28T01:22:47.145033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ","json":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ.json","graph_json":"https://pith.science/api/pith-number/OUY5D6SRGL6RDDWGNUSPEENSVJ/graph.json","events_json":"https://pith.science/api/pith-number/OUY5D6SRGL6RDDWGNUSPEENSVJ/events.json","paper":"https://pith.science/paper/OUY5D6SR"},"agent_actions":{"view_html":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ","download_json":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ.json","view_paper":"https://pith.science/paper/OUY5D6SR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23310&json=true","fetch_graph":"https://pith.science/api/pith-number/OUY5D6SRGL6RDDWGNUSPEENSVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OUY5D6SRGL6RDDWGNUSPEENSVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ/action/storage_attestation","attest_author":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ/action/author_attestation","sign_citation":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ/action/citation_signature","submit_replication":"https://pith.science/pith/OUY5D6SRGL6RDDWGNUSPEENSVJ/action/replication_record"}},"created_at":"2026-07-28T01:22:47.145033+00:00","updated_at":"2026-07-28T01:22:47.145033+00:00"}