{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RD4PLDWVRXQO4S346HPNUQZNXE","short_pith_number":"pith:RD4PLDWV","canonical_record":{"source":{"id":"1206.5343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T00:14:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bffaf187b6f55a78756e0aab81b0cb5ec2ec524ea6b50495a8e66cc9b21c6c28","abstract_canon_sha256":"77bdfa7033f1e20f258690a4a55346d42dd971fa78da2f6704ca305d992b41c5"},"schema_version":"1.0"},"canonical_sha256":"88f8f58ed58de0ee4b7cf1deda432db927223d3958a1bb4d331bca6e70ed315d","source":{"kind":"arxiv","id":"1206.5343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5343","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5343v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5343","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"RD4PLDWVRXQO","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RD4PLDWVRXQO4S34","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RD4PLDWV","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RD4PLDWVRXQO4S346HPNUQZNXE","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T00:14:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bffaf187b6f55a78756e0aab81b0cb5ec2ec524ea6b50495a8e66cc9b21c6c28","abstract_canon_sha256":"77bdfa7033f1e20f258690a4a55346d42dd971fa78da2f6704ca305d992b41c5"},"schema_version":"1.0"},"canonical_sha256":"88f8f58ed58de0ee4b7cf1deda432db927223d3958a1bb4d331bca6e70ed315d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.372705Z","signature_b64":"dxeidD3ellQAWT0urG+1YyK2Wkl+P+gvT1x0ra8EzKrXVutMj3kwGQtCVp11LNFCfmcxQMt40XnnOkiDXDKxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88f8f58ed58de0ee4b7cf1deda432db927223d3958a1bb4d331bca6e70ed315d","last_reissued_at":"2026-05-18T03:52:40.371927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.371927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5343","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+f+1degg2Os5d8fOQ8iRR5xC5uIjuKsKNzJ2OSrK5XTudMO8WQy/YS0Djw/rS2jEpyXu3FY7xIwhY6n76/z4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:23:37.118356Z"},"content_sha256":"d62f1fb5e5515a2c62b8a270d850d555b0ba236f86c75cc2c402d40940a0417d","schema_version":"1.0","event_id":"sha256:d62f1fb5e5515a2c62b8a270d850d555b0ba236f86c75cc2c402d40940a0417d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RD4PLDWVRXQO4S346HPNUQZNXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonuniform Vote Aggregation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Behrouz Touri, Farzad Farnoud (Hassanzadeh), Olgica Milenkovic","submitted_at":"2012-06-23T00:14:04Z","abstract_excerpt":"We consider the problem of non-uniform vote aggregation, and in particular, the algorithmic aspects associated with the aggregation process. For a novel class of weighted distance measures on votes, we present two different aggregation methods. The first algorithm is based on approximating the weighted distance measure by Spearman's footrule distance, with provable constant approximation guarantees. The second algorithm is based on a non-uniform Markov chain method inspired by PageRank, for which currently only heuristic guarantees are known. We illustrate the performance of the proposed algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5343","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Csa10wfOsxIBQu2bm+V+HxMQ6fn9pF1iC7i/CoY0kHP/wvmyhjJSxsSnuLC+G1DI7tb/wGxrBOKtt+3CxdGwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:23:37.118704Z"},"content_sha256":"3ef1c2d6d4232d21f12abf51de13ae91e86edefccf0845362bff94311997ee23","schema_version":"1.0","event_id":"sha256:3ef1c2d6d4232d21f12abf51de13ae91e86edefccf0845362bff94311997ee23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RD4PLDWVRXQO4S346HPNUQZNXE/bundle.json","state_url":"https://pith.science/pith/RD4PLDWVRXQO4S346HPNUQZNXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RD4PLDWVRXQO4S346HPNUQZNXE/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-25T03:23:37Z","links":{"resolver":"https://pith.science/pith/RD4PLDWVRXQO4S346HPNUQZNXE","bundle":"https://pith.science/pith/RD4PLDWVRXQO4S346HPNUQZNXE/bundle.json","state":"https://pith.science/pith/RD4PLDWVRXQO4S346HPNUQZNXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RD4PLDWVRXQO4S346HPNUQZNXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RD4PLDWVRXQO4S346HPNUQZNXE","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":"77bdfa7033f1e20f258690a4a55346d42dd971fa78da2f6704ca305d992b41c5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T00:14:04Z","title_canon_sha256":"bffaf187b6f55a78756e0aab81b0cb5ec2ec524ea6b50495a8e66cc9b21c6c28"},"schema_version":"1.0","source":{"id":"1206.5343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5343","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5343v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5343","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"RD4PLDWVRXQO","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RD4PLDWVRXQO4S34","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RD4PLDWV","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:3ef1c2d6d4232d21f12abf51de13ae91e86edefccf0845362bff94311997ee23","target":"graph","created_at":"2026-05-18T03:52:40Z","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 consider the problem of non-uniform vote aggregation, and in particular, the algorithmic aspects associated with the aggregation process. For a novel class of weighted distance measures on votes, we present two different aggregation methods. The first algorithm is based on approximating the weighted distance measure by Spearman's footrule distance, with provable constant approximation guarantees. The second algorithm is based on a non-uniform Markov chain method inspired by PageRank, for which currently only heuristic guarantees are known. We illustrate the performance of the proposed algor","authors_text":"Behrouz Touri, Farzad Farnoud (Hassanzadeh), Olgica Milenkovic","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T00:14:04Z","title":"Nonuniform Vote Aggregation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5343","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:d62f1fb5e5515a2c62b8a270d850d555b0ba236f86c75cc2c402d40940a0417d","target":"record","created_at":"2026-05-18T03:52:40Z","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":"77bdfa7033f1e20f258690a4a55346d42dd971fa78da2f6704ca305d992b41c5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T00:14:04Z","title_canon_sha256":"bffaf187b6f55a78756e0aab81b0cb5ec2ec524ea6b50495a8e66cc9b21c6c28"},"schema_version":"1.0","source":{"id":"1206.5343","kind":"arxiv","version":1}},"canonical_sha256":"88f8f58ed58de0ee4b7cf1deda432db927223d3958a1bb4d331bca6e70ed315d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88f8f58ed58de0ee4b7cf1deda432db927223d3958a1bb4d331bca6e70ed315d","first_computed_at":"2026-05-18T03:52:40.371927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:40.371927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dxeidD3ellQAWT0urG+1YyK2Wkl+P+gvT1x0ra8EzKrXVutMj3kwGQtCVp11LNFCfmcxQMt40XnnOkiDXDKxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:40.372705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d62f1fb5e5515a2c62b8a270d850d555b0ba236f86c75cc2c402d40940a0417d","sha256:3ef1c2d6d4232d21f12abf51de13ae91e86edefccf0845362bff94311997ee23"],"state_sha256":"dcbd223d43409855125028574bf30f638a09e251e1410cb178545d2b8ffdf148"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyVDeVH0HHQTGxSgFDswu12YrPa3/4uZ5z7xG9qZBxByWpKLcszGojL6MzZheAILOMBopyKzS+m2EV8oB4KfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:23:37.120584Z","bundle_sha256":"3528f34f6c8817bdd0a682cdb00bfe546d15803fc1229be03d5cba24831ff900"}}