{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EUWQAIXJN64CYURCUUGQXQIH5S","short_pith_number":"pith:EUWQAIXJ","schema_version":"1.0","canonical_sha256":"252d0022e96fb82c5222a50d0bc107ec8a154d4a318bcce104ecc49b2775f552","source":{"kind":"arxiv","id":"1605.03933","version":1},"attestation_state":"computed","paper":{"title":"Competitive analysis of the top-K ranking problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.DS","authors_text":"Jieming Mao, Jon Schneider, Sivakanth Gopi, Xi Chen","submitted_at":"2016-05-12T19:07:31Z","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 $"},"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":"1605.03933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T19:07:31Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"5fa6dbeea93ff043982da61b94bdb29e68cc0624f9301d39e3a81c58f19d7908","abstract_canon_sha256":"8609ddbbba0d7784921604f9026ed9c0b1d0a230958add44ffb6d8b116f4056a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:59.186664Z","signature_b64":"6+aV6/gjNy9lEObpMCWMy9LFan9WJeYMHXKhQBKmAeOaHiQBaksopi2dfeJpg84b6jAj/E+p+tVxoFOdOZRjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"252d0022e96fb82c5222a50d0bc107ec8a154d4a318bcce104ecc49b2775f552","last_reissued_at":"2026-05-18T01:14:59.186144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:59.186144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive analysis of the top-K ranking problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.DS","authors_text":"Jieming Mao, Jon Schneider, Sivakanth Gopi, Xi Chen","submitted_at":"2016-05-12T19:07:31Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03933","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":"1605.03933","created_at":"2026-05-18T01:14:59.186229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03933v1","created_at":"2026-05-18T01:14:59.186229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03933","created_at":"2026-05-18T01:14:59.186229+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUWQAIXJN64C","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUWQAIXJN64CYURC","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUWQAIXJ","created_at":"2026-05-18T12:30:15.759754+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/EUWQAIXJN64CYURCUUGQXQIH5S","json":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S.json","graph_json":"https://pith.science/api/pith-number/EUWQAIXJN64CYURCUUGQXQIH5S/graph.json","events_json":"https://pith.science/api/pith-number/EUWQAIXJN64CYURCUUGQXQIH5S/events.json","paper":"https://pith.science/paper/EUWQAIXJ"},"agent_actions":{"view_html":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S","download_json":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S.json","view_paper":"https://pith.science/paper/EUWQAIXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03933&json=true","fetch_graph":"https://pith.science/api/pith-number/EUWQAIXJN64CYURCUUGQXQIH5S/graph.json","fetch_events":"https://pith.science/api/pith-number/EUWQAIXJN64CYURCUUGQXQIH5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S/action/storage_attestation","attest_author":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S/action/author_attestation","sign_citation":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S/action/citation_signature","submit_replication":"https://pith.science/pith/EUWQAIXJN64CYURCUUGQXQIH5S/action/replication_record"}},"created_at":"2026-05-18T01:14:59.186229+00:00","updated_at":"2026-05-18T01:14:59.186229+00:00"}