{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ELBUUHADCHKK7WH7ZPV6LEJIUM","short_pith_number":"pith:ELBUUHAD","canonical_record":{"source":{"id":"1504.00774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T08:24:31Z","cross_cats_sorted":[],"title_canon_sha256":"8c8354c1151c7218ad0ab3efe86bac9e150f7683d19460ab4085616d78c956d4","abstract_canon_sha256":"703312bed5056137ff473d6e58323ad42508ace823258b88ed7426bd04a932d4"},"schema_version":"1.0"},"canonical_sha256":"22c34a1c0311d4afd8ffcbebe59128a31d2e5abae0ad326621cdccaecb97fa04","source":{"kind":"arxiv","id":"1504.00774","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00774","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00774v2","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00774","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"ELBUUHADCHKK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELBUUHADCHKK7WH7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELBUUHAD","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ELBUUHADCHKK7WH7ZPV6LEJIUM","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T08:24:31Z","cross_cats_sorted":[],"title_canon_sha256":"8c8354c1151c7218ad0ab3efe86bac9e150f7683d19460ab4085616d78c956d4","abstract_canon_sha256":"703312bed5056137ff473d6e58323ad42508ace823258b88ed7426bd04a932d4"},"schema_version":"1.0"},"canonical_sha256":"22c34a1c0311d4afd8ffcbebe59128a31d2e5abae0ad326621cdccaecb97fa04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:25.601303Z","signature_b64":"UOoEb+fCJgf3dHJjStUdzzw+wTG+vUEvQQ8C8RSTuTAIO7L/Og/aly1Ko0t1kWejtergZdu2/ef96z8EpM4DCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22c34a1c0311d4afd8ffcbebe59128a31d2e5abae0ad326621cdccaecb97fa04","last_reissued_at":"2026-05-18T01:36:25.600674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:25.600674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00774","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-18T01:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnwF8URT6X2R5nIUtuZnGSGywVpKepwqHj1yENAIRherQIkLXpk8HKkXTdLXN9BnapQI6L4Ofzs9pVFVUsaFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:39:23.654057Z"},"content_sha256":"6e2764513bf4e75931aac31a6ffd4baf7c21b6f61eafde52bd004aefe1fef1e7","schema_version":"1.0","event_id":"sha256:6e2764513bf4e75931aac31a6ffd4baf7c21b6f61eafde52bd004aefe1fef1e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ELBUUHADCHKK7WH7ZPV6LEJIUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to solve the cake-cutting problem in sublinear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"CREST, Hiro Ito (UEC, Japan, Japan), JST, Takahiro Ueda (Komatsu Ltd.","submitted_at":"2015-04-03T08:24:31Z","abstract_excerpt":"In this paper, we show algorithms for solving the cake-cutting problem in sublinear-time. More specifically, we preassign (simple) fair portions to o(n) players in o(n)-time, and minimize the damage to the rest of the players. All currently known algorithms require Omega(n)-time, even when assigning a portion to just one player, and it is nontrivial to revise these algorithms to run in $o(n)$-time since many of the remaining players, who have not been asked any queries, may not be satisfied with the remaining cake. To challenge this problem, we begin by providing a framework for solving the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00774","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-18T01:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRCz44kZHDSgHEuwHSZFIkdVLXfnFX0gWJSyrhUGRn/3cVe/EjzyS+LtwVP20z1BNWgl7hub5iFa4d5Ioi85DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:39:23.654769Z"},"content_sha256":"7e358d84ae2c233db901e3de5be4d4dfcf8ce811c038b1ddc1307f1cfc3a25e0","schema_version":"1.0","event_id":"sha256:7e358d84ae2c233db901e3de5be4d4dfcf8ce811c038b1ddc1307f1cfc3a25e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/bundle.json","state_url":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/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-30T17:39:23Z","links":{"resolver":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM","bundle":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/bundle.json","state":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ELBUUHADCHKK7WH7ZPV6LEJIUM","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":"703312bed5056137ff473d6e58323ad42508ace823258b88ed7426bd04a932d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T08:24:31Z","title_canon_sha256":"8c8354c1151c7218ad0ab3efe86bac9e150f7683d19460ab4085616d78c956d4"},"schema_version":"1.0","source":{"id":"1504.00774","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00774","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00774v2","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00774","created_at":"2026-05-18T01:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"ELBUUHADCHKK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELBUUHADCHKK7WH7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELBUUHAD","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:7e358d84ae2c233db901e3de5be4d4dfcf8ce811c038b1ddc1307f1cfc3a25e0","target":"graph","created_at":"2026-05-18T01:36:25Z","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":"In this paper, we show algorithms for solving the cake-cutting problem in sublinear-time. More specifically, we preassign (simple) fair portions to o(n) players in o(n)-time, and minimize the damage to the rest of the players. All currently known algorithms require Omega(n)-time, even when assigning a portion to just one player, and it is nontrivial to revise these algorithms to run in $o(n)$-time since many of the remaining players, who have not been asked any queries, may not be satisfied with the remaining cake. To challenge this problem, we begin by providing a framework for solving the ca","authors_text":"CREST, Hiro Ito (UEC, Japan, Japan), JST, Takahiro Ueda (Komatsu Ltd.","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T08:24:31Z","title":"How to solve the cake-cutting problem in sublinear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00774","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:6e2764513bf4e75931aac31a6ffd4baf7c21b6f61eafde52bd004aefe1fef1e7","target":"record","created_at":"2026-05-18T01:36:25Z","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":"703312bed5056137ff473d6e58323ad42508ace823258b88ed7426bd04a932d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-03T08:24:31Z","title_canon_sha256":"8c8354c1151c7218ad0ab3efe86bac9e150f7683d19460ab4085616d78c956d4"},"schema_version":"1.0","source":{"id":"1504.00774","kind":"arxiv","version":2}},"canonical_sha256":"22c34a1c0311d4afd8ffcbebe59128a31d2e5abae0ad326621cdccaecb97fa04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22c34a1c0311d4afd8ffcbebe59128a31d2e5abae0ad326621cdccaecb97fa04","first_computed_at":"2026-05-18T01:36:25.600674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:25.600674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UOoEb+fCJgf3dHJjStUdzzw+wTG+vUEvQQ8C8RSTuTAIO7L/Og/aly1Ko0t1kWejtergZdu2/ef96z8EpM4DCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:25.601303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00774","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e2764513bf4e75931aac31a6ffd4baf7c21b6f61eafde52bd004aefe1fef1e7","sha256:7e358d84ae2c233db901e3de5be4d4dfcf8ce811c038b1ddc1307f1cfc3a25e0"],"state_sha256":"9ba058729dbab4ed7dcfac0f919af3e4aa9451793e1dd2d7831fda6da964b377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NLbdCOOj9CR2u4MbkBx9hgk0eBr8ihwpG5dnGX5evSMTbPSyYIUF/Jh2ylLUIuBCdGjLLEgbTQgZITVa49dDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:39:23.659974Z","bundle_sha256":"5b69220e73ff0447486980beaf7dfe32d3fc2ffdc26fb6aa0756557a04ed81a2"}}