{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EUWQAIXJN64CYURCUUGQXQIH5S","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":"8609ddbbba0d7784921604f9026ed9c0b1d0a230958add44ffb6d8b116f4056a","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T19:07:31Z","title_canon_sha256":"5fa6dbeea93ff043982da61b94bdb29e68cc0624f9301d39e3a81c58f19d7908"},"schema_version":"1.0","source":{"id":"1605.03933","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03933","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03933v1","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03933","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"EUWQAIXJN64C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUWQAIXJN64CYURC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUWQAIXJ","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1217ce633331794c1d10f19e8220e9dd997476e26bc8527870827509da0cab14","target":"graph","created_at":"2026-05-18T01:14:59Z","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":"Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top $K$ items from noisy pairwise comparisons. In our setting, we are non-actively given $r$ pairwise comparisons between each pair of $n$ items, where each comparison has noise constrained by a very general noise model called the strong stochastic transitivity (SST) model. We analyze the competitive ratio of algorithms for the top-$K$ problem. In particular, we present a linear time algorithm for the top-$K$ problem which has a competitive ratio of $","authors_text":"Jieming Mao, Jon Schneider, Sivakanth Gopi, Xi Chen","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T19:07:31Z","title":"Competitive analysis of the top-K ranking problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03933","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:4d4686900eb6501d268864922290a3fa07aafe4040de169fbccfdcc289ff694d","target":"record","created_at":"2026-05-18T01:14:59Z","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":"8609ddbbba0d7784921604f9026ed9c0b1d0a230958add44ffb6d8b116f4056a","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T19:07:31Z","title_canon_sha256":"5fa6dbeea93ff043982da61b94bdb29e68cc0624f9301d39e3a81c58f19d7908"},"schema_version":"1.0","source":{"id":"1605.03933","kind":"arxiv","version":1}},"canonical_sha256":"252d0022e96fb82c5222a50d0bc107ec8a154d4a318bcce104ecc49b2775f552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"252d0022e96fb82c5222a50d0bc107ec8a154d4a318bcce104ecc49b2775f552","first_computed_at":"2026-05-18T01:14:59.186144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:59.186144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6+aV6/gjNy9lEObpMCWMy9LFan9WJeYMHXKhQBKmAeOaHiQBaksopi2dfeJpg84b6jAj/E+p+tVxoFOdOZRjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:59.186664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03933","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d4686900eb6501d268864922290a3fa07aafe4040de169fbccfdcc289ff694d","sha256:1217ce633331794c1d10f19e8220e9dd997476e26bc8527870827509da0cab14"],"state_sha256":"084499d99c2db45d47c8d9cc0604073de706ea9f43a310315f0e9109d7ce60df"}