{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AH327P6XMEIF2W3ZPARCQA3XFG","short_pith_number":"pith:AH327P6X","canonical_record":{"source":{"id":"1810.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-16T10:20:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"4a13387a41097aede8269db7ff36ea1b12199a6c06558f58405b4678773cdabd","abstract_canon_sha256":"8d91771f3566dbc11925fc2d2b6c034998ce8bf91fecd2710ad53458797847cb"},"schema_version":"1.0"},"canonical_sha256":"01f7afbfd761105d5b7978222803772995fdcfe36e5746af16b45697509409ec","source":{"kind":"arxiv","id":"1810.06913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06913","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06913v1","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06913","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"AH327P6XMEIF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AH327P6XMEIF2W3Z","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AH327P6X","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AH327P6XMEIF2W3ZPARCQA3XFG","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-16T10:20:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"4a13387a41097aede8269db7ff36ea1b12199a6c06558f58405b4678773cdabd","abstract_canon_sha256":"8d91771f3566dbc11925fc2d2b6c034998ce8bf91fecd2710ad53458797847cb"},"schema_version":"1.0"},"canonical_sha256":"01f7afbfd761105d5b7978222803772995fdcfe36e5746af16b45697509409ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:11.106329Z","signature_b64":"tsKbsBXhkZwebNaPK/6v257IXRSrep43XFt7HKfAQ2mU4bG7LUcNx77KCeU/HgaSCbbYlp/0/QoO9X9mWqF4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f7afbfd761105d5b7978222803772995fdcfe36e5746af16b45697509409ec","last_reissued_at":"2026-05-18T00:03:11.105816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:11.105816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06913","source_version":1,"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-18T00:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEWQqSjelOBhcR/Y8Hccc6rdyNWUAs8jxVE4UKCbT0U7wTctPjZolDnWX+58U6UDQOmFX7liRD7bnY0BsazyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:51:28.435417Z"},"content_sha256":"7afe493d5ae2cb3cc6b76454d2ccb147cbfbf1ea264ae2a80b940c10b1082797","schema_version":"1.0","event_id":"sha256:7afe493d5ae2cb3cc6b76454d2ccb147cbfbf1ea264ae2a80b940c10b1082797"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AH327P6XMEIF2W3ZPARCQA3XFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to share a cake with a secret agent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.MA","authors_text":"Guillaume Ch\\`eze (IMT)","submitted_at":"2018-10-16T10:20:06Z","abstract_excerpt":"In this note we study a problem of fair division in the absence of full information. We give an algorithm which solves the following problem: n $\\ge$ 2 persons want to cut a cake into n shares so that each person will get at least 1/n of the cake for his or her own measure, furthermore the preferences of one person are secret. How can we construct such shares? Our algorithm is a slight modification of the Even-Paz algorithm and allows to give a connected part to each agent. Moreover, the number of cuts used during the algorithm is optimal: O (n log(n)) ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06913","kind":"arxiv","version":1},"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-18T00:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbMOI7A3FkLrBBYFWiAf+D8vwHyQbhzoY95/s5ZyfjNE/Pqa/7bxPk09ukuccPhGwBA5XWgEaGYYcOl7QOHBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:51:28.435767Z"},"content_sha256":"d8f75d47c4bab47213d811b866ba095a81283752297e86c2a5df43c5529b7a7f","schema_version":"1.0","event_id":"sha256:d8f75d47c4bab47213d811b866ba095a81283752297e86c2a5df43c5529b7a7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AH327P6XMEIF2W3ZPARCQA3XFG/bundle.json","state_url":"https://pith.science/pith/AH327P6XMEIF2W3ZPARCQA3XFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AH327P6XMEIF2W3ZPARCQA3XFG/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-07-04T15:51:28Z","links":{"resolver":"https://pith.science/pith/AH327P6XMEIF2W3ZPARCQA3XFG","bundle":"https://pith.science/pith/AH327P6XMEIF2W3ZPARCQA3XFG/bundle.json","state":"https://pith.science/pith/AH327P6XMEIF2W3ZPARCQA3XFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AH327P6XMEIF2W3ZPARCQA3XFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AH327P6XMEIF2W3ZPARCQA3XFG","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":"8d91771f3566dbc11925fc2d2b6c034998ce8bf91fecd2710ad53458797847cb","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-16T10:20:06Z","title_canon_sha256":"4a13387a41097aede8269db7ff36ea1b12199a6c06558f58405b4678773cdabd"},"schema_version":"1.0","source":{"id":"1810.06913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06913","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06913v1","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06913","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"AH327P6XMEIF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AH327P6XMEIF2W3Z","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AH327P6X","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:d8f75d47c4bab47213d811b866ba095a81283752297e86c2a5df43c5529b7a7f","target":"graph","created_at":"2026-05-18T00:03:11Z","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":"In this note we study a problem of fair division in the absence of full information. We give an algorithm which solves the following problem: n $\\ge$ 2 persons want to cut a cake into n shares so that each person will get at least 1/n of the cake for his or her own measure, furthermore the preferences of one person are secret. How can we construct such shares? Our algorithm is a slight modification of the Even-Paz algorithm and allows to give a connected part to each agent. Moreover, the number of cuts used during the algorithm is optimal: O (n log(n)) .","authors_text":"Guillaume Ch\\`eze (IMT)","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-16T10:20:06Z","title":"How to share a cake with a secret agent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06913","kind":"arxiv","version":1},"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:7afe493d5ae2cb3cc6b76454d2ccb147cbfbf1ea264ae2a80b940c10b1082797","target":"record","created_at":"2026-05-18T00:03:11Z","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":"8d91771f3566dbc11925fc2d2b6c034998ce8bf91fecd2710ad53458797847cb","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-10-16T10:20:06Z","title_canon_sha256":"4a13387a41097aede8269db7ff36ea1b12199a6c06558f58405b4678773cdabd"},"schema_version":"1.0","source":{"id":"1810.06913","kind":"arxiv","version":1}},"canonical_sha256":"01f7afbfd761105d5b7978222803772995fdcfe36e5746af16b45697509409ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01f7afbfd761105d5b7978222803772995fdcfe36e5746af16b45697509409ec","first_computed_at":"2026-05-18T00:03:11.105816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:11.105816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tsKbsBXhkZwebNaPK/6v257IXRSrep43XFt7HKfAQ2mU4bG7LUcNx77KCeU/HgaSCbbYlp/0/QoO9X9mWqF4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:11.106329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7afe493d5ae2cb3cc6b76454d2ccb147cbfbf1ea264ae2a80b940c10b1082797","sha256:d8f75d47c4bab47213d811b866ba095a81283752297e86c2a5df43c5529b7a7f"],"state_sha256":"b16757a684e36dc2bea0daad656ce6199784ab9e58c5da1e4f6044a8df1224b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFahgdN7J6dsWOHmxW3TZaO0timbmnKTgwhhcCK1j41j5xQounBCbLtt3LmQW4/EDgtCo89ae/TnPc1FWiHBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T15:51:28.437747Z","bundle_sha256":"7b1393b62289ddf22d40392e7f7daca746c650104b969d7819549f0b99b3b4a3"}}