{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NZGSUUWAXMCUYKHV7PLNAZT7B3","short_pith_number":"pith:NZGSUUWA","schema_version":"1.0","canonical_sha256":"6e4d2a52c0bb054c28f5fbd6d0667f0ed98a6528f12542cd21e2734d0e5fc67b","source":{"kind":"arxiv","id":"1705.11060","version":1},"attestation_state":"computed","paper":{"title":"Obtaining a Proportional Allocation by Deleting Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.MA","authors_text":"Britta Dorn, Ildik\\'o Schlotter, Ronald de Haan","submitted_at":"2017-05-31T12:29:26Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.11060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-05-31T12:29:26Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"6768ddcd9d1ce35a3d8e5cfd210380e70213656b7ad88aeb4932f5f63966dda5","abstract_canon_sha256":"a44bf486078ba7aacbc8a52c405019312e2c4510d10826a81a4476b3c295bd3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:19.422699Z","signature_b64":"EbGxoO2Qlk1wvMLN1mzVqvH8pU0p9bd/tWWoZLBpb7zPm16Pagkg5IGq2AUh5yl9CbylMLNTKVtYwLv+W9fqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e4d2a52c0bb054c28f5fbd6d0667f0ed98a6528f12542cd21e2734d0e5fc67b","last_reissued_at":"2026-05-18T00:43:19.422195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:19.422195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Obtaining a Proportional Allocation by Deleting Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.MA","authors_text":"Britta Dorn, Ildik\\'o Schlotter, Ronald de Haan","submitted_at":"2017-05-31T12:29:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11060","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.11060","created_at":"2026-05-18T00:43:19.422274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.11060v1","created_at":"2026-05-18T00:43:19.422274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11060","created_at":"2026-05-18T00:43:19.422274+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZGSUUWAXMCU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZGSUUWAXMCUYKHV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZGSUUWA","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3","json":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3.json","graph_json":"https://pith.science/api/pith-number/NZGSUUWAXMCUYKHV7PLNAZT7B3/graph.json","events_json":"https://pith.science/api/pith-number/NZGSUUWAXMCUYKHV7PLNAZT7B3/events.json","paper":"https://pith.science/paper/NZGSUUWA"},"agent_actions":{"view_html":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3","download_json":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3.json","view_paper":"https://pith.science/paper/NZGSUUWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.11060&json=true","fetch_graph":"https://pith.science/api/pith-number/NZGSUUWAXMCUYKHV7PLNAZT7B3/graph.json","fetch_events":"https://pith.science/api/pith-number/NZGSUUWAXMCUYKHV7PLNAZT7B3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3/action/storage_attestation","attest_author":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3/action/author_attestation","sign_citation":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3/action/citation_signature","submit_replication":"https://pith.science/pith/NZGSUUWAXMCUYKHV7PLNAZT7B3/action/replication_record"}},"created_at":"2026-05-18T00:43:19.422274+00:00","updated_at":"2026-05-18T00:43:19.422274+00:00"}