{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6ELT2HEFXVBVWOLB4PSZTL32GN","short_pith_number":"pith:6ELT2HEF","schema_version":"1.0","canonical_sha256":"f1173d1c85bd435b3961e3e599af7a336c4b3c816de7f58d4237b78cc69fe2d1","source":{"kind":"arxiv","id":"2507.19461","version":1},"attestation_state":"computed","paper":{"title":"Existence of 2-EFX Allocations of Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aniket Murhekar, Jugal Garg","submitted_at":"2025-07-25T17:46:04Z","abstract_excerpt":"We study the fair division of indivisible chores among agents with additive disutility functions. We investigate the existence of allocations satisfying the popular fairness notion of envy-freeness up to any chore (EFX), and its multiplicative approximations. The existence of $4$-EFX allocations was recently established by Garg, Murhekar, and Qin (2025). We improve this guarantee by proving the existence of $2$-EFX allocations for all instances with additive disutilities. This approximation was previously known only for restricted instances such as bivalued disutilities (Lin, Wu, and Zhou (202"},"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":"2507.19461","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-07-25T17:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"f49b8b0badefb4081fff8d82fb8b1d8e97764f0507b8c21be3c660d095d6e549","abstract_canon_sha256":"95e2edc0e3a0502ca0e456f1cd7462f9a4535472ff2ff09f4266502e1a0c95a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:25.648627Z","signature_b64":"MOK5sn1d0owwXHVL56LbXP2UuhS31rUMdodMMF5gnGARccL30nl7Lvvo9u56uCazpSQaOCg+FidmLK3rTmaVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1173d1c85bd435b3961e3e599af7a336c4b3c816de7f58d4237b78cc69fe2d1","last_reissued_at":"2026-07-05T11:43:25.648134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:25.648134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Existence of 2-EFX Allocations of Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aniket Murhekar, Jugal Garg","submitted_at":"2025-07-25T17:46:04Z","abstract_excerpt":"We study the fair division of indivisible chores among agents with additive disutility functions. We investigate the existence of allocations satisfying the popular fairness notion of envy-freeness up to any chore (EFX), and its multiplicative approximations. The existence of $4$-EFX allocations was recently established by Garg, Murhekar, and Qin (2025). We improve this guarantee by proving the existence of $2$-EFX allocations for all instances with additive disutilities. This approximation was previously known only for restricted instances such as bivalued disutilities (Lin, Wu, and Zhou (202"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19461","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/2507.19461/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":"2507.19461","created_at":"2026-07-05T11:43:25.648193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19461v1","created_at":"2026-07-05T11:43:25.648193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19461","created_at":"2026-07-05T11:43:25.648193+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ELT2HEFXVBV","created_at":"2026-07-05T11:43:25.648193+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ELT2HEFXVBVWOLB","created_at":"2026-07-05T11:43:25.648193+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ELT2HEF","created_at":"2026-07-05T11:43:25.648193+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/6ELT2HEFXVBVWOLB4PSZTL32GN","json":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN.json","graph_json":"https://pith.science/api/pith-number/6ELT2HEFXVBVWOLB4PSZTL32GN/graph.json","events_json":"https://pith.science/api/pith-number/6ELT2HEFXVBVWOLB4PSZTL32GN/events.json","paper":"https://pith.science/paper/6ELT2HEF"},"agent_actions":{"view_html":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN","download_json":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN.json","view_paper":"https://pith.science/paper/6ELT2HEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19461&json=true","fetch_graph":"https://pith.science/api/pith-number/6ELT2HEFXVBVWOLB4PSZTL32GN/graph.json","fetch_events":"https://pith.science/api/pith-number/6ELT2HEFXVBVWOLB4PSZTL32GN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN/action/storage_attestation","attest_author":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN/action/author_attestation","sign_citation":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN/action/citation_signature","submit_replication":"https://pith.science/pith/6ELT2HEFXVBVWOLB4PSZTL32GN/action/replication_record"}},"created_at":"2026-07-05T11:43:25.648193+00:00","updated_at":"2026-07-05T11:43:25.648193+00:00"}