{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CN33CKQV6RQ4VD5SWDDMZYUZ2Q","short_pith_number":"pith:CN33CKQV","schema_version":"1.0","canonical_sha256":"1377b12a15f461ca8fb2b0c6cce299d415d723e63f2b21a07d9b2e7f0f20e605","source":{"kind":"arxiv","id":"2608.08590","version":1},"attestation_state":"computed","paper":{"title":"Complete EFX Allocations Exist for Four Additive Agents and Up to Nine Goods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eyad Alkassar, Kurt Mehlhorn, Mahmoud Fouz","submitted_at":"2026-08-09T09:08:27Z","abstract_excerpt":"We prove that every fair-division instance with four agents, additive valuations over the non-negative reals, and at most nine indivisible goods admits a \\emph{complete} allocation that is envy-free up to any good in the strong, zero-tolerant sense ($\\EFXo$). The case $m=9=n+5$ lies beyond the previously known frontier for complete EFX with four agents ($m\\le n+3$). The proof combines a small set of hand-proven reduction lemmas with a machine-verified certificate corpus. The valuation polytope is covered by a collection of smaller polytopes. For each smaller polytope $P$, a family $F$ of alloc"},"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":"2608.08590","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-08-09T09:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"a97888c0726264aff8f4b099ba98e9ba42ee5edf558b5760cd72258796f70431","abstract_canon_sha256":"4aa9114819572dada34408f555effeb0079e7d77bdd53416a9d2b75f60e2af39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:23:05.799482Z","signature_b64":"qAS1i9MwNUKlopx73ffgU+MQGeRXlbLbE9ETDqFGkTx8Biv0jMvDMxJzkXvqKTRVh9OVXmc7Vu1YldycPUb2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1377b12a15f461ca8fb2b0c6cce299d415d723e63f2b21a07d9b2e7f0f20e605","last_reissued_at":"2026-08-11T01:23:05.796863Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:23:05.796863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete EFX Allocations Exist for Four Additive Agents and Up to Nine Goods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eyad Alkassar, Kurt Mehlhorn, Mahmoud Fouz","submitted_at":"2026-08-09T09:08:27Z","abstract_excerpt":"We prove that every fair-division instance with four agents, additive valuations over the non-negative reals, and at most nine indivisible goods admits a \\emph{complete} allocation that is envy-free up to any good in the strong, zero-tolerant sense ($\\EFXo$). The case $m=9=n+5$ lies beyond the previously known frontier for complete EFX with four agents ($m\\le n+3$). The proof combines a small set of hand-proven reduction lemmas with a machine-verified certificate corpus. The valuation polytope is covered by a collection of smaller polytopes. For each smaller polytope $P$, a family $F$ of alloc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08590","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/2608.08590/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":"2608.08590","created_at":"2026-08-11T01:23:05.797826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08590v1","created_at":"2026-08-11T01:23:05.797826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08590","created_at":"2026-08-11T01:23:05.797826+00:00"},{"alias_kind":"pith_short_12","alias_value":"CN33CKQV6RQ4","created_at":"2026-08-11T01:23:05.797826+00:00"},{"alias_kind":"pith_short_16","alias_value":"CN33CKQV6RQ4VD5S","created_at":"2026-08-11T01:23:05.797826+00:00"},{"alias_kind":"pith_short_8","alias_value":"CN33CKQV","created_at":"2026-08-11T01:23:05.797826+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/CN33CKQV6RQ4VD5SWDDMZYUZ2Q","json":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q.json","graph_json":"https://pith.science/api/pith-number/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/graph.json","events_json":"https://pith.science/api/pith-number/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/events.json","paper":"https://pith.science/paper/CN33CKQV"},"agent_actions":{"view_html":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q","download_json":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q.json","view_paper":"https://pith.science/paper/CN33CKQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08590&json=true","fetch_graph":"https://pith.science/api/pith-number/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/action/storage_attestation","attest_author":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/action/author_attestation","sign_citation":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/action/citation_signature","submit_replication":"https://pith.science/pith/CN33CKQV6RQ4VD5SWDDMZYUZ2Q/action/replication_record"}},"created_at":"2026-08-11T01:23:05.797826+00:00","updated_at":"2026-08-11T01:23:05.797826+00:00"}