{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZC6FBYLVVMQLAUV347BUD5VTUN","short_pith_number":"pith:ZC6FBYLV","schema_version":"1.0","canonical_sha256":"c8bc50e175ab20b052bbe7c341f6b3a355188b612406f4f8ffd43f39494d03d3","source":{"kind":"arxiv","id":"1407.7216","version":2},"attestation_state":"computed","paper":{"title":"PTAS for Minimax Approval Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Jaroslaw Byrka, Krzysztof Sornat (Institute of Computer Science, Poland), University of Wroclaw","submitted_at":"2014-07-27T13:02:08Z","abstract_excerpt":"We consider Approval Voting systems where each voter decides on a subset to candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k minimizing the maximal Hamming distance from a vote. In this paper we give a PTAS for this problem and hence resolve the open question raised by Carragianis et al. [AAAI'10]. The result is obtained by adapting the techniques developed by Li et al. [JACM'02] originally used for the less constrained Closest String problem. The technique relies on extracting information and structural properties of constant size subse"},"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.7216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-27T13:02:08Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"c849da25a0856f3cb5ee945ae1a5509a683e3227cd9de9acdc890ce47205f795","abstract_canon_sha256":"5e4c052a6d11cab5682c01e0a397fc9029e8d4c62ab7c808ad1556a4b995d3e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.949093Z","signature_b64":"e/0LGOo1hqbrikjlqQstTpS2TRDi4F/DljYqGjaLAB/o5Q9numaxvQAwxdlH/xdWyksF44OrxeK4kPzQpQuCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8bc50e175ab20b052bbe7c341f6b3a355188b612406f4f8ffd43f39494d03d3","last_reissued_at":"2026-05-18T01:12:01.948721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.948721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PTAS for Minimax Approval Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Jaroslaw Byrka, Krzysztof Sornat (Institute of Computer Science, Poland), University of Wroclaw","submitted_at":"2014-07-27T13:02:08Z","abstract_excerpt":"We consider Approval Voting systems where each voter decides on a subset to candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k minimizing the maximal Hamming distance from a vote. In this paper we give a PTAS for this problem and hence resolve the open question raised by Carragianis et al. [AAAI'10]. The result is obtained by adapting the techniques developed by Li et al. [JACM'02] originally used for the less constrained Closest String problem. The technique relies on extracting information and structural properties of constant size subse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7216","kind":"arxiv","version":2},"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.7216","created_at":"2026-05-18T01:12:01.948784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7216v2","created_at":"2026-05-18T01:12:01.948784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7216","created_at":"2026-05-18T01:12:01.948784+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZC6FBYLVVMQL","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZC6FBYLVVMQLAUV3","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZC6FBYLV","created_at":"2026-05-18T12:28:59.999130+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/ZC6FBYLVVMQLAUV347BUD5VTUN","json":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN.json","graph_json":"https://pith.science/api/pith-number/ZC6FBYLVVMQLAUV347BUD5VTUN/graph.json","events_json":"https://pith.science/api/pith-number/ZC6FBYLVVMQLAUV347BUD5VTUN/events.json","paper":"https://pith.science/paper/ZC6FBYLV"},"agent_actions":{"view_html":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN","download_json":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN.json","view_paper":"https://pith.science/paper/ZC6FBYLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7216&json=true","fetch_graph":"https://pith.science/api/pith-number/ZC6FBYLVVMQLAUV347BUD5VTUN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZC6FBYLVVMQLAUV347BUD5VTUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN/action/storage_attestation","attest_author":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN/action/author_attestation","sign_citation":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN/action/citation_signature","submit_replication":"https://pith.science/pith/ZC6FBYLVVMQLAUV347BUD5VTUN/action/replication_record"}},"created_at":"2026-05-18T01:12:01.948784+00:00","updated_at":"2026-05-18T01:12:01.948784+00:00"}