{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EY7FSDYHZKZHAHXTYGYRW3M6MG","short_pith_number":"pith:EY7FSDYH","schema_version":"1.0","canonical_sha256":"263e590f07cab2701ef3c1b11b6d9e61bd6b8269e3779998c04bfae28391d0b9","source":{"kind":"arxiv","id":"1907.05083","version":1},"attestation_state":"computed","paper":{"title":"Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Hao Wu, Jialin Zhang, Wei Zi, Xiaohui Bei, Xiaoming Sun, Zhijie Zhang","submitted_at":"2019-07-11T10:05:55Z","abstract_excerpt":"The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well known that a proportional allocation among $n$ agents can be found efficiently via simple protocols [16]. For envy-freeness, in a recent breakthrough, Aziz and Mackenzie [5] proposed a discrete and bounded envy-free protocol for any number of players. However, the protocol suffers from high multiple-exponential query complexity and it remains o"},"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":"1907.05083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:05:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8f786a73da146eef9efb518f4144bd819903f4396822d48457a8d9ed8923d6ca","abstract_canon_sha256":"def1eb396e2a80f1d84fef575e6c5fddd62735eff6a0466a02b8c67a36998a6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:48.520923Z","signature_b64":"oYSt95RsXJFI6P+BsH1Rz0M/ySu7QH0HRdVVGU79N4Wd9KxBj2VIjZz3PLdAEzgjo8s/80bI9V5uf3V6yG7MBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263e590f07cab2701ef3c1b11b6d9e61bd6b8269e3779998c04bfae28391d0b9","last_reissued_at":"2026-05-17T23:40:48.520199Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:48.520199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Hao Wu, Jialin Zhang, Wei Zi, Xiaohui Bei, Xiaoming Sun, Zhijie Zhang","submitted_at":"2019-07-11T10:05:55Z","abstract_excerpt":"The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well known that a proportional allocation among $n$ agents can be found efficiently via simple protocols [16]. For envy-freeness, in a recent breakthrough, Aziz and Mackenzie [5] proposed a discrete and bounded envy-free protocol for any number of players. However, the protocol suffers from high multiple-exponential query complexity and it remains o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05083","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":""},"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":"1907.05083","created_at":"2026-05-17T23:40:48.520329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05083v1","created_at":"2026-05-17T23:40:48.520329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05083","created_at":"2026-05-17T23:40:48.520329+00:00"},{"alias_kind":"pith_short_12","alias_value":"EY7FSDYHZKZH","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EY7FSDYHZKZHAHXT","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EY7FSDYH","created_at":"2026-05-18T12:33:15.570797+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/EY7FSDYHZKZHAHXTYGYRW3M6MG","json":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG.json","graph_json":"https://pith.science/api/pith-number/EY7FSDYHZKZHAHXTYGYRW3M6MG/graph.json","events_json":"https://pith.science/api/pith-number/EY7FSDYHZKZHAHXTYGYRW3M6MG/events.json","paper":"https://pith.science/paper/EY7FSDYH"},"agent_actions":{"view_html":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG","download_json":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG.json","view_paper":"https://pith.science/paper/EY7FSDYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05083&json=true","fetch_graph":"https://pith.science/api/pith-number/EY7FSDYHZKZHAHXTYGYRW3M6MG/graph.json","fetch_events":"https://pith.science/api/pith-number/EY7FSDYHZKZHAHXTYGYRW3M6MG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG/action/storage_attestation","attest_author":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG/action/author_attestation","sign_citation":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG/action/citation_signature","submit_replication":"https://pith.science/pith/EY7FSDYHZKZHAHXTYGYRW3M6MG/action/replication_record"}},"created_at":"2026-05-17T23:40:48.520329+00:00","updated_at":"2026-05-17T23:40:48.520329+00:00"}