{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:75IDYBAEIEZMAF66N253TOBHBB","short_pith_number":"pith:75IDYBAE","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"},"canonical_sha256":"ff503c04044132c017de6ebbb9b827084255ba4d931d561e13ab6710924a0c81","source":{"kind":"arxiv","id":"2005.04864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.04864","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"2005.04864v1","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04864","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"75IDYBAEIEZM","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"pith_short_16","alias_value":"75IDYBAEIEZMAF66","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"pith_short_8","alias_value":"75IDYBAE","created_at":"2026-07-05T01:01:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:75IDYBAEIEZMAF66N253TOBHBB","target":"record","payload":{"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"},"canonical_sha256":"ff503c04044132c017de6ebbb9b827084255ba4d931d561e13ab6710924a0c81","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"},"source_kind":"arxiv","source_id":"2005.04864","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezceYFtCqpT/KHMdeDquYIayA50XYguNNc83kBAFdYo1dGnZOPos7Fm8c1krFZ6KqjUp58yoObCCFsi/PLegCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:55:39.761191Z"},"content_sha256":"f7823830852a7ba76e1a66a0c7f7aa50ac5c11e2661fe7de3067bfdc7bf2a10e","schema_version":"1.0","event_id":"sha256:f7823830852a7ba76e1a66a0c7f7aa50ac5c11e2661fe7de3067bfdc7bf2a10e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:75IDYBAEIEZMAF66N253TOBHBB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGNaU8rQLcVcIrQneuydInIMREBapWBaYcpuwk/vMLI05ObpxS1NRq9/2Kduvmuckg8tU6PNWMEACWitP7uGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:55:39.761689Z"},"content_sha256":"ae983102f27bfc7f4fcc093ca4d51c0fac50731c4bfddc943b6b9d39c4168e7a","schema_version":"1.0","event_id":"sha256:ae983102f27bfc7f4fcc093ca4d51c0fac50731c4bfddc943b6b9d39c4168e7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/bundle.json","state_url":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75IDYBAEIEZMAF66N253TOBHBB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T01:55:39Z","links":{"resolver":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB","bundle":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/bundle.json","state":"https://pith.science/pith/75IDYBAEIEZMAF66N253TOBHBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75IDYBAEIEZMAF66N253TOBHBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:75IDYBAEIEZMAF66N253TOBHBB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"db2eb150fd10406eb336c591dc2c4c9f59cbcca483e59ce696fc347f1573e26b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-11T05:15:43Z","title_canon_sha256":"053b52b6151b80e4e144bdd8c3a7fa4ab80c541f05e88e9ba99b775f4306dbce"},"schema_version":"1.0","source":{"id":"2005.04864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.04864","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"2005.04864v1","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04864","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"75IDYBAEIEZM","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"pith_short_16","alias_value":"75IDYBAEIEZMAF66","created_at":"2026-07-05T01:01:47Z"},{"alias_kind":"pith_short_8","alias_value":"75IDYBAE","created_at":"2026-07-05T01:01:47Z"}],"graph_snapshots":[{"event_id":"sha256:ae983102f27bfc7f4fcc093ca4d51c0fac50731c4bfddc943b6b9d39c4168e7a","target":"graph","created_at":"2026-07-05T01:01:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.04864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Xingyu Chen, Zijie Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-11T05:15:43Z","title":"The Fairness of Leximin in Allocation of Indivisible Chores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04864","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7823830852a7ba76e1a66a0c7f7aa50ac5c11e2661fe7de3067bfdc7bf2a10e","target":"record","created_at":"2026-07-05T01:01:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"db2eb150fd10406eb336c591dc2c4c9f59cbcca483e59ce696fc347f1573e26b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-11T05:15:43Z","title_canon_sha256":"053b52b6151b80e4e144bdd8c3a7fa4ab80c541f05e88e9ba99b775f4306dbce"},"schema_version":"1.0","source":{"id":"2005.04864","kind":"arxiv","version":1}},"canonical_sha256":"ff503c04044132c017de6ebbb9b827084255ba4d931d561e13ab6710924a0c81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff503c04044132c017de6ebbb9b827084255ba4d931d561e13ab6710924a0c81","first_computed_at":"2026-07-05T01:01:47.995683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:47.995683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FAwH9fyeyRwectyPqh/8LK3fUXDpAwzoWwP5ti2TfDYF85tUzhLehy8uRLy/vxFBPwHxJDtpD5PYxh06qvYGDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:47.996190Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.04864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7823830852a7ba76e1a66a0c7f7aa50ac5c11e2661fe7de3067bfdc7bf2a10e","sha256:ae983102f27bfc7f4fcc093ca4d51c0fac50731c4bfddc943b6b9d39c4168e7a"],"state_sha256":"f8f211586e65287061b2ffdea93b641d6e24aab5b824bf4a8ba3e2782930a812"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIEHyzOr1ItKTx71teAquGm9+UudPE6AlF1aCPM9TCokM1BOvCzLNTfqryN3njWLUeiM5Cmxpk0nRsXxZtMXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T01:55:39.766012Z","bundle_sha256":"88a91364d6fe1918f79f0dca0b8826a00ec3a236729acf3b01c069294e9a7391"}}