{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BKS2RWQVQHWXJETGVARUR4NJ7Y","short_pith_number":"pith:BKS2RWQV","schema_version":"1.0","canonical_sha256":"0aa5a8da1581ed749266a82348f1a9fe1730d89c2abd0c4d3a94d1f6b945d56d","source":{"kind":"arxiv","id":"2407.03318","version":4},"attestation_state":"computed","paper":{"title":"Constant-Factor EFX Exists for Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aniket Murhekar, John Qin, Jugal Garg","submitted_at":"2024-07-03T17:58:22Z","abstract_excerpt":"We study the problem of fair allocation of chores to agents with additive preferences. In the discrete setting, envy-freeness up to any chore (EFX) has emerged as a compelling fairness criterion. However, establishing its (non-)existence or achieving a meaningful approximation remains a major open question. The current best guarantee is the existence of $O(n^2)$-EFX allocations for $n$ agents, obtained through a sophisticated algorithm (Zhou and Wu, 2022). In this paper, we show the existence of $4$-EFX allocations, providing the first constant-factor approximation of EFX.\n  We also investigat"},"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":"2407.03318","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-07-03T17:58:22Z","cross_cats_sorted":[],"title_canon_sha256":"5d8443b490049fb90084cd7db11af112fbffe9288c29eb0ccd4815ca12338e75","abstract_canon_sha256":"32977550d5dc91451ce20c5b41c78e51c91647db7c1ebd9bc4dbe7eb88d49aeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:49.574978Z","signature_b64":"GHnLZthGeZkZDbxUFAY/yWstzZBZQEj8NwBveLWlM7KYJkRTOrLpLL/gQazJSaeqJFgemivb4V9g3Ji1pHDxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aa5a8da1581ed749266a82348f1a9fe1730d89c2abd0c4d3a94d1f6b945d56d","last_reissued_at":"2026-07-05T09:38:49.574484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:49.574484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Factor EFX Exists for Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aniket Murhekar, John Qin, Jugal Garg","submitted_at":"2024-07-03T17:58:22Z","abstract_excerpt":"We study the problem of fair allocation of chores to agents with additive preferences. In the discrete setting, envy-freeness up to any chore (EFX) has emerged as a compelling fairness criterion. However, establishing its (non-)existence or achieving a meaningful approximation remains a major open question. The current best guarantee is the existence of $O(n^2)$-EFX allocations for $n$ agents, obtained through a sophisticated algorithm (Zhou and Wu, 2022). In this paper, we show the existence of $4$-EFX allocations, providing the first constant-factor approximation of EFX.\n  We also investigat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03318","kind":"arxiv","version":4},"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/2407.03318/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":"2407.03318","created_at":"2026-07-05T09:38:49.574542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.03318v4","created_at":"2026-07-05T09:38:49.574542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03318","created_at":"2026-07-05T09:38:49.574542+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKS2RWQVQHWX","created_at":"2026-07-05T09:38:49.574542+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKS2RWQVQHWXJETG","created_at":"2026-07-05T09:38:49.574542+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKS2RWQV","created_at":"2026-07-05T09:38:49.574542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04550","citing_title":"Approximately EFX and PO Allocations for Bivalued Chores","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y","json":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y.json","graph_json":"https://pith.science/api/pith-number/BKS2RWQVQHWXJETGVARUR4NJ7Y/graph.json","events_json":"https://pith.science/api/pith-number/BKS2RWQVQHWXJETGVARUR4NJ7Y/events.json","paper":"https://pith.science/paper/BKS2RWQV"},"agent_actions":{"view_html":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y","download_json":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y.json","view_paper":"https://pith.science/paper/BKS2RWQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.03318&json=true","fetch_graph":"https://pith.science/api/pith-number/BKS2RWQVQHWXJETGVARUR4NJ7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/BKS2RWQVQHWXJETGVARUR4NJ7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y/action/storage_attestation","attest_author":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y/action/author_attestation","sign_citation":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y/action/citation_signature","submit_replication":"https://pith.science/pith/BKS2RWQVQHWXJETGVARUR4NJ7Y/action/replication_record"}},"created_at":"2026-07-05T09:38:49.574542+00:00","updated_at":"2026-07-05T09:38:49.574542+00:00"}