{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T4DTIVTBGSD3NPAC55MB2GEUYF","short_pith_number":"pith:T4DTIVTB","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"},"canonical_sha256":"9f073456613487b6bc02ef581d1894c17beb84b9ea1535654ea1b69b6986da72","source":{"kind":"arxiv","id":"1708.04862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04862","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04862v1","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04862","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"T4DTIVTBGSD3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4DTIVTBGSD3NPAC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4DTIVTB","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T4DTIVTBGSD3NPAC55MB2GEUYF","target":"record","payload":{"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"},"canonical_sha256":"9f073456613487b6bc02ef581d1894c17beb84b9ea1535654ea1b69b6986da72","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"},"source_kind":"arxiv","source_id":"1708.04862","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-18T00:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mf53AxAhINiMRkKba7ZzerAk0LPx9Y4ZFEQq9qHwNO6/OAZG5YTB8GTUdx+OI13HhwRcykZSmAIJgwRXhx2JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:24:47.107938Z"},"content_sha256":"20ff42e5751a357280214e23097520ddd074130a46ca38e46816703a5a28b917","schema_version":"1.0","event_id":"sha256:20ff42e5751a357280214e23097520ddd074130a46ca38e46816703a5a28b917"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T4DTIVTBGSD3NPAC55MB2GEUYF","target":"graph","payload":{"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"},"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-18T00:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3O/fyB2OKTLUIfVxGx/YhClbzmCWhLMoRy5vEVHeaRr84EuVwiZW+pbY/1JkFQWPEVJKQ1fsGpRRGWBMIqBUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:24:47.108297Z"},"content_sha256":"f0fb211508c96ec9950054b56994a18d5df43d5a06ce96990297a9386509eb67","schema_version":"1.0","event_id":"sha256:f0fb211508c96ec9950054b56994a18d5df43d5a06ce96990297a9386509eb67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/bundle.json","state_url":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/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-23T01:24:47Z","links":{"resolver":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF","bundle":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/bundle.json","state":"https://pith.science/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4DTIVTBGSD3NPAC55MB2GEUYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T4DTIVTBGSD3NPAC55MB2GEUYF","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":"7e68b4222bd0d4fb0bed529589445419b1bf28e61cdc606a4abcae15f7a59500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T12:47:19Z","title_canon_sha256":"d6311e9609860396ef4489c0346fb60c7a3a0a6aacd12eb84cf99183a40c528b"},"schema_version":"1.0","source":{"id":"1708.04862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04862","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04862v1","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04862","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"T4DTIVTBGSD3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4DTIVTBGSD3NPAC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4DTIVTB","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f0fb211508c96ec9950054b56994a18d5df43d5a06ce96990297a9386509eb67","target":"graph","created_at":"2026-05-18T00:37:55Z","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 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","authors_text":"Avinatan Hassidim, Noam Hazon, Orgad Keller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T12:47:19Z","title":"New Approximations for Coalitional Manipulation in General Scoring Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04862","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:20ff42e5751a357280214e23097520ddd074130a46ca38e46816703a5a28b917","target":"record","created_at":"2026-05-18T00:37:55Z","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":"7e68b4222bd0d4fb0bed529589445419b1bf28e61cdc606a4abcae15f7a59500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T12:47:19Z","title_canon_sha256":"d6311e9609860396ef4489c0346fb60c7a3a0a6aacd12eb84cf99183a40c528b"},"schema_version":"1.0","source":{"id":"1708.04862","kind":"arxiv","version":1}},"canonical_sha256":"9f073456613487b6bc02ef581d1894c17beb84b9ea1535654ea1b69b6986da72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f073456613487b6bc02ef581d1894c17beb84b9ea1535654ea1b69b6986da72","first_computed_at":"2026-05-18T00:37:55.321127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:55.321127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zrs7IdL0fZ5uNdOgBJGtx7FfL5vMg7qGfPYvzGkoqbJWvC4n/wOmR2+g54fHfgdjE6oP4ThQByPfSi7Ug/LQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:55.321799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20ff42e5751a357280214e23097520ddd074130a46ca38e46816703a5a28b917","sha256:f0fb211508c96ec9950054b56994a18d5df43d5a06ce96990297a9386509eb67"],"state_sha256":"2191b56cf5a9b31ecbbcb3672feaa106d8de7b5b544d8f182a13e6c4e5d4ae16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XGyDKQvdAURrBNjXTsGZCXXb5xzumCk+ZzMEKZ6/kue7YcI76rdg6kUZdqkQFw769mC28lA5gYoID1BkTRpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T01:24:47.111234Z","bundle_sha256":"beb065dac7e49e4033afb55e30a45dc2966916f3aaf4f7dd754a03c1630b127e"}}