{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FOMONIJSSDXEO4OE7O6UISQHCY","short_pith_number":"pith:FOMONIJS","schema_version":"1.0","canonical_sha256":"2b98e6a13290ee4771c4fbbd444a07160c7c3a2dab03b16f145a487387fea632","source":{"kind":"arxiv","id":"2308.12177","version":1},"attestation_state":"computed","paper":{"title":"On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Shengwei Zhou, Xiaowei Wu, Ziqi Yu","submitted_at":"2023-08-23T14:56:53Z","abstract_excerpt":"We study the problem of allocating a group of indivisible chores among agents while each chore has a binary marginal. We focus on the fairness criteria of envy-freeness up to any item (EFX) and investigate the existence of EFX allocations. We show that when agents have additive binary cost functions, there exist EFX and Pareto-optimal (PO) allocations that can be computed in polynomial time. To the best of our knowledge, this is the first setting of a general number of agents that admits EFX and PO allocations, before which EFX and PO allocations have only been shown to exist for three bivalue"},"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":"2308.12177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-08-23T14:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"cabeb4778534a38ac339675df76c36d28020b327402e308c9d2946ff1d059e3d","abstract_canon_sha256":"edd37ff59a1c8f7dcdb7590adfc2c2741e8cd38416d31aef065d68af02d88c67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:00.951127Z","signature_b64":"fZs9ySEPflB12HLCjlT3SJ35NPizkLYwm/eZbwk9x2NDrzYi/FOXNMbKDe05GvlLKLEzXd9FYIiSGw8PH9V2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b98e6a13290ee4771c4fbbd444a07160c7c3a2dab03b16f145a487387fea632","last_reissued_at":"2026-07-05T06:44:00.950631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:00.950631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Biaoshuai Tao, Shengwei Zhou, Xiaowei Wu, Ziqi Yu","submitted_at":"2023-08-23T14:56:53Z","abstract_excerpt":"We study the problem of allocating a group of indivisible chores among agents while each chore has a binary marginal. We focus on the fairness criteria of envy-freeness up to any item (EFX) and investigate the existence of EFX allocations. We show that when agents have additive binary cost functions, there exist EFX and Pareto-optimal (PO) allocations that can be computed in polynomial time. To the best of our knowledge, this is the first setting of a general number of agents that admits EFX and PO allocations, before which EFX and PO allocations have only been shown to exist for three bivalue"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12177","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/2308.12177/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":"2308.12177","created_at":"2026-07-05T06:44:00.950719+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12177v1","created_at":"2026-07-05T06:44:00.950719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12177","created_at":"2026-07-05T06:44:00.950719+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOMONIJSSDXE","created_at":"2026-07-05T06:44:00.950719+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOMONIJSSDXEO4OE","created_at":"2026-07-05T06:44:00.950719+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOMONIJS","created_at":"2026-07-05T06:44:00.950719+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/FOMONIJSSDXEO4OE7O6UISQHCY","json":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY.json","graph_json":"https://pith.science/api/pith-number/FOMONIJSSDXEO4OE7O6UISQHCY/graph.json","events_json":"https://pith.science/api/pith-number/FOMONIJSSDXEO4OE7O6UISQHCY/events.json","paper":"https://pith.science/paper/FOMONIJS"},"agent_actions":{"view_html":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY","download_json":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY.json","view_paper":"https://pith.science/paper/FOMONIJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12177&json=true","fetch_graph":"https://pith.science/api/pith-number/FOMONIJSSDXEO4OE7O6UISQHCY/graph.json","fetch_events":"https://pith.science/api/pith-number/FOMONIJSSDXEO4OE7O6UISQHCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY/action/storage_attestation","attest_author":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY/action/author_attestation","sign_citation":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY/action/citation_signature","submit_replication":"https://pith.science/pith/FOMONIJSSDXEO4OE7O6UISQHCY/action/replication_record"}},"created_at":"2026-07-05T06:44:00.950719+00:00","updated_at":"2026-07-05T06:44:00.950719+00:00"}