{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7WW4E3RIOU2L5UJTI4PJTO4BUM","short_pith_number":"pith:7WW4E3RI","schema_version":"1.0","canonical_sha256":"fdadc26e287534bed133471e99bb81a308943e43fe3e783c01b32a5f099c4f34","source":{"kind":"arxiv","id":"2207.01455","version":4},"attestation_state":"computed","paper":{"title":"Dynamic Ranking and Translation Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Eglantine Karl\\'e, Ernesto Araya, Hemant Tyagi","submitted_at":"2022-07-04T14:45:12Z","abstract_excerpt":"In many applications, such as sport tournaments or recommendation systems, we have at our disposal data consisting of pairwise comparisons between a set of $n$ items (or players). The objective is to use this data to infer the latent strength of each item and/or their ranking. Existing results for this problem predominantly focus on the setting consisting of a single comparison graph $G$. However, there exist scenarios (e.g., sports tournaments) where the the pairwise comparison data evolves with time. Theoretical results for this dynamic setting are relatively limited and is the focus of this"},"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":"2207.01455","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-07-04T14:45:12Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"9cc2f6c2f9285890797bde957fea5f870e0f33c58461a7e54b84440c413ced72","abstract_canon_sha256":"cf896d504cf0b1c666ee1aff46119af8b4e5f9883460e92dffcbfc39494f41e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:39.313688Z","signature_b64":"jNtvRiSebnn+QpikeUq2/szWs1eQESBK5BefgcV/Ndgx91X4WIUbkx1kUruI/yJMPixFkFgnGKUdVssE14z7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdadc26e287534bed133471e99bb81a308943e43fe3e783c01b32a5f099c4f34","last_reissued_at":"2026-07-05T08:27:39.313250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:39.313250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Ranking and Translation Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Eglantine Karl\\'e, Ernesto Araya, Hemant Tyagi","submitted_at":"2022-07-04T14:45:12Z","abstract_excerpt":"In many applications, such as sport tournaments or recommendation systems, we have at our disposal data consisting of pairwise comparisons between a set of $n$ items (or players). The objective is to use this data to infer the latent strength of each item and/or their ranking. Existing results for this problem predominantly focus on the setting consisting of a single comparison graph $G$. However, there exist scenarios (e.g., sports tournaments) where the the pairwise comparison data evolves with time. Theoretical results for this dynamic setting are relatively limited and is the focus of this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01455","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.01455/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":"2207.01455","created_at":"2026-07-05T08:27:39.313323+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.01455v4","created_at":"2026-07-05T08:27:39.313323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01455","created_at":"2026-07-05T08:27:39.313323+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WW4E3RIOU2L","created_at":"2026-07-05T08:27:39.313323+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WW4E3RIOU2L5UJT","created_at":"2026-07-05T08:27:39.313323+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WW4E3RI","created_at":"2026-07-05T08:27:39.313323+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/7WW4E3RIOU2L5UJTI4PJTO4BUM","json":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM.json","graph_json":"https://pith.science/api/pith-number/7WW4E3RIOU2L5UJTI4PJTO4BUM/graph.json","events_json":"https://pith.science/api/pith-number/7WW4E3RIOU2L5UJTI4PJTO4BUM/events.json","paper":"https://pith.science/paper/7WW4E3RI"},"agent_actions":{"view_html":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM","download_json":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM.json","view_paper":"https://pith.science/paper/7WW4E3RI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.01455&json=true","fetch_graph":"https://pith.science/api/pith-number/7WW4E3RIOU2L5UJTI4PJTO4BUM/graph.json","fetch_events":"https://pith.science/api/pith-number/7WW4E3RIOU2L5UJTI4PJTO4BUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM/action/storage_attestation","attest_author":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM/action/author_attestation","sign_citation":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM/action/citation_signature","submit_replication":"https://pith.science/pith/7WW4E3RIOU2L5UJTI4PJTO4BUM/action/replication_record"}},"created_at":"2026-07-05T08:27:39.313323+00:00","updated_at":"2026-07-05T08:27:39.313323+00:00"}