{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KWGFMZZ5XOCQUYSO6CT3P2SYXG","short_pith_number":"pith:KWGFMZZ5","schema_version":"1.0","canonical_sha256":"558c56673dbb850a624ef0a7b7ea58b9b3aafeea3d76632e64d06ff5f52ea89c","source":{"kind":"arxiv","id":"2506.12950","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.12950","created_at":"2026-07-05T11:22:02.817824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12950v1","created_at":"2026-07-05T11:22:02.817824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12950","created_at":"2026-07-05T11:22:02.817824+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWGFMZZ5XOCQ","created_at":"2026-07-05T11:22:02.817824+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWGFMZZ5XOCQUYSO","created_at":"2026-07-05T11:22:02.817824+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWGFMZZ5","created_at":"2026-07-05T11:22:02.817824+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/KWGFMZZ5XOCQUYSO6CT3P2SYXG","json":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG.json","graph_json":"https://pith.science/api/pith-number/KWGFMZZ5XOCQUYSO6CT3P2SYXG/graph.json","events_json":"https://pith.science/api/pith-number/KWGFMZZ5XOCQUYSO6CT3P2SYXG/events.json","paper":"https://pith.science/paper/KWGFMZZ5"},"agent_actions":{"view_html":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG","download_json":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG.json","view_paper":"https://pith.science/paper/KWGFMZZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12950&json=true","fetch_graph":"https://pith.science/api/pith-number/KWGFMZZ5XOCQUYSO6CT3P2SYXG/graph.json","fetch_events":"https://pith.science/api/pith-number/KWGFMZZ5XOCQUYSO6CT3P2SYXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/action/storage_attestation","attest_author":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/action/author_attestation","sign_citation":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/action/citation_signature","submit_replication":"https://pith.science/pith/KWGFMZZ5XOCQUYSO6CT3P2SYXG/action/replication_record"}},"created_at":"2026-07-05T11:22:02.817824+00:00","updated_at":"2026-07-05T11:22:02.817824+00:00"}