{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TG47RC2M3THWOZD3BOPXKUCF2L","short_pith_number":"pith:TG47RC2M","schema_version":"1.0","canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","source":{"kind":"arxiv","id":"2501.04550","version":1},"attestation_state":"computed","paper":{"title":"Approximately EFX and PO Allocations for Bivalued Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shengwei Zhou, Xiaowei Wu, Zehan Lin","submitted_at":"2025-01-08T14:57:07Z","abstract_excerpt":"We consider the computation for allocations of indivisible chores that are approximately EFX and Pareto optimal (PO). Recently, Garg et al. (2024) show the existence of $3$-EFX and PO allocations for bi-valued instances, where the cost of an item to an agent is either $1$ or $k$ (where $k > 1$) by rounding the (fractional) earning restricted equilibrium. In this work, we improve the approximation ratio to $(2-1/k)$, while preserving the Pareto optimality. Instead of rounding fractional equilibrium, our algorithm starts with the integral EF1 equilibrium for bi-valued chores, introduced by Garg "},"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":"2501.04550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-08T14:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"e1bf9b9622fad7e18788f686d5d699168687c17e9ecad7015fab09ea0feb35ae","abstract_canon_sha256":"2da26ddacd61a6144cb55dbe96067028a52b4ffbec92ab7cf23c955c98e5dc14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:37.163638Z","signature_b64":"w/i3AS+xeza6/Z0aCYgDRJCkuOZFlCCzVkEICPrAzZMT1vDoPFlHDV1c2uOZNr+Dk2gcGVj26QEqc4KOakSODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","last_reissued_at":"2026-07-05T09:58:37.163167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:37.163167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximately EFX and PO Allocations for Bivalued Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shengwei Zhou, Xiaowei Wu, Zehan Lin","submitted_at":"2025-01-08T14:57:07Z","abstract_excerpt":"We consider the computation for allocations of indivisible chores that are approximately EFX and Pareto optimal (PO). Recently, Garg et al. (2024) show the existence of $3$-EFX and PO allocations for bi-valued instances, where the cost of an item to an agent is either $1$ or $k$ (where $k > 1$) by rounding the (fractional) earning restricted equilibrium. In this work, we improve the approximation ratio to $(2-1/k)$, while preserving the Pareto optimality. Instead of rounding fractional equilibrium, our algorithm starts with the integral EF1 equilibrium for bi-valued chores, introduced by Garg "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04550","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/2501.04550/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":"2501.04550","created_at":"2026-07-05T09:58:37.163223+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04550v1","created_at":"2026-07-05T09:58:37.163223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04550","created_at":"2026-07-05T09:58:37.163223+00:00"},{"alias_kind":"pith_short_12","alias_value":"TG47RC2M3THW","created_at":"2026-07-05T09:58:37.163223+00:00"},{"alias_kind":"pith_short_16","alias_value":"TG47RC2M3THWOZD3","created_at":"2026-07-05T09:58:37.163223+00:00"},{"alias_kind":"pith_short_8","alias_value":"TG47RC2M","created_at":"2026-07-05T09:58:37.163223+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/TG47RC2M3THWOZD3BOPXKUCF2L","json":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L.json","graph_json":"https://pith.science/api/pith-number/TG47RC2M3THWOZD3BOPXKUCF2L/graph.json","events_json":"https://pith.science/api/pith-number/TG47RC2M3THWOZD3BOPXKUCF2L/events.json","paper":"https://pith.science/paper/TG47RC2M"},"agent_actions":{"view_html":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L","download_json":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L.json","view_paper":"https://pith.science/paper/TG47RC2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04550&json=true","fetch_graph":"https://pith.science/api/pith-number/TG47RC2M3THWOZD3BOPXKUCF2L/graph.json","fetch_events":"https://pith.science/api/pith-number/TG47RC2M3THWOZD3BOPXKUCF2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/action/storage_attestation","attest_author":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/action/author_attestation","sign_citation":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/action/citation_signature","submit_replication":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/action/replication_record"}},"created_at":"2026-07-05T09:58:37.163223+00:00","updated_at":"2026-07-05T09:58:37.163223+00:00"}