{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ELBUUHADCHKK7WH7ZPV6LEJIUM","short_pith_number":"pith:ELBUUHAD","schema_version":"1.0","canonical_sha256":"22c34a1c0311d4afd8ffcbebe59128a31d2e5abae0ad326621cdccaecb97fa04","source":{"kind":"arxiv","id":"1504.00774","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.00774","created_at":"2026-05-18T01:36:25.600777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00774v2","created_at":"2026-05-18T01:36:25.600777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00774","created_at":"2026-05-18T01:36:25.600777+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELBUUHADCHKK","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELBUUHADCHKK7WH7","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELBUUHAD","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/ELBUUHADCHKK7WH7ZPV6LEJIUM","json":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM.json","graph_json":"https://pith.science/api/pith-number/ELBUUHADCHKK7WH7ZPV6LEJIUM/graph.json","events_json":"https://pith.science/api/pith-number/ELBUUHADCHKK7WH7ZPV6LEJIUM/events.json","paper":"https://pith.science/paper/ELBUUHAD"},"agent_actions":{"view_html":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM","download_json":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM.json","view_paper":"https://pith.science/paper/ELBUUHAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00774&json=true","fetch_graph":"https://pith.science/api/pith-number/ELBUUHADCHKK7WH7ZPV6LEJIUM/graph.json","fetch_events":"https://pith.science/api/pith-number/ELBUUHADCHKK7WH7ZPV6LEJIUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/action/storage_attestation","attest_author":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/action/author_attestation","sign_citation":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/action/citation_signature","submit_replication":"https://pith.science/pith/ELBUUHADCHKK7WH7ZPV6LEJIUM/action/replication_record"}},"created_at":"2026-05-18T01:36:25.600777+00:00","updated_at":"2026-05-18T01:36:25.600777+00:00"}