{"as_of":"2026-08-18T05:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0cbd6ae4811dce51fa60b75381fe87895e9b20b9029c92d59f3b222988af9c7b","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T01:16:53.892149Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.08979/citation-record","integrity":"/paper/2607.08979/integrity","json":"/paper/2607.08979/citation-record.json","paper":"/paper/2607.08979"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Li, Tianle and Li, Dacheng and Zhu, Banghua and Zhang, Hao and Jordan, Michael I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:51b7e93c987d01966daabdd082f4cbd6c8e19138302451e6189f1241a6d7e8a4","observation_id":"4c4442ae-6221-4d63-8d96-d7545a0f670a","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Chen, Ted Hsuan Yun , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:f745c6085446455ffbcbfb19b5f565feaa8c61b7e7a73bde7d91467c32672f15","observation_id":"5c38e8cd-8138-4d61-9908-5b7cb95f97a6","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 2017 ACM International Conference on Management of Data , address =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:41b93cc97d59eec4a1165ae5159740df787c1c649ccc51ed2f9031cbb55f7c30","observation_id":"d79ce95b-a75d-416b-8662-d80d9e38103d","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Collins-Thompson, Kevyn and Horvitz, Eric , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:d6e85ba4d4c14e81fd2cc273fb5ec5ec1a019823422b08c5902b291de05352c7","observation_id":"9a6c4496-7992-4047-ae6a-c7c0f736fc35","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 12th ACM Conference on Recommender Systems , address =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:e7ee3f08617744f59aabbc521c73ed07151e6ba7dd85b91ff7fc4592ef60e91f","observation_id":"67ac6801-6893-4189-bd00-9bc582581456","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Identification of the Generalized Condorcet Winner in Multi-dueling Bandits , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:0a50387ea6ac2777fcb9880f3b5986e694d477ee4624e1f76dbfa8c73caa45d9","observation_id":"b0847be9-fc79-44f2-bab5-48e7933653ea","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:00df3e26c0abddba12f872d1fdee945bf136c1b47879621ead1affc3d544ec26","observation_id":"1f344da3-38b8-4f21-b65e-089af44d5dbe","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the Thirty-Second Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:1f4aff41100cf7665f616f2856eb8116d851c58fd4626246827346e40800cad7","observation_id":"e871730a-2969-4f1b-a6e1-e50e71268b0d","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"IEEE Transactions on Information Theory , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:dd3de7c4bc5a6b90ab5a304ecd923d1b10a19eeee3bde4e7539fa02c87cb22bf","observation_id":"a8e34d08-ece2-44b2-b518-950eb7d7ca22","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:315fecacc1c876f15fe226f7886d64dcb652704bcdefaf9634c15c74f5fe51e8","observation_id":"ff0a69fb-d49a-479b-aebb-0d5e0b52f6dd","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:93a1aa20cd7d157265e4723f89fd9c61710b3d7390c9efe55972196af1dc95f4","observation_id":"5ebf7fff-7d25-4805-9d0b-648bfccc54bc","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Journal of Machine Learning Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:8415e72519df01b775e3be759e93c311b76cf27930ee0fd8f86330271ae0c577","observation_id":"c3eeeb87-f3c9-4ae5-b3f2-f96c83a2c630","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 29th Annual Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:e7be987bec1ff3009aed4eb43d451c4d8c72af1181c43f5069ad04aa741bfd06","observation_id":"79ee0fde-c548-44a9-8d10-088ae425dc57","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Journal of Machine Learning Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:2bbf75628616de9e22905629368b5c9b882c782f2c9c87d9c6b738873f503858","observation_id":"645cd39f-4165-43d3-8fa7-9107890dfb33","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 30th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:9a41a20dfb65487c18ee6d79fab3366ed0a90fe39956432b8542227d86b8c2ae","observation_id":"858b26ec-a796-40fb-9168-fbe2c6c862b4","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 37th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:7c2742353cdb2bfc68ce565f0f8ba54da81c14f4a29342a1a05d3a5c396621e4","observation_id":"9e51f5f9-ec4b-4b6e-b96f-90a656baabfa","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:cd913ddfda00eeffa77840d09cd892289ab8b7c1cd73b858c5a79ffe0af6bcb0","observation_id":"d8153b63-4382-46ca-8ec4-e124b3fc2f9e","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":", journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:68abd16e9e11ba07f8c880ec0c99006a9f0eb9b0529e943c710ac75279d7331b","observation_id":"5ecbb13c-c11e-49b6-aa86-063c08eef9e0","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Ramchandran, Kannan and Wainwright, Martin J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:9c8e2045d41fd2d58c2a0cac147092fc53f89c1beb4afc12d8a8fbdd01a41be9","observation_id":"030ab4fb-8273-470e-aee4-3b2ecdc5c27c","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 34th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:4417ea8a4e814b13e587a90be3ca4ee366a7fa166c0124b12f9ebb2e900b46b3","observation_id":"b119c727-0f97-430e-aec9-b14676926451","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"The Annals of Statistics , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:301c0be1e7a25f12f1125559f5237316b32320b831032227a7bf033c3d52063d","observation_id":"fd0b807b-5d45-4fb7-9fa9-4a7104b7e97b","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Operations Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:d4bc719f541614609d0bb7050e0cb083e9f70a54763f4494274de96290b09d68","observation_id":"75fc2edd-ec1b-4967-8aa3-74d8f08b4ec1","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Proceedings of the 33rd International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:9b5a6ed3a89d3488e4d0ddc87bc03d3e894e79beaea03b7e8186cf9cd0e00861","observation_id":"8ae2749e-8707-426a-911e-5664e6c5403f","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Spectral","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:d81315aabf3033bac68377d612b4d02eb198edde55132cb06d181bc3c10e9950","observation_id":"fdc6dd14-47aa-4685-a5bf-f49ae9b56b0a","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Advances in Neural Information Processing Systems 27 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:561679a1b410d37e0fe75e108195be0b8337e47cc14e214e5036df25d645300c","observation_id":"40611cc3-3821-4e4c-a696-6b85799f671e","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Non-Asymptotic Pure Exploration by Solving Games , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:ed617b7d8a5be36618bf382739058158bda6547992f7958f376b273821db3793","observation_id":"f51f4ce0-5eb4-4266-865e-3560fb2bedbf","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Gamification of Pure Exploration for Linear Bandits , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:f17010e80742c4216eae772caa1e270d07a0b93625f8d885a04b926fd974a5f0","observation_id":"279cb818-d168-49a9-898f-cf99bac983e0","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Optimal Best-Arm Identification in Linear Bandits , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:fb955563d95ef76685952ba56a9e691a091393f512d0b6d25afb2b58115295ce","observation_id":"7d2a47c0-c64e-423e-830b-6e6d897dadd7","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Fast Pure Exploration via Frank-Wolfe , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:2821f98a601d44adcbf82442af98daf7137ef7b81f0bcc8a8eb75fa03ed1199e","observation_id":"7db4d1bd-15b4-46ac-8c26-0186ad0c63ac","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Journal of Machine Learning Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:fd1ee625e5a6408ae6256428c5b967821fe460b60e844626347bb432590ee4f3","observation_id":"48a351e9-bea4-441c-8d99-3cd716a991c1","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Advances in Neural Information Processing Systems 24 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:789261ee388899474629bc6176579ec544a6cbb89c76c489788b74b62eff1f0a","observation_id":"8032dff4-2627-4225-9dc3-c60479f2c24f","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Foundations and Trends in Machine Learning , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:53f37bbe2aa2242903fc0201a70ee06d6d6d98b8e4698d9877def487c7b93b4f","observation_id":"b77c777c-d642-4825-a4e6-a4fa7fce85ae","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Foundations and Trends in Optimization , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:6d6531ece16187c56b6e7c0852976cc778962a123ade8ca361a6ef31d1385f85","observation_id":"38455298-c71d-49f8-8c65-961414208429","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Theory of Computing , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:eb15a6c8e82aa38234140e1470acecdf5f44f62fa3953110b8ef22ede921cb41","observation_id":"c43e3696-9e99-49db-8101-97f8095195a5","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"2020 , publisher =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:e5dfa24dd295036408a477c55284bdafd3b11a3d4166afa1fc431aec5ba72085","observation_id":"2a4fe768-5b90-4d51-b34b-ec995556c436","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:686b2b1bdcc41b6a04088dba71ab8d9dcb73aeb5c4df8642b396705095bca9fb","observation_id":"d82820ad-a35b-4404-a42e-31ba63b3f43a","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"The multiplicative weights update method: a meta-algorithm and applications","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:29472c48cf8a7e34d32fb4dde80eba19df3b7d9ed84eb18ee19f9c6468f092c2","observation_id":"ab3e5a8a-1ab2-4eaf-b211-ac56a4df102a","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Preference-based online learning with dueling bandits: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:2417dbf3015af2cc88b99bc0631e3f34e9c1cc81fc83c8aed64c8513affb195d","observation_id":"fdd85a9e-c444-41fe-bfc2-fa71769be501","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Sorted top-k in rounds","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:0fbdb7061862b88a2d5cc9708753442a00450236ff052f5ad1bcd9d9c8492a84","observation_id":"b7127a82-8de4-4357-b5eb-0fb2aed02f98","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"o r \\'e nyi, B., Weng, P., Cheng, W., and H \\","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:7a13b2b45e8ebdcd8ed74a61aa738791ccda59b1469aa739db8500221a6cffe5","observation_id":"3121f318-2a12-43d8-bf92-8c108fce6982","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"N., Collins-Thompson, K., and Horvitz, E","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:930b354e6785912a048d3729b5ea47db447005eb87edc94f28f2bb0cb264ce0c","observation_id":"aa4f2a0b-b74b-4c50-ad6c-0c948c30f1ba","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"A nearly instance optimal algorithm for top- k ranking under the multinomial logit model","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:4398e0181aef5663e0d4de9e499c1155d9b44b4370ac59b1d92197d0f792947f","observation_id":"7c4b3979-60f9-45a9-9a4f-ef3e938a45b4","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Suh, C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:c39b3c4a37ae6b3d70b07b0d96dece185f9f79e8faa70cf81db950504b721810","observation_id":"3d4833ef-86e6-4194-81f2-ff5ef46fb3f1","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Spectral method and regularized MLE are both optimal for Top - K ranking","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:6b1aa4086bc9ab144dc28e40cf5a1233c608caf4324e1abe6a5cd6d8d915dcb7","observation_id":"827de813-3a92-4973-882f-fafed31b8bb0","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"N., Li, T., Li, D., Zhu, B., Zhang, H., Jordan, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:bd0066d42b76c6f060c80bbb00373cb0001ccd09509e31dae79c9bcf809a1f86","observation_id":"1734085a-1fd4-4126-9ad7-9a314ec40529","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"M., and M \\'e nard, P","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:958338e7d137175181bb637a6cda8bb5fb64378c98a22b56ea8a0f875c182752","observation_id":"f7ab35aa-0567-48bf-bb2a-4e32934ea9b8","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Gamification of pure exploration for linear bandits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:02b8b50c7899b4512bafd98320a1b3e381c55c65e02dcc6c94ca820b82ee2b65","observation_id":"53105c38-3ee8-43bc-9bc7-70ee3c99c0e4","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Kaufmann, E","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:d0234fccfad5ba835da1fa6e52c4aea97224a85b87ba7a7220b59038c71e8745","observation_id":"1a9a31dc-9b78-4b3d-9932-e307aac5efd6","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Identification of the generalized condorcet winner in multi-dueling bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:784d5be964a4d5c9fbd8a20b67b5d4da1371d89aecdcba8f55b904439d7aec3b","observation_id":"d4ee4d01-03e7-4e08-bba9-fb6db3f69414","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Minimax-optimal inference from partial rankings","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:a0818be63b7438d58ea86835c76b7861825c91306e41f2435348c9cb4686450f","observation_id":"78bf0671-7470-42fc-848e-f5a9a59d4dd4","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:c6b607251204ead97b466e56ad0ef167fa92497b3a1ff5764a74e9510c3caae7","observation_id":"ee3db2b3-acc8-4005-be37-301d7b0461a7","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"B., Ramchandran, K., and Wainwright, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:84ae8a20c83391698c2322172eac827674677bf3230a40e342900cd696529f0d","observation_id":"c561eb2b-b0b2-4447-a0a3-0d5935a95e65","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.04153","last_updated":"2016-03-14T07:01:28Z","snapshot_observed_at":"2026-08-14T22:06:13.939250Z","submitted_at":"2016-03-14T07:01:28Z","title":"Top-$K$ Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.04153","snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Top- K ranking from pairwise comparisons: When spectral ranking is optimal","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"cited_paper":"/paper/1603.04153","citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:f196bb4e9aed94fbe7eab6f9131672905ff64e7a82cc8db0fa2ef97f73db2570","observation_id":"d29ec107-c375-4899-ab6d-5a87174a060c","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Prouti \\`e re, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:8dc24c76bfc0ccc0395285d0db661e300f9e3c9f333d9d3248c746b7786c5319","observation_id":"ba90e360-4d1b-4563-8d5e-7511c7549c52","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Eliciting pairwise preferences in recommender systems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:281ab50df4be80225473e8d8b260475353240f719a149ba0db4d7519445b3b4a","observation_id":"d112e88a-8893-4c16-858e-7ee052019127","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Koolen, W","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:e48fd06a08d19d6d8a8edc9d33190cd5c676c3705efbfdb6f6704f3ab0572e5e","observation_id":"e2b95e0a-fdac-4197-8a75-34b6ebf3a018","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"On the complexity of best-arm identification in multi-armed bandit models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:645b53d98e138724a24f5467d508ae14a42131e0ab89ee4424476913fa0a46f4","observation_id":"4b401999-318b-4692-9fc7-32a379ae0538","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Oh, S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:a1d8a2b7487c93b16a7fe7263dc8bde5b8a526d707bc5ac8449683dc0844c007","observation_id":"38de1b41-c5a7-4a67-ab51-ce0bbd85306f","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"M., Li, Y., Wang, H., U, L","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:cf3d394d6dcafb3843c068befcfff676328616f8b437cffcdbae9596a6128f3c","observation_id":"7ae89f92-385f-4948-87ec-172cfc16c0b0","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Szepesv \\'a ri, C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:0e65ae99e53eae6f3fa2b678be9c9609d70b578107e0adf27758a1e4760b0498","observation_id":"d626a15f-53c1-4acd-bb0a-5d28987afea5","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Active learning for top- k rank aggregation from noisy comparisons","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:05ef06f75c8068bb320c48f705bc4c8b9a89e7b87b1202e167735f0b25a2dd6b","observation_id":"cce59895-b97d-4d50-b53a-2a2bb98f6299","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"G., and Chen, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:6d6ea8d5c60192b19b0d3fdcb2a86d0c085abbfa49d930dccfed39a4f2fed4fc","observation_id":"a7ec41cf-ade9-403b-8bd2-7f5d2679931f","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Rank centrality: Ranking from pairwise comparisons","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:f44d8bc3b365e236be291e07817d098b8416f9710531c8a9d1af5803f7bf0936","observation_id":"99bf903a-23bb-45b2-be5f-94e2d5f74fa4","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.02970","last_updated":"2018-09-10T01:08:47Z","snapshot_observed_at":"2026-08-14T19:06:12.234741Z","submitted_at":"2018-06-08T05:04:34Z","title":"PAC Ranking from Pairwise and Listwise Queries: Lower Bounds and Upper Bounds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.02970","snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"cited_paper":"/paper/1806.02970","citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:6b71d5ccf4a4027c8d5ba095a28433de6d62113918123bcc98b44e1faf822ab8","observation_id":"7e9cae4a-67a7-48bb-a1e9-59dcb3bfc2fb","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:5f46fd7cc924af55c1808b195ed1d17cab4e3ee5480897fd0ec6affd87f97fb0","observation_id":"65db77a5-c561-4738-a013-d1cbd720e472","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Gopalan, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:fabdba62cd1f9b4c08ed7c9f792672fa7353061d7581fdd4dacc017d90f2cfe1","observation_id":"8429eced-e711-4bdf-902f-3db82467ebbe","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"and Gopalan, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:068ff793c916590aa60120ebb7685356f188628184a7b254d0fbfd3afe48117d","observation_id":"dcd817d4-7d9d-4125-80b8-3ac9cd3f6950","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"B., Balakrishnan, S., Guntuboyina, A., and Wainwright, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:f9d9e974ef4a076fba343110244e0728ea6e0c8bbf040de8356ca771288bd4c7","observation_id":"9dcec84b-ecd2-4938-8711-a750c34f9aa6","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Online learning and online convex optimization","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:713ee05ea427bdcf78f3874999ad840a7901e73925794e1a89b67fc918436e20","observation_id":"ecf3b150-abfe-4a2e-881e-f0d93eb59d97","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Fast pure exploration via frank-wolfe","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:127ffa78899ce6544905d5123ee5793f2d9ece159bbe529a2d88a23b639a889a","observation_id":"638e3392-82c1-43d0-857c-701a15bfdde1","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:16:53.892149Z","title":"Dueling bandits with qualitative feedback","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-13T01:16:53.892149Z"},"links":{"citing_paper":"/paper/2607.08979"},"observation_digest":"sha256:75df0e4d1fdaad63a4e20baaadda026826287ac83eca1c0edf9f0b2fb4e90221","observation_id":"e0942ff2-5c74-48e4-8d03-dfccc291753d","resolution":{"observed_at":"2026-07-13T01:16:53.892149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.08979","last_updated":"2026-07-09T22:55:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T17:50:30.757304Z","submitted_at":"2026-07-09T22:55:16Z","title":"Optimal Top-$k$ Identification from Pairwise Comparisons"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":71,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":71},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2607.08979."}