{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LYFOMLMSXLGWNN7LNQUNFLQZWP","short_pith_number":"pith:LYFOMLMS","canonical_record":{"source":{"id":"1105.5667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T23:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"b4f9e0edb7e317a757010d686f8b21bebdf9122ab304d6b515f2ef8fbeceb396","abstract_canon_sha256":"769c626f5e137c1060a78f6b49c3278089ab0bb36d48203104d7931064a2791b"},"schema_version":"1.0"},"canonical_sha256":"5e0ae62d92bacd66b7eb6c28d2ae19b3d7d71cbe17fe60580a9afd0f09ea3e53","source":{"kind":"arxiv","id":"1105.5667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5667","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5667v1","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5667","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"LYFOMLMSXLGW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LYFOMLMSXLGWNN7L","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LYFOMLMS","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LYFOMLMSXLGWNN7LNQUNFLQZWP","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T23:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"b4f9e0edb7e317a757010d686f8b21bebdf9122ab304d6b515f2ef8fbeceb396","abstract_canon_sha256":"769c626f5e137c1060a78f6b49c3278089ab0bb36d48203104d7931064a2791b"},"schema_version":"1.0"},"canonical_sha256":"5e0ae62d92bacd66b7eb6c28d2ae19b3d7d71cbe17fe60580a9afd0f09ea3e53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:01.840966Z","signature_b64":"3Hqotfb2obxrCLxdPaC+9n6UzRhukHUOyZ3VSW/hbaGZEMkmAK2Wqqnt+Pe3Q4RghyoIBb7rSWgM42VNret+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e0ae62d92bacd66b7eb6c28d2ae19b3d7d71cbe17fe60580a9afd0f09ea3e53","last_reissued_at":"2026-05-18T04:21:01.840306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:01.840306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5667","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-18T04:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYsUOPDLbKZuAQzkhRDyKjmm2NhROzhNlpk86h7+OMCfr2ETsR2W1T8PZhDcnRMENz4CcBGYHiUu7dvtlJ4OAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:41:36.278420Z"},"content_sha256":"a25408c7d4be7c469e3ffc43d95a49f42e7e0b97401babe3663ad69c4b1274ac","schema_version":"1.0","event_id":"sha256:a25408c7d4be7c469e3ffc43d95a49f42e7e0b97401babe3663ad69c4b1274ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LYFOMLMSXLGWNN7LNQUNFLQZWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of and Algorithms for Borda Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"George Katsirelos, Jessica Davies, Nina Narodytska, Toby Walsh","submitted_at":"2011-05-27T23:11:40Z","abstract_excerpt":"We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin packing and multiprocessor scheduling, we propose two new approximation methods to compute manipulations of the Borda rule. Experiments show that these methods significantly outperform the previous best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5667","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-18T04:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vr+rFY2wQL1ibn+q10Sos6qxYNFLSg0K+z05oikSgM0/5YEjJRpgQyQCvnJqCNgMNPy1sUEsUZ5Tb77l1yU2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:41:36.278772Z"},"content_sha256":"6c7b35df2a9b88d5aaa492bcbd04d7fe338562caaea6a559bfd6e4fac5df19e2","schema_version":"1.0","event_id":"sha256:6c7b35df2a9b88d5aaa492bcbd04d7fe338562caaea6a559bfd6e4fac5df19e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP/bundle.json","state_url":"https://pith.science/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP/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-06-03T16:41:36Z","links":{"resolver":"https://pith.science/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP","bundle":"https://pith.science/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP/bundle.json","state":"https://pith.science/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYFOMLMSXLGWNN7LNQUNFLQZWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LYFOMLMSXLGWNN7LNQUNFLQZWP","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":"769c626f5e137c1060a78f6b49c3278089ab0bb36d48203104d7931064a2791b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T23:11:40Z","title_canon_sha256":"b4f9e0edb7e317a757010d686f8b21bebdf9122ab304d6b515f2ef8fbeceb396"},"schema_version":"1.0","source":{"id":"1105.5667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5667","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5667v1","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5667","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"LYFOMLMSXLGW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LYFOMLMSXLGWNN7L","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LYFOMLMS","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6c7b35df2a9b88d5aaa492bcbd04d7fe338562caaea6a559bfd6e4fac5df19e2","target":"graph","created_at":"2026-05-18T04:21:01Z","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 prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin packing and multiprocessor scheduling, we propose two new approximation methods to compute manipulations of the Borda rule. Experiments show that these methods significantly outperform the previous best ","authors_text":"George Katsirelos, Jessica Davies, Nina Narodytska, Toby Walsh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T23:11:40Z","title":"Complexity of and Algorithms for Borda Manipulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5667","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:a25408c7d4be7c469e3ffc43d95a49f42e7e0b97401babe3663ad69c4b1274ac","target":"record","created_at":"2026-05-18T04:21:01Z","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":"769c626f5e137c1060a78f6b49c3278089ab0bb36d48203104d7931064a2791b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T23:11:40Z","title_canon_sha256":"b4f9e0edb7e317a757010d686f8b21bebdf9122ab304d6b515f2ef8fbeceb396"},"schema_version":"1.0","source":{"id":"1105.5667","kind":"arxiv","version":1}},"canonical_sha256":"5e0ae62d92bacd66b7eb6c28d2ae19b3d7d71cbe17fe60580a9afd0f09ea3e53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e0ae62d92bacd66b7eb6c28d2ae19b3d7d71cbe17fe60580a9afd0f09ea3e53","first_computed_at":"2026-05-18T04:21:01.840306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:01.840306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Hqotfb2obxrCLxdPaC+9n6UzRhukHUOyZ3VSW/hbaGZEMkmAK2Wqqnt+Pe3Q4RghyoIBb7rSWgM42VNret+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:01.840966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a25408c7d4be7c469e3ffc43d95a49f42e7e0b97401babe3663ad69c4b1274ac","sha256:6c7b35df2a9b88d5aaa492bcbd04d7fe338562caaea6a559bfd6e4fac5df19e2"],"state_sha256":"5acb58d74246df52b6d29ce4d6aff817522814e70fffab5d17051472b58b8f11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/f9hPhDks/31CJ8Y2OTZjw6KrsnFu0+NZ5IJoNvRSzcgrMJlKYrInWWsBNdQhSjy4b5VMGKycl4UH0qq+jPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:41:36.280948Z","bundle_sha256":"8aa2b8ad39addbc40905a3e0a099488c2c3da7fa5f94c615084e01b52784a241"}}