{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SGOQ7YHDZDWLXHCBNGN5QY7CHT","short_pith_number":"pith:SGOQ7YHD","schema_version":"1.0","canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","source":{"kind":"arxiv","id":"2302.04581","version":4},"attestation_state":"computed","paper":{"title":"A Reduction from Chores Allocation to Job Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Erel Segal-Halevi, Xin Huang","submitted_at":"2023-02-09T11:42:41Z","abstract_excerpt":"We consider allocating indivisible chores among agents with different cost functions, such that all agents receive a cost of at most a constant factor times their maximin share. The state-of-the-art was presented in In EC 2021 by Huang and Lu. They presented a non-polynomial-time algorithm, called HFFD, that attains an 11/9 approximation, and a polynomial-time algorithm that attains a 5/4 approximation.\n  In this paper, we show that HFFD can be reduced to an algorithm called MultiFit, developed by Coffman, Garey and Johnson in 1978 for makespan minimization in job scheduling. Using this reduct"},"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":"2302.04581","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-02-09T11:42:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0467ac162f280f809d7e1a852dda81bb5679c2bcc7845616549ad931d7a712af","abstract_canon_sha256":"08ecc7c54e3b0f5fabf43d6341a2b99e84c04f3c75519c51524b9641d6a4e57b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:10.887762Z","signature_b64":"d/AhMBnVSysXhFUUtYLicFlBS18hr2R/8iH3I81svAFYls5O4HeSU3P+5hjF/Fv1zaSeYqAWLyq6xNGvv72uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","last_reissued_at":"2026-07-05T09:02:10.887247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:10.887247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reduction from Chores Allocation to Job Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Erel Segal-Halevi, Xin Huang","submitted_at":"2023-02-09T11:42:41Z","abstract_excerpt":"We consider allocating indivisible chores among agents with different cost functions, such that all agents receive a cost of at most a constant factor times their maximin share. The state-of-the-art was presented in In EC 2021 by Huang and Lu. They presented a non-polynomial-time algorithm, called HFFD, that attains an 11/9 approximation, and a polynomial-time algorithm that attains a 5/4 approximation.\n  In this paper, we show that HFFD can be reduced to an algorithm called MultiFit, developed by Coffman, Garey and Johnson in 1978 for makespan minimization in job scheduling. Using this reduct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04581","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/2302.04581/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":"2302.04581","created_at":"2026-07-05T09:02:10.887307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.04581v4","created_at":"2026-07-05T09:02:10.887307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04581","created_at":"2026-07-05T09:02:10.887307+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGOQ7YHDZDWL","created_at":"2026-07-05T09:02:10.887307+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGOQ7YHDZDWLXHCB","created_at":"2026-07-05T09:02:10.887307+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGOQ7YHD","created_at":"2026-07-05T09:02:10.887307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12984","citing_title":"Lower Bound for Online MMS Assignment of Indivisible Chores","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT","json":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT.json","graph_json":"https://pith.science/api/pith-number/SGOQ7YHDZDWLXHCBNGN5QY7CHT/graph.json","events_json":"https://pith.science/api/pith-number/SGOQ7YHDZDWLXHCBNGN5QY7CHT/events.json","paper":"https://pith.science/paper/SGOQ7YHD"},"agent_actions":{"view_html":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT","download_json":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT.json","view_paper":"https://pith.science/paper/SGOQ7YHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.04581&json=true","fetch_graph":"https://pith.science/api/pith-number/SGOQ7YHDZDWLXHCBNGN5QY7CHT/graph.json","fetch_events":"https://pith.science/api/pith-number/SGOQ7YHDZDWLXHCBNGN5QY7CHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/action/storage_attestation","attest_author":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/action/author_attestation","sign_citation":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/action/citation_signature","submit_replication":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/action/replication_record"}},"created_at":"2026-07-05T09:02:10.887307+00:00","updated_at":"2026-07-05T09:02:10.887307+00:00"}