{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KRD3NWA4JDQYQGNE364ZPUUR4F","short_pith_number":"pith:KRD3NWA4","canonical_record":{"source":{"id":"1304.3145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T21:05:08Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f5e2e3774cb13ca274a3f23304c5a9a3ecafac35c22b9b322c6ee1327c59cfa4","abstract_canon_sha256":"9b1aaa4c6b10efbc431a984d4cb7d56c26057f97c610a2cbe089ad0e1438875d"},"schema_version":"1.0"},"canonical_sha256":"5447b6d81c48e18819a4dfb997d291e175f9e0d02799bd1644707c763effe88d","source":{"kind":"arxiv","id":"1304.3145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3145","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3145v1","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3145","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"KRD3NWA4JDQY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KRD3NWA4JDQYQGNE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KRD3NWA4","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KRD3NWA4JDQYQGNE364ZPUUR4F","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T21:05:08Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f5e2e3774cb13ca274a3f23304c5a9a3ecafac35c22b9b322c6ee1327c59cfa4","abstract_canon_sha256":"9b1aaa4c6b10efbc431a984d4cb7d56c26057f97c610a2cbe089ad0e1438875d"},"schema_version":"1.0"},"canonical_sha256":"5447b6d81c48e18819a4dfb997d291e175f9e0d02799bd1644707c763effe88d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:18.524184Z","signature_b64":"s8kdRElpvOgt/z2uWe4MTYD1ZkyiKAQcKDGxAQaeB+fKOfVWerUKBnBP2CUjolQPvky2lmEkbgSdzyx8ZLqhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5447b6d81c48e18819a4dfb997d291e175f9e0d02799bd1644707c763effe88d","last_reissued_at":"2026-05-18T03:28:18.523496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:18.523496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3145","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-18T03:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKVcM3v6kWMUYzwmllH20r2sSAmiDHmTjV1us7WiHv8MTeIf8YXx2kB/mxTYWBFmqX3oYCiuC1q9YbIcZWw1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:42:56.892438Z"},"content_sha256":"679b0285793d4a0739bd30754c79b0e4b3205afccdfd83f8e9f18710c838b68c","schema_version":"1.0","event_id":"sha256:679b0285793d4a0739bd30754c79b0e4b3205afccdfd83f8e9f18710c838b68c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KRD3NWA4JDQYQGNE364ZPUUR4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Jiong Guo, Yongjie Yang","submitted_at":"2013-04-10T21:05:08Z","abstract_excerpt":"Both weighted and unweighted Borda manipulation problems have been proved $\\mathcal{NP}$-hard. However, there is no exact combinatorial algorithm known for these problems. In this paper, we initiate the study of exact combinatorial algorithms for both weighted and unweighted Borda manipulation problems. More precisely, we propose $O^*((m\\cdot 2^m)^{t+1})$time and $O^*(t^{2m})$time\\footnote{$O^*()$ is the $O()$ notation with suppressed factors polynomial in the size of the input.} combinatorial algorithms for weighted and unweighted Borda manipulation problems, respectively, where $t$ is the nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3145","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-18T03:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koy3/UOs7KGrWKpblxGnAgcZCpig+mlbx4FizzmihVS4mxsZzjCsKji+aqDOHN449Xe1FXIC95ZnckvvuIbUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:42:56.893058Z"},"content_sha256":"5cbc9dd3419dd5d89feb70b47f7dcdc5ba30243b05351c6c0ef4946b48bfcde2","schema_version":"1.0","event_id":"sha256:5cbc9dd3419dd5d89feb70b47f7dcdc5ba30243b05351c6c0ef4946b48bfcde2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRD3NWA4JDQYQGNE364ZPUUR4F/bundle.json","state_url":"https://pith.science/pith/KRD3NWA4JDQYQGNE364ZPUUR4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRD3NWA4JDQYQGNE364ZPUUR4F/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-06T15:42:56Z","links":{"resolver":"https://pith.science/pith/KRD3NWA4JDQYQGNE364ZPUUR4F","bundle":"https://pith.science/pith/KRD3NWA4JDQYQGNE364ZPUUR4F/bundle.json","state":"https://pith.science/pith/KRD3NWA4JDQYQGNE364ZPUUR4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRD3NWA4JDQYQGNE364ZPUUR4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KRD3NWA4JDQYQGNE364ZPUUR4F","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":"9b1aaa4c6b10efbc431a984d4cb7d56c26057f97c610a2cbe089ad0e1438875d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T21:05:08Z","title_canon_sha256":"f5e2e3774cb13ca274a3f23304c5a9a3ecafac35c22b9b322c6ee1327c59cfa4"},"schema_version":"1.0","source":{"id":"1304.3145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3145","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3145v1","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3145","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"KRD3NWA4JDQY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KRD3NWA4JDQYQGNE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KRD3NWA4","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:5cbc9dd3419dd5d89feb70b47f7dcdc5ba30243b05351c6c0ef4946b48bfcde2","target":"graph","created_at":"2026-05-18T03:28:18Z","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":"Both weighted and unweighted Borda manipulation problems have been proved $\\mathcal{NP}$-hard. However, there is no exact combinatorial algorithm known for these problems. In this paper, we initiate the study of exact combinatorial algorithms for both weighted and unweighted Borda manipulation problems. More precisely, we propose $O^*((m\\cdot 2^m)^{t+1})$time and $O^*(t^{2m})$time\\footnote{$O^*()$ is the $O()$ notation with suppressed factors polynomial in the size of the input.} combinatorial algorithms for weighted and unweighted Borda manipulation problems, respectively, where $t$ is the nu","authors_text":"Jiong Guo, Yongjie Yang","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T21:05:08Z","title":"Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3145","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:679b0285793d4a0739bd30754c79b0e4b3205afccdfd83f8e9f18710c838b68c","target":"record","created_at":"2026-05-18T03:28:18Z","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":"9b1aaa4c6b10efbc431a984d4cb7d56c26057f97c610a2cbe089ad0e1438875d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T21:05:08Z","title_canon_sha256":"f5e2e3774cb13ca274a3f23304c5a9a3ecafac35c22b9b322c6ee1327c59cfa4"},"schema_version":"1.0","source":{"id":"1304.3145","kind":"arxiv","version":1}},"canonical_sha256":"5447b6d81c48e18819a4dfb997d291e175f9e0d02799bd1644707c763effe88d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5447b6d81c48e18819a4dfb997d291e175f9e0d02799bd1644707c763effe88d","first_computed_at":"2026-05-18T03:28:18.523496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:18.523496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8kdRElpvOgt/z2uWe4MTYD1ZkyiKAQcKDGxAQaeB+fKOfVWerUKBnBP2CUjolQPvky2lmEkbgSdzyx8ZLqhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:18.524184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:679b0285793d4a0739bd30754c79b0e4b3205afccdfd83f8e9f18710c838b68c","sha256:5cbc9dd3419dd5d89feb70b47f7dcdc5ba30243b05351c6c0ef4946b48bfcde2"],"state_sha256":"79550aa703955619c3d9e2de57f484531363b14f87762b510ebc5f1b470140ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwfSHAfCOoGr0a+GCSXA3oPFgAQ8ax1oSprJDsVL2lTcSCPE/1Wb32bd0biw9FOJGead7QIRauFgpBOAw/ZSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:42:56.897268Z","bundle_sha256":"ded815113f3cbe89999f53f924ee2c7f69eaad1439a77d79b13b8dfeddcdd091"}}