{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XVPDPZ32C25MFPW7CV22S2PVDR","short_pith_number":"pith:XVPDPZ32","canonical_record":{"source":{"id":"2410.15738","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-21T07:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"f764ce397444010c6ba2bb781f50e911c01100e4cb278d78c672e35fc98cdb6f","abstract_canon_sha256":"8e326a9e517cf7f778a6830c2c627ae3f1d5507f21dc9ad7daf0065cfb643736"},"schema_version":"1.0"},"canonical_sha256":"bd5e37e77a16bac2bedf1575a969f51c5e54d40e7430b89b87b20d541c1adeba","source":{"kind":"arxiv","id":"2410.15738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.15738","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"2410.15738v1","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15738","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"XVPDPZ32C25M","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"pith_short_16","alias_value":"XVPDPZ32C25MFPW7","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"pith_short_8","alias_value":"XVPDPZ32","created_at":"2026-07-05T09:23:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XVPDPZ32C25MFPW7CV22S2PVDR","target":"record","payload":{"canonical_record":{"source":{"id":"2410.15738","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-21T07:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"f764ce397444010c6ba2bb781f50e911c01100e4cb278d78c672e35fc98cdb6f","abstract_canon_sha256":"8e326a9e517cf7f778a6830c2c627ae3f1d5507f21dc9ad7daf0065cfb643736"},"schema_version":"1.0"},"canonical_sha256":"bd5e37e77a16bac2bedf1575a969f51c5e54d40e7430b89b87b20d541c1adeba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:23.994988Z","signature_b64":"4/6yhjpUy9afWHWiEmaQIcN/hFvXQpqRDNtLT3e7HMdLqeuVldUDFVPKPXdmge7s+78UdZOOL8DzK4t5sqbIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd5e37e77a16bac2bedf1575a969f51c5e54d40e7430b89b87b20d541c1adeba","last_reissued_at":"2026-07-05T09:23:23.994426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:23.994426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.15738","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-05T09:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7O9lujLy1Ga465eHoD/dHp3OYkQNXFKaa8xT5fUUcv8ZErtM+S2VgXm5xPcq5Dw1tyUoupJ2SVcr+Mn18KLJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:10:44.308820Z"},"content_sha256":"be6549cb14dd91369387e1abccd13577700e3e02d83e5bb0b988f5b2c4572988","schema_version":"1.0","event_id":"sha256:be6549cb14dd91369387e1abccd13577700e3e02d83e5bb0b988f5b2c4572988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XVPDPZ32C25MFPW7CV22S2PVDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ankang Sun, Bo Li, Shiji Xing","submitted_at":"2024-10-21T07:58:16Z","abstract_excerpt":"In this paper, we study the allocation of indivisible chores and consider the problem of finding a fair allocation that is approximately efficient. We shift our attention from the multiplicative approximation to the additive one. Our results are twofold, with (1) bounding how the optimal social cost escalates resulting from fairness requirements and (2) presenting the hardness of approximation for the problems of finding fair allocations with the minimum social cost. To quantify the escalation, we introduce cost of fairness (CoF) $\\unicode{x2014}$ an alternative to the price of fairness (PoF) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15738","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/2410.15738/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-05T09:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oIKB3Z3TSv99aqN8H7IZQLA7Gs1NMq45o+hckpIOdVtPg7HZKSnjAdhMSzy9R8d6QItOr3Ssiv7HRhpmjtEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:10:44.309598Z"},"content_sha256":"364f8200eec7cfa2c03283ba1bb822b1535ce5a8cf7e7928f64920a90911ccdf","schema_version":"1.0","event_id":"sha256:364f8200eec7cfa2c03283ba1bb822b1535ce5a8cf7e7928f64920a90911ccdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVPDPZ32C25MFPW7CV22S2PVDR/bundle.json","state_url":"https://pith.science/pith/XVPDPZ32C25MFPW7CV22S2PVDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVPDPZ32C25MFPW7CV22S2PVDR/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-11T06:10:44Z","links":{"resolver":"https://pith.science/pith/XVPDPZ32C25MFPW7CV22S2PVDR","bundle":"https://pith.science/pith/XVPDPZ32C25MFPW7CV22S2PVDR/bundle.json","state":"https://pith.science/pith/XVPDPZ32C25MFPW7CV22S2PVDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVPDPZ32C25MFPW7CV22S2PVDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XVPDPZ32C25MFPW7CV22S2PVDR","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":"8e326a9e517cf7f778a6830c2c627ae3f1d5507f21dc9ad7daf0065cfb643736","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-21T07:58:16Z","title_canon_sha256":"f764ce397444010c6ba2bb781f50e911c01100e4cb278d78c672e35fc98cdb6f"},"schema_version":"1.0","source":{"id":"2410.15738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.15738","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"2410.15738v1","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15738","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"XVPDPZ32C25M","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"pith_short_16","alias_value":"XVPDPZ32C25MFPW7","created_at":"2026-07-05T09:23:23Z"},{"alias_kind":"pith_short_8","alias_value":"XVPDPZ32","created_at":"2026-07-05T09:23:23Z"}],"graph_snapshots":[{"event_id":"sha256:364f8200eec7cfa2c03283ba1bb822b1535ce5a8cf7e7928f64920a90911ccdf","target":"graph","created_at":"2026-07-05T09:23:23Z","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/2410.15738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the allocation of indivisible chores and consider the problem of finding a fair allocation that is approximately efficient. We shift our attention from the multiplicative approximation to the additive one. Our results are twofold, with (1) bounding how the optimal social cost escalates resulting from fairness requirements and (2) presenting the hardness of approximation for the problems of finding fair allocations with the minimum social cost. To quantify the escalation, we introduce cost of fairness (CoF) $\\unicode{x2014}$ an alternative to the price of fairness (PoF) ","authors_text":"Ankang Sun, Bo Li, Shiji Xing","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-21T07:58:16Z","title":"A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15738","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:be6549cb14dd91369387e1abccd13577700e3e02d83e5bb0b988f5b2c4572988","target":"record","created_at":"2026-07-05T09:23:23Z","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":"8e326a9e517cf7f778a6830c2c627ae3f1d5507f21dc9ad7daf0065cfb643736","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-21T07:58:16Z","title_canon_sha256":"f764ce397444010c6ba2bb781f50e911c01100e4cb278d78c672e35fc98cdb6f"},"schema_version":"1.0","source":{"id":"2410.15738","kind":"arxiv","version":1}},"canonical_sha256":"bd5e37e77a16bac2bedf1575a969f51c5e54d40e7430b89b87b20d541c1adeba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd5e37e77a16bac2bedf1575a969f51c5e54d40e7430b89b87b20d541c1adeba","first_computed_at":"2026-07-05T09:23:23.994426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:23.994426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/6yhjpUy9afWHWiEmaQIcN/hFvXQpqRDNtLT3e7HMdLqeuVldUDFVPKPXdmge7s+78UdZOOL8DzK4t5sqbIBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:23.994988Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.15738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be6549cb14dd91369387e1abccd13577700e3e02d83e5bb0b988f5b2c4572988","sha256:364f8200eec7cfa2c03283ba1bb822b1535ce5a8cf7e7928f64920a90911ccdf"],"state_sha256":"ab586d54b4bc4beb7ed20ba76f3229172f07eb4b75d904761d4a7f70e362b8bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPuDLnQLU4si3NzC7hPexhIzBDi1S8N1rkiV2RSC1COEqFVUJNUIongjcGGqRuXwO5me/g6UreAmHYxKG7WwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T06:10:44.319115Z","bundle_sha256":"22348eb75490b8bb28b0254d03e7bc153e85fe11de6d58f1ee90c24228979791"}}