{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MHIIBZPVWGXRGOO62QJN6DBZQO","short_pith_number":"pith:MHIIBZPV","canonical_record":{"source":{"id":"1906.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T15:24:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b50a3ffab0572fca925d92126275cf5882c9bf16b5d3b82336c2940c53a73ccd","abstract_canon_sha256":"94b838d73469f8d866641f41ea967e757762c4aafaf40324102f0eb331dcd191"},"schema_version":"1.0"},"canonical_sha256":"61d080e5f5b1af1339ded412df0c398393c95e0d975eddf7d66035d08b257598","source":{"kind":"arxiv","id":"1906.05208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05208","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05208v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05208","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"MHIIBZPVWGXR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MHIIBZPVWGXRGOO6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MHIIBZPV","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MHIIBZPVWGXRGOO62QJN6DBZQO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T15:24:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b50a3ffab0572fca925d92126275cf5882c9bf16b5d3b82336c2940c53a73ccd","abstract_canon_sha256":"94b838d73469f8d866641f41ea967e757762c4aafaf40324102f0eb331dcd191"},"schema_version":"1.0"},"canonical_sha256":"61d080e5f5b1af1339ded412df0c398393c95e0d975eddf7d66035d08b257598","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.193672Z","signature_b64":"iXDwgF7TG9rYPgIOc6StLhhydqzoAn7FES8N6+j1lYlvRf2eStL0+XGnderERAbzLqHiy/w8WN16xrZwPGJFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d080e5f5b1af1339ded412df0c398393c95e0d975eddf7d66035d08b257598","last_reissued_at":"2026-05-17T23:43:29.193087Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.193087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05208","source_version":1,"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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlUZi5xprImCnpNK7H2iUXUfuoetHokcaPZrb/IbICWVwVcl0oZ+C0Qd55+eQ2alb6aqDzKrUUbOyw0OR3oABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:05:17.026485Z"},"content_sha256":"8bee9f558d4883a6ee2a533130ac76003af971e018ea51224e56d46194c11988","schema_version":"1.0","event_id":"sha256:8bee9f558d4883a6ee2a533130ac76003af971e018ea51224e56d46194c11988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MHIIBZPVWGXRGOO62QJN6DBZQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sorted Top-k in Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Jieming Mao, Mark Braverman, Yuval Peres","submitted_at":"2019-06-12T15:24:07Z","abstract_excerpt":"We consider the sorted top-$k$ problem whose goal is to recover the top-$k$ items with the correct order out of $n$ items using pairwise comparisons. In many applications, multiple rounds of interaction can be costly. We restrict our attention to algorithms with a constant number of rounds $r$ and try to minimize the sample complexity, i.e. the number of comparisons.\n  When the comparisons are noiseless, we characterize how the optimal sample complexity depends on the number of rounds (up to a polylogarithmic factor for general $r$ and up to a constant factor for $r=1$ or 2). In particular, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05208","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"},"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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cN7Y3R/rWWmStiP1dP4I2cUIlUxSRAiUxuYN+qCEsfKnww26x3tR4tT1sAB3OJE6TpazncPR6zDDG/DZT3rGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:05:17.027273Z"},"content_sha256":"80915267ae14780d146f1cbeb3c13124e504bd9bd60ce32d313747b54ad04064","schema_version":"1.0","event_id":"sha256:80915267ae14780d146f1cbeb3c13124e504bd9bd60ce32d313747b54ad04064"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHIIBZPVWGXRGOO62QJN6DBZQO/bundle.json","state_url":"https://pith.science/pith/MHIIBZPVWGXRGOO62QJN6DBZQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHIIBZPVWGXRGOO62QJN6DBZQO/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-12T00:05:17Z","links":{"resolver":"https://pith.science/pith/MHIIBZPVWGXRGOO62QJN6DBZQO","bundle":"https://pith.science/pith/MHIIBZPVWGXRGOO62QJN6DBZQO/bundle.json","state":"https://pith.science/pith/MHIIBZPVWGXRGOO62QJN6DBZQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHIIBZPVWGXRGOO62QJN6DBZQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MHIIBZPVWGXRGOO62QJN6DBZQO","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":"94b838d73469f8d866641f41ea967e757762c4aafaf40324102f0eb331dcd191","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T15:24:07Z","title_canon_sha256":"b50a3ffab0572fca925d92126275cf5882c9bf16b5d3b82336c2940c53a73ccd"},"schema_version":"1.0","source":{"id":"1906.05208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05208","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05208v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05208","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"MHIIBZPVWGXR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MHIIBZPVWGXRGOO6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MHIIBZPV","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:80915267ae14780d146f1cbeb3c13124e504bd9bd60ce32d313747b54ad04064","target":"graph","created_at":"2026-05-17T23:43:29Z","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 consider the sorted top-$k$ problem whose goal is to recover the top-$k$ items with the correct order out of $n$ items using pairwise comparisons. In many applications, multiple rounds of interaction can be costly. We restrict our attention to algorithms with a constant number of rounds $r$ and try to minimize the sample complexity, i.e. the number of comparisons.\n  When the comparisons are noiseless, we characterize how the optimal sample complexity depends on the number of rounds (up to a polylogarithmic factor for general $r$ and up to a constant factor for $r=1$ or 2). In particular, th","authors_text":"Jieming Mao, Mark Braverman, Yuval Peres","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T15:24:07Z","title":"Sorted Top-k in Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05208","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:8bee9f558d4883a6ee2a533130ac76003af971e018ea51224e56d46194c11988","target":"record","created_at":"2026-05-17T23:43:29Z","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":"94b838d73469f8d866641f41ea967e757762c4aafaf40324102f0eb331dcd191","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T15:24:07Z","title_canon_sha256":"b50a3ffab0572fca925d92126275cf5882c9bf16b5d3b82336c2940c53a73ccd"},"schema_version":"1.0","source":{"id":"1906.05208","kind":"arxiv","version":1}},"canonical_sha256":"61d080e5f5b1af1339ded412df0c398393c95e0d975eddf7d66035d08b257598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61d080e5f5b1af1339ded412df0c398393c95e0d975eddf7d66035d08b257598","first_computed_at":"2026-05-17T23:43:29.193087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:29.193087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iXDwgF7TG9rYPgIOc6StLhhydqzoAn7FES8N6+j1lYlvRf2eStL0+XGnderERAbzLqHiy/w8WN16xrZwPGJFCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:29.193672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bee9f558d4883a6ee2a533130ac76003af971e018ea51224e56d46194c11988","sha256:80915267ae14780d146f1cbeb3c13124e504bd9bd60ce32d313747b54ad04064"],"state_sha256":"4162f495a6b25f443d00f065ef949ced492753aebb46c07b6328f71ed296f2e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4Rurr12x8bKhTjOCJE99p3JTmDp2wlxqbNVn0YXzIu5vilCpqX0EUgBzZIs9TIoXKQ6rpt3nZBpUwObODXBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:05:17.031925Z","bundle_sha256":"6643711275e01679a710dbae52220aa7721cc94092d7e03e6e6b4f9c6aebda77"}}