{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SGOQ7YHDZDWLXHCBNGN5QY7CHT","short_pith_number":"pith:SGOQ7YHD","canonical_record":{"source":{"id":"2302.04581","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-02-09T11:42:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0467ac162f280f809d7e1a852dda81bb5679c2bcc7845616549ad931d7a712af","abstract_canon_sha256":"08ecc7c54e3b0f5fabf43d6341a2b99e84c04f3c75519c51524b9641d6a4e57b"},"schema_version":"1.0"},"canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","source":{"kind":"arxiv","id":"2302.04581","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04581","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04581v4","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04581","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"SGOQ7YHDZDWL","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"SGOQ7YHDZDWLXHCB","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"SGOQ7YHD","created_at":"2026-07-05T09:02:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SGOQ7YHDZDWLXHCBNGN5QY7CHT","target":"record","payload":{"canonical_record":{"source":{"id":"2302.04581","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-02-09T11:42:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0467ac162f280f809d7e1a852dda81bb5679c2bcc7845616549ad931d7a712af","abstract_canon_sha256":"08ecc7c54e3b0f5fabf43d6341a2b99e84c04f3c75519c51524b9641d6a4e57b"},"schema_version":"1.0"},"canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:10.887762Z","signature_b64":"d/AhMBnVSysXhFUUtYLicFlBS18hr2R/8iH3I81svAFYls5O4HeSU3P+5hjF/Fv1zaSeYqAWLyq6xNGvv72uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","last_reissued_at":"2026-07-05T09:02:10.887247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:10.887247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.04581","source_version":4,"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:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCrd7IMMYkjDjQzc3WTffom/qlcUpj8obpfm+DQPxBg5nxdlXe53ZixoRuNXdJsOChRQJdBCPVnGNH+oOYp5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:45:48.521491Z"},"content_sha256":"55248bba40e481805976096548200c41c0b240808cdc0104ced8cfa0f15437d6","schema_version":"1.0","event_id":"sha256:55248bba40e481805976096548200c41c0b240808cdc0104ced8cfa0f15437d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SGOQ7YHDZDWLXHCBNGN5QY7CHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reduction from Chores Allocation to Job Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Erel Segal-Halevi, Xin Huang","submitted_at":"2023-02-09T11:42:41Z","abstract_excerpt":"We consider allocating indivisible chores among agents with different cost functions, such that all agents receive a cost of at most a constant factor times their maximin share. The state-of-the-art was presented in In EC 2021 by Huang and Lu. They presented a non-polynomial-time algorithm, called HFFD, that attains an 11/9 approximation, and a polynomial-time algorithm that attains a 5/4 approximation.\n  In this paper, we show that HFFD can be reduced to an algorithm called MultiFit, developed by Coffman, Garey and Johnson in 1978 for makespan minimization in job scheduling. Using this reduct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04581","kind":"arxiv","version":4},"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/2302.04581/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:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ej4/yfFmUKAbGBVrWqXprjYyUk0OVD/32eXFb2wRJfoIFJpmkFjYAKIiLf+LYblc3A3aTMy+AokqxCygjILKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:45:48.522031Z"},"content_sha256":"ba3ebd6fc494f2fcdc31c86f3c3002ebe75cf7f0933f2c20d577f4343473ef08","schema_version":"1.0","event_id":"sha256:ba3ebd6fc494f2fcdc31c86f3c3002ebe75cf7f0933f2c20d577f4343473ef08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/bundle.json","state_url":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/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-12T22:45:48Z","links":{"resolver":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT","bundle":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/bundle.json","state":"https://pith.science/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGOQ7YHDZDWLXHCBNGN5QY7CHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SGOQ7YHDZDWLXHCBNGN5QY7CHT","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":"08ecc7c54e3b0f5fabf43d6341a2b99e84c04f3c75519c51524b9641d6a4e57b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-02-09T11:42:41Z","title_canon_sha256":"0467ac162f280f809d7e1a852dda81bb5679c2bcc7845616549ad931d7a712af"},"schema_version":"1.0","source":{"id":"2302.04581","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04581","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04581v4","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04581","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"SGOQ7YHDZDWL","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"SGOQ7YHDZDWLXHCB","created_at":"2026-07-05T09:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"SGOQ7YHD","created_at":"2026-07-05T09:02:10Z"}],"graph_snapshots":[{"event_id":"sha256:ba3ebd6fc494f2fcdc31c86f3c3002ebe75cf7f0933f2c20d577f4343473ef08","target":"graph","created_at":"2026-07-05T09:02:10Z","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/2302.04581/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider allocating indivisible chores among agents with different cost functions, such that all agents receive a cost of at most a constant factor times their maximin share. The state-of-the-art was presented in In EC 2021 by Huang and Lu. They presented a non-polynomial-time algorithm, called HFFD, that attains an 11/9 approximation, and a polynomial-time algorithm that attains a 5/4 approximation.\n  In this paper, we show that HFFD can be reduced to an algorithm called MultiFit, developed by Coffman, Garey and Johnson in 1978 for makespan minimization in job scheduling. Using this reduct","authors_text":"Erel Segal-Halevi, Xin Huang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-02-09T11:42:41Z","title":"A Reduction from Chores Allocation to Job Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04581","kind":"arxiv","version":4},"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:55248bba40e481805976096548200c41c0b240808cdc0104ced8cfa0f15437d6","target":"record","created_at":"2026-07-05T09:02:10Z","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":"08ecc7c54e3b0f5fabf43d6341a2b99e84c04f3c75519c51524b9641d6a4e57b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-02-09T11:42:41Z","title_canon_sha256":"0467ac162f280f809d7e1a852dda81bb5679c2bcc7845616549ad931d7a712af"},"schema_version":"1.0","source":{"id":"2302.04581","kind":"arxiv","version":4}},"canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"919d0fe0e3c8ecbb9c41699bd863e23cee2a0d47cc5a4ca983c508799dd4d301","first_computed_at":"2026-07-05T09:02:10.887247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:02:10.887247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d/AhMBnVSysXhFUUtYLicFlBS18hr2R/8iH3I81svAFYls5O4HeSU3P+5hjF/Fv1zaSeYqAWLyq6xNGvv72uBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:02:10.887762Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.04581","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55248bba40e481805976096548200c41c0b240808cdc0104ced8cfa0f15437d6","sha256:ba3ebd6fc494f2fcdc31c86f3c3002ebe75cf7f0933f2c20d577f4343473ef08"],"state_sha256":"8e3202c1f09c1ff8df9b02b95ef9a4f1dbbaf4c888200b25a74b71292a8e4eb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us8fZr0J59lDg739hIXX1sb3U+rQFICzZmwbPIA9mZu20jDOb7MCVOCvvwrZG8IDl9mZyXIujgxK/GIrbmlrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:45:48.529554Z","bundle_sha256":"8963914043ca59bb29a0c4af045b3ed1eef621ee8e10ed242b366d7a176b8eb0"}}