{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LV6MSOWSBUZSLEBX4O4APVHTWE","short_pith_number":"pith:LV6MSOWS","schema_version":"1.0","canonical_sha256":"5d7cc93ad20d33259037e3b807d4f3b100ae358ffc7ad3b5926f1784a33c2199","source":{"kind":"arxiv","id":"1407.3247","version":1},"attestation_state":"computed","paper":{"title":"Computational Aspects of Multi-Winner Approval Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Joachim Gudmundsson, Nicholas Mattei, Serge Gaspers, Simon Mackenzie, Toby Walsh","submitted_at":"2014-07-11T18:40:22Z","abstract_excerpt":"We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for dichotomous preferences, we study various strategic aspects of the rules. In particular, we examine the computational complexity of computing a best response for both a single agent and a group of agents."},"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":"1407.3247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T18:40:22Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"5ea6d199ba4cb702713bac86d739e7733636f5f00681338b8d85d8870ed7b94c","abstract_canon_sha256":"51611c04a67f76965ddc69300a4ce468bcf73f75da1a6b12b63f9ad934e43086"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:51.606007Z","signature_b64":"5Ce/0iQe3BwnObluhJ2IOFsN2lsvT1oxlKAB5SsWM0/iyCoQQ1Jietz2lB7trmGasrDal3ZDo+R1ky9SsgPZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d7cc93ad20d33259037e3b807d4f3b100ae358ffc7ad3b5926f1784a33c2199","last_reissued_at":"2026-05-18T02:47:51.605115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:51.605115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Aspects of Multi-Winner Approval Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Joachim Gudmundsson, Nicholas Mattei, Serge Gaspers, Simon Mackenzie, Toby Walsh","submitted_at":"2014-07-11T18:40:22Z","abstract_excerpt":"We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for dichotomous preferences, we study various strategic aspects of the rules. In particular, we examine the computational complexity of computing a best response for both a single agent and a group of agents."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3247","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":"1407.3247","created_at":"2026-05-18T02:47:51.605208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3247v1","created_at":"2026-05-18T02:47:51.605208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3247","created_at":"2026-05-18T02:47:51.605208+00:00"},{"alias_kind":"pith_short_12","alias_value":"LV6MSOWSBUZS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LV6MSOWSBUZSLEBX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LV6MSOWS","created_at":"2026-05-18T12:28:38.356838+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/LV6MSOWSBUZSLEBX4O4APVHTWE","json":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE.json","graph_json":"https://pith.science/api/pith-number/LV6MSOWSBUZSLEBX4O4APVHTWE/graph.json","events_json":"https://pith.science/api/pith-number/LV6MSOWSBUZSLEBX4O4APVHTWE/events.json","paper":"https://pith.science/paper/LV6MSOWS"},"agent_actions":{"view_html":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE","download_json":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE.json","view_paper":"https://pith.science/paper/LV6MSOWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3247&json=true","fetch_graph":"https://pith.science/api/pith-number/LV6MSOWSBUZSLEBX4O4APVHTWE/graph.json","fetch_events":"https://pith.science/api/pith-number/LV6MSOWSBUZSLEBX4O4APVHTWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE/action/storage_attestation","attest_author":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE/action/author_attestation","sign_citation":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE/action/citation_signature","submit_replication":"https://pith.science/pith/LV6MSOWSBUZSLEBX4O4APVHTWE/action/replication_record"}},"created_at":"2026-05-18T02:47:51.605208+00:00","updated_at":"2026-05-18T02:47:51.605208+00:00"}