{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YE3MNQ5SQPMZHZR6RZ4F6IP3BM","short_pith_number":"pith:YE3MNQ5S","canonical_record":{"source":{"id":"1604.03655","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-13T05:06:29Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"c03123634d99c350dbbf4059fa8dc2c31b4b1d28132226417cb23623d73ae211","abstract_canon_sha256":"7bfff3ce421204438e11b607cec0dfb55cae2e628ad8f8178b71d6dd721e7f7e"},"schema_version":"1.0"},"canonical_sha256":"c136c6c3b283d993e63e8e785f21fb0b2b3adc3c070998d1cceae6b17021f60d","source":{"kind":"arxiv","id":"1604.03655","version":12},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03655","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03655v12","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03655","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"YE3MNQ5SQPMZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YE3MNQ5SQPMZHZR6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YE3MNQ5S","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YE3MNQ5SQPMZHZR6RZ4F6IP3BM","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03655","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-13T05:06:29Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"c03123634d99c350dbbf4059fa8dc2c31b4b1d28132226417cb23623d73ae211","abstract_canon_sha256":"7bfff3ce421204438e11b607cec0dfb55cae2e628ad8f8178b71d6dd721e7f7e"},"schema_version":"1.0"},"canonical_sha256":"c136c6c3b283d993e63e8e785f21fb0b2b3adc3c070998d1cceae6b17021f60d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.408172Z","signature_b64":"l5ddtxim1MFoo1xxS7oHZFNYK1KEuLPgFV+I4qw2JExsVeKkZTPoMEiUciEm0+lnoo7EvQCwz6LQlDVLLkONAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c136c6c3b283d993e63e8e785f21fb0b2b3adc3c070998d1cceae6b17021f60d","last_reissued_at":"2026-05-18T00:36:41.407488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.407488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03655","source_version":12,"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:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+IcV/Tma3e1vvnevIOjUCrxqx+ko07mC5zWc+kAHiu5AppRrRe8ZfacoqO/m/t3KxN8Dxazfj5Xqfe/v6mk+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:23:04.632436Z"},"content_sha256":"8677eb3ceb476c78e94b57ceadceac7362fe2804964a7c23664a3b81d974cc45","schema_version":"1.0","event_id":"sha256:8677eb3ceb476c78e94b57ceadceac7362fe2804964a7c23664a3b81d974cc45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YE3MNQ5SQPMZHZR6RZ4F6IP3BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.DS","authors_text":"Haris Aziz, Simon Mackenzie","submitted_at":"2016-04-13T05:06:29Z","abstract_excerpt":"We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from $n$ agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a discrete and bounded envy-free protocol. We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents. The maximum number of queries required by the protocol is $n^{n^{n^{n^{n^n}}}}$. We additionally show that even if we do not run our protocol to completion, it can find in at mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03655","kind":"arxiv","version":12},"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:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5kIRUZpG8sUICJoxbPdeEi0aTeI82HlKBEpoK5nyWGd3ZHjfwceqTHjZj6612Lcf0Rb1z65DRjtLav8KVwjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:23:04.633039Z"},"content_sha256":"4b1ddcd120f4f51b4d9ecdd7ea831fdb73ceb632bbe235f494c9b4bb87f3d40b","schema_version":"1.0","event_id":"sha256:4b1ddcd120f4f51b4d9ecdd7ea831fdb73ceb632bbe235f494c9b4bb87f3d40b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/bundle.json","state_url":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/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-05-27T22:23:04Z","links":{"resolver":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM","bundle":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/bundle.json","state":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YE3MNQ5SQPMZHZR6RZ4F6IP3BM","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":"7bfff3ce421204438e11b607cec0dfb55cae2e628ad8f8178b71d6dd721e7f7e","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-13T05:06:29Z","title_canon_sha256":"c03123634d99c350dbbf4059fa8dc2c31b4b1d28132226417cb23623d73ae211"},"schema_version":"1.0","source":{"id":"1604.03655","kind":"arxiv","version":12}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03655","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03655v12","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03655","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"YE3MNQ5SQPMZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YE3MNQ5SQPMZHZR6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YE3MNQ5S","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:4b1ddcd120f4f51b4d9ecdd7ea831fdb73ceb632bbe235f494c9b4bb87f3d40b","target":"graph","created_at":"2026-05-18T00:36:41Z","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 well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from $n$ agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a discrete and bounded envy-free protocol. We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents. The maximum number of queries required by the protocol is $n^{n^{n^{n^{n^n}}}}$. We additionally show that even if we do not run our protocol to completion, it can find in at mos","authors_text":"Haris Aziz, Simon Mackenzie","cross_cats":["cs.AI","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-13T05:06:29Z","title":"A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03655","kind":"arxiv","version":12},"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:8677eb3ceb476c78e94b57ceadceac7362fe2804964a7c23664a3b81d974cc45","target":"record","created_at":"2026-05-18T00:36:41Z","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":"7bfff3ce421204438e11b607cec0dfb55cae2e628ad8f8178b71d6dd721e7f7e","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-13T05:06:29Z","title_canon_sha256":"c03123634d99c350dbbf4059fa8dc2c31b4b1d28132226417cb23623d73ae211"},"schema_version":"1.0","source":{"id":"1604.03655","kind":"arxiv","version":12}},"canonical_sha256":"c136c6c3b283d993e63e8e785f21fb0b2b3adc3c070998d1cceae6b17021f60d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c136c6c3b283d993e63e8e785f21fb0b2b3adc3c070998d1cceae6b17021f60d","first_computed_at":"2026-05-18T00:36:41.407488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:41.407488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l5ddtxim1MFoo1xxS7oHZFNYK1KEuLPgFV+I4qw2JExsVeKkZTPoMEiUciEm0+lnoo7EvQCwz6LQlDVLLkONAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:41.408172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03655","source_kind":"arxiv","source_version":12}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8677eb3ceb476c78e94b57ceadceac7362fe2804964a7c23664a3b81d974cc45","sha256:4b1ddcd120f4f51b4d9ecdd7ea831fdb73ceb632bbe235f494c9b4bb87f3d40b"],"state_sha256":"afbd6b02c2a527274b96201e6a697af3de8962f0c2585c7b607bc5f79bf3afb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOlrVgRq+YPIqLKfG4t0L1B2x2iJk2JbWliM90N+1KoF7+ZWcOUwz0neMECv8xxB+ndNGgZ2ssEpCRnBKqmIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:23:04.636451Z","bundle_sha256":"5afae69f49d102384dcad19b25b6c46858b47bc4738f1fabfa6155a0f07aea0a"}}