{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GXJR4HAFHJBUN35F7ABNSPF4Y5","short_pith_number":"pith:GXJR4HAF","schema_version":"1.0","canonical_sha256":"35d31e1c053a4346efa5f802d93cbcc76a1c45ee8582f522bd57b543ab620c2c","source":{"kind":"arxiv","id":"2410.14593","version":1},"attestation_state":"computed","paper":{"title":"Temporal Fair Division of Indivisible Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Alexander Lam, Edith Elkind, Mohamad Latifian, Nicholas Teh, Tzeh Yuan Neoh","submitted_at":"2024-10-18T16:43:36Z","abstract_excerpt":"We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impossibility results in achieving approximate envy-freeness under these constraints. In contrast, we consider an informed setting where the algorithm has complete knowledge of future items, and aim to ensure that the cumulative allocation at each round satisfies approximate envy-freeness -- which we define as temporal envy-freeness up to one item (TEF1). We focus on settings where items can be exclusively goods or exclus"},"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":"2410.14593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-10-18T16:43:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a87628666378d2fa48b10a1c2441da4f858ea0d9ce86f40b219abac9c87dec66","abstract_canon_sha256":"e3af8ac9aa51d0c4a54eaab13cb0524393a8957e47e1391d57d256af8df0bfc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:34.347966Z","signature_b64":"87qjN5I76AIev/YtcpyxA7q8pL7KtO0RuROxYDljb/k/R4UVdqKTuPgLncghU3tEfiJyjzo+/DfsL762WEQ+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d31e1c053a4346efa5f802d93cbcc76a1c45ee8582f522bd57b543ab620c2c","last_reissued_at":"2026-07-05T09:22:34.347524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:34.347524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Fair Division of Indivisible Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Alexander Lam, Edith Elkind, Mohamad Latifian, Nicholas Teh, Tzeh Yuan Neoh","submitted_at":"2024-10-18T16:43:36Z","abstract_excerpt":"We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impossibility results in achieving approximate envy-freeness under these constraints. In contrast, we consider an informed setting where the algorithm has complete knowledge of future items, and aim to ensure that the cumulative allocation at each round satisfies approximate envy-freeness -- which we define as temporal envy-freeness up to one item (TEF1). We focus on settings where items can be exclusively goods or exclus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14593","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/2410.14593/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":"2410.14593","created_at":"2026-07-05T09:22:34.347581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14593v1","created_at":"2026-07-05T09:22:34.347581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14593","created_at":"2026-07-05T09:22:34.347581+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXJR4HAFHJBU","created_at":"2026-07-05T09:22:34.347581+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXJR4HAFHJBUN35F","created_at":"2026-07-05T09:22:34.347581+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXJR4HAF","created_at":"2026-07-05T09:22:34.347581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24321","citing_title":"Online Fair Allocations with Binary Valuations and Beyond","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5","json":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5.json","graph_json":"https://pith.science/api/pith-number/GXJR4HAFHJBUN35F7ABNSPF4Y5/graph.json","events_json":"https://pith.science/api/pith-number/GXJR4HAFHJBUN35F7ABNSPF4Y5/events.json","paper":"https://pith.science/paper/GXJR4HAF"},"agent_actions":{"view_html":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5","download_json":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5.json","view_paper":"https://pith.science/paper/GXJR4HAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14593&json=true","fetch_graph":"https://pith.science/api/pith-number/GXJR4HAFHJBUN35F7ABNSPF4Y5/graph.json","fetch_events":"https://pith.science/api/pith-number/GXJR4HAFHJBUN35F7ABNSPF4Y5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5/action/storage_attestation","attest_author":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5/action/author_attestation","sign_citation":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5/action/citation_signature","submit_replication":"https://pith.science/pith/GXJR4HAFHJBUN35F7ABNSPF4Y5/action/replication_record"}},"created_at":"2026-07-05T09:22:34.347581+00:00","updated_at":"2026-07-05T09:22:34.347581+00:00"}