{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NZGSUUWAXMCUYKHV7PLNAZT7B3","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":"a44bf486078ba7aacbc8a52c405019312e2c4510d10826a81a4476b3c295bd3c","cross_cats_sorted":["cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-05-31T12:29:26Z","title_canon_sha256":"6768ddcd9d1ce35a3d8e5cfd210380e70213656b7ad88aeb4932f5f63966dda5"},"schema_version":"1.0","source":{"id":"1705.11060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11060","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11060v1","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11060","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"NZGSUUWAXMCU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NZGSUUWAXMCUYKHV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NZGSUUWA","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:94270d53ca3788926dcaad2b8d9d78d0349ac13c6bb88d8f9ef050ca921ccdf8","target":"graph","created_at":"2026-05-18T00:43:19Z","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 the following control problem on fair allocation of indivisible goods. Given a set $I$ of items and a set of agents, each having strict linear preference over the items, we ask for a minimum subset of the items whose deletion guarantees the existence of a proportional allocation in the remaining instance; we call this problem Proportionality by Item Deletion (PID). Our main result is a polynomial-time algorithm that solves PID for three agents. By contrast, we prove that PID is computationally intractable when the number of agents is unbounded, even if the number $k$ of item deleti","authors_text":"Britta Dorn, Ildik\\'o Schlotter, Ronald de Haan","cross_cats":["cs.CC","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-05-31T12:29:26Z","title":"Obtaining a Proportional Allocation by Deleting Items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11060","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:69c270e2b4afb5cbf8c3a0466486878b47e349f4960e6225e455246886badc6d","target":"record","created_at":"2026-05-18T00:43:19Z","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":"a44bf486078ba7aacbc8a52c405019312e2c4510d10826a81a4476b3c295bd3c","cross_cats_sorted":["cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-05-31T12:29:26Z","title_canon_sha256":"6768ddcd9d1ce35a3d8e5cfd210380e70213656b7ad88aeb4932f5f63966dda5"},"schema_version":"1.0","source":{"id":"1705.11060","kind":"arxiv","version":1}},"canonical_sha256":"6e4d2a52c0bb054c28f5fbd6d0667f0ed98a6528f12542cd21e2734d0e5fc67b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e4d2a52c0bb054c28f5fbd6d0667f0ed98a6528f12542cd21e2734d0e5fc67b","first_computed_at":"2026-05-18T00:43:19.422195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:19.422195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EbGxoO2Qlk1wvMLN1mzVqvH8pU0p9bd/tWWoZLBpb7zPm16Pagkg5IGq2AUh5yl9CbylMLNTKVtYwLv+W9fqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:19.422699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.11060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69c270e2b4afb5cbf8c3a0466486878b47e349f4960e6225e455246886badc6d","sha256:94270d53ca3788926dcaad2b8d9d78d0349ac13c6bb88d8f9ef050ca921ccdf8"],"state_sha256":"706d74dc422f13ff108ef2c87a255d5ddac56955fd94ea155375b27678a7a7ad"}