{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MG4OARHX2DHL6ZNB74QQ56XXK3","short_pith_number":"pith:MG4OARHX","canonical_record":{"source":{"id":"2410.18655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-24T11:34:28Z","cross_cats_sorted":[],"title_canon_sha256":"2128982d6d1ae8b4d53304f5fbfe870b1087534566e5d83de9206b34b1692ae3","abstract_canon_sha256":"0395a4c2e166b3f4ac76762fe3c0495719f2dae8749d0086cffa42a8d31201c9"},"schema_version":"1.0"},"canonical_sha256":"61b8e044f7d0cebf65a1ff210efaf756c8f5aa0ffa6b0241dc3b669769a0c23c","source":{"kind":"arxiv","id":"2410.18655","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18655","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18655v1","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18655","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"MG4OARHX2DHL","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"pith_short_16","alias_value":"MG4OARHX2DHL6ZNB","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"pith_short_8","alias_value":"MG4OARHX","created_at":"2026-07-05T09:25:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MG4OARHX2DHL6ZNB74QQ56XXK3","target":"record","payload":{"canonical_record":{"source":{"id":"2410.18655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-24T11:34:28Z","cross_cats_sorted":[],"title_canon_sha256":"2128982d6d1ae8b4d53304f5fbfe870b1087534566e5d83de9206b34b1692ae3","abstract_canon_sha256":"0395a4c2e166b3f4ac76762fe3c0495719f2dae8749d0086cffa42a8d31201c9"},"schema_version":"1.0"},"canonical_sha256":"61b8e044f7d0cebf65a1ff210efaf756c8f5aa0ffa6b0241dc3b669769a0c23c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:11.865130Z","signature_b64":"nzcJNFedE4PNm7aRT/QW4GkGTQITKvQukqHnALdxpSKP7U2x4zvT1KvZGkGH+kBu8iO13p6G43Rc5ai8YnToCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b8e044f7d0cebf65a1ff210efaf756c8f5aa0ffa6b0241dc3b669769a0c23c","last_reissued_at":"2026-07-05T09:25:11.864783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:11.864783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.18655","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4MUlabqW9kuOM90lBzjoM2zPYIw+4nW7kF4ooZFOq5fMLq9iRRxQBxYGWoQp+QzzwW+DsEaT4jaZapLjLKpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:01:34.056913Z"},"content_sha256":"e5bd92f618d21242ab0b42b41e34fb53f6170fd666039856aa3d8bf3cb932e68","schema_version":"1.0","event_id":"sha256:e5bd92f618d21242ab0b42b41e34fb53f6170fd666039856aa3d8bf3cb932e68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MG4OARHX2DHL6ZNB74QQ56XXK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alireza Danaei, Kurt Mehlhorn, Mahyar Afshinmehr, Matin Ansaripour","submitted_at":"2024-10-24T11:34:28Z","abstract_excerpt":"We explore the fair distribution of a set of $m$ indivisible chores among $n$ agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two fairness criteria: envy-freeness up to any item (EFX) and a relaxed notion, namely envy-freeness up to the transfer of any item (tEFX). We demonstrate that a 2-approximate EFX allocation exists and is computable in polynomial time for three agents with subadditive cost functions, improving upon the previous $(2 + \\sqrt{6})$ approximation for additive cost functions. This result requires extensive case analysis. Christ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18655","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.18655/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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkCi9c7HNtM2XByp80ix1T6W3TR+aVI63pQ1EwV5/k/s9K3840AsaMAZvIIOCp0ZrIQ2E6lmf2UPbdbMJo9rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:01:34.057417Z"},"content_sha256":"c65e45dfca5e7c3e7ddc48b5620079930dbf0d8c0cd8394c014b11e883264efb","schema_version":"1.0","event_id":"sha256:c65e45dfca5e7c3e7ddc48b5620079930dbf0d8c0cd8394c014b11e883264efb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG4OARHX2DHL6ZNB74QQ56XXK3/bundle.json","state_url":"https://pith.science/pith/MG4OARHX2DHL6ZNB74QQ56XXK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG4OARHX2DHL6ZNB74QQ56XXK3/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-17T03:01:34Z","links":{"resolver":"https://pith.science/pith/MG4OARHX2DHL6ZNB74QQ56XXK3","bundle":"https://pith.science/pith/MG4OARHX2DHL6ZNB74QQ56XXK3/bundle.json","state":"https://pith.science/pith/MG4OARHX2DHL6ZNB74QQ56XXK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG4OARHX2DHL6ZNB74QQ56XXK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MG4OARHX2DHL6ZNB74QQ56XXK3","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":"0395a4c2e166b3f4ac76762fe3c0495719f2dae8749d0086cffa42a8d31201c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-24T11:34:28Z","title_canon_sha256":"2128982d6d1ae8b4d53304f5fbfe870b1087534566e5d83de9206b34b1692ae3"},"schema_version":"1.0","source":{"id":"2410.18655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18655","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18655v1","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18655","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"MG4OARHX2DHL","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"pith_short_16","alias_value":"MG4OARHX2DHL6ZNB","created_at":"2026-07-05T09:25:11Z"},{"alias_kind":"pith_short_8","alias_value":"MG4OARHX","created_at":"2026-07-05T09:25:11Z"}],"graph_snapshots":[{"event_id":"sha256:c65e45dfca5e7c3e7ddc48b5620079930dbf0d8c0cd8394c014b11e883264efb","target":"graph","created_at":"2026-07-05T09:25:11Z","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.18655/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We explore the fair distribution of a set of $m$ indivisible chores among $n$ agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two fairness criteria: envy-freeness up to any item (EFX) and a relaxed notion, namely envy-freeness up to the transfer of any item (tEFX). We demonstrate that a 2-approximate EFX allocation exists and is computable in polynomial time for three agents with subadditive cost functions, improving upon the previous $(2 + \\sqrt{6})$ approximation for additive cost functions. This result requires extensive case analysis. Christ","authors_text":"Alireza Danaei, Kurt Mehlhorn, Mahyar Afshinmehr, Matin Ansaripour","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-24T11:34:28Z","title":"Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18655","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:e5bd92f618d21242ab0b42b41e34fb53f6170fd666039856aa3d8bf3cb932e68","target":"record","created_at":"2026-07-05T09:25:11Z","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":"0395a4c2e166b3f4ac76762fe3c0495719f2dae8749d0086cffa42a8d31201c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2024-10-24T11:34:28Z","title_canon_sha256":"2128982d6d1ae8b4d53304f5fbfe870b1087534566e5d83de9206b34b1692ae3"},"schema_version":"1.0","source":{"id":"2410.18655","kind":"arxiv","version":1}},"canonical_sha256":"61b8e044f7d0cebf65a1ff210efaf756c8f5aa0ffa6b0241dc3b669769a0c23c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61b8e044f7d0cebf65a1ff210efaf756c8f5aa0ffa6b0241dc3b669769a0c23c","first_computed_at":"2026-07-05T09:25:11.864783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:11.864783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nzcJNFedE4PNm7aRT/QW4GkGTQITKvQukqHnALdxpSKP7U2x4zvT1KvZGkGH+kBu8iO13p6G43Rc5ai8YnToCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:11.865130Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.18655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5bd92f618d21242ab0b42b41e34fb53f6170fd666039856aa3d8bf3cb932e68","sha256:c65e45dfca5e7c3e7ddc48b5620079930dbf0d8c0cd8394c014b11e883264efb"],"state_sha256":"8b1e624ec062ed263912f2dc8e46f381bce8ab571c3affda0b302674fff2e139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fcZS1WYjXHE/yDkHYs86psd2QCAJZrz1i4OIhl4oyFB9K4RrAjNBYe0JQyqlCzcqTW/9H4jF3151w1/y1tBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T03:01:34.061117Z","bundle_sha256":"9e0156082a2513bec6219dcbe4753269110e4cc7b8d413c2ea8a668e4789e27b"}}