{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XVGAWXKWN4OMJFJTLMWCOW55IQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f4fc22c4e0c9e114b0225cc0379d083d2fbbe5e15dea6b370b17019a87698d2a","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T06:18:39Z","title_canon_sha256":"4e317ffa0fcc165e0d1a81c33e6cfee914c0045074358901242b5b8ed249f92e"},"schema_version":"1.0","source":{"id":"1801.01253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01253","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01253v1","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01253","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"XVGAWXKWN4OM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XVGAWXKWN4OMJFJT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XVGAWXKW","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:0d1f1e5ed1900ff10de55071dc8f9be937a6239ba4cf99c4d668cf8c4070df34","target":"graph","created_at":"2026-05-18T00:26:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Kannan Ramchandran, Martin J. Wainwright, Max Simchowitz, Reinhard Heckel","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T06:18:39Z","title":"Approximate Ranking from Pairwise Comparisons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01253","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0f7fba2de2f07d752a852dc18bd4cce1912e53e30aef4b94b30bac36e5370747","target":"record","created_at":"2026-05-18T00:26:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f4fc22c4e0c9e114b0225cc0379d083d2fbbe5e15dea6b370b17019a87698d2a","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T06:18:39Z","title_canon_sha256":"4e317ffa0fcc165e0d1a81c33e6cfee914c0045074358901242b5b8ed249f92e"},"schema_version":"1.0","source":{"id":"1801.01253","kind":"arxiv","version":1}},"canonical_sha256":"bd4c0b5d566f1cc495335b2c275bbd442f13269c9407a210784be954eb226340","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd4c0b5d566f1cc495335b2c275bbd442f13269c9407a210784be954eb226340","first_computed_at":"2026-05-18T00:26:42.637482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:42.637482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wWxPwg/TGQWzv1os4JHwzpf+Zwi6lSbUNX8ndaEjalG9XmJVcqLBA49KygWQqWRN93e9ThDzRUKcyTbCtg6NDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:42.638168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f7fba2de2f07d752a852dc18bd4cce1912e53e30aef4b94b30bac36e5370747","sha256:0d1f1e5ed1900ff10de55071dc8f9be937a6239ba4cf99c4d668cf8c4070df34"],"state_sha256":"b04ad0f24f10837768bfd08aad9dc79c90cb42094b3a3c95335e55923a983f38"}