{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GIHAWSJW7U2ITYJZVXFSL4V3DP","short_pith_number":"pith:GIHAWSJW","schema_version":"1.0","canonical_sha256":"320e0b4936fd3489e139adcb25f2bb1bc36047ee602bbd4a57cbe848725bde6b","source":{"kind":"arxiv","id":"1411.7812","version":2},"attestation_state":"computed","paper":{"title":"Elections with Few Voters: Candidate Control Can Be Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.AI","authors_text":"Jiehua Chen, Nimrod Talmon, Piotr Faliszewski, Rolf Niedermeier","submitted_at":"2014-11-28T11:09:04Z","abstract_excerpt":"We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with respect to the number of voters as a parameter. We consider both the standard scenario of adding and deleting candidates, where one asks whether a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding or deleting few candidates, as well as a combinatorial scenario where adding/deleting a candidate automatically means adding or deleting a whole group of candidates. Co"},"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":"1411.7812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-28T11:09:04Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"0787f2a95abd03b7f31d79ca42d0b289687332671af553e22ae4e4b3c0be53df","abstract_canon_sha256":"01a9b335d2b9d7bfd5567dfba7988b56eef2deda590931f452094ff759a76619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:28.812856Z","signature_b64":"U6asT+1XTMIyyfMM7GppdPK+VNz7h2lY2/QJMDoDuEqRoT2Iec7Ya9aCsuYHhkQupFTHVk2O6nWUuGxt6T1xCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320e0b4936fd3489e139adcb25f2bb1bc36047ee602bbd4a57cbe848725bde6b","last_reissued_at":"2026-05-18T00:48:28.812387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:28.812387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elections with Few Voters: Candidate Control Can Be Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.AI","authors_text":"Jiehua Chen, Nimrod Talmon, Piotr Faliszewski, Rolf Niedermeier","submitted_at":"2014-11-28T11:09:04Z","abstract_excerpt":"We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with respect to the number of voters as a parameter. We consider both the standard scenario of adding and deleting candidates, where one asks whether a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding or deleting few candidates, as well as a combinatorial scenario where adding/deleting a candidate automatically means adding or deleting a whole group of candidates. Co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7812","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":"1411.7812","created_at":"2026-05-18T00:48:28.812468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7812v2","created_at":"2026-05-18T00:48:28.812468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7812","created_at":"2026-05-18T00:48:28.812468+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIHAWSJW7U2I","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIHAWSJW7U2ITYJZ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIHAWSJW","created_at":"2026-05-18T12:28:30.664211+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/GIHAWSJW7U2ITYJZVXFSL4V3DP","json":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP.json","graph_json":"https://pith.science/api/pith-number/GIHAWSJW7U2ITYJZVXFSL4V3DP/graph.json","events_json":"https://pith.science/api/pith-number/GIHAWSJW7U2ITYJZVXFSL4V3DP/events.json","paper":"https://pith.science/paper/GIHAWSJW"},"agent_actions":{"view_html":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP","download_json":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP.json","view_paper":"https://pith.science/paper/GIHAWSJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7812&json=true","fetch_graph":"https://pith.science/api/pith-number/GIHAWSJW7U2ITYJZVXFSL4V3DP/graph.json","fetch_events":"https://pith.science/api/pith-number/GIHAWSJW7U2ITYJZVXFSL4V3DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP/action/storage_attestation","attest_author":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP/action/author_attestation","sign_citation":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP/action/citation_signature","submit_replication":"https://pith.science/pith/GIHAWSJW7U2ITYJZVXFSL4V3DP/action/replication_record"}},"created_at":"2026-05-18T00:48:28.812468+00:00","updated_at":"2026-05-18T00:48:28.812468+00:00"}