{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UHZYAWCAVX34ZDLMFGU2SVNLMJ","short_pith_number":"pith:UHZYAWCA","canonical_record":{"source":{"id":"1806.02970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T05:04:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"711dae91ee9737cf1d65ae0d043457fb4c568d5b7d73f4e04ae46fb22bd39b90","abstract_canon_sha256":"b62c0efc6eafe2d7879d643d9d6994c5de685247d7fbaea1dbd0a507386f76d3"},"schema_version":"1.0"},"canonical_sha256":"a1f3805840adf7cc8d6c29a9a955ab624032621477442954b3c13d2b24b1ace7","source":{"kind":"arxiv","id":"1806.02970","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UHZYAWCAVX34ZDLMFGU2SVNLMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T05:04:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"711dae91ee9737cf1d65ae0d043457fb4c568d5b7d73f4e04ae46fb22bd39b90","abstract_canon_sha256":"b62c0efc6eafe2d7879d643d9d6994c5de685247d7fbaea1dbd0a507386f76d3"},"schema_version":"1.0"},"canonical_sha256":"a1f3805840adf7cc8d6c29a9a955ab624032621477442954b3c13d2b24b1ace7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:11.303465Z","signature_b64":"uTSW3ZAr08dKUDRNkG9lRNqCdVRXl4p4zMZeNCV0rdzQHDLN9LPyeYV/pd04kREQht+qRmqe/S23SlbvHkA0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1f3805840adf7cc8d6c29a9a955ab624032621477442954b3c13d2b24b1ace7","last_reissued_at":"2026-05-18T00:06:11.302815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:11.302815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02970","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Obyv3oAKxrVNFdQpKhl7QET340QV/cYY00cLyKfRSn4nVxM5fjeJFfoGxCgfGYBhbTTR/Llo52WnoXKLqMetDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:52:56.636085Z"},"content_sha256":"63363466ac9701d50d72299e1fe15394eecdc74b739d63fe7e2c2c82fbd70794","schema_version":"1.0","event_id":"sha256:63363466ac9701d50d72299e1fe15394eecdc74b739d63fe7e2c2c82fbd70794"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UHZYAWCAVX34ZDLMFGU2SVNLMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jia Liu, Ness B. Shroff, Wenbo Ren","submitted_at":"2018-06-08T05:04:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02970","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRq9doraig/h9LBqOQDZ4mG3l77KiUQ6O0F4cMK2XzDJ/R8/CYuSpUOdXTWHiN5hi6hQRqey4skgGgY1xA3ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:52:56.636830Z"},"content_sha256":"4cc29a2ff41c6da5ffae37582a4365496ca9877504cacd43e7b05030bb0e5047","schema_version":"1.0","event_id":"sha256:4cc29a2ff41c6da5ffae37582a4365496ca9877504cacd43e7b05030bb0e5047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ/bundle.json","state_url":"https://pith.science/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T03:52:56Z","links":{"resolver":"https://pith.science/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ","bundle":"https://pith.science/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ/bundle.json","state":"https://pith.science/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHZYAWCAVX34ZDLMFGU2SVNLMJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YhnogktEi8IwSxyLq4whEHGAivekwxT0Argnc2vJZ1vZ0+d/lBN1/e36zobbp5mYCP7euqBUkwm35ZgVhLXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:52:56.640842Z","bundle_sha256":"87405b73f9837e5a39e04cef7cddc6ccf899b025facb5770d8309cf927ec922d"}}