{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FFDXTHX4S4KREOPIVO4ZHKUDFW","short_pith_number":"pith:FFDXTHX4","schema_version":"1.0","canonical_sha256":"2947799efc97151239e8abb993aa832da0a0c823bf6aa3899156ffc4b59571cb","source":{"kind":"arxiv","id":"1304.4471","version":4},"attestation_state":"computed","paper":{"title":"The Control Complexity of $r$-Approval: from the Single-Peaked Case to the General Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jiong Guo, Yongjie Yang","submitted_at":"2013-04-16T14:41:44Z","abstract_excerpt":"We investigate the complexity of $r$-Approval control problems in $k$-peaked elections, where at most $k$ peaks are allowed in each vote with respect to an order of the candidates. We show that most NP-hardness results in general elections also hold in k-peaked elections even for $k=2,3$. On the other hand, we derive polynomial-time algorithms for some problems for $k=2$. All our NP-hardness results apply to Approval and sincere-strategy preference-based Approval as well. Our study leads to many dichotomy results for the problems considered in this paper, with respect to the values of $k$ and "},"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":"1304.4471","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-04-16T14:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"e9207a8bef88211c38a187894cc4a5edd876c61748b46095cd0e77ef88c3365e","abstract_canon_sha256":"97813e8cd9de5854351cacf35b2095b48d615e95100a61b6dca349d279b67931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.996154Z","signature_b64":"BzKZMrRzzwYreW7ZX4KgFNDEOZPAE1p3ffWbOtLwy0nEMQQ3+TXRVlXHwRXSPpFaikIkTGWRcYv5ZSuzD52gCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2947799efc97151239e8abb993aa832da0a0c823bf6aa3899156ffc4b59571cb","last_reissued_at":"2026-05-18T00:42:39.995496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.995496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Control Complexity of $r$-Approval: from the Single-Peaked Case to the General Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jiong Guo, Yongjie Yang","submitted_at":"2013-04-16T14:41:44Z","abstract_excerpt":"We investigate the complexity of $r$-Approval control problems in $k$-peaked elections, where at most $k$ peaks are allowed in each vote with respect to an order of the candidates. We show that most NP-hardness results in general elections also hold in k-peaked elections even for $k=2,3$. On the other hand, we derive polynomial-time algorithms for some problems for $k=2$. All our NP-hardness results apply to Approval and sincere-strategy preference-based Approval as well. Our study leads to many dichotomy results for the problems considered in this paper, with respect to the values of $k$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4471","kind":"arxiv","version":4},"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":"1304.4471","created_at":"2026-05-18T00:42:39.995595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4471v4","created_at":"2026-05-18T00:42:39.995595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4471","created_at":"2026-05-18T00:42:39.995595+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFDXTHX4S4KR","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFDXTHX4S4KREOPI","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFDXTHX4","created_at":"2026-05-18T12:27:45.050594+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/FFDXTHX4S4KREOPIVO4ZHKUDFW","json":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW.json","graph_json":"https://pith.science/api/pith-number/FFDXTHX4S4KREOPIVO4ZHKUDFW/graph.json","events_json":"https://pith.science/api/pith-number/FFDXTHX4S4KREOPIVO4ZHKUDFW/events.json","paper":"https://pith.science/paper/FFDXTHX4"},"agent_actions":{"view_html":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW","download_json":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW.json","view_paper":"https://pith.science/paper/FFDXTHX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4471&json=true","fetch_graph":"https://pith.science/api/pith-number/FFDXTHX4S4KREOPIVO4ZHKUDFW/graph.json","fetch_events":"https://pith.science/api/pith-number/FFDXTHX4S4KREOPIVO4ZHKUDFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW/action/storage_attestation","attest_author":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW/action/author_attestation","sign_citation":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW/action/citation_signature","submit_replication":"https://pith.science/pith/FFDXTHX4S4KREOPIVO4ZHKUDFW/action/replication_record"}},"created_at":"2026-05-18T00:42:39.995595+00:00","updated_at":"2026-05-18T00:42:39.995595+00:00"}