{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UHZYAWCAVX34ZDLMFGU2SVNLMJ","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":"b62c0efc6eafe2d7879d643d9d6994c5de685247d7fbaea1dbd0a507386f76d3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T05:04:34Z","title_canon_sha256":"711dae91ee9737cf1d65ae0d043457fb4c568d5b7d73f4e04ae46fb22bd39b90"},"schema_version":"1.0","source":{"id":"1806.02970","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02970","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02970v2","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02970","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"UHZYAWCAVX34","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UHZYAWCAVX34ZDLM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UHZYAWCA","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:4cc29a2ff41c6da5ffae37582a4365496ca9877504cacd43e7b05030bb0e5047","target":"graph","created_at":"2026-05-18T00:06:11Z","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":"This paper explores the adaptive (active) PAC (probably approximately correct) top-$k$ ranking (i.e., top-$k$ item selection) and total ranking problems from $l$-wise ($l\\geq 2$) comparisons under the multinomial logit (MNL) model. By adaptively choosing sets to query and observing the noisy output of the most favored item of each query, we want to design ranking algorithms that recover the top-$k$ or total ranking using as few queries as possible. For the PAC top-$k$ ranking problem, we derive a lower bound on the sample complexity (aka number of queries), and propose an algorithm that is sam","authors_text":"Jia Liu, Ness B. Shroff, Wenbo Ren","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T05:04:34Z","title":"PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02970","kind":"arxiv","version":2},"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:63363466ac9701d50d72299e1fe15394eecdc74b739d63fe7e2c2c82fbd70794","target":"record","created_at":"2026-05-18T00:06:11Z","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":"b62c0efc6eafe2d7879d643d9d6994c5de685247d7fbaea1dbd0a507386f76d3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T05:04:34Z","title_canon_sha256":"711dae91ee9737cf1d65ae0d043457fb4c568d5b7d73f4e04ae46fb22bd39b90"},"schema_version":"1.0","source":{"id":"1806.02970","kind":"arxiv","version":2}},"canonical_sha256":"a1f3805840adf7cc8d6c29a9a955ab624032621477442954b3c13d2b24b1ace7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1f3805840adf7cc8d6c29a9a955ab624032621477442954b3c13d2b24b1ace7","first_computed_at":"2026-05-18T00:06:11.302815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:11.302815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uTSW3ZAr08dKUDRNkG9lRNqCdVRXl4p4zMZeNCV0rdzQHDLN9LPyeYV/pd04kREQht+qRmqe/S23SlbvHkA0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:11.303465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02970","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63363466ac9701d50d72299e1fe15394eecdc74b739d63fe7e2c2c82fbd70794","sha256:4cc29a2ff41c6da5ffae37582a4365496ca9877504cacd43e7b05030bb0e5047"],"state_sha256":"b8b97ad035d0b5d438ad6159f4b60ce1bfedcca57e41dfd6ff25e4e20524c17a"}