{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LBTOWL2RBL52PJTDHHOTFKCEC7","short_pith_number":"pith:LBTOWL2R","schema_version":"1.0","canonical_sha256":"5866eb2f510afba7a66339dd32a84417f09504c98270d00993549cfb5850b925","source":{"kind":"arxiv","id":"1804.00449","version":2},"attestation_state":"computed","paper":{"title":"Envy-free cake division without assuming the players prefer nonempty pieces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.GN"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Meunier, Shira Zerbib","submitted_at":"2018-04-02T11:07:11Z","abstract_excerpt":"Consider $n$ players having preferences over the connected pieces of a cake, identified with the interval $[0,1]$. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is possible to divide the cake into $n$ connected pieces and assign these pieces to the players in an envy-free manner, i.e, such that no player strictly prefers a piece that has not been assigned to her. One of these conditions, considered as crucial, is that no player is happy with an empty piece. We prove that, even if this condition is not satisfied, it is sti"},"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":"1804.00449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-02T11:07:11Z","cross_cats_sorted":["cs.GT","math.GN"],"title_canon_sha256":"359737711b6dbabdf03294c268d319f22a86647d639da734022a00bd0bf28530","abstract_canon_sha256":"40e3ffbaa2873d15d25fef6f470a41aacc5d1c122f58d031eb836c4502f7aa29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:25.102357Z","signature_b64":"gc8bouBJacuTDyhsYgwSTKw5ucDrTQsqXboO+HTgFc3l/8SV+vYVTEX1ctA92gcIQwJGzUqy1cds44zA0G2nBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5866eb2f510afba7a66339dd32a84417f09504c98270d00993549cfb5850b925","last_reissued_at":"2026-05-17T23:56:25.101925Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:25.101925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Envy-free cake division without assuming the players prefer nonempty pieces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.GN"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Meunier, Shira Zerbib","submitted_at":"2018-04-02T11:07:11Z","abstract_excerpt":"Consider $n$ players having preferences over the connected pieces of a cake, identified with the interval $[0,1]$. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is possible to divide the cake into $n$ connected pieces and assign these pieces to the players in an envy-free manner, i.e, such that no player strictly prefers a piece that has not been assigned to her. One of these conditions, considered as crucial, is that no player is happy with an empty piece. We prove that, even if this condition is not satisfied, it is sti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00449","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":"1804.00449","created_at":"2026-05-17T23:56:25.101989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00449v2","created_at":"2026-05-17T23:56:25.101989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00449","created_at":"2026-05-17T23:56:25.101989+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBTOWL2RBL52","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBTOWL2RBL52PJTD","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBTOWL2R","created_at":"2026-05-18T12:32:33.847187+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/LBTOWL2RBL52PJTDHHOTFKCEC7","json":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7.json","graph_json":"https://pith.science/api/pith-number/LBTOWL2RBL52PJTDHHOTFKCEC7/graph.json","events_json":"https://pith.science/api/pith-number/LBTOWL2RBL52PJTDHHOTFKCEC7/events.json","paper":"https://pith.science/paper/LBTOWL2R"},"agent_actions":{"view_html":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7","download_json":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7.json","view_paper":"https://pith.science/paper/LBTOWL2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00449&json=true","fetch_graph":"https://pith.science/api/pith-number/LBTOWL2RBL52PJTDHHOTFKCEC7/graph.json","fetch_events":"https://pith.science/api/pith-number/LBTOWL2RBL52PJTDHHOTFKCEC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/action/storage_attestation","attest_author":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/action/author_attestation","sign_citation":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/action/citation_signature","submit_replication":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/action/replication_record"}},"created_at":"2026-05-17T23:56:25.101989+00:00","updated_at":"2026-05-17T23:56:25.101989+00:00"}