{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OPGPHDHB23LVSILBBZ3T7Z7Q46","short_pith_number":"pith:OPGPHDHB","schema_version":"1.0","canonical_sha256":"73ccf38ce1d6d75921610e773fe7f0e794130468c99836b51a543541a2e371cc","source":{"kind":"arxiv","id":"1504.01070","version":1},"attestation_state":"computed","paper":{"title":"Sync-Rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and Semidefinite Programming Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mihai Cucuringu","submitted_at":"2015-04-05T01:40:35Z","abstract_excerpt":"We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g., ranking teams in sports data), computer vision, and machine learning. We formulate the above problem of ranking with incomplete noisy information as an instance of the group synchronization problem over the group SO(2) of planar rotations, whose usefulness has been demonstrated in numerous applications in recent years. Its least squares s"},"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":"1504.01070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-05T01:40:35Z","cross_cats_sorted":["cs.SI","math.OC","stat.ML"],"title_canon_sha256":"3cb9107a4ec156ba0e30d946aa8bdeb1f390acf5e9d13c2eebffb44e17b5aea7","abstract_canon_sha256":"7e06abe62db4a4e9a8941e50f976df591cfb256118487f9d9553109a3fe4bee1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:35.236817Z","signature_b64":"Y6YhXbB7a6rqLSxsj0BigtiGabL1xle0d+oVzXQWsPb8XDIA4Th5aAh5nFXWvGVLoYdW7sv/7dac/MtQe3yECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ccf38ce1d6d75921610e773fe7f0e794130468c99836b51a543541a2e371cc","last_reissued_at":"2026-05-18T02:19:35.236246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:35.236246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sync-Rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and Semidefinite Programming Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mihai Cucuringu","submitted_at":"2015-04-05T01:40:35Z","abstract_excerpt":"We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g., ranking teams in sports data), computer vision, and machine learning. We formulate the above problem of ranking with incomplete noisy information as an instance of the group synchronization problem over the group SO(2) of planar rotations, whose usefulness has been demonstrated in numerous applications in recent years. Its least squares s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01070","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.01070","created_at":"2026-05-18T02:19:35.236354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01070v1","created_at":"2026-05-18T02:19:35.236354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01070","created_at":"2026-05-18T02:19:35.236354+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPGPHDHB23LV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPGPHDHB23LVSILB","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPGPHDHB","created_at":"2026-05-18T12:29:34.919912+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/OPGPHDHB23LVSILBBZ3T7Z7Q46","json":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46.json","graph_json":"https://pith.science/api/pith-number/OPGPHDHB23LVSILBBZ3T7Z7Q46/graph.json","events_json":"https://pith.science/api/pith-number/OPGPHDHB23LVSILBBZ3T7Z7Q46/events.json","paper":"https://pith.science/paper/OPGPHDHB"},"agent_actions":{"view_html":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46","download_json":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46.json","view_paper":"https://pith.science/paper/OPGPHDHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01070&json=true","fetch_graph":"https://pith.science/api/pith-number/OPGPHDHB23LVSILBBZ3T7Z7Q46/graph.json","fetch_events":"https://pith.science/api/pith-number/OPGPHDHB23LVSILBBZ3T7Z7Q46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46/action/storage_attestation","attest_author":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46/action/author_attestation","sign_citation":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46/action/citation_signature","submit_replication":"https://pith.science/pith/OPGPHDHB23LVSILBBZ3T7Z7Q46/action/replication_record"}},"created_at":"2026-05-18T02:19:35.236354+00:00","updated_at":"2026-05-18T02:19:35.236354+00:00"}