{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XVGAWXKWN4OMJFJTLMWCOW55IQ","short_pith_number":"pith:XVGAWXKW","schema_version":"1.0","canonical_sha256":"bd4c0b5d566f1cc495335b2c275bbd442f13269c9407a210784be954eb226340","source":{"kind":"arxiv","id":"1801.01253","version":1},"attestation_state":"computed","paper":{"title":"Approximate Ranking from Pairwise Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kannan Ramchandran, Martin J. Wainwright, Max Simchowitz, Reinhard Heckel","submitted_at":"2018-01-04T06:18:39Z","abstract_excerpt":"A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the top-k items as the most prominent special case. The score of a given item is defined as the probability that it beats a randomly chosen other item. Finding an exact ranking typically requires a prohibitively large number of comparisons, but in practice, approximate rankings are often adequate. Accordingly, we study the problem of finding approximate rankings "},"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":"1801.01253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T06:18:39Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"4e317ffa0fcc165e0d1a81c33e6cfee914c0045074358901242b5b8ed249f92e","abstract_canon_sha256":"f4fc22c4e0c9e114b0225cc0379d083d2fbbe5e15dea6b370b17019a87698d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:42.638168Z","signature_b64":"wWxPwg/TGQWzv1os4JHwzpf+Zwi6lSbUNX8ndaEjalG9XmJVcqLBA49KygWQqWRN93e9ThDzRUKcyTbCtg6NDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd4c0b5d566f1cc495335b2c275bbd442f13269c9407a210784be954eb226340","last_reissued_at":"2026-05-18T00:26:42.637482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:42.637482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Ranking from Pairwise Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kannan Ramchandran, Martin J. Wainwright, Max Simchowitz, Reinhard Heckel","submitted_at":"2018-01-04T06:18:39Z","abstract_excerpt":"A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the top-k items as the most prominent special case. The score of a given item is defined as the probability that it beats a randomly chosen other item. Finding an exact ranking typically requires a prohibitively large number of comparisons, but in practice, approximate rankings are often adequate. Accordingly, we study the problem of finding approximate rankings "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01253","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":"1801.01253","created_at":"2026-05-18T00:26:42.637587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01253v1","created_at":"2026-05-18T00:26:42.637587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01253","created_at":"2026-05-18T00:26:42.637587+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVGAWXKWN4OM","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVGAWXKWN4OMJFJT","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVGAWXKW","created_at":"2026-05-18T12:33:01.666342+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/XVGAWXKWN4OMJFJTLMWCOW55IQ","json":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ.json","graph_json":"https://pith.science/api/pith-number/XVGAWXKWN4OMJFJTLMWCOW55IQ/graph.json","events_json":"https://pith.science/api/pith-number/XVGAWXKWN4OMJFJTLMWCOW55IQ/events.json","paper":"https://pith.science/paper/XVGAWXKW"},"agent_actions":{"view_html":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ","download_json":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ.json","view_paper":"https://pith.science/paper/XVGAWXKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01253&json=true","fetch_graph":"https://pith.science/api/pith-number/XVGAWXKWN4OMJFJTLMWCOW55IQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XVGAWXKWN4OMJFJTLMWCOW55IQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ/action/storage_attestation","attest_author":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ/action/author_attestation","sign_citation":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ/action/citation_signature","submit_replication":"https://pith.science/pith/XVGAWXKWN4OMJFJTLMWCOW55IQ/action/replication_record"}},"created_at":"2026-05-18T00:26:42.637587+00:00","updated_at":"2026-05-18T00:26:42.637587+00:00"}