{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EJZ7QF7VHAFOYSCZTZCN5OREHX","short_pith_number":"pith:EJZ7QF7V","schema_version":"1.0","canonical_sha256":"2273f817f5380aec48599e44deba243de7fa7a8ad5e384c6aae9d062551955f0","source":{"kind":"arxiv","id":"1507.08497","version":2},"attestation_state":"computed","paper":{"title":"Which Unbounded Protocol for Envy Free Cake Cutting is Better?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.LO","authors_text":"William Gasarch","submitted_at":"2015-07-28T21:33:26Z","abstract_excerpt":"A division of a cake by n people is envy free if everyone thinks they got the biggest pieces. Note that peoples tastes can differ. There is a discrete protocol for envy free division for n=3 which takes at most 5 cuts. For n=4 and beyond there is a protocol but the number of cuts it takes is unbounded. In particular the number of cuts depends on peoples tastes. Given any number N peoples tastes can be set so that the algorithm takes over N cuts. There are three such algorithms known. Which is better?\n  We have devised a way to measure the number of cuts even though it is unbounded. We use ordi"},"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":"1507.08497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-07-28T21:33:26Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"049e1e0594cd8d99f3eaee4da2810e0cac96fe367f5354a022703cc1858f3a2e","abstract_canon_sha256":"807cdf2c9faa26a91d68afe83da6f49ec1f573a5d2ab1bc47363199487aed09b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:54.292130Z","signature_b64":"XmfPD4x4jg8As1lmTjryDWssec3MzlWkbhkAVkeLUwGT5e+PKqn4npFWcIqSiHN4yYxGdf9N2CEUZYFnf6CuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2273f817f5380aec48599e44deba243de7fa7a8ad5e384c6aae9d062551955f0","last_reissued_at":"2026-05-18T01:34:54.291478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:54.291478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which Unbounded Protocol for Envy Free Cake Cutting is Better?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.LO","authors_text":"William Gasarch","submitted_at":"2015-07-28T21:33:26Z","abstract_excerpt":"A division of a cake by n people is envy free if everyone thinks they got the biggest pieces. Note that peoples tastes can differ. There is a discrete protocol for envy free division for n=3 which takes at most 5 cuts. For n=4 and beyond there is a protocol but the number of cuts it takes is unbounded. In particular the number of cuts depends on peoples tastes. Given any number N peoples tastes can be set so that the algorithm takes over N cuts. There are three such algorithms known. Which is better?\n  We have devised a way to measure the number of cuts even though it is unbounded. We use ordi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08497","kind":"arxiv","version":2},"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":"1507.08497","created_at":"2026-05-18T01:34:54.291584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08497v2","created_at":"2026-05-18T01:34:54.291584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08497","created_at":"2026-05-18T01:34:54.291584+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJZ7QF7VHAFO","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJZ7QF7VHAFOYSCZ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJZ7QF7V","created_at":"2026-05-18T12:29:19.899920+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/EJZ7QF7VHAFOYSCZTZCN5OREHX","json":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX.json","graph_json":"https://pith.science/api/pith-number/EJZ7QF7VHAFOYSCZTZCN5OREHX/graph.json","events_json":"https://pith.science/api/pith-number/EJZ7QF7VHAFOYSCZTZCN5OREHX/events.json","paper":"https://pith.science/paper/EJZ7QF7V"},"agent_actions":{"view_html":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX","download_json":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX.json","view_paper":"https://pith.science/paper/EJZ7QF7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08497&json=true","fetch_graph":"https://pith.science/api/pith-number/EJZ7QF7VHAFOYSCZTZCN5OREHX/graph.json","fetch_events":"https://pith.science/api/pith-number/EJZ7QF7VHAFOYSCZTZCN5OREHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX/action/storage_attestation","attest_author":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX/action/author_attestation","sign_citation":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX/action/citation_signature","submit_replication":"https://pith.science/pith/EJZ7QF7VHAFOYSCZTZCN5OREHX/action/replication_record"}},"created_at":"2026-05-18T01:34:54.291584+00:00","updated_at":"2026-05-18T01:34:54.291584+00:00"}