{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H7JJK64XQTX7NLLXTL57KCC6OP","short_pith_number":"pith:H7JJK64X","schema_version":"1.0","canonical_sha256":"3fd2957b9784eff6ad779afbf5085e73ef7a115148fefba7441b12afb02a62e0","source":{"kind":"arxiv","id":"1908.02988","version":2},"attestation_state":"computed","paper":{"title":"Obvious Manipulations in Cake-Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Erel Segal-Halevi, Josue Ortega","submitted_at":"2019-08-08T09:44:04Z","abstract_excerpt":"In cake-cutting, strategy-proofness is a very costly requirement in terms of fairness: for n=2 it implies a dictatorial allocation, whereas for n > 2 it requires that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril, called non-obvious manipulability, is compatible with the strong fairness property of proportionality, which guarantees that each agent receives 1/n of the cake. Both properties are satisfied by the leftmost leaves mechanism, an adaptation of the Dubins - Spanier moving knife procedure. Most other classical proporti"},"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":"1908.02988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-08T09:44:04Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"783741b095ead742f3a6286ba590c501026bc6662215a2caf955e85ec83d9923","abstract_canon_sha256":"e5de1468d3375f4e575122f603ebbe3062414485b365670affd5dbef4dd1ad16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:35.573115Z","signature_b64":"2eJ3aZ8je6OtaRd4OM8fG00+HO7TTsR8/wIgmCGp95FTa4PX6C2cvOp3WFKy+TYT6IBRycTBt4RQ7WNVzmDqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd2957b9784eff6ad779afbf5085e73ef7a115148fefba7441b12afb02a62e0","last_reissued_at":"2026-07-05T00:11:35.572639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:35.572639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Obvious Manipulations in Cake-Cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Erel Segal-Halevi, Josue Ortega","submitted_at":"2019-08-08T09:44:04Z","abstract_excerpt":"In cake-cutting, strategy-proofness is a very costly requirement in terms of fairness: for n=2 it implies a dictatorial allocation, whereas for n > 2 it requires that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril, called non-obvious manipulability, is compatible with the strong fairness property of proportionality, which guarantees that each agent receives 1/n of the cake. Both properties are satisfied by the leftmost leaves mechanism, an adaptation of the Dubins - Spanier moving knife procedure. Most other classical proporti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02988","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02988/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.02988","created_at":"2026-07-05T00:11:35.572697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02988v2","created_at":"2026-07-05T00:11:35.572697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02988","created_at":"2026-07-05T00:11:35.572697+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7JJK64XQTX7","created_at":"2026-07-05T00:11:35.572697+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7JJK64XQTX7NLLX","created_at":"2026-07-05T00:11:35.572697+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7JJK64X","created_at":"2026-07-05T00:11:35.572697+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/H7JJK64XQTX7NLLXTL57KCC6OP","json":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP.json","graph_json":"https://pith.science/api/pith-number/H7JJK64XQTX7NLLXTL57KCC6OP/graph.json","events_json":"https://pith.science/api/pith-number/H7JJK64XQTX7NLLXTL57KCC6OP/events.json","paper":"https://pith.science/paper/H7JJK64X"},"agent_actions":{"view_html":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP","download_json":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP.json","view_paper":"https://pith.science/paper/H7JJK64X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02988&json=true","fetch_graph":"https://pith.science/api/pith-number/H7JJK64XQTX7NLLXTL57KCC6OP/graph.json","fetch_events":"https://pith.science/api/pith-number/H7JJK64XQTX7NLLXTL57KCC6OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP/action/storage_attestation","attest_author":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP/action/author_attestation","sign_citation":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP/action/citation_signature","submit_replication":"https://pith.science/pith/H7JJK64XQTX7NLLXTL57KCC6OP/action/replication_record"}},"created_at":"2026-07-05T00:11:35.572697+00:00","updated_at":"2026-07-05T00:11:35.572697+00:00"}