{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R5PEFJUGF663ASXXBTDHKBC46F","short_pith_number":"pith:R5PEFJUG","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"},"canonical_sha256":"8f5e42a6862fbdb04af70cc675045cf17e441e770b3b4cb644904f8faf08febe","source":{"kind":"arxiv","id":"1511.02599","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02599","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02599v3","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02599","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"R5PEFJUGF663","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5PEFJUGF663ASXX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5PEFJUG","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R5PEFJUGF663ASXXBTDHKBC46F","target":"record","payload":{"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"},"canonical_sha256":"8f5e42a6862fbdb04af70cc675045cf17e441e770b3b4cb644904f8faf08febe","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"},"source_kind":"arxiv","source_id":"1511.02599","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bb6Ia0V3Rm25vHeis4tZdHFtU904RZyHfQ+l+GVFmbYZkH3/QgV/rMH7ueaa4xKZVKtWQCJ8xTOjwUW6odHEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:16:30.990683Z"},"content_sha256":"8b4d5553cf4c4eb3e3049147d2bdfdd0c33355c0809255bea17d9a7272586f84","schema_version":"1.0","event_id":"sha256:8b4d5553cf4c4eb3e3049147d2bdfdd0c33355c0809255bea17d9a7272586f84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R5PEFJUGF663ASXXBTDHKBC46F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNTy7So39XV/vQdW05gHStNwcruV42ogzSn4VdJhRrspXAA76/BoSiAwSm2oD8F4Xv+hnMexJLsudszgFkc1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:16:30.991027Z"},"content_sha256":"f1244c15174e9f606d63b75051689b5efdad0e12fbc110c790bf271f9bf5a578","schema_version":"1.0","event_id":"sha256:f1244c15174e9f606d63b75051689b5efdad0e12fbc110c790bf271f9bf5a578"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/bundle.json","state_url":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5PEFJUGF663ASXXBTDHKBC46F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T02:16:30Z","links":{"resolver":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F","bundle":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/bundle.json","state":"https://pith.science/pith/R5PEFJUGF663ASXXBTDHKBC46F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5PEFJUGF663ASXXBTDHKBC46F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R5PEFJUGF663ASXXBTDHKBC46F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f4cb0f4f828136d0f5db5854f5224cd7ec9514b0ed1b2a23c391d887de2f8e10","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:00:47Z","title_canon_sha256":"bc99133ae28973a51baf62fc82fc709661de25d3519d117c19370a723a2b1b6d"},"schema_version":"1.0","source":{"id":"1511.02599","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02599","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02599v3","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02599","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"R5PEFJUGF663","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5PEFJUGF663ASXX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5PEFJUG","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f1244c15174e9f606d63b75051689b5efdad0e12fbc110c790bf271f9bf5a578","target":"graph","created_at":"2026-05-18T00:16:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Avinatan Hassidim, Erel Segal-Halevi, Yonatan Aumann","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:00:47Z","title":"Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02599","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b4d5553cf4c4eb3e3049147d2bdfdd0c33355c0809255bea17d9a7272586f84","target":"record","created_at":"2026-05-18T00:16:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f4cb0f4f828136d0f5db5854f5224cd7ec9514b0ed1b2a23c391d887de2f8e10","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T09:00:47Z","title_canon_sha256":"bc99133ae28973a51baf62fc82fc709661de25d3519d117c19370a723a2b1b6d"},"schema_version":"1.0","source":{"id":"1511.02599","kind":"arxiv","version":3}},"canonical_sha256":"8f5e42a6862fbdb04af70cc675045cf17e441e770b3b4cb644904f8faf08febe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f5e42a6862fbdb04af70cc675045cf17e441e770b3b4cb644904f8faf08febe","first_computed_at":"2026-05-18T00:16:09.884325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:09.884325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZ/feO/Mc50xP4J7c1nCYPL8jPM+xmpV/jMf/MDj/Xy7yuQEf+364yfPFJhcAzxgCpFYmJ1Q102tSq7mpGuDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:09.884969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02599","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b4d5553cf4c4eb3e3049147d2bdfdd0c33355c0809255bea17d9a7272586f84","sha256:f1244c15174e9f606d63b75051689b5efdad0e12fbc110c790bf271f9bf5a578"],"state_sha256":"fd787c041e2bd3c627db1a424cac4f1b36f5e2dbfd6c7c8bc95bc4c3ae116458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAr1oZC1aO1VP5MOS+D7q6IbSbSJFJ3LojKPbzRzXg6u1UkYBKY2aYCPA6nJCFOr629Qoy9/NcGjSoWAlu8rCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:16:30.992959Z","bundle_sha256":"3dc6b145b860690f12fa1ce3b26ec51349f1cc28047d54f948280a287360ef6c"}}