{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T4DTIVTBGSD3NPAC55MB2GEUYF","short_pith_number":"pith:T4DTIVTB","schema_version":"1.0","canonical_sha256":"9f073456613487b6bc02ef581d1894c17beb84b9ea1535654ea1b69b6986da72","source":{"kind":"arxiv","id":"1708.04862","version":1},"attestation_state":"computed","paper":{"title":"New Approximations for Coalitional Manipulation in General Scoring Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avinatan Hassidim, Noam Hazon, Orgad Keller","submitted_at":"2017-08-16T12:47:19Z","abstract_excerpt":"We study the problem of coalitional manipulation---where $k$ manipulators try to manipulate an election on $m$ candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted settings. We focus on minimizing the maximum score obtainable by a non-preferred candidate.\n  In the strongest, most general setting, we provide an algorithm for any scoring rule as described by a vector $\\vec{\\alpha}=(\\alpha_1,\\ldots,\\alpha_m)$: for some $\\beta=O(\\sqrt{m\\log m})$, it obtains an additive approximation equal to $W\\cdot \\max_i \\lvert \\alpha_{i+\\beta"},"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":"1708.04862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T12:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"d6311e9609860396ef4489c0346fb60c7a3a0a6aacd12eb84cf99183a40c528b","abstract_canon_sha256":"7e68b4222bd0d4fb0bed529589445419b1bf28e61cdc606a4abcae15f7a59500"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:55.321799Z","signature_b64":"zrs7IdL0fZ5uNdOgBJGtx7FfL5vMg7qGfPYvzGkoqbJWvC4n/wOmR2+g54fHfgdjE6oP4ThQByPfSi7Ug/LQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f073456613487b6bc02ef581d1894c17beb84b9ea1535654ea1b69b6986da72","last_reissued_at":"2026-05-18T00:37:55.321127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:55.321127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Approximations for Coalitional Manipulation in General Scoring Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avinatan Hassidim, Noam Hazon, Orgad Keller","submitted_at":"2017-08-16T12:47:19Z","abstract_excerpt":"We study the problem of coalitional manipulation---where $k$ manipulators try to manipulate an election on $m$ candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted settings. We focus on minimizing the maximum score obtainable by a non-preferred candidate.\n  In the strongest, most general setting, we provide an algorithm for any scoring rule as described by a vector $\\vec{\\alpha}=(\\alpha_1,\\ldots,\\alpha_m)$: for some $\\beta=O(\\sqrt{m\\log m})$, it obtains an additive approximation equal to $W\\cdot \\max_i \\lvert \\alpha_{i+\\beta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04862","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":"1708.04862","created_at":"2026-05-18T00:37:55.321224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04862v1","created_at":"2026-05-18T00:37:55.321224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04862","created_at":"2026-05-18T00:37:55.321224+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4DTIVTBGSD3","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4DTIVTBGSD3NPAC","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4DTIVTB","created_at":"2026-05-18T12:31:43.269735+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/T4DTIVTBGSD3NPAC55MB2GEUYF","json":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF.json","graph_json":"https://pith.science/api/pith-number/T4DTIVTBGSD3NPAC55MB2GEUYF/graph.json","events_json":"https://pith.science/api/pith-number/T4DTIVTBGSD3NPAC55MB2GEUYF/events.json","paper":"https://pith.science/paper/T4DTIVTB"},"agent_actions":{"view_html":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF","download_json":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF.json","view_paper":"https://pith.science/paper/T4DTIVTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04862&json=true","fetch_graph":"https://pith.science/api/pith-number/T4DTIVTBGSD3NPAC55MB2GEUYF/graph.json","fetch_events":"https://pith.science/api/pith-number/T4DTIVTBGSD3NPAC55MB2GEUYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/action/storage_attestation","attest_author":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/action/author_attestation","sign_citation":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/action/citation_signature","submit_replication":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/action/replication_record"}},"created_at":"2026-05-18T00:37:55.321224+00:00","updated_at":"2026-05-18T00:37:55.321224+00:00"}