{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R5PEFJUGF663ASXXBTDHKBC46F","short_pith_number":"pith:R5PEFJUG","schema_version":"1.0","canonical_sha256":"8f5e42a6862fbdb04af70cc675045cf17e441e770b3b4cb644904f8faf08febe","source":{"kind":"arxiv","id":"1511.02599","version":3},"attestation_state":"computed","paper":{"title":"Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Avinatan Hassidim, Erel Segal-Halevi, Yonatan Aumann","submitted_at":"2015-11-09T09:00:47Z","abstract_excerpt":"We consider the classic problem of envy-free division of a heterogeneous good (\"cake\") among several agents. It is known that, when the allotted pieces must be connected, the problem cannot be solved by a finite algorithm for 3 or more agents. The impossibility result, however, assumes that the entire cake must be allocated. In this paper we replace the entire-allocation requirement with a weaker \\emph{partial-proportionality} requirement: the piece given to each agent must be worth for it at least a certain positive fraction of the entire cake value. We prove that this version of the problem "},"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":"1511.02599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:00:47Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"bc99133ae28973a51baf62fc82fc709661de25d3519d117c19370a723a2b1b6d","abstract_canon_sha256":"f4cb0f4f828136d0f5db5854f5224cd7ec9514b0ed1b2a23c391d887de2f8e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:09.884969Z","signature_b64":"jZ/feO/Mc50xP4J7c1nCYPL8jPM+xmpV/jMf/MDj/Xy7yuQEf+364yfPFJhcAzxgCpFYmJ1Q102tSq7mpGuDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5e42a6862fbdb04af70cc675045cf17e441e770b3b4cb644904f8faf08febe","last_reissued_at":"2026-05-18T00:16:09.884325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:09.884325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Avinatan Hassidim, Erel Segal-Halevi, Yonatan Aumann","submitted_at":"2015-11-09T09:00:47Z","abstract_excerpt":"We consider the classic problem of envy-free division of a heterogeneous good (\"cake\") among several agents. It is known that, when the allotted pieces must be connected, the problem cannot be solved by a finite algorithm for 3 or more agents. The impossibility result, however, assumes that the entire cake must be allocated. In this paper we replace the entire-allocation requirement with a weaker \\emph{partial-proportionality} requirement: the piece given to each agent must be worth for it at least a certain positive fraction of the entire cake value. We prove that this version of the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02599","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1511.02599","created_at":"2026-05-18T00:16:09.884426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02599v3","created_at":"2026-05-18T00:16:09.884426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02599","created_at":"2026-05-18T00:16:09.884426+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5PEFJUGF663","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5PEFJUGF663ASXX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5PEFJUG","created_at":"2026-05-18T12:29:39.896362+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/R5PEFJUGF663ASXXBTDHKBC46F","json":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F.json","graph_json":"https://pith.science/api/pith-number/R5PEFJUGF663ASXXBTDHKBC46F/graph.json","events_json":"https://pith.science/api/pith-number/R5PEFJUGF663ASXXBTDHKBC46F/events.json","paper":"https://pith.science/paper/R5PEFJUG"},"agent_actions":{"view_html":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F","download_json":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F.json","view_paper":"https://pith.science/paper/R5PEFJUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02599&json=true","fetch_graph":"https://pith.science/api/pith-number/R5PEFJUGF663ASXXBTDHKBC46F/graph.json","fetch_events":"https://pith.science/api/pith-number/R5PEFJUGF663ASXXBTDHKBC46F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/action/storage_attestation","attest_author":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/action/author_attestation","sign_citation":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/action/citation_signature","submit_replication":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/action/replication_record"}},"created_at":"2026-05-18T00:16:09.884426+00:00","updated_at":"2026-05-18T00:16:09.884426+00:00"}