{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KG4FST5SZKSZ5QFRL5K2F45NE5","short_pith_number":"pith:KG4FST5S","canonical_record":{"source":{"id":"1807.00317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-01T11:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"5e05954286f346a2fd56961921145df1493d843275b660d700c9daa3d2a0e2b3","abstract_canon_sha256":"f2405410e07ae7546e27876357a18ab0e00931e878ce5e1d255c65af3ac13415"},"schema_version":"1.0"},"canonical_sha256":"51b8594fb2caa59ec0b15f55a2f3ad275f8a89c9033cb264e23df1c8fc726ea7","source":{"kind":"arxiv","id":"1807.00317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00317","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00317v1","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00317","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"KG4FST5SZKSZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KG4FST5SZKSZ5QFR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KG4FST5S","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KG4FST5SZKSZ5QFRL5K2F45NE5","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-01T11:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"5e05954286f346a2fd56961921145df1493d843275b660d700c9daa3d2a0e2b3","abstract_canon_sha256":"f2405410e07ae7546e27876357a18ab0e00931e878ce5e1d255c65af3ac13415"},"schema_version":"1.0"},"canonical_sha256":"51b8594fb2caa59ec0b15f55a2f3ad275f8a89c9033cb264e23df1c8fc726ea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:55.237817Z","signature_b64":"s8LV2Oza4lQk0nSgJh672ySimbXGk14wu2RExhYJ0nz3sLw6TkgC+gZeFW3YFvzwM4siFD12C0BcvFhr3j8FCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b8594fb2caa59ec0b15f55a2f3ad275f8a89c9033cb264e23df1c8fc726ea7","last_reissued_at":"2026-05-18T00:11:55.237172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:55.237172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00317","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:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnhuA/Zq2ft09Rm0eKkwUu9WqaiwyQUONv89F/5l1+yUNZP0/IB5pwFYjQbAPbCU//WRZ0gX3jJrRQOddDc2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:05:46.022293Z"},"content_sha256":"fbab329d0933c0bb479cb2a513237f717c2decedeb1f1bde7737ed78623f556b","schema_version":"1.0","event_id":"sha256:fbab329d0933c0bb479cb2a513237f717c2decedeb1f1bde7737ed78623f556b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KG4FST5SZKSZ5QFRL5K2F45NE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Envy-Free Cake Cutting Protocol for Four Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christos-Alexandros Psomas, Eftychia Vakaliou, Evangelos Markakis, George Christodoulou, Georgios Amanatidis, John Fearnley","submitted_at":"2018-07-01T11:59:25Z","abstract_excerpt":"We consider the classic cake-cutting problem of producing envy-free allocations, restricted to the case of four agents. The problem asks for a partition of the cake to four agents, so that every agent finds her piece at least as valuable as every other agent's piece. The problem has had an interesting history so far. Although the case of three agents is solvable with less than 15 queries, for four agents no bounded procedure was known until the recent breakthroughs of Aziz and Mackenzie (STOC 2016, FOCS 2016). The main drawback of these new algorithms, however, is that they are quite complicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00317","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:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36Osi4OEhFYPf7gn+1es4sOf9r9YmHMTUzm/6HvklMbLTUJqgmid7m6DR/TNFIxalwBuiGs6Hp46N0lH5P4GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:05:46.022951Z"},"content_sha256":"a18bb87d4184923e17dfe43a8eb0bb62019dae12e6d27e6c77027ee9092265de","schema_version":"1.0","event_id":"sha256:a18bb87d4184923e17dfe43a8eb0bb62019dae12e6d27e6c77027ee9092265de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KG4FST5SZKSZ5QFRL5K2F45NE5/bundle.json","state_url":"https://pith.science/pith/KG4FST5SZKSZ5QFRL5K2F45NE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KG4FST5SZKSZ5QFRL5K2F45NE5/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-22T10:05:46Z","links":{"resolver":"https://pith.science/pith/KG4FST5SZKSZ5QFRL5K2F45NE5","bundle":"https://pith.science/pith/KG4FST5SZKSZ5QFRL5K2F45NE5/bundle.json","state":"https://pith.science/pith/KG4FST5SZKSZ5QFRL5K2F45NE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KG4FST5SZKSZ5QFRL5K2F45NE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KG4FST5SZKSZ5QFRL5K2F45NE5","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":"f2405410e07ae7546e27876357a18ab0e00931e878ce5e1d255c65af3ac13415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-01T11:59:25Z","title_canon_sha256":"5e05954286f346a2fd56961921145df1493d843275b660d700c9daa3d2a0e2b3"},"schema_version":"1.0","source":{"id":"1807.00317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00317","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00317v1","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00317","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"KG4FST5SZKSZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KG4FST5SZKSZ5QFR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KG4FST5S","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:a18bb87d4184923e17dfe43a8eb0bb62019dae12e6d27e6c77027ee9092265de","target":"graph","created_at":"2026-05-18T00:11:55Z","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":"We consider the classic cake-cutting problem of producing envy-free allocations, restricted to the case of four agents. The problem asks for a partition of the cake to four agents, so that every agent finds her piece at least as valuable as every other agent's piece. The problem has had an interesting history so far. Although the case of three agents is solvable with less than 15 queries, for four agents no bounded procedure was known until the recent breakthroughs of Aziz and Mackenzie (STOC 2016, FOCS 2016). The main drawback of these new algorithms, however, is that they are quite complicat","authors_text":"Christos-Alexandros Psomas, Eftychia Vakaliou, Evangelos Markakis, George Christodoulou, Georgios Amanatidis, John Fearnley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-01T11:59:25Z","title":"An Improved Envy-Free Cake Cutting Protocol for Four Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00317","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:fbab329d0933c0bb479cb2a513237f717c2decedeb1f1bde7737ed78623f556b","target":"record","created_at":"2026-05-18T00:11:55Z","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":"f2405410e07ae7546e27876357a18ab0e00931e878ce5e1d255c65af3ac13415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-01T11:59:25Z","title_canon_sha256":"5e05954286f346a2fd56961921145df1493d843275b660d700c9daa3d2a0e2b3"},"schema_version":"1.0","source":{"id":"1807.00317","kind":"arxiv","version":1}},"canonical_sha256":"51b8594fb2caa59ec0b15f55a2f3ad275f8a89c9033cb264e23df1c8fc726ea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51b8594fb2caa59ec0b15f55a2f3ad275f8a89c9033cb264e23df1c8fc726ea7","first_computed_at":"2026-05-18T00:11:55.237172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:55.237172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8LV2Oza4lQk0nSgJh672ySimbXGk14wu2RExhYJ0nz3sLw6TkgC+gZeFW3YFvzwM4siFD12C0BcvFhr3j8FCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:55.237817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbab329d0933c0bb479cb2a513237f717c2decedeb1f1bde7737ed78623f556b","sha256:a18bb87d4184923e17dfe43a8eb0bb62019dae12e6d27e6c77027ee9092265de"],"state_sha256":"5c0cf5ff4ffcd0a78617b2182f6397905b2d4e0fa7621c88cfe2a83b49d1c63a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3j0G3ebwf06YrDOL3TPO7pmF0BEr/fcUcvP7q3XBooag+eBXjxADAi0nRwOKNQd954JB2W+XI8NABMcmIazDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T10:05:46.026731Z","bundle_sha256":"eb6190cb1845fb1829bbee6b3d211529b36ac58dc8cb5d61e0d597a860bbd00a"}}