{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OWWNVGD2BVBSPWGZLQDZIALHEI","short_pith_number":"pith:OWWNVGD2","schema_version":"1.0","canonical_sha256":"75acda987a0d4327d8d95c079401672239e9b972cc899f389f0a9655dffabd14","source":{"kind":"arxiv","id":"2510.06581","version":2},"attestation_state":"computed","paper":{"title":"Constant Weighted Maximin Share Approximations for Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Li, Fangxiao Wang, Shiji Xing","submitted_at":"2025-10-08T02:24:32Z","abstract_excerpt":"We study the fair allocation of indivisible chores among agents with asymmetric weights. Among the various fairness notions, weighted maximin share (WMMS) stands out as particularly compelling. Despite its appeal, the existence of a constant-factor approximation for WMMS has remained an important open problem in weighted fair division [Aziz et al., 2022, Suksompong, 2025]. Prior to our work, the best known approximation ratio was $O(\\log n)$, where $n$ is the number of agents. In this paper, we make significant progress by presenting the first constant-factor approximation algorithm for WMMS. "},"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":"2510.06581","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-10-08T02:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"d64f18ac8fea8bcccc0adceba68e62c8e4e5112ebaf101068599a8d382e64f7d","abstract_canon_sha256":"afb1852a8385379c007f406d1521e75c2050a60da99b437310a0cc72fbe6d048"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T00:19:11.416589Z","signature_b64":"xadfpaVdTmRuw8M/iqgkJoImmsKjVSfWPOrepONeT0GOMTftpSfoMrEcLH9H99jq3/FBFMA2em4sGtMOcpr5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75acda987a0d4327d8d95c079401672239e9b972cc899f389f0a9655dffabd14","last_reissued_at":"2026-07-09T00:19:11.415891Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T00:19:11.415891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Weighted Maximin Share Approximations for Chores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Li, Fangxiao Wang, Shiji Xing","submitted_at":"2025-10-08T02:24:32Z","abstract_excerpt":"We study the fair allocation of indivisible chores among agents with asymmetric weights. Among the various fairness notions, weighted maximin share (WMMS) stands out as particularly compelling. Despite its appeal, the existence of a constant-factor approximation for WMMS has remained an important open problem in weighted fair division [Aziz et al., 2022, Suksompong, 2025]. Prior to our work, the best known approximation ratio was $O(\\log n)$, where $n$ is the number of agents. In this paper, we make significant progress by presenting the first constant-factor approximation algorithm for WMMS. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06581","kind":"arxiv","version":2},"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/2510.06581/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":"2510.06581","created_at":"2026-07-09T00:19:11.415992+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.06581v2","created_at":"2026-07-09T00:19:11.415992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06581","created_at":"2026-07-09T00:19:11.415992+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWWNVGD2BVBS","created_at":"2026-07-09T00:19:11.415992+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWWNVGD2BVBSPWGZ","created_at":"2026-07-09T00:19:11.415992+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWWNVGD2","created_at":"2026-07-09T00:19:11.415992+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/OWWNVGD2BVBSPWGZLQDZIALHEI","json":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI.json","graph_json":"https://pith.science/api/pith-number/OWWNVGD2BVBSPWGZLQDZIALHEI/graph.json","events_json":"https://pith.science/api/pith-number/OWWNVGD2BVBSPWGZLQDZIALHEI/events.json","paper":"https://pith.science/paper/OWWNVGD2"},"agent_actions":{"view_html":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI","download_json":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI.json","view_paper":"https://pith.science/paper/OWWNVGD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.06581&json=true","fetch_graph":"https://pith.science/api/pith-number/OWWNVGD2BVBSPWGZLQDZIALHEI/graph.json","fetch_events":"https://pith.science/api/pith-number/OWWNVGD2BVBSPWGZLQDZIALHEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI/action/storage_attestation","attest_author":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI/action/author_attestation","sign_citation":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI/action/citation_signature","submit_replication":"https://pith.science/pith/OWWNVGD2BVBSPWGZLQDZIALHEI/action/replication_record"}},"created_at":"2026-07-09T00:19:11.415992+00:00","updated_at":"2026-07-09T00:19:11.415992+00:00"}