{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JDJ666USV4HHRVO3UNLZISS7FJ","short_pith_number":"pith:JDJ666US","schema_version":"1.0","canonical_sha256":"48d3ef7a92af0e78d5dba357944a5f2a6bbf03d202a6805c5411f5b21cffa0a4","source":{"kind":"arxiv","id":"1003.5480","version":2},"attestation_state":"computed","paper":{"title":"Truthful Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elchanan Mossel, Omer Tamuz","submitted_at":"2010-03-29T09:45:02Z","abstract_excerpt":"We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space (\"cake\") and non-atomic, additive individual preference measures - or utilities - we show that there exists a truthful \"mechanism\" which ensures that each of the k players gets at least 1/k of the cake. This mechanism also minimizes risk for truthful players. Furthermore, in the case where there exist at least two different measures we present a different truthful mechanism which ensures that each of the players gets more than 1/k of the cake.\n  We then"},"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":"1003.5480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-03-29T09:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"bc2b9ed9b452ffafc3f87570e19b2a0954a7817f8253958a263980940f4cd1ff","abstract_canon_sha256":"e4132cea526964ae6a3c1424453e80ed2b01206736d24664891f3a94368495ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:48.430283Z","signature_b64":"DUogpJbpEA+igGx+zMGRF0N45D3UWSCvYxmeCSpev22/FC2lzY9ilCDZKLx1j2OcjgEtdhjA3b+9iGYEMWs3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48d3ef7a92af0e78d5dba357944a5f2a6bbf03d202a6805c5411f5b21cffa0a4","last_reissued_at":"2026-05-18T04:38:48.429800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:48.429800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truthful Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elchanan Mossel, Omer Tamuz","submitted_at":"2010-03-29T09:45:02Z","abstract_excerpt":"We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space (\"cake\") and non-atomic, additive individual preference measures - or utilities - we show that there exists a truthful \"mechanism\" which ensures that each of the k players gets at least 1/k of the cake. This mechanism also minimizes risk for truthful players. Furthermore, in the case where there exist at least two different measures we present a different truthful mechanism which ensures that each of the players gets more than 1/k of the cake.\n  We then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5480","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":"1003.5480","created_at":"2026-05-18T04:38:48.429890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5480v2","created_at":"2026-05-18T04:38:48.429890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5480","created_at":"2026-05-18T04:38:48.429890+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDJ666USV4HH","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDJ666USV4HHRVO3","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDJ666US","created_at":"2026-05-18T12:26:09.077623+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/JDJ666USV4HHRVO3UNLZISS7FJ","json":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ.json","graph_json":"https://pith.science/api/pith-number/JDJ666USV4HHRVO3UNLZISS7FJ/graph.json","events_json":"https://pith.science/api/pith-number/JDJ666USV4HHRVO3UNLZISS7FJ/events.json","paper":"https://pith.science/paper/JDJ666US"},"agent_actions":{"view_html":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ","download_json":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ.json","view_paper":"https://pith.science/paper/JDJ666US","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5480&json=true","fetch_graph":"https://pith.science/api/pith-number/JDJ666USV4HHRVO3UNLZISS7FJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JDJ666USV4HHRVO3UNLZISS7FJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ/action/storage_attestation","attest_author":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ/action/author_attestation","sign_citation":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ/action/citation_signature","submit_replication":"https://pith.science/pith/JDJ666USV4HHRVO3UNLZISS7FJ/action/replication_record"}},"created_at":"2026-05-18T04:38:48.429890+00:00","updated_at":"2026-05-18T04:38:48.429890+00:00"}