{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IZXEEFXQOCIODTYYRYXZS5TEN3","short_pith_number":"pith:IZXEEFXQ","schema_version":"1.0","canonical_sha256":"466e4216f07090e1cf188e2f9976646ec8f23989bea71528f21e6f2279d4b2ac","source":{"kind":"arxiv","id":"1906.02746","version":3},"attestation_state":"computed","paper":{"title":"Ranking and synchronization from pairwise measurements via SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alexandre d'Aspremont, Hemant Tyagi, Mihai Cucuringu","submitted_at":"2019-06-06T16:17:36Z","abstract_excerpt":"Given a measurement graph $G= (V,E)$ and an unknown signal $r \\in \\mathbb{R}^n$, we investigate algorithms for recovering $r$ from pairwise measurements of the form $r_i - r_j$; $\\{i,j\\} \\in E$. This problem arises in a variety of applications, such as ranking teams in sports data and time synchronization of distributed networks. Framed in the context of ranking, the task is to recover the ranking of $n$ teams (induced by $r$) given a small subset of noisy pairwise rank offsets. We propose a simple SVD-based algorithmic pipeline for both the problem of time synchronization and ranking. We prov"},"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":"1906.02746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-06T16:17:36Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"c59f8e70d7b9bd3aee8c4c8e809062d25ef9baa1b96cb7020f8ceb22dbe39269","abstract_canon_sha256":"f35b3935343cae587f35f0314ad7b17fd70cc1e4870f702f544d2f83322a881e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:21.761778Z","signature_b64":"SII4aLfZO+lijIz1MrB8GgincljjOqRxzIJi2mELcLwjeNGU8C2vYUn7Nv5FCmd7SwoPJM0iJvxV1XGR5t/nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"466e4216f07090e1cf188e2f9976646ec8f23989bea71528f21e6f2279d4b2ac","last_reissued_at":"2026-07-05T01:25:21.761371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:21.761371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking and synchronization from pairwise measurements via SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alexandre d'Aspremont, Hemant Tyagi, Mihai Cucuringu","submitted_at":"2019-06-06T16:17:36Z","abstract_excerpt":"Given a measurement graph $G= (V,E)$ and an unknown signal $r \\in \\mathbb{R}^n$, we investigate algorithms for recovering $r$ from pairwise measurements of the form $r_i - r_j$; $\\{i,j\\} \\in E$. This problem arises in a variety of applications, such as ranking teams in sports data and time synchronization of distributed networks. Framed in the context of ranking, the task is to recover the ranking of $n$ teams (induced by $r$) given a small subset of noisy pairwise rank offsets. We propose a simple SVD-based algorithmic pipeline for both the problem of time synchronization and ranking. We prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02746","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.02746/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1906.02746","created_at":"2026-07-05T01:25:21.761441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02746v3","created_at":"2026-07-05T01:25:21.761441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02746","created_at":"2026-07-05T01:25:21.761441+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZXEEFXQOCIO","created_at":"2026-07-05T01:25:21.761441+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZXEEFXQOCIODTYY","created_at":"2026-07-05T01:25:21.761441+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZXEEFXQ","created_at":"2026-07-05T01:25:21.761441+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/IZXEEFXQOCIODTYYRYXZS5TEN3","json":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3.json","graph_json":"https://pith.science/api/pith-number/IZXEEFXQOCIODTYYRYXZS5TEN3/graph.json","events_json":"https://pith.science/api/pith-number/IZXEEFXQOCIODTYYRYXZS5TEN3/events.json","paper":"https://pith.science/paper/IZXEEFXQ"},"agent_actions":{"view_html":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3","download_json":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3.json","view_paper":"https://pith.science/paper/IZXEEFXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02746&json=true","fetch_graph":"https://pith.science/api/pith-number/IZXEEFXQOCIODTYYRYXZS5TEN3/graph.json","fetch_events":"https://pith.science/api/pith-number/IZXEEFXQOCIODTYYRYXZS5TEN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3/action/storage_attestation","attest_author":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3/action/author_attestation","sign_citation":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3/action/citation_signature","submit_replication":"https://pith.science/pith/IZXEEFXQOCIODTYYRYXZS5TEN3/action/replication_record"}},"created_at":"2026-07-05T01:25:21.761441+00:00","updated_at":"2026-07-05T01:25:21.761441+00:00"}