{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YE3MNQ5SQPMZHZR6RZ4F6IP3BM","short_pith_number":"pith:YE3MNQ5S","schema_version":"1.0","canonical_sha256":"c136c6c3b283d993e63e8e785f21fb0b2b3adc3c070998d1cceae6b17021f60d","source":{"kind":"arxiv","id":"1604.03655","version":12},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.03655","created_at":"2026-05-18T00:36:41.407613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03655v12","created_at":"2026-05-18T00:36:41.407613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03655","created_at":"2026-05-18T00:36:41.407613+00:00"},{"alias_kind":"pith_short_12","alias_value":"YE3MNQ5SQPMZ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YE3MNQ5SQPMZHZR6","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YE3MNQ5S","created_at":"2026-05-18T12:30:53.716459+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/YE3MNQ5SQPMZHZR6RZ4F6IP3BM","json":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM.json","graph_json":"https://pith.science/api/pith-number/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/graph.json","events_json":"https://pith.science/api/pith-number/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/events.json","paper":"https://pith.science/paper/YE3MNQ5S"},"agent_actions":{"view_html":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM","download_json":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM.json","view_paper":"https://pith.science/paper/YE3MNQ5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03655&json=true","fetch_graph":"https://pith.science/api/pith-number/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/graph.json","fetch_events":"https://pith.science/api/pith-number/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/action/storage_attestation","attest_author":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/action/author_attestation","sign_citation":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/action/citation_signature","submit_replication":"https://pith.science/pith/YE3MNQ5SQPMZHZR6RZ4F6IP3BM/action/replication_record"}},"created_at":"2026-05-18T00:36:41.407613+00:00","updated_at":"2026-05-18T00:36:41.407613+00:00"}