{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KSK6SXJBYNJNGZALGRGMEZXYVC","short_pith_number":"pith:KSK6SXJB","schema_version":"1.0","canonical_sha256":"5495e95d21c352d3640b344cc266f8a89ff7657426023f23f11b77c4e2742d01","source":{"kind":"arxiv","id":"1307.4339","version":4},"attestation_state":"computed","paper":{"title":"Computing Similarity Distances Between Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Farzad Farnoud (Hassanzadeh), Gregory J. Puleo, Lili Su, Olgica Milenkovic","submitted_at":"2013-07-16T16:50:37Z","abstract_excerpt":"We address the problem of computing distances between rankings that take into account similarities between candidates. The need for evaluating such distances is governed by applications as diverse as rank aggregation, bioinformatics, social sciences and data storage. The problem may be summarized as follows: Given two rankings and a positive cost function on transpositions that depends on the similarity of the candidates involved, find a smallest cost sequence of transpositions that converts one ranking into another. Our focus is on costs that may be described via special metric-tree structure"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.4339","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T16:50:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7fb7ed2827528efc75ba3b2eacd8186fb55669a189fddfea4f15043b6920ee35","abstract_canon_sha256":"5e30252c4268c30f82e8c98e72297edd5369286fabdf3dde96eb7133152e860b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:45.118452Z","signature_b64":"RngMI/jNXYZ4GShBcMYoHp+6Pk9gUDnopcar6tG259B2sN3xzPkdCXsbgDMrcq7D3kol6BANQQNVBsUlXtJPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5495e95d21c352d3640b344cc266f8a89ff7657426023f23f11b77c4e2742d01","last_reissued_at":"2026-05-18T02:34:45.118038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:45.118038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Similarity Distances Between Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Farzad Farnoud (Hassanzadeh), Gregory J. Puleo, Lili Su, Olgica Milenkovic","submitted_at":"2013-07-16T16:50:37Z","abstract_excerpt":"We address the problem of computing distances between rankings that take into account similarities between candidates. The need for evaluating such distances is governed by applications as diverse as rank aggregation, bioinformatics, social sciences and data storage. The problem may be summarized as follows: Given two rankings and a positive cost function on transpositions that depends on the similarity of the candidates involved, find a smallest cost sequence of transpositions that converts one ranking into another. Our focus is on costs that may be described via special metric-tree structure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4339","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.4339","created_at":"2026-05-18T02:34:45.118106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4339v4","created_at":"2026-05-18T02:34:45.118106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4339","created_at":"2026-05-18T02:34:45.118106+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSK6SXJBYNJN","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSK6SXJBYNJNGZAL","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSK6SXJB","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC","json":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC.json","graph_json":"https://pith.science/api/pith-number/KSK6SXJBYNJNGZALGRGMEZXYVC/graph.json","events_json":"https://pith.science/api/pith-number/KSK6SXJBYNJNGZALGRGMEZXYVC/events.json","paper":"https://pith.science/paper/KSK6SXJB"},"agent_actions":{"view_html":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC","download_json":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC.json","view_paper":"https://pith.science/paper/KSK6SXJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4339&json=true","fetch_graph":"https://pith.science/api/pith-number/KSK6SXJBYNJNGZALGRGMEZXYVC/graph.json","fetch_events":"https://pith.science/api/pith-number/KSK6SXJBYNJNGZALGRGMEZXYVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC/action/storage_attestation","attest_author":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC/action/author_attestation","sign_citation":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC/action/citation_signature","submit_replication":"https://pith.science/pith/KSK6SXJBYNJNGZALGRGMEZXYVC/action/replication_record"}},"created_at":"2026-05-18T02:34:45.118106+00:00","updated_at":"2026-05-18T02:34:45.118106+00:00"}