{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DM3VNHPM7TDXGY6WDR5ZAYD5CM","short_pith_number":"pith:DM3VNHPM","schema_version":"1.0","canonical_sha256":"1b37569decfcc77363d61c7b90607d130b657b583cbe74acef5bbe5718e4e9d7","source":{"kind":"arxiv","id":"1307.2225","version":2},"attestation_state":"computed","paper":{"title":"An Algorithmic Framework for Strategic Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, David Kurokawa, Ioannis Caragiannis, Simina Br\\^anzei","submitted_at":"2013-07-08T19:58:15Z","abstract_excerpt":"We study the paradigmatic fair division problem of allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classical cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness?\n  To address this question we adopt a novel algorithmic approach, by designing a concrete computational framework for fair division---the class of Generalized Cut and Choose (GCC) protocols}---and reasoning about the game-theoretic properties of algorithms that operate in this model. The class of GCC protocols includes the"},"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":"1307.2225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-08T19:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"3c249e3d6041bd6a8052cae2d07ad97acb919621d86e87646db18b8536b0b117","abstract_canon_sha256":"08929d7826ba4a344b8ba4bd0335826a7bec44b86b1f90ad03217128893095cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:54.880642Z","signature_b64":"ip6yYNrg7D2FckBGr6PWRr19yfF+6o2PLZ7t8EkE6tKkIz8/AXjeGKd5BDJ7jCWbCWapxJt0GNhyBvIzlzpYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b37569decfcc77363d61c7b90607d130b657b583cbe74acef5bbe5718e4e9d7","last_reissued_at":"2026-05-18T01:10:54.879906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:54.879906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Framework for Strategic Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, David Kurokawa, Ioannis Caragiannis, Simina Br\\^anzei","submitted_at":"2013-07-08T19:58:15Z","abstract_excerpt":"We study the paradigmatic fair division problem of allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classical cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness?\n  To address this question we adopt a novel algorithmic approach, by designing a concrete computational framework for fair division---the class of Generalized Cut and Choose (GCC) protocols}---and reasoning about the game-theoretic properties of algorithms that operate in this model. The class of GCC protocols includes the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2225","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":"1307.2225","created_at":"2026-05-18T01:10:54.880034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2225v2","created_at":"2026-05-18T01:10:54.880034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2225","created_at":"2026-05-18T01:10:54.880034+00:00"},{"alias_kind":"pith_short_12","alias_value":"DM3VNHPM7TDX","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DM3VNHPM7TDXGY6W","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DM3VNHPM","created_at":"2026-05-18T12:27:43.054852+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/DM3VNHPM7TDXGY6WDR5ZAYD5CM","json":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM.json","graph_json":"https://pith.science/api/pith-number/DM3VNHPM7TDXGY6WDR5ZAYD5CM/graph.json","events_json":"https://pith.science/api/pith-number/DM3VNHPM7TDXGY6WDR5ZAYD5CM/events.json","paper":"https://pith.science/paper/DM3VNHPM"},"agent_actions":{"view_html":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM","download_json":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM.json","view_paper":"https://pith.science/paper/DM3VNHPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2225&json=true","fetch_graph":"https://pith.science/api/pith-number/DM3VNHPM7TDXGY6WDR5ZAYD5CM/graph.json","fetch_events":"https://pith.science/api/pith-number/DM3VNHPM7TDXGY6WDR5ZAYD5CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM/action/storage_attestation","attest_author":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM/action/author_attestation","sign_citation":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM/action/citation_signature","submit_replication":"https://pith.science/pith/DM3VNHPM7TDXGY6WDR5ZAYD5CM/action/replication_record"}},"created_at":"2026-05-18T01:10:54.880034+00:00","updated_at":"2026-05-18T01:10:54.880034+00:00"}