{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DLZE57AACZPBRZ3H2KCJSXYOOT","short_pith_number":"pith:DLZE57AA","schema_version":"1.0","canonical_sha256":"1af24efc00165e18e767d284995f0e74fa7345fed5d596a290c3d24f8687290f","source":{"kind":"arxiv","id":"1709.09876","version":2},"attestation_state":"computed","paper":{"title":"Communication Complexity of Cake Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Simina Br\\^anzei","submitted_at":"2017-09-28T09:51:56Z","abstract_excerpt":"We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and moving-knife), we roughly partition the various fair-allocation problems into 3 classes: \"easy\" (constant number of rounds of logarithmic many bits), \"medium\" (poly-logarithmic total communication), and \"hard\". Our main technical result concerns two of the \"medium\" problems (perfect allocation for 2 players and equitable allocatio"},"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":"1709.09876","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-09-28T09:51:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4c324e38fc3b7ffe52cee0c85a37ea75c778609bcdc301be098e00c115620976","abstract_canon_sha256":"41e8a45970b7cbe4c1fd1e2d9c277eedf4d8421ce903a7bb9f0c5bf2af076d48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.525356Z","signature_b64":"O00zhebvHa/wQLOzFFDcOJCEQc90cS2J6HrPVrKN9OaHKPYqNCY4FcquRg9NEgt2kETMosv6b/dn6rHfpmVtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af24efc00165e18e767d284995f0e74fa7345fed5d596a290c3d24f8687290f","last_reissued_at":"2026-05-18T00:07:50.524742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.524742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Complexity of Cake Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Simina Br\\^anzei","submitted_at":"2017-09-28T09:51:56Z","abstract_excerpt":"We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and moving-knife), we roughly partition the various fair-allocation problems into 3 classes: \"easy\" (constant number of rounds of logarithmic many bits), \"medium\" (poly-logarithmic total communication), and \"hard\". Our main technical result concerns two of the \"medium\" problems (perfect allocation for 2 players and equitable allocatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09876","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":"1709.09876","created_at":"2026-05-18T00:07:50.524840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09876v2","created_at":"2026-05-18T00:07:50.524840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09876","created_at":"2026-05-18T00:07:50.524840+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLZE57AACZPB","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLZE57AACZPBRZ3H","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLZE57AA","created_at":"2026-05-18T12:31:10.602751+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/DLZE57AACZPBRZ3H2KCJSXYOOT","json":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT.json","graph_json":"https://pith.science/api/pith-number/DLZE57AACZPBRZ3H2KCJSXYOOT/graph.json","events_json":"https://pith.science/api/pith-number/DLZE57AACZPBRZ3H2KCJSXYOOT/events.json","paper":"https://pith.science/paper/DLZE57AA"},"agent_actions":{"view_html":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT","download_json":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT.json","view_paper":"https://pith.science/paper/DLZE57AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09876&json=true","fetch_graph":"https://pith.science/api/pith-number/DLZE57AACZPBRZ3H2KCJSXYOOT/graph.json","fetch_events":"https://pith.science/api/pith-number/DLZE57AACZPBRZ3H2KCJSXYOOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/action/storage_attestation","attest_author":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/action/author_attestation","sign_citation":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/action/citation_signature","submit_replication":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/action/replication_record"}},"created_at":"2026-05-18T00:07:50.524840+00:00","updated_at":"2026-05-18T00:07:50.524840+00:00"}