{"as_of":"2026-08-19T14:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a29811f2bea13e5675e8b9ca00354d62e212879b10c2bedd08fe62a1d9ae628e","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:10:55.084026Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2608.12573/citation-record","integrity":"/paper/2608.12573/integrity","json":"/paper/2608.12573/citation-record.json","paper":"/paper/2608.12573"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.279331Z","title":"Best position al- gorithms for efficient top-k query processing.Information Systems, 36(6): 973–989, 2011","venue":null,"work_id":"42fc5089-7e0d-40a1-a687-fe3ca4e84a52","year":2011},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.024729Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:094169cf567079c95b2957d10750fe75b1802cc639bc4f07aba132fdd7e095c4","observation_id":"1c086fbc-fbfe-4c7d-8e98-2b5b9cf48e94","resolution":{"observed_at":"2026-08-16T00:10:55.283510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.268296Z","title":"Efficient top-k query processing on massively parallel hardware","venue":null,"work_id":"c1f64754-499d-4855-9876-3b60f6c8d7ec","year":2018},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.028981Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:3c7ebcda0048c7a4fd26967bc39a283a38102cfbb05dfbe1ddd6a788de567468","observation_id":"3eba05bf-e3d3-48d0-bf08-90fb101d7f25","resolution":{"observed_at":"2026-08-16T00:10:55.272641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.256049Z","title":"The sparsely-gated mixture-of-experts layer.Outrageously large neural networks, 2:2, 2017","venue":null,"work_id":"d3c043e7-75fe-4e7d-bcd1-7c4d172245ba","year":2017},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.033234Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:ebd72d9eb87e51bd06a057027e689f2b1f838dc12e3f8de8c8c1ef6788995a40","observation_id":"77fe530e-dcb6-4439-9e2c-8fd538c6e39a","resolution":{"observed_at":"2026-08-16T00:10:55.260423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.16668","last_updated":"2020-06-30T10:42:02Z","snapshot_observed_at":"2026-08-07T09:27:36.420559Z","submitted_at":"2020-06-30T10:42:02Z","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16668","snapshot_observed_at":"2026-08-16T00:10:55.037454Z","title":"Gshard: Scaling giant models with conditional computation and automatic sharding.arXiv preprint arXiv:2006.16668, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.037454Z"},"links":{"cited_paper":"/paper/2006.16668","citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:a9f46b206082a2106ab540b3e8361ddde050d29349ec436939967e83d61213d1","observation_id":"ad9bce5a-146c-4a8e-b19d-6a098200b9c9","resolution":{"observed_at":"2026-08-16T00:10:55.037454Z","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-08-16T00:10:55.042215Z","title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.042215Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:2fa37b6b8a5bd91d00abaffdba8c5ac0605577ce1ee21c1053ab0acea4d703d0","observation_id":"d44bed4f-5bb1-461d-8486-356be4d38769","resolution":{"observed_at":"2026-08-16T00:10:55.042215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06410","last_updated":"2024-12-09T11:39:00Z","snapshot_observed_at":"2026-08-16T14:09:13.808921Z","submitted_at":"2024-12-09T11:39:00Z","title":"BatchTopK Sparse Autoencoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06410","snapshot_observed_at":"2026-08-16T00:10:55.045966Z","title":"Batchtopk sparse autoen- coders.arXiv preprint arXiv:2412.06410, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.045966Z"},"links":{"cited_paper":"/paper/2412.06410","citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:f9960fdae766e4e5e98b856a5742fb30447a107ee48392debad4cd8f6e33faeb","observation_id":"a9591f00-6135-4051-b16d-70faecf76dcd","resolution":{"observed_at":"2026-08-16T00:10:55.045966Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.238089Z","title":"Fast k-selection algorithms for graphics processing units.Journal of Experimental Algorithmics (JEA), 17:4–1, 2012","venue":null,"work_id":"4eb6f862-3d37-4fd4-b522-10326e548299","year":2012},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.050248Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:609158756ead6fc0b465b86515273b530b7294d83b5f44dc91f776c0872fa2a8","observation_id":"4951e4b0-08d5-474f-aa46-4bcae0a104c2","resolution":{"observed_at":"2026-08-16T00:10:55.241787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.225670Z","title":null,"venue":null,"work_id":"91389cd0-6a21-4686-8fcb-fbbe120bff05","year":2021},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.053674Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:7826e488e1b6f230a93bf79fac3399327d0e35c362283a43994d791aa5778385","observation_id":"15432273-3c4d-4c74-a570-f3e622bf3f2f","resolution":{"observed_at":"2026-08-16T00:10:55.229313Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.212870Z","title":"Parallel top-k algorithms on gpu: A comprehensive study and new methods","venue":null,"work_id":"cfd15e19-5063-4c22-8e5c-4b6baab50bf7","year":2023},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.057341Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:c479252653dfb6db4139ea10c09585ec056d62fa0b77ac7dee5b50922597a25f","observation_id":"ace886d7-5c02-48f1-ae39-41a4ad0389d8","resolution":{"observed_at":"2026-08-16T00:10:55.217116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.201699Z","title":"Rtop-k: Ultra-fast row-wise top-k selection for neural network acceleration on gpus","venue":null,"work_id":"b20623da-2206-4111-893e-e35a69db64df","year":2024},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.060728Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:276650663b2a5410c09735da8917a64e28cd969dab607bb0c4768fce8725de9e","observation_id":"0d6b83bb-2eb9-4289-8660-9ef7752775b9","resolution":{"observed_at":"2026-08-16T00:10:55.205484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.189394Z","title":"Radik: scalable and optimized gpu-parallel radix top-k selection","venue":null,"work_id":"58c49ae5-7d95-4116-9d97-cd47f7d9574b","year":2024},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.064068Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:ab995ef7676ab0bde2f4f30680c6e72d2252b75cefaee02da4e8fc5ac07e3a30","observation_id":"53a5643b-49c2-4976-9e46-5a8be2193542","resolution":{"observed_at":"2026-08-16T00:10:55.194173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.068413Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.068413Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:36d354dc112ddd158e1fd4f622cd2d12c8749a0d938dd4ad2c24f65589c4c599","observation_id":"34ab12f0-c54b-4c60-aaa9-933d4583e0e9","resolution":{"observed_at":"2026-08-16T00:10:55.068413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-16T00:10:55.071840Z","title":"Gemma 2: Improving open language models at a practical size.arXiv preprint arXiv:2408.00118, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.071840Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:ab38e116d9e5da0a63da3ac488def68dd21b177c21cca8791e32aeed37552503","observation_id":"7bc52018-a70c-4e09-8d92-02a80ad2d7df","resolution":{"observed_at":"2026-08-16T00:10:55.071840Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.171445Z","title":"Space-efficient online computation of quantile summaries.ACM SIGMOD Record, 30(2):58–66, 2001","venue":null,"work_id":"059fd570-c0b7-42fa-92cb-96a4afdac965","year":2001},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.075927Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:3fd56d0ed11b880575ecc3c227882061f4d997eafd38eccc7a380deea7906f51","observation_id":"6c9ff8b5-5b85-43bb-b7ba-2fd09c54d5c5","resolution":{"observed_at":"2026-08-16T00:10:55.175917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.158928Z","title":"dictionary_learning","venue":null,"work_id":"f9a07ed4-ba8e-4e4b-b37a-85fef2b05e12","year":2024},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.080285Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:c5163a14725b5a7e495e81746959584b609fe7a0e9dce30fedb073de1c93fe36","observation_id":"3c963204-5ca2-487e-8c65-6e5db47dda77","resolution":{"observed_at":"2026-08-16T00:10:55.162959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:10:55.144540Z","title":"John Wiley & Sons, 2004","venue":null,"work_id":"255177ba-a0d6-4421-a663-f1c4c59bd797","year":2004},"citing_paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:10:55.084026Z"},"links":{"citing_paper":"/paper/2608.12573"},"observation_digest":"sha256:5aebb251016bb31f87e7ef4c4a613fee10100726224efcb09ca0d13b74bf06e2","observation_id":"b128d1f0-f84b-40d2-b311-3a695dd57f31","resolution":{"observed_at":"2026-08-16T00:10:55.149506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.12573","last_updated":"2026-08-12T20:31:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T09:02:39.585796Z","submitted_at":"2026-08-12T20:31:33Z","title":"Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":16},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2608.12573."}