{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6E4P5Y3IWZ3AR6P2D5WNFXFIBT","short_pith_number":"pith:6E4P5Y3I","schema_version":"1.0","canonical_sha256":"f138fee368b67608f9fa1f6cd2dca80ce55f95f3a138c5e57da5bfe1147819ca","source":{"kind":"arxiv","id":"2508.04779","version":1},"attestation_state":"computed","paper":{"title":"Online EFX Allocations with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Nicos Protopapas, Themistoklis Melissourgos","submitted_at":"2025-08-06T18:00:15Z","abstract_excerpt":"We study an online fair division problem where a fixed number of goods arrive sequentially and must be allocated to a given set of agents. Once a good arrives, its true value for each agent is revealed, and it has to be immediately and irrevocably allocated to some agent. The ultimate goal is to ensure envy-freeness up to any good (EFX) after all goods have been allocated. Unfortunately, as we show, approximate EFX allocations are unattainable in general, even under restrictive assumptions on the valuation functions.\n  To address this, we follow a recent and fruitful trend of augmenting algori"},"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.04779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-06T18:00:15Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"2c0b1b574243183755cf2e74efdc74e59823410ede7348912dea1233ec7e6461","abstract_canon_sha256":"da01855b52de6910a52f908510cfc711c450477b3cefd8756108d6c0d7fd5a5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:01.440908Z","signature_b64":"bnIY8wWaIN1mnikDiTzXBe+01afs2unjKVYOlL/7yoZlx7I9tL3cZd885oBITGr0lUHvxnH+ZIrTByhyeYhxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f138fee368b67608f9fa1f6cd2dca80ce55f95f3a138c5e57da5bfe1147819ca","last_reissued_at":"2026-07-05T11:50:01.440445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:01.440445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online EFX Allocations with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Nicos Protopapas, Themistoklis Melissourgos","submitted_at":"2025-08-06T18:00:15Z","abstract_excerpt":"We study an online fair division problem where a fixed number of goods arrive sequentially and must be allocated to a given set of agents. Once a good arrives, its true value for each agent is revealed, and it has to be immediately and irrevocably allocated to some agent. The ultimate goal is to ensure envy-freeness up to any good (EFX) after all goods have been allocated. Unfortunately, as we show, approximate EFX allocations are unattainable in general, even under restrictive assumptions on the valuation functions.\n  To address this, we follow a recent and fruitful trend of augmenting algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04779","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/2508.04779/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.04779","created_at":"2026-07-05T11:50:01.440503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04779v1","created_at":"2026-07-05T11:50:01.440503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04779","created_at":"2026-07-05T11:50:01.440503+00:00"},{"alias_kind":"pith_short_12","alias_value":"6E4P5Y3IWZ3A","created_at":"2026-07-05T11:50:01.440503+00:00"},{"alias_kind":"pith_short_16","alias_value":"6E4P5Y3IWZ3AR6P2","created_at":"2026-07-05T11:50:01.440503+00:00"},{"alias_kind":"pith_short_8","alias_value":"6E4P5Y3I","created_at":"2026-07-05T11:50:01.440503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01159","citing_title":"Online Fair Division Meets Reordering Buffers","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT","json":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT.json","graph_json":"https://pith.science/api/pith-number/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/graph.json","events_json":"https://pith.science/api/pith-number/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/events.json","paper":"https://pith.science/paper/6E4P5Y3I"},"agent_actions":{"view_html":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT","download_json":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT.json","view_paper":"https://pith.science/paper/6E4P5Y3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04779&json=true","fetch_graph":"https://pith.science/api/pith-number/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/graph.json","fetch_events":"https://pith.science/api/pith-number/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/action/storage_attestation","attest_author":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/action/author_attestation","sign_citation":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/action/citation_signature","submit_replication":"https://pith.science/pith/6E4P5Y3IWZ3AR6P2D5WNFXFIBT/action/replication_record"}},"created_at":"2026-07-05T11:50:01.440503+00:00","updated_at":"2026-07-05T11:50:01.440503+00:00"}