{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WQTOUHCD3RVESJG4LAULAOJF7O","short_pith_number":"pith:WQTOUHCD","canonical_record":{"source":{"id":"1707.08238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-25T22:03:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a4ff96336100b0132dc65b658f036b49da9a43f32bd4585c8781e114f252d188","abstract_canon_sha256":"d388bb726029bf6ef17866530f8b71190f9e82f5fcd81f3d89f2182be2d9b60c"},"schema_version":"1.0"},"canonical_sha256":"b426ea1c43dc6a4924dc5828b03925fbbcbeb12c1b50b79cfbe61d1b3b23d177","source":{"kind":"arxiv","id":"1707.08238","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08238","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08238v2","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08238","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"WQTOUHCD3RVE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WQTOUHCD3RVESJG4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WQTOUHCD","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WQTOUHCD3RVESJG4LAULAOJF7O","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-25T22:03:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a4ff96336100b0132dc65b658f036b49da9a43f32bd4585c8781e114f252d188","abstract_canon_sha256":"d388bb726029bf6ef17866530f8b71190f9e82f5fcd81f3d89f2182be2d9b60c"},"schema_version":"1.0"},"canonical_sha256":"b426ea1c43dc6a4924dc5828b03925fbbcbeb12c1b50b79cfbe61d1b3b23d177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.714030Z","signature_b64":"sgyCGyfKl12Me8XQPfN9e53qwfDS1NkQcP3UXQuu/UDYOLyxvmlGh5yM/cdultKMJsBPXHVsAJ0axTr9tsNXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b426ea1c43dc6a4924dc5828b03925fbbcbeb12c1b50b79cfbe61d1b3b23d177","last_reissued_at":"2026-05-18T00:39:11.713291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.713291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08238","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:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUAtEABETKBsRKFZ5Jw+xAf7uSTxozy/kZSULETPRzDdjyWexOJuPJR23vxv6P+4igmCNQs9oJr7ILuqElOACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:47:19.375638Z"},"content_sha256":"49ba36b48fe940d212c8db740f4cfd6a9aca2890080d202cecf22bbcd1cee918","schema_version":"1.0","event_id":"sha256:49ba36b48fe940d212c8db740f4cfd6a9aca2890080d202cecf22bbcd1cee918"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WQTOUHCD3RVESJG4LAULAOJF7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Jieming Mao, Xi Chen, Yuanzhi Li","submitted_at":"2017-07-25T22:03:21Z","abstract_excerpt":"We study the active learning problem of top-$k$ ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top-$k$ items with high probability by adaptively querying sets for comparisons and observing the noisy output of the most preferred item from each comparison. To achieve this goal, we design a new active ranking algorithm without using any information about the underlying items' preference scores. We also establish a matching lower bound on the sample complexity even when the set of preference scores is given to the algorithm. These two res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08238","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:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEKcSL4HJT8/REva+VcRT7a2hoJisCzVtgRCCt/bnf9xG5LT0ocwEgrrkjnwDVzuGQpixJd6GphUVrXf+POuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:47:19.376530Z"},"content_sha256":"96cda03b4bb553260ab8980d31d30530e0958190c73d5cac6e3749935d2c3da2","schema_version":"1.0","event_id":"sha256:96cda03b4bb553260ab8980d31d30530e0958190c73d5cac6e3749935d2c3da2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQTOUHCD3RVESJG4LAULAOJF7O/bundle.json","state_url":"https://pith.science/pith/WQTOUHCD3RVESJG4LAULAOJF7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQTOUHCD3RVESJG4LAULAOJF7O/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-08-08T15:47:19Z","links":{"resolver":"https://pith.science/pith/WQTOUHCD3RVESJG4LAULAOJF7O","bundle":"https://pith.science/pith/WQTOUHCD3RVESJG4LAULAOJF7O/bundle.json","state":"https://pith.science/pith/WQTOUHCD3RVESJG4LAULAOJF7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQTOUHCD3RVESJG4LAULAOJF7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WQTOUHCD3RVESJG4LAULAOJF7O","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":"d388bb726029bf6ef17866530f8b71190f9e82f5fcd81f3d89f2182be2d9b60c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-25T22:03:21Z","title_canon_sha256":"a4ff96336100b0132dc65b658f036b49da9a43f32bd4585c8781e114f252d188"},"schema_version":"1.0","source":{"id":"1707.08238","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08238","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08238v2","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08238","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"WQTOUHCD3RVE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WQTOUHCD3RVESJG4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WQTOUHCD","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:96cda03b4bb553260ab8980d31d30530e0958190c73d5cac6e3749935d2c3da2","target":"graph","created_at":"2026-05-18T00:39: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":"We study the active learning problem of top-$k$ ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top-$k$ items with high probability by adaptively querying sets for comparisons and observing the noisy output of the most preferred item from each comparison. To achieve this goal, we design a new active ranking algorithm without using any information about the underlying items' preference scores. We also establish a matching lower bound on the sample complexity even when the set of preference scores is given to the algorithm. These two res","authors_text":"Jieming Mao, Xi Chen, Yuanzhi Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-25T22:03:21Z","title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08238","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:49ba36b48fe940d212c8db740f4cfd6a9aca2890080d202cecf22bbcd1cee918","target":"record","created_at":"2026-05-18T00:39: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":"d388bb726029bf6ef17866530f8b71190f9e82f5fcd81f3d89f2182be2d9b60c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-25T22:03:21Z","title_canon_sha256":"a4ff96336100b0132dc65b658f036b49da9a43f32bd4585c8781e114f252d188"},"schema_version":"1.0","source":{"id":"1707.08238","kind":"arxiv","version":2}},"canonical_sha256":"b426ea1c43dc6a4924dc5828b03925fbbcbeb12c1b50b79cfbe61d1b3b23d177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b426ea1c43dc6a4924dc5828b03925fbbcbeb12c1b50b79cfbe61d1b3b23d177","first_computed_at":"2026-05-18T00:39:11.713291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:11.713291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sgyCGyfKl12Me8XQPfN9e53qwfDS1NkQcP3UXQuu/UDYOLyxvmlGh5yM/cdultKMJsBPXHVsAJ0axTr9tsNXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:11.714030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08238","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49ba36b48fe940d212c8db740f4cfd6a9aca2890080d202cecf22bbcd1cee918","sha256:96cda03b4bb553260ab8980d31d30530e0958190c73d5cac6e3749935d2c3da2"],"state_sha256":"4c93c4d252a49159d493c573639d057bd57d8eea061c09a35343969a647bb33f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOlFAEagAN+hQQSBGsoUbgphU/0TCLypKb2X+32ScWfbCX8U4/ZSmILNXY4HMAlYgdv3mXCfCoOeUmqfwDBmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:47:19.383126Z","bundle_sha256":"0398dbffbd589ac4bb1e7a5b14155202e0310bdd1fde9383bf6eb164a91014db"}}