{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TG47RC2M3THWOZD3BOPXKUCF2L","short_pith_number":"pith:TG47RC2M","canonical_record":{"source":{"id":"2501.04550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-08T14:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"e1bf9b9622fad7e18788f686d5d699168687c17e9ecad7015fab09ea0feb35ae","abstract_canon_sha256":"2da26ddacd61a6144cb55dbe96067028a52b4ffbec92ab7cf23c955c98e5dc14"},"schema_version":"1.0"},"canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","source":{"kind":"arxiv","id":"2501.04550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04550","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04550v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04550","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"TG47RC2M3THW","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"TG47RC2M3THWOZD3","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"TG47RC2M","created_at":"2026-07-05T09:58:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TG47RC2M3THWOZD3BOPXKUCF2L","target":"record","payload":{"canonical_record":{"source":{"id":"2501.04550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-08T14:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"e1bf9b9622fad7e18788f686d5d699168687c17e9ecad7015fab09ea0feb35ae","abstract_canon_sha256":"2da26ddacd61a6144cb55dbe96067028a52b4ffbec92ab7cf23c955c98e5dc14"},"schema_version":"1.0"},"canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:37.163638Z","signature_b64":"w/i3AS+xeza6/Z0aCYgDRJCkuOZFlCCzVkEICPrAzZMT1vDoPFlHDV1c2uOZNr+Dk2gcGVj26QEqc4KOakSODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","last_reissued_at":"2026-07-05T09:58:37.163167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:37.163167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.04550","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:58:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPXa0roER+gHXZ/7HXlnejKY1PlNBZMXCIsfqnT5l6SS2yMe/mATNEYrkdCF1INQbQ9Y1eHLnTuc3T0ECBWIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:09:32.017552Z"},"content_sha256":"3139c11f6459ff9dc15ea5908327e4ba98278d80cdf25a85b504f627b50be4b6","schema_version":"1.0","event_id":"sha256:3139c11f6459ff9dc15ea5908327e4ba98278d80cdf25a85b504f627b50be4b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TG47RC2M3THWOZD3BOPXKUCF2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximately EFX and PO Allocations for Bivalued Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shengwei Zhou, Xiaowei Wu, Zehan Lin","submitted_at":"2025-01-08T14:57:07Z","abstract_excerpt":"We consider the computation for allocations of indivisible chores that are approximately EFX and Pareto optimal (PO). Recently, Garg et al. (2024) show the existence of $3$-EFX and PO allocations for bi-valued instances, where the cost of an item to an agent is either $1$ or $k$ (where $k > 1$) by rounding the (fractional) earning restricted equilibrium. In this work, we improve the approximation ratio to $(2-1/k)$, while preserving the Pareto optimality. Instead of rounding fractional equilibrium, our algorithm starts with the integral EF1 equilibrium for bi-valued chores, introduced by Garg "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04550","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/2501.04550/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:58:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlpIEPZIRe54dwCt4J8xK39UXuZY0d+WH4WXaV6CUkwURUbjbHgC9aYPDE+kD8OmoGQ9GExHO+TJX5stYRhaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:09:32.018088Z"},"content_sha256":"93c6f4bdb9b1db8d5184b861e6d6e7968039d2cd76843aa7dd47d6ab2761a4e6","schema_version":"1.0","event_id":"sha256:93c6f4bdb9b1db8d5184b861e6d6e7968039d2cd76843aa7dd47d6ab2761a4e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/bundle.json","state_url":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TG47RC2M3THWOZD3BOPXKUCF2L/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-15T07:09:32Z","links":{"resolver":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L","bundle":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/bundle.json","state":"https://pith.science/pith/TG47RC2M3THWOZD3BOPXKUCF2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TG47RC2M3THWOZD3BOPXKUCF2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TG47RC2M3THWOZD3BOPXKUCF2L","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":"2da26ddacd61a6144cb55dbe96067028a52b4ffbec92ab7cf23c955c98e5dc14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-08T14:57:07Z","title_canon_sha256":"e1bf9b9622fad7e18788f686d5d699168687c17e9ecad7015fab09ea0feb35ae"},"schema_version":"1.0","source":{"id":"2501.04550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04550","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04550v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04550","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"TG47RC2M3THW","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"TG47RC2M3THWOZD3","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"TG47RC2M","created_at":"2026-07-05T09:58:37Z"}],"graph_snapshots":[{"event_id":"sha256:93c6f4bdb9b1db8d5184b861e6d6e7968039d2cd76843aa7dd47d6ab2761a4e6","target":"graph","created_at":"2026-07-05T09:58:37Z","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/2501.04550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the computation for allocations of indivisible chores that are approximately EFX and Pareto optimal (PO). Recently, Garg et al. (2024) show the existence of $3$-EFX and PO allocations for bi-valued instances, where the cost of an item to an agent is either $1$ or $k$ (where $k > 1$) by rounding the (fractional) earning restricted equilibrium. In this work, we improve the approximation ratio to $(2-1/k)$, while preserving the Pareto optimality. Instead of rounding fractional equilibrium, our algorithm starts with the integral EF1 equilibrium for bi-valued chores, introduced by Garg ","authors_text":"Shengwei Zhou, Xiaowei Wu, Zehan Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-08T14:57:07Z","title":"Approximately EFX and PO Allocations for Bivalued Chores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04550","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:3139c11f6459ff9dc15ea5908327e4ba98278d80cdf25a85b504f627b50be4b6","target":"record","created_at":"2026-07-05T09:58:37Z","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":"2da26ddacd61a6144cb55dbe96067028a52b4ffbec92ab7cf23c955c98e5dc14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-08T14:57:07Z","title_canon_sha256":"e1bf9b9622fad7e18788f686d5d699168687c17e9ecad7015fab09ea0feb35ae"},"schema_version":"1.0","source":{"id":"2501.04550","kind":"arxiv","version":1}},"canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99b9f88b4cdccf67647b0b9f755045d2dc65dbd1cac39bca2c61eebbf9ead4d8","first_computed_at":"2026-07-05T09:58:37.163167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:37.163167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w/i3AS+xeza6/Z0aCYgDRJCkuOZFlCCzVkEICPrAzZMT1vDoPFlHDV1c2uOZNr+Dk2gcGVj26QEqc4KOakSODQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:37.163638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3139c11f6459ff9dc15ea5908327e4ba98278d80cdf25a85b504f627b50be4b6","sha256:93c6f4bdb9b1db8d5184b861e6d6e7968039d2cd76843aa7dd47d6ab2761a4e6"],"state_sha256":"9825d629f0ac8d9c92c54c0858ed700b3310a4bfef55b8d0d86a1588e52fd559"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeSN6Q6chdHth2zjUdqTNgDzJhgsjhuAfnUeUdA38ybY2egkYM6SgqNFDKXqjpoIyz0jH6NVQmVYuH4eoeMWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T07:09:32.029886Z","bundle_sha256":"0a0d3b27e5ec1f7d6e3504658d2f76945e207aa1e0a3d0fc8e61aa087440cf34"}}