{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KWGFMZZ5XOCQUYSO6CT3P2SYXG","short_pith_number":"pith:KWGFMZZ5","canonical_record":{"source":{"id":"2506.12950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-15T19:32:38Z","cross_cats_sorted":[],"title_canon_sha256":"7d76500b6b068d1009ba29dadc0f8ef05fc576c7ca755330d1f6659ac30f53d8","abstract_canon_sha256":"a1bf230921841a160ff005b2fe6ee7c927834c8e106b437c5a937a74216228b7"},"schema_version":"1.0"},"canonical_sha256":"558c56673dbb850a624ef0a7b7ea58b9b3aafeea3d76632e64d06ff5f52ea89c","source":{"kind":"arxiv","id":"2506.12950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12950","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12950v1","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12950","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"KWGFMZZ5XOCQ","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"KWGFMZZ5XOCQUYSO","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"KWGFMZZ5","created_at":"2026-07-05T11:22:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KWGFMZZ5XOCQUYSO6CT3P2SYXG","target":"record","payload":{"canonical_record":{"source":{"id":"2506.12950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-15T19:32:38Z","cross_cats_sorted":[],"title_canon_sha256":"7d76500b6b068d1009ba29dadc0f8ef05fc576c7ca755330d1f6659ac30f53d8","abstract_canon_sha256":"a1bf230921841a160ff005b2fe6ee7c927834c8e106b437c5a937a74216228b7"},"schema_version":"1.0"},"canonical_sha256":"558c56673dbb850a624ef0a7b7ea58b9b3aafeea3d76632e64d06ff5f52ea89c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:02.818197Z","signature_b64":"ROCD1GJ/OL/hHFlA2CaUswSxjdhezEOa/gRMixxgMPrVYF+6txib7MkoA9rZM5zUjydT7LUpaR4rms8TWgvXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558c56673dbb850a624ef0a7b7ea58b9b3aafeea3d76632e64d06ff5f52ea89c","last_reissued_at":"2026-07-05T11:22:02.817767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:02.817767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.12950","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-07-05T11:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGb+MB8RYRf4lt/SlUFgGGCXJi83Jze6VH+WkDMWkByOmAHXGlgIhlLqJ8MFdKfRJoe46gt+pr/kElGSWKLkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:17:50.026135Z"},"content_sha256":"cc60e280e598f9ceba0afdd29c618aaf7c0775d8c0b7fee83382c8ea980a86a1","schema_version":"1.0","event_id":"sha256:cc60e280e598f9ceba0afdd29c618aaf7c0775d8c0b7fee83382c8ea980a86a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KWGFMZZ5XOCQUYSO6CT3P2SYXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexandros Psomas, Arnav Mehra","submitted_at":"2025-06-15T19:32:38Z","abstract_excerpt":"We consider the classic cake-cutting problem of producing fair allocations for $n$ agents, in the Robertson-Webb query model. In this model, it is known that: (i) proportional allocations can be computed using $O(n \\log n)$ queries, and this is optimal for deterministic protocols; (ii) envy-free allocations (a subset of proportional allocations) can be computed using $O\\left( n^{n^{n^{n^{n^{n}}}}} \\right)$ queries, and the best known lower bound is $\\Omega(n^2)$; (iii) perfect allocations (a subset of envy-free allocations) cannot be computed using a bounded (in $n$) number of queries.\n  In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12950","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.12950/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"},"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-07-05T11:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bRRH08cdQwWMisYX7IobfGazafUiCDDhvthFkvPvklLHWdfySK4b/VD3rULYZpcg7SCTi9xqwDgfKUjbMN5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:17:50.027097Z"},"content_sha256":"092bf106d23d906ebc574ee0b9bf283c063bcbe1894fa43f2cdce23817e0f2ae","schema_version":"1.0","event_id":"sha256:092bf106d23d906ebc574ee0b9bf283c063bcbe1894fa43f2cdce23817e0f2ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/bundle.json","state_url":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/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-08-18T14:17:50Z","links":{"resolver":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG","bundle":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/bundle.json","state":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KWGFMZZ5XOCQUYSO6CT3P2SYXG","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":"a1bf230921841a160ff005b2fe6ee7c927834c8e106b437c5a937a74216228b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-15T19:32:38Z","title_canon_sha256":"7d76500b6b068d1009ba29dadc0f8ef05fc576c7ca755330d1f6659ac30f53d8"},"schema_version":"1.0","source":{"id":"2506.12950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12950","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12950v1","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12950","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"KWGFMZZ5XOCQ","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"KWGFMZZ5XOCQUYSO","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"KWGFMZZ5","created_at":"2026-07-05T11:22:02Z"}],"graph_snapshots":[{"event_id":"sha256:092bf106d23d906ebc574ee0b9bf283c063bcbe1894fa43f2cdce23817e0f2ae","target":"graph","created_at":"2026-07-05T11:22:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.12950/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the classic cake-cutting problem of producing fair allocations for $n$ agents, in the Robertson-Webb query model. In this model, it is known that: (i) proportional allocations can be computed using $O(n \\log n)$ queries, and this is optimal for deterministic protocols; (ii) envy-free allocations (a subset of proportional allocations) can be computed using $O\\left( n^{n^{n^{n^{n^{n}}}}} \\right)$ queries, and the best known lower bound is $\\Omega(n^2)$; (iii) perfect allocations (a subset of envy-free allocations) cannot be computed using a bounded (in $n$) number of queries.\n  In th","authors_text":"Alexandros Psomas, Arnav Mehra","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-15T19:32:38Z","title":"On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12950","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:cc60e280e598f9ceba0afdd29c618aaf7c0775d8c0b7fee83382c8ea980a86a1","target":"record","created_at":"2026-07-05T11:22:02Z","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":"a1bf230921841a160ff005b2fe6ee7c927834c8e106b437c5a937a74216228b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-15T19:32:38Z","title_canon_sha256":"7d76500b6b068d1009ba29dadc0f8ef05fc576c7ca755330d1f6659ac30f53d8"},"schema_version":"1.0","source":{"id":"2506.12950","kind":"arxiv","version":1}},"canonical_sha256":"558c56673dbb850a624ef0a7b7ea58b9b3aafeea3d76632e64d06ff5f52ea89c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"558c56673dbb850a624ef0a7b7ea58b9b3aafeea3d76632e64d06ff5f52ea89c","first_computed_at":"2026-07-05T11:22:02.817767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:02.817767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ROCD1GJ/OL/hHFlA2CaUswSxjdhezEOa/gRMixxgMPrVYF+6txib7MkoA9rZM5zUjydT7LUpaR4rms8TWgvXDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:02.818197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.12950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc60e280e598f9ceba0afdd29c618aaf7c0775d8c0b7fee83382c8ea980a86a1","sha256:092bf106d23d906ebc574ee0b9bf283c063bcbe1894fa43f2cdce23817e0f2ae"],"state_sha256":"5f2cdce0897a3390de611d0ec372d524866d20ffe6cddfad991a216cbd15266d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AS6mx0fBlLi2MNWooPPZOZ5m3frHyTI6MGXbTA8xG7ouwMto+sVHHKiMJ53ZQSg0+ejaGEY0PdV7zBgbeYBgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:17:50.036002Z","bundle_sha256":"831ec9196ff3272224b0deecffcc507c6e935f90ccc27ecc4e36f384deccea8d"}}