{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VV7KTGSNUBS427RPJZXK34JLQS","short_pith_number":"pith:VV7KTGSN","schema_version":"1.0","canonical_sha256":"ad7ea99a4da065cd7e2f4e6eadf12b84a86b2b2848b5d052d5ed894b6c1b794f","source":{"kind":"arxiv","id":"1607.07906","version":1},"attestation_state":"computed","paper":{"title":"Approximation and Parameterized Complexity of Minimax Approval Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.MA"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, Krzysztof Sornat, {\\L}ukasz Kowalik, Marek Cygan","submitted_at":"2016-07-26T22:06:51Z","abstract_excerpt":"We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance $d$ from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time $\\mathcal{O}^\\star(2^{o(d\\log d)})$, unless the Exponential Time Hypothesis (ETH) fails. This means that the $\\mathcal{O}^\\star(d^{2d})$ algorithm of Misra et al. [AAMAS 2015] is essentially optimal. Motivated by this, we then show a parameterized approximation scheme, running in time $\\mathcal{O}^\\star(\\left({3}/{\\epsilon}\\right)^{2d})$, which "},"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":"1607.07906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T22:06:51Z","cross_cats_sorted":["cs.AI","cs.GT","cs.MA"],"title_canon_sha256":"613e98d0e85c3426dc490f58bb92b274e139f89a668f27ef610747f0823632d3","abstract_canon_sha256":"33d959e4018d60b478ea174736fa08029ab77c008f3a8915eb00879124418b40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:22.962278Z","signature_b64":"RK0acjupaO1fAyfWhv64sD7tLJYs6AOG+1zlHN7fMxJU3JSUk6auVx1v4s1C1xynCWAUzO0/oPE1yZaJ9WyMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7ea99a4da065cd7e2f4e6eadf12b84a86b2b2848b5d052d5ed894b6c1b794f","last_reissued_at":"2026-05-18T01:10:22.961723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:22.961723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation and Parameterized Complexity of Minimax Approval Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.MA"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, Krzysztof Sornat, {\\L}ukasz Kowalik, Marek Cygan","submitted_at":"2016-07-26T22:06:51Z","abstract_excerpt":"We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance $d$ from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time $\\mathcal{O}^\\star(2^{o(d\\log d)})$, unless the Exponential Time Hypothesis (ETH) fails. This means that the $\\mathcal{O}^\\star(d^{2d})$ algorithm of Misra et al. [AAMAS 2015] is essentially optimal. Motivated by this, we then show a parameterized approximation scheme, running in time $\\mathcal{O}^\\star(\\left({3}/{\\epsilon}\\right)^{2d})$, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07906","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":"1607.07906","created_at":"2026-05-18T01:10:22.961812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07906v1","created_at":"2026-05-18T01:10:22.961812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07906","created_at":"2026-05-18T01:10:22.961812+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV7KTGSNUBS4","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV7KTGSNUBS427RP","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV7KTGSN","created_at":"2026-05-18T12:30:48.956258+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/VV7KTGSNUBS427RPJZXK34JLQS","json":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS.json","graph_json":"https://pith.science/api/pith-number/VV7KTGSNUBS427RPJZXK34JLQS/graph.json","events_json":"https://pith.science/api/pith-number/VV7KTGSNUBS427RPJZXK34JLQS/events.json","paper":"https://pith.science/paper/VV7KTGSN"},"agent_actions":{"view_html":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS","download_json":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS.json","view_paper":"https://pith.science/paper/VV7KTGSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07906&json=true","fetch_graph":"https://pith.science/api/pith-number/VV7KTGSNUBS427RPJZXK34JLQS/graph.json","fetch_events":"https://pith.science/api/pith-number/VV7KTGSNUBS427RPJZXK34JLQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/action/storage_attestation","attest_author":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/action/author_attestation","sign_citation":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/action/citation_signature","submit_replication":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/action/replication_record"}},"created_at":"2026-05-18T01:10:22.961812+00:00","updated_at":"2026-05-18T01:10:22.961812+00:00"}