{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DLZE57AACZPBRZ3H2KCJSXYOOT","short_pith_number":"pith:DLZE57AA","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"},"canonical_sha256":"1af24efc00165e18e767d284995f0e74fa7345fed5d596a290c3d24f8687290f","source":{"kind":"arxiv","id":"1709.09876","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09876","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09876v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09876","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"DLZE57AACZPB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLZE57AACZPBRZ3H","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLZE57AA","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DLZE57AACZPBRZ3H2KCJSXYOOT","target":"record","payload":{"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"},"canonical_sha256":"1af24efc00165e18e767d284995f0e74fa7345fed5d596a290c3d24f8687290f","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"},"source_kind":"arxiv","source_id":"1709.09876","source_version":2,"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:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qr/ivxZd2VWiqx2WDXsHpWjxVkYsFvsaU4UYdCpQsvdIjBhrQcRSj9zoZ7Ai9Mw+1nDiDJSzE04c9NQNFxkVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:02.092545Z"},"content_sha256":"dfc95bbd9caf56faf4c06a9faa682903b7b74e47c31a8dac4dbd4ca4c1d5c718","schema_version":"1.0","event_id":"sha256:dfc95bbd9caf56faf4c06a9faa682903b7b74e47c31a8dac4dbd4ca4c1d5c718"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DLZE57AACZPBRZ3H2KCJSXYOOT","target":"graph","payload":{"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"},"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:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNXR8SaFKfQCVVedsZRnwyd6d+eXqvCrrF8HYVf7W9MwJqYYghlwHjdX3la0L8iWePWtTMfJaAaG7A1TLI8nCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:02.092907Z"},"content_sha256":"897cae6634e9154b91058cf983f583c47415a9561da9b4f25ebc9104400e39b4","schema_version":"1.0","event_id":"sha256:897cae6634e9154b91058cf983f583c47415a9561da9b4f25ebc9104400e39b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/bundle.json","state_url":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/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-25T09:22:02Z","links":{"resolver":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT","bundle":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/bundle.json","state":"https://pith.science/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLZE57AACZPBRZ3H2KCJSXYOOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DLZE57AACZPBRZ3H2KCJSXYOOT","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":"41e8a45970b7cbe4c1fd1e2d9c277eedf4d8421ce903a7bb9f0c5bf2af076d48","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-09-28T09:51:56Z","title_canon_sha256":"4c324e38fc3b7ffe52cee0c85a37ea75c778609bcdc301be098e00c115620976"},"schema_version":"1.0","source":{"id":"1709.09876","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09876","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09876v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09876","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"DLZE57AACZPB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DLZE57AACZPBRZ3H","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DLZE57AA","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:897cae6634e9154b91058cf983f583c47415a9561da9b4f25ebc9104400e39b4","target":"graph","created_at":"2026-05-18T00:07:50Z","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 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","authors_text":"Noam Nisan, Simina Br\\^anzei","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-09-28T09:51:56Z","title":"Communication Complexity of Cake Cutting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09876","kind":"arxiv","version":2},"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:dfc95bbd9caf56faf4c06a9faa682903b7b74e47c31a8dac4dbd4ca4c1d5c718","target":"record","created_at":"2026-05-18T00:07:50Z","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":"41e8a45970b7cbe4c1fd1e2d9c277eedf4d8421ce903a7bb9f0c5bf2af076d48","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-09-28T09:51:56Z","title_canon_sha256":"4c324e38fc3b7ffe52cee0c85a37ea75c778609bcdc301be098e00c115620976"},"schema_version":"1.0","source":{"id":"1709.09876","kind":"arxiv","version":2}},"canonical_sha256":"1af24efc00165e18e767d284995f0e74fa7345fed5d596a290c3d24f8687290f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1af24efc00165e18e767d284995f0e74fa7345fed5d596a290c3d24f8687290f","first_computed_at":"2026-05-18T00:07:50.524742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:50.524742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O00zhebvHa/wQLOzFFDcOJCEQc90cS2J6HrPVrKN9OaHKPYqNCY4FcquRg9NEgt2kETMosv6b/dn6rHfpmVtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:50.525356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09876","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfc95bbd9caf56faf4c06a9faa682903b7b74e47c31a8dac4dbd4ca4c1d5c718","sha256:897cae6634e9154b91058cf983f583c47415a9561da9b4f25ebc9104400e39b4"],"state_sha256":"0aa8d9fc89399f64762d125773d05ee3666b204570333e06706c2a71943621d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olyrv39BISNo0QL2fJpVMIZ3Xj4V7CKYMtGZ8hh6QD04RGtL5v3ajsLJSPMb4AR6lOnQd5uvdfthPUojWAopBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:22:02.095633Z","bundle_sha256":"9cb2bb99489932c122d6bf209312cbc6de4a241fc50a6980007bc54f4ba14005"}}