{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LBTOWL2RBL52PJTDHHOTFKCEC7","short_pith_number":"pith:LBTOWL2R","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"},"canonical_sha256":"5866eb2f510afba7a66339dd32a84417f09504c98270d00993549cfb5850b925","source":{"kind":"arxiv","id":"1804.00449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00449","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00449v2","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00449","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"LBTOWL2RBL52","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LBTOWL2RBL52PJTD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LBTOWL2R","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LBTOWL2RBL52PJTDHHOTFKCEC7","target":"record","payload":{"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"},"canonical_sha256":"5866eb2f510afba7a66339dd32a84417f09504c98270d00993549cfb5850b925","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"},"source_kind":"arxiv","source_id":"1804.00449","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsTn8jMqghy4J99jgLXpROKJwk+YKFMiSxpHlK3Z155fCGXHC4yPyePSN1M9bgaNp7K+XNuI5Nl0oQnxYlxqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:31:43.222205Z"},"content_sha256":"99402fd2f66e3f623020ebeeb44902f9039654ae4378489960e959f7ed33349d","schema_version":"1.0","event_id":"sha256:99402fd2f66e3f623020ebeeb44902f9039654ae4378489960e959f7ed33349d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LBTOWL2RBL52PJTDHHOTFKCEC7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HC9Z4cYg8iCcfngGqCSN9YXDOamWvYIAWkjb7kRtb5GQNTvq1JXPvVHn5+bqQOWd7I/lEJXnOKhwfrYbupj0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:31:43.222879Z"},"content_sha256":"9d00fb2342e5fc06813dd662141bf2a9ac83bd2bb6ba955526e06ed281d85a9d","schema_version":"1.0","event_id":"sha256:9d00fb2342e5fc06813dd662141bf2a9ac83bd2bb6ba955526e06ed281d85a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/bundle.json","state_url":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T17:31:43Z","links":{"resolver":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7","bundle":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/bundle.json","state":"https://pith.science/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBTOWL2RBL52PJTDHHOTFKCEC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LBTOWL2RBL52PJTDHHOTFKCEC7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"40e3ffbaa2873d15d25fef6f470a41aacc5d1c122f58d031eb836c4502f7aa29","cross_cats_sorted":["cs.GT","math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-02T11:07:11Z","title_canon_sha256":"359737711b6dbabdf03294c268d319f22a86647d639da734022a00bd0bf28530"},"schema_version":"1.0","source":{"id":"1804.00449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00449","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00449v2","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00449","created_at":"2026-05-17T23:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"LBTOWL2RBL52","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LBTOWL2RBL52PJTD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LBTOWL2R","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:9d00fb2342e5fc06813dd662141bf2a9ac83bd2bb6ba955526e06ed281d85a9d","target":"graph","created_at":"2026-05-17T23:56:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fr\\'ed\\'eric Meunier, Shira Zerbib","cross_cats":["cs.GT","math.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-02T11:07:11Z","title":"Envy-free cake division without assuming the players prefer nonempty pieces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00449","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99402fd2f66e3f623020ebeeb44902f9039654ae4378489960e959f7ed33349d","target":"record","created_at":"2026-05-17T23:56:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"40e3ffbaa2873d15d25fef6f470a41aacc5d1c122f58d031eb836c4502f7aa29","cross_cats_sorted":["cs.GT","math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-02T11:07:11Z","title_canon_sha256":"359737711b6dbabdf03294c268d319f22a86647d639da734022a00bd0bf28530"},"schema_version":"1.0","source":{"id":"1804.00449","kind":"arxiv","version":2}},"canonical_sha256":"5866eb2f510afba7a66339dd32a84417f09504c98270d00993549cfb5850b925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5866eb2f510afba7a66339dd32a84417f09504c98270d00993549cfb5850b925","first_computed_at":"2026-05-17T23:56:25.101925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:25.101925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gc8bouBJacuTDyhsYgwSTKw5ucDrTQsqXboO+HTgFc3l/8SV+vYVTEX1ctA92gcIQwJGzUqy1cds44zA0G2nBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:25.102357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99402fd2f66e3f623020ebeeb44902f9039654ae4378489960e959f7ed33349d","sha256:9d00fb2342e5fc06813dd662141bf2a9ac83bd2bb6ba955526e06ed281d85a9d"],"state_sha256":"d6e8be06185bb43cb23ea0bff20bcacddc6cb5a4454d5403e2c3efb2c8306ecf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WulEjuKt59vXd16tzKLAaPxrzaFZsFDjIs/9MzCsdDxd0zCugh63nbsljs1z83L9zO0meKDNpLu5av/DscKCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:31:43.226428Z","bundle_sha256":"7db20107e30744f51226d5c182c93cb5bb342d38422bf9fa4de17a13592983c5"}}