{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EBXHFHDIKUIMQXHCOKICM3WQBM","short_pith_number":"pith:EBXHFHDI","canonical_record":{"source":{"id":"2012.06788","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-12-12T11:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"8c46a36831f24fd0a48d87c2579b8302608300e8ad5d15ed8e9beff18b8ee101","abstract_canon_sha256":"d7990c13fa73f63696ca72e83d6a711f2ab9fb27c1698ea389df3b6bb2c4a6ee"},"schema_version":"1.0"},"canonical_sha256":"206e729c685510c85ce27290266ed00b33b9a97f52218c9ed1d3f34c4ef0e422","source":{"kind":"arxiv","id":"2012.06788","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06788","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06788v3","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06788","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"EBXHFHDIKUIM","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"pith_short_16","alias_value":"EBXHFHDIKUIMQXHC","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"pith_short_8","alias_value":"EBXHFHDI","created_at":"2026-07-05T04:51:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EBXHFHDIKUIMQXHCOKICM3WQBM","target":"record","payload":{"canonical_record":{"source":{"id":"2012.06788","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-12-12T11:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"8c46a36831f24fd0a48d87c2579b8302608300e8ad5d15ed8e9beff18b8ee101","abstract_canon_sha256":"d7990c13fa73f63696ca72e83d6a711f2ab9fb27c1698ea389df3b6bb2c4a6ee"},"schema_version":"1.0"},"canonical_sha256":"206e729c685510c85ce27290266ed00b33b9a97f52218c9ed1d3f34c4ef0e422","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:51.843049Z","signature_b64":"HceCkeH4Zu0DYOdcQw8xpLioxnUUwLDnfqFZZ7FMVmXvBl8WtOB8qqWHHrIJOWRY0G0m1RQJFjSfBj7Kjb95Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"206e729c685510c85ce27290266ed00b33b9a97f52218c9ed1d3f34c4ef0e422","last_reissued_at":"2026-07-05T04:51:51.842651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:51.842651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.06788","source_version":3,"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-05T04:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPZrt943GTLeAO2K4zxriq3GU4fNV9Z1XmTT0arNAfLs+uYYq0Kd893WOUiu0fZaf9OCQvQNhpr+f2UckuzXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:01:19.899317Z"},"content_sha256":"7c55dc43170f0a297a0407afce4d1b19ea792cb94ec0b6a0776350859f4f0748","schema_version":"1.0","event_id":"sha256:7c55dc43170f0a297a0407afce4d1b19ea792cb94ec0b6a0776350859f4f0748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EBXHFHDIKUIMQXHCOKICM3WQBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"A. R. Sricharan, Rohit Vaish, Umang Bhaskar","submitted_at":"2020-12-12T11:19:00Z","abstract_excerpt":"We study the fair allocation of undesirable indivisible items, or chores. While the case of desirable indivisible items (or goods) is extensively studied, with many results known for different notions of fairness, less is known about the fair division of chores. We study the envy-free division of chores, and make three contributions. First, we show that determining the existence of an envy-free allocation is NP-complete, even in the simple case when agents have binary additive valuations. Second, we provide a polynomial-time algorithm for computing an allocation that satisfies envy-freeness up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06788","kind":"arxiv","version":3},"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/2012.06788/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-05T04:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2b6YFoOPDFLO+YK3uhjXJhsnZPYILkduFD4/RaB7FTlbdSoZAsI+nl5RCzVgQ39nKXYruu+nO/GyokQc4bYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:01:19.899692Z"},"content_sha256":"abe662e16e15df7a9fb034d6c60dfa48ec96e394d792dc7813aa4f1e063e4fe0","schema_version":"1.0","event_id":"sha256:abe662e16e15df7a9fb034d6c60dfa48ec96e394d792dc7813aa4f1e063e4fe0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBXHFHDIKUIMQXHCOKICM3WQBM/bundle.json","state_url":"https://pith.science/pith/EBXHFHDIKUIMQXHCOKICM3WQBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBXHFHDIKUIMQXHCOKICM3WQBM/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-20T17:01:19Z","links":{"resolver":"https://pith.science/pith/EBXHFHDIKUIMQXHCOKICM3WQBM","bundle":"https://pith.science/pith/EBXHFHDIKUIMQXHCOKICM3WQBM/bundle.json","state":"https://pith.science/pith/EBXHFHDIKUIMQXHCOKICM3WQBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBXHFHDIKUIMQXHCOKICM3WQBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EBXHFHDIKUIMQXHCOKICM3WQBM","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":"d7990c13fa73f63696ca72e83d6a711f2ab9fb27c1698ea389df3b6bb2c4a6ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-12-12T11:19:00Z","title_canon_sha256":"8c46a36831f24fd0a48d87c2579b8302608300e8ad5d15ed8e9beff18b8ee101"},"schema_version":"1.0","source":{"id":"2012.06788","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06788","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06788v3","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06788","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"EBXHFHDIKUIM","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"pith_short_16","alias_value":"EBXHFHDIKUIMQXHC","created_at":"2026-07-05T04:51:51Z"},{"alias_kind":"pith_short_8","alias_value":"EBXHFHDI","created_at":"2026-07-05T04:51:51Z"}],"graph_snapshots":[{"event_id":"sha256:abe662e16e15df7a9fb034d6c60dfa48ec96e394d792dc7813aa4f1e063e4fe0","target":"graph","created_at":"2026-07-05T04:51:51Z","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/2012.06788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the fair allocation of undesirable indivisible items, or chores. While the case of desirable indivisible items (or goods) is extensively studied, with many results known for different notions of fairness, less is known about the fair division of chores. We study the envy-free division of chores, and make three contributions. First, we show that determining the existence of an envy-free allocation is NP-complete, even in the simple case when agents have binary additive valuations. Second, we provide a polynomial-time algorithm for computing an allocation that satisfies envy-freeness up","authors_text":"A. R. Sricharan, Rohit Vaish, Umang Bhaskar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-12-12T11:19:00Z","title":"On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06788","kind":"arxiv","version":3},"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:7c55dc43170f0a297a0407afce4d1b19ea792cb94ec0b6a0776350859f4f0748","target":"record","created_at":"2026-07-05T04:51:51Z","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":"d7990c13fa73f63696ca72e83d6a711f2ab9fb27c1698ea389df3b6bb2c4a6ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2020-12-12T11:19:00Z","title_canon_sha256":"8c46a36831f24fd0a48d87c2579b8302608300e8ad5d15ed8e9beff18b8ee101"},"schema_version":"1.0","source":{"id":"2012.06788","kind":"arxiv","version":3}},"canonical_sha256":"206e729c685510c85ce27290266ed00b33b9a97f52218c9ed1d3f34c4ef0e422","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"206e729c685510c85ce27290266ed00b33b9a97f52218c9ed1d3f34c4ef0e422","first_computed_at":"2026-07-05T04:51:51.842651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:51:51.842651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HceCkeH4Zu0DYOdcQw8xpLioxnUUwLDnfqFZZ7FMVmXvBl8WtOB8qqWHHrIJOWRY0G0m1RQJFjSfBj7Kjb95Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:51:51.843049Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.06788","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c55dc43170f0a297a0407afce4d1b19ea792cb94ec0b6a0776350859f4f0748","sha256:abe662e16e15df7a9fb034d6c60dfa48ec96e394d792dc7813aa4f1e063e4fe0"],"state_sha256":"b7aa3b3d432acf6a52786b45d64f1f033d658d30a8b523c6ced79900b2ad6232"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxPkcvYySwR5TAeifHFIjRi9toDOcZJcR6k4XxS/bfrrLCll9ggqYQ3lmaIUnEQe23sdwJWUvTHX36UcMtW3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T17:01:19.902084Z","bundle_sha256":"d330b4473084f6a79ea92334fce2b399ce11b394d7e101ab58936c072ff0b4a3"}}