{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EY7FSDYHZKZHAHXTYGYRW3M6MG","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":"def1eb396e2a80f1d84fef575e6c5fddd62735eff6a0466a02b8c67a36998a6b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:05:55Z","title_canon_sha256":"8f786a73da146eef9efb518f4144bd819903f4396822d48457a8d9ed8923d6ca"},"schema_version":"1.0","source":{"id":"1907.05083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05083","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05083v1","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05083","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"EY7FSDYHZKZH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EY7FSDYHZKZHAHXT","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EY7FSDYH","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:1f159e24e2efe5170e134a8526ceaa9808837cdc402cbb2feccf5db3a48f15c0","target":"graph","created_at":"2026-05-17T23:40:48Z","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":"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","authors_text":"Hao Wu, Jialin Zhang, Wei Zi, Xiaohui Bei, Xiaoming Sun, Zhijie Zhang","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:05:55Z","title":"Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05083","kind":"arxiv","version":1},"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:b65b13daee92e659a8de6876be8cbbce086c8c4c589e7c73e5f0d37e4094e18f","target":"record","created_at":"2026-05-17T23:40:48Z","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":"def1eb396e2a80f1d84fef575e6c5fddd62735eff6a0466a02b8c67a36998a6b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:05:55Z","title_canon_sha256":"8f786a73da146eef9efb518f4144bd819903f4396822d48457a8d9ed8923d6ca"},"schema_version":"1.0","source":{"id":"1907.05083","kind":"arxiv","version":1}},"canonical_sha256":"263e590f07cab2701ef3c1b11b6d9e61bd6b8269e3779998c04bfae28391d0b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"263e590f07cab2701ef3c1b11b6d9e61bd6b8269e3779998c04bfae28391d0b9","first_computed_at":"2026-05-17T23:40:48.520199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:48.520199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oYSt95RsXJFI6P+BsH1Rz0M/ySu7QH0HRdVVGU79N4Wd9KxBj2VIjZz3PLdAEzgjo8s/80bI9V5uf3V6yG7MBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:48.520923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b65b13daee92e659a8de6876be8cbbce086c8c4c589e7c73e5f0d37e4094e18f","sha256:1f159e24e2efe5170e134a8526ceaa9808837cdc402cbb2feccf5db3a48f15c0"],"state_sha256":"51b2279a9087dd3f70af12e917cea54cb109af25bc5a36a48f1efb8e7f9e99df"}