{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z6TFLRJP6GL64EST7BX5CWE5OE","short_pith_number":"pith:Z6TFLRJP","canonical_record":{"source":{"id":"1212.1471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-06T21:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"33310f74a76df65bfe09c89b778a1362b6894119062f434bfd29dff024dcd725","abstract_canon_sha256":"4abdaae6ac061fb1a929290ef93158b05b41ac182375e26b1ec67379b6fb9de0"},"schema_version":"1.0"},"canonical_sha256":"cfa655c52ff197ee1253f86fd1589d7135ecc53b0abd66933b7b4ea6a6d33ef7","source":{"kind":"arxiv","id":"1212.1471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1471","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1471v1","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1471","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"Z6TFLRJP6GL6","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z6TFLRJP6GL64EST","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z6TFLRJP","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z6TFLRJP6GL64EST7BX5CWE5OE","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-06T21:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"33310f74a76df65bfe09c89b778a1362b6894119062f434bfd29dff024dcd725","abstract_canon_sha256":"4abdaae6ac061fb1a929290ef93158b05b41ac182375e26b1ec67379b6fb9de0"},"schema_version":"1.0"},"canonical_sha256":"cfa655c52ff197ee1253f86fd1589d7135ecc53b0abd66933b7b4ea6a6d33ef7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:57.102426Z","signature_b64":"4MqrAljhqbOOHSpqfpY90WAJv/7ntRIlaT+aAyc05L6QMLkJdOjX0mNttBPo3iGbS02nXxZcFuyIlhtT+iZ4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfa655c52ff197ee1253f86fd1589d7135ecc53b0abd66933b7b4ea6a6d33ef7","last_reissued_at":"2026-05-18T03:38:57.101717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:57.101717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1471","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:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXYnIYeisalT/WsFWuZglxD1RmBkIjsv17qrkeIl1X87ukK4bScuwOklVOVDgE183EHGWnvhCLf5QUYIzUTSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:05:51.197370Z"},"content_sha256":"d7539c2a5b99bf29e4f625a4604b782f806b50837761b356b37ec0373f7efbad","schema_version":"1.0","event_id":"sha256:d7539c2a5b99bf29e4f625a4604b782f806b50837761b356b37ec0373f7efbad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z6TFLRJP6GL64EST7BX5CWE5OE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Distance-Based Approach to Constrained Rank Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Behrouz Touri, Farzad Farnoud (Hassanzadeh), Olgica Milenkovic","submitted_at":"2012-12-06T21:06:21Z","abstract_excerpt":"We consider a classical problem in choice theory -- vote aggregation -- using novel distance measures between permutations that arise in several practical applications. The distance measures are derived through an axiomatic approach, taking into account various issues arising in voting with side constraints. The side constraints of interest include non-uniform relevance of the top and the bottom of rankings (or equivalently, eliminating negative outliers in votes) and similarities between candidates (or equivalently, introducing diversity in the voting process). The proposed distance functions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1471","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:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWtGkZJCjmG9+jo2P+xzhceKT1qLY1/rWIH7ZTRSk2bn02Li+3kzoZ1HOhjck6CCo3H8rz/6KgFebLDsslzfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:05:51.197714Z"},"content_sha256":"f251c3d561944aef26e3e465e9e792e3233ea6ed2c751991bd9047282460b833","schema_version":"1.0","event_id":"sha256:f251c3d561944aef26e3e465e9e792e3233ea6ed2c751991bd9047282460b833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6TFLRJP6GL64EST7BX5CWE5OE/bundle.json","state_url":"https://pith.science/pith/Z6TFLRJP6GL64EST7BX5CWE5OE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6TFLRJP6GL64EST7BX5CWE5OE/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-01T03:05:51Z","links":{"resolver":"https://pith.science/pith/Z6TFLRJP6GL64EST7BX5CWE5OE","bundle":"https://pith.science/pith/Z6TFLRJP6GL64EST7BX5CWE5OE/bundle.json","state":"https://pith.science/pith/Z6TFLRJP6GL64EST7BX5CWE5OE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6TFLRJP6GL64EST7BX5CWE5OE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z6TFLRJP6GL64EST7BX5CWE5OE","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":"4abdaae6ac061fb1a929290ef93158b05b41ac182375e26b1ec67379b6fb9de0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-06T21:06:21Z","title_canon_sha256":"33310f74a76df65bfe09c89b778a1362b6894119062f434bfd29dff024dcd725"},"schema_version":"1.0","source":{"id":"1212.1471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1471","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1471v1","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1471","created_at":"2026-05-18T03:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"Z6TFLRJP6GL6","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z6TFLRJP6GL64EST","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z6TFLRJP","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:f251c3d561944aef26e3e465e9e792e3233ea6ed2c751991bd9047282460b833","target":"graph","created_at":"2026-05-18T03:38:57Z","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 a classical problem in choice theory -- vote aggregation -- using novel distance measures between permutations that arise in several practical applications. The distance measures are derived through an axiomatic approach, taking into account various issues arising in voting with side constraints. The side constraints of interest include non-uniform relevance of the top and the bottom of rankings (or equivalently, eliminating negative outliers in votes) and similarities between candidates (or equivalently, introducing diversity in the voting process). The proposed distance functions","authors_text":"Behrouz Touri, Farzad Farnoud (Hassanzadeh), Olgica Milenkovic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-06T21:06:21Z","title":"A Novel Distance-Based Approach to Constrained Rank Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1471","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:d7539c2a5b99bf29e4f625a4604b782f806b50837761b356b37ec0373f7efbad","target":"record","created_at":"2026-05-18T03:38:57Z","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":"4abdaae6ac061fb1a929290ef93158b05b41ac182375e26b1ec67379b6fb9de0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-06T21:06:21Z","title_canon_sha256":"33310f74a76df65bfe09c89b778a1362b6894119062f434bfd29dff024dcd725"},"schema_version":"1.0","source":{"id":"1212.1471","kind":"arxiv","version":1}},"canonical_sha256":"cfa655c52ff197ee1253f86fd1589d7135ecc53b0abd66933b7b4ea6a6d33ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfa655c52ff197ee1253f86fd1589d7135ecc53b0abd66933b7b4ea6a6d33ef7","first_computed_at":"2026-05-18T03:38:57.101717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:57.101717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4MqrAljhqbOOHSpqfpY90WAJv/7ntRIlaT+aAyc05L6QMLkJdOjX0mNttBPo3iGbS02nXxZcFuyIlhtT+iZ4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:57.102426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7539c2a5b99bf29e4f625a4604b782f806b50837761b356b37ec0373f7efbad","sha256:f251c3d561944aef26e3e465e9e792e3233ea6ed2c751991bd9047282460b833"],"state_sha256":"14a4b796b6f9cebd5af9f252615e88f7ab72eeae881cfa26ea0722449f68d8e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+jj9VMZcivf8rszEzJRVaDWBSMZ+UVTaClDqeDlZiEBm3l3srr8ZhWIerzIXgoa4QxJnAVrofaGm8roKewJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:05:51.199835Z","bundle_sha256":"e4407a47a8691a73367773ff8799aedb14bdefd213aa4d4c0fd98d8fe748916d"}}