{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VV7KTGSNUBS427RPJZXK34JLQS","short_pith_number":"pith:VV7KTGSN","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"},"canonical_sha256":"ad7ea99a4da065cd7e2f4e6eadf12b84a86b2b2848b5d052d5ed894b6c1b794f","source":{"kind":"arxiv","id":"1607.07906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07906","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07906v1","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07906","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"VV7KTGSNUBS4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VV7KTGSNUBS427RP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VV7KTGSN","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VV7KTGSNUBS427RPJZXK34JLQS","target":"record","payload":{"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"},"canonical_sha256":"ad7ea99a4da065cd7e2f4e6eadf12b84a86b2b2848b5d052d5ed894b6c1b794f","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"},"source_kind":"arxiv","source_id":"1607.07906","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yu1anvq5TnH+vC9Xn9mZeUOAUkqajGzHzGziHqdydBxnLU2NnhklqepKEE9E6NijC0GJbe5Z3iWamPf5A4iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:03:56.227208Z"},"content_sha256":"8b7fc2d822c064ed1eed9a50751c0c154305d309092e78041898591043ec65ca","schema_version":"1.0","event_id":"sha256:8b7fc2d822c064ed1eed9a50751c0c154305d309092e78041898591043ec65ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VV7KTGSNUBS427RPJZXK34JLQS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE5bw2oxitDO/U+np89NjwidgdjPWy/L6th6RPjX+i4q34X5YD3yrdMxDcsxzlvy2gKB9Cdmw+8r8BbIFXXODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:03:56.227707Z"},"content_sha256":"636c8832f33ba7d7b2085c6d80f873fca4808297229e107b6fe39a1c627ef4e1","schema_version":"1.0","event_id":"sha256:636c8832f33ba7d7b2085c6d80f873fca4808297229e107b6fe39a1c627ef4e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/bundle.json","state_url":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VV7KTGSNUBS427RPJZXK34JLQS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T08:03:56Z","links":{"resolver":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS","bundle":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/bundle.json","state":"https://pith.science/pith/VV7KTGSNUBS427RPJZXK34JLQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VV7KTGSNUBS427RPJZXK34JLQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VV7KTGSNUBS427RPJZXK34JLQS","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":"33d959e4018d60b478ea174736fa08029ab77c008f3a8915eb00879124418b40","cross_cats_sorted":["cs.AI","cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T22:06:51Z","title_canon_sha256":"613e98d0e85c3426dc490f58bb92b274e139f89a668f27ef610747f0823632d3"},"schema_version":"1.0","source":{"id":"1607.07906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07906","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07906v1","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07906","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"VV7KTGSNUBS4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VV7KTGSNUBS427RP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VV7KTGSN","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:636c8832f33ba7d7b2085c6d80f873fca4808297229e107b6fe39a1c627ef4e1","target":"graph","created_at":"2026-05-18T01:10:22Z","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 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 ","authors_text":"Arkadiusz Soca{\\l}a, Krzysztof Sornat, {\\L}ukasz Kowalik, Marek Cygan","cross_cats":["cs.AI","cs.GT","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T22:06:51Z","title":"Approximation and Parameterized Complexity of Minimax Approval Voting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07906","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:8b7fc2d822c064ed1eed9a50751c0c154305d309092e78041898591043ec65ca","target":"record","created_at":"2026-05-18T01:10:22Z","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":"33d959e4018d60b478ea174736fa08029ab77c008f3a8915eb00879124418b40","cross_cats_sorted":["cs.AI","cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T22:06:51Z","title_canon_sha256":"613e98d0e85c3426dc490f58bb92b274e139f89a668f27ef610747f0823632d3"},"schema_version":"1.0","source":{"id":"1607.07906","kind":"arxiv","version":1}},"canonical_sha256":"ad7ea99a4da065cd7e2f4e6eadf12b84a86b2b2848b5d052d5ed894b6c1b794f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad7ea99a4da065cd7e2f4e6eadf12b84a86b2b2848b5d052d5ed894b6c1b794f","first_computed_at":"2026-05-18T01:10:22.961723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:22.961723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RK0acjupaO1fAyfWhv64sD7tLJYs6AOG+1zlHN7fMxJU3JSUk6auVx1v4s1C1xynCWAUzO0/oPE1yZaJ9WyMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:22.962278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b7fc2d822c064ed1eed9a50751c0c154305d309092e78041898591043ec65ca","sha256:636c8832f33ba7d7b2085c6d80f873fca4808297229e107b6fe39a1c627ef4e1"],"state_sha256":"cd69b7ed65c567927a0c9312bdd39ef5968cbb7c8a35384a6d56fb91f55cb545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aroTFUgtJ4eA78NL7Hb3luHfY0rKk2q/ZoJ3jzV/VDOZllb/VfOt4eUqD7Deo7JKWf6Pf/lXplYp+/YvwisOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:03:56.230645Z","bundle_sha256":"034ddca055b19cf2d7c15fbdeb997b7483683da4f13c2584517fe26062b1f6cc"}}