{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ID6RQHU3XGZUVOKAIHTUJZPDE4","short_pith_number":"pith:ID6RQHU3","canonical_record":{"source":{"id":"1604.01435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-05T21:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"b55991001ec5bdffdfa9dfa3ade22a93d67bc6823afb7ddbe44fc7d4fef8388d","abstract_canon_sha256":"fd99288c2031e66d5f7e3f0c826486738b7a2ae52e233474e10448afc26a2ae9"},"schema_version":"1.0"},"canonical_sha256":"40fd181e9bb9b34ab94041e744e5e3270163ba86ef71566bbd98f6caae63f65a","source":{"kind":"arxiv","id":"1604.01435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01435","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01435v1","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01435","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"ID6RQHU3XGZU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ID6RQHU3XGZUVOKA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ID6RQHU3","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ID6RQHU3XGZUVOKAIHTUJZPDE4","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-05T21:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"b55991001ec5bdffdfa9dfa3ade22a93d67bc6823afb7ddbe44fc7d4fef8388d","abstract_canon_sha256":"fd99288c2031e66d5f7e3f0c826486738b7a2ae52e233474e10448afc26a2ae9"},"schema_version":"1.0"},"canonical_sha256":"40fd181e9bb9b34ab94041e744e5e3270163ba86ef71566bbd98f6caae63f65a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:36.394808Z","signature_b64":"+FKRyIkJOumZwgKu1QFyDzI4dLMWspxDKRFT3aJdmLKgKQqVY963SwVdUvYthZuRf3u810eyIR/vvkGHdtNSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40fd181e9bb9b34ab94041e744e5e3270163ba86ef71566bbd98f6caae63f65a","last_reissued_at":"2026-05-18T01:17:36.394090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:36.394090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01435","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-05-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMNWgJuKh3dY8HWtFNrANozW3iazuPNtbrqhK0Nzjv3pk7be6sVJXah3YINlK6bFaG10s3FL/AQgf5ZMdB56CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:54:14.903305Z"},"content_sha256":"c080856ce2bd6d7b5d10430dbe36ebbe1ea4eefa16fd0607f01fa9f843e1b5b5","schema_version":"1.0","event_id":"sha256:c080856ce2bd6d7b5d10430dbe36ebbe1ea4eefa16fd0607f01fa9f843e1b5b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ID6RQHU3XGZUVOKAIHTUJZPDE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gerhard Rauchecker, Guido Schryen, Haris Aziz, Toby Walsh","submitted_at":"2016-04-05T21:43:26Z","abstract_excerpt":"We consider Max-min Share (MmS) allocations of items both in the case where items are goods (positive utility) and when they are chores (negative utility). We show that fair allocations of goods and chores have some fundamental connections but differences as well. We prove that like in the case for goods, an MmS allocation does not need to exist for chores and computing an MmS allocation - if it exists - is strongly NP-hard. In view of these non-existence and complexity results, we present a polynomial-time 2-approximation algorithm for MmS fairness for chores. We then introduce a new fairness"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01435","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":""},"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-05-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XT+VbqBtN1uV1a2r8VxMsX7ECcYbz94gHoLFzShDECo/6MIVHn1meu+TJ487oPeUOjuS5NV4j614oK4qTkw5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:54:14.903760Z"},"content_sha256":"d440bc65a098ab23d23d84f6f41380faf8f3ea7ec2885b734484908e44984c4b","schema_version":"1.0","event_id":"sha256:d440bc65a098ab23d23d84f6f41380faf8f3ea7ec2885b734484908e44984c4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4/bundle.json","state_url":"https://pith.science/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4/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-05-27T16:54:14Z","links":{"resolver":"https://pith.science/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4","bundle":"https://pith.science/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4/bundle.json","state":"https://pith.science/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ID6RQHU3XGZUVOKAIHTUJZPDE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ID6RQHU3XGZUVOKAIHTUJZPDE4","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":"fd99288c2031e66d5f7e3f0c826486738b7a2ae52e233474e10448afc26a2ae9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-05T21:43:26Z","title_canon_sha256":"b55991001ec5bdffdfa9dfa3ade22a93d67bc6823afb7ddbe44fc7d4fef8388d"},"schema_version":"1.0","source":{"id":"1604.01435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01435","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01435v1","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01435","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"ID6RQHU3XGZU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ID6RQHU3XGZUVOKA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ID6RQHU3","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:d440bc65a098ab23d23d84f6f41380faf8f3ea7ec2885b734484908e44984c4b","target":"graph","created_at":"2026-05-18T01:17:36Z","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"},"paper":{"abstract_excerpt":"We consider Max-min Share (MmS) allocations of items both in the case where items are goods (positive utility) and when they are chores (negative utility). We show that fair allocations of goods and chores have some fundamental connections but differences as well. We prove that like in the case for goods, an MmS allocation does not need to exist for chores and computing an MmS allocation - if it exists - is strongly NP-hard. In view of these non-existence and complexity results, we present a polynomial-time 2-approximation algorithm for MmS fairness for chores. We then introduce a new fairness","authors_text":"Gerhard Rauchecker, Guido Schryen, Haris Aziz, Toby Walsh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-05T21:43:26Z","title":"Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01435","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:c080856ce2bd6d7b5d10430dbe36ebbe1ea4eefa16fd0607f01fa9f843e1b5b5","target":"record","created_at":"2026-05-18T01:17:36Z","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":"fd99288c2031e66d5f7e3f0c826486738b7a2ae52e233474e10448afc26a2ae9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-05T21:43:26Z","title_canon_sha256":"b55991001ec5bdffdfa9dfa3ade22a93d67bc6823afb7ddbe44fc7d4fef8388d"},"schema_version":"1.0","source":{"id":"1604.01435","kind":"arxiv","version":1}},"canonical_sha256":"40fd181e9bb9b34ab94041e744e5e3270163ba86ef71566bbd98f6caae63f65a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40fd181e9bb9b34ab94041e744e5e3270163ba86ef71566bbd98f6caae63f65a","first_computed_at":"2026-05-18T01:17:36.394090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:36.394090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+FKRyIkJOumZwgKu1QFyDzI4dLMWspxDKRFT3aJdmLKgKQqVY963SwVdUvYthZuRf3u810eyIR/vvkGHdtNSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:36.394808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c080856ce2bd6d7b5d10430dbe36ebbe1ea4eefa16fd0607f01fa9f843e1b5b5","sha256:d440bc65a098ab23d23d84f6f41380faf8f3ea7ec2885b734484908e44984c4b"],"state_sha256":"461544008bb79be7cfbcf493f4841ff21859a1d4632e65d5b155cc79692f0533"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fmg0O3+dygm4dQjRtDrILwa5j9PiVm1AU1zRCHeB66+mYMQvkSZmNjHGsHZ0nMRd60jzlgGuyOk250SsDPTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:54:14.907268Z","bundle_sha256":"ba76db88053c0c8b92e94c74e96467ae9ff8afca0b0ee497943f697fdbe28230"}}