{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RSRKHVOXRAEPDJPPB7KXOX67L4","short_pith_number":"pith:RSRKHVOX","schema_version":"1.0","canonical_sha256":"8ca2a3d5d78808f1a5ef0fd5775fdf5f1d1289ff9167c45057e33e0678e48263","source":{"kind":"arxiv","id":"2207.00076","version":2},"attestation_state":"computed","paper":{"title":"Efficient computation of rankings from pairwise comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"M. E. J. Newman","submitted_at":"2022-06-30T19:39:09Z","abstract_excerpt":"We study the ranking of individuals, teams, or objects, based on pairwise comparisons between them, using the Bradley-Terry model. Estimates of rankings within this model are commonly made using a simple iterative algorithm first introduced by Zermelo almost a century ago. Here we describe an alternative and similarly simple iteration that provably returns identical results but does so much faster -- over a hundred times faster in some cases. We demonstrate this algorithm with applications to a range of example data sets and derive a number of results regarding its convergence."},"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.00076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-06-30T19:39:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec8fbb5edff9e5caafafa11e8800dde778956087ff6d97b4672da8b8aca7d937","abstract_canon_sha256":"c7f94fff4ac05280524e674c31d2cd5d194ad6d6330b4c9339878619c0b5354b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:02.415582Z","signature_b64":"6nviOWDyenQhk5Z9vJF/kc9fi/5yTqns5D9gD7j/RSS3IN3UkLDFiwAeGgMg4MHsTXkuxSu3sVAiow83OaE+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ca2a3d5d78808f1a5ef0fd5775fdf5f1d1289ff9167c45057e33e0678e48263","last_reissued_at":"2026-07-05T06:41:02.415088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:02.415088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computation of rankings from pairwise comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"M. E. J. Newman","submitted_at":"2022-06-30T19:39:09Z","abstract_excerpt":"We study the ranking of individuals, teams, or objects, based on pairwise comparisons between them, using the Bradley-Terry model. Estimates of rankings within this model are commonly made using a simple iterative algorithm first introduced by Zermelo almost a century ago. Here we describe an alternative and similarly simple iteration that provably returns identical results but does so much faster -- over a hundred times faster in some cases. We demonstrate this algorithm with applications to a range of example data sets and derive a number of results regarding its convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00076","kind":"arxiv","version":2},"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.00076/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.00076","created_at":"2026-07-05T06:41:02.415144+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.00076v2","created_at":"2026-07-05T06:41:02.415144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00076","created_at":"2026-07-05T06:41:02.415144+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSRKHVOXRAEP","created_at":"2026-07-05T06:41:02.415144+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSRKHVOXRAEPDJPP","created_at":"2026-07-05T06:41:02.415144+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSRKHVOX","created_at":"2026-07-05T06:41:02.415144+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30758","citing_title":"Pairwise Reference Alignment as a Model-Level Ordinal Observable","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22148","citing_title":"Ordering Stochastic Block Models via prior transitivity","ref_index":139,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4","json":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4.json","graph_json":"https://pith.science/api/pith-number/RSRKHVOXRAEPDJPPB7KXOX67L4/graph.json","events_json":"https://pith.science/api/pith-number/RSRKHVOXRAEPDJPPB7KXOX67L4/events.json","paper":"https://pith.science/paper/RSRKHVOX"},"agent_actions":{"view_html":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4","download_json":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4.json","view_paper":"https://pith.science/paper/RSRKHVOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.00076&json=true","fetch_graph":"https://pith.science/api/pith-number/RSRKHVOXRAEPDJPPB7KXOX67L4/graph.json","fetch_events":"https://pith.science/api/pith-number/RSRKHVOXRAEPDJPPB7KXOX67L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4/action/storage_attestation","attest_author":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4/action/author_attestation","sign_citation":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4/action/citation_signature","submit_replication":"https://pith.science/pith/RSRKHVOXRAEPDJPPB7KXOX67L4/action/replication_record"}},"created_at":"2026-07-05T06:41:02.415144+00:00","updated_at":"2026-07-05T06:41:02.415144+00:00"}