{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:75IDYBAEIEZMAF66N253TOBHBB","short_pith_number":"pith:75IDYBAE","schema_version":"1.0","canonical_sha256":"ff503c04044132c017de6ebbb9b827084255ba4d931d561e13ab6710924a0c81","source":{"kind":"arxiv","id":"2005.04864","version":1},"attestation_state":"computed","paper":{"title":"The Fairness of Leximin in Allocation of Indivisible Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Xingyu Chen, Zijie Liu","submitted_at":"2020-05-11T05:15:43Z","abstract_excerpt":"The leximin solution -- which selects an allocation that maximizes the minimum utility, then the second minimum utility, and so forth -- is known to provide EFX (envy-free up to any good) fairness guarantee in some contexts when allocating indivisible goods. However, it remains unknown how fair the leximin solution is when used to allocate indivisible chores. In this paper, we demonstrate that the leximin solution can be modified to also provide compelling fairness guarantees for the allocation of indivisible chores. First, we generalize the definition of the leximin solution. Then, we show th"},"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":"2005.04864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-11T05:15:43Z","cross_cats_sorted":[],"title_canon_sha256":"053b52b6151b80e4e144bdd8c3a7fa4ab80c541f05e88e9ba99b775f4306dbce","abstract_canon_sha256":"db2eb150fd10406eb336c591dc2c4c9f59cbcca483e59ce696fc347f1573e26b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:47.996190Z","signature_b64":"FAwH9fyeyRwectyPqh/8LK3fUXDpAwzoWwP5ti2TfDYF85tUzhLehy8uRLy/vxFBPwHxJDtpD5PYxh06qvYGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff503c04044132c017de6ebbb9b827084255ba4d931d561e13ab6710924a0c81","last_reissued_at":"2026-07-05T01:01:47.995683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:47.995683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fairness of Leximin in Allocation of Indivisible Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Xingyu Chen, Zijie Liu","submitted_at":"2020-05-11T05:15:43Z","abstract_excerpt":"The leximin solution -- which selects an allocation that maximizes the minimum utility, then the second minimum utility, and so forth -- is known to provide EFX (envy-free up to any good) fairness guarantee in some contexts when allocating indivisible goods. However, it remains unknown how fair the leximin solution is when used to allocate indivisible chores. In this paper, we demonstrate that the leximin solution can be modified to also provide compelling fairness guarantees for the allocation of indivisible chores. First, we generalize the definition of the leximin solution. Then, we show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04864","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/2005.04864/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":"2005.04864","created_at":"2026-07-05T01:01:47.995741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.04864v1","created_at":"2026-07-05T01:01:47.995741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04864","created_at":"2026-07-05T01:01:47.995741+00:00"},{"alias_kind":"pith_short_12","alias_value":"75IDYBAEIEZM","created_at":"2026-07-05T01:01:47.995741+00:00"},{"alias_kind":"pith_short_16","alias_value":"75IDYBAEIEZMAF66","created_at":"2026-07-05T01:01:47.995741+00:00"},{"alias_kind":"pith_short_8","alias_value":"75IDYBAE","created_at":"2026-07-05T01:01:47.995741+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08872","citing_title":"EFX for Additive Chores: Nonexistence, Pareto Incompatibility, and Bi-Valued Existence","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB","json":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB.json","graph_json":"https://pith.science/api/pith-number/75IDYBAEIEZMAF66N253TOBHBB/graph.json","events_json":"https://pith.science/api/pith-number/75IDYBAEIEZMAF66N253TOBHBB/events.json","paper":"https://pith.science/paper/75IDYBAE"},"agent_actions":{"view_html":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB","download_json":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB.json","view_paper":"https://pith.science/paper/75IDYBAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.04864&json=true","fetch_graph":"https://pith.science/api/pith-number/75IDYBAEIEZMAF66N253TOBHBB/graph.json","fetch_events":"https://pith.science/api/pith-number/75IDYBAEIEZMAF66N253TOBHBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/action/storage_attestation","attest_author":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/action/author_attestation","sign_citation":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/action/citation_signature","submit_replication":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/action/replication_record"}},"created_at":"2026-07-05T01:01:47.995741+00:00","updated_at":"2026-07-05T01:01:47.995741+00:00"}