{"as_of":"2026-08-10T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ccbdd6f06b85852d3eb2a095c109188b7c76291f011e4405e7a4c2375bfb02a","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:35:18.246467Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:57:03.523760Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06163","snapshot_observed_at":"2026-08-02T22:57:03.523760Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:03.523760Z"},"links":{"cited_paper":"/paper/2502.06163","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:d03666334603ce62cd296aa914d0cbddc83ed65a5a60b6607c36886a41dffc1b","observation_id":"a8e6f14f-0c1f-4b7a-9d4e-45bf5eb5416d","resolution":{"observed_at":"2026-08-02T22:57:03.523760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06163/citation-record","integrity":"/paper/2502.06163/integrity","json":"/paper/2502.06163/citation-record.json","paper":"/paper/2502.06163"},"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-08T16:35:19.065095Z","title":null,"venue":null,"work_id":"d32aac06-3e94-495d-9bdf-6c9174e99a04","year":null},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.228439Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:f876e1723ed354915a783e705add54903f673872a4eae68d88850a64390cb2b0","observation_id":"7d9dd411-29c5-43f5-add9-c2b7a0b97d2c","resolution":{"observed_at":"2026-08-08T16:35:19.068644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T16:35:19.053782Z","title":null,"venue":null,"work_id":"6674dbf2-5156-4563-996a-03e847f5058f","year":null},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.232060Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:9b145f1ed4337bd6a103bf455f0eb142b61490de8344f5c66c282949a22a2b05","observation_id":"8c1abb0f-f853-487b-b966-0666a5b267bf","resolution":{"observed_at":"2026-08-08T16:35:19.057414Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T16:35:19.042410Z","title":null,"venue":null,"work_id":"5d2abbcf-7614-49f6-aa49-33b4bfc2dbe7","year":null},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.235431Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:d3f8ff308b8c3a9758370ee40df8c8b23672afb7364dd6151b660efb93d8264f","observation_id":"ed4cdf9f-a89e-4321-b955-b7f084cd3d0e","resolution":{"observed_at":"2026-08-08T16:35:19.046593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T16:35:19.031641Z","title":"Each of these steps has a variety of avenues for improvement, see the survey by Ikotun et al","venue":null,"work_id":"b59bf3c7-cd19-491c-a061-4d1a09336036","year":2023},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.239171Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:e0a6ccab29d86b6fef26cfff8d87982ef4a1218f9367d8fe8da42baa66f2c440","observation_id":"8bb64bc2-51a3-4387-a8e3-5e6c0a70218b","resolution":{"observed_at":"2026-08-08T16:35:19.035467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17424","last_updated":"2024-09-25T23:24:56Z","snapshot_observed_at":"2026-08-02T09:28:14.540794Z","submitted_at":"2024-09-25T23:24:56Z","title":"Results of the Big ANN: NeurIPS'23 competition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17424","snapshot_observed_at":"2026-08-08T16:35:18.216740Z","title":"Simhadri, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.216740Z"},"links":{"cited_paper":"/paper/2409.17424","citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:b76b4358c9e4c627e70dfa4ff8e0d303a769a8a57402bc48f9a3a5d5256421be","observation_id":"bc3470ab-952c-4cbb-a8d1-b70f4bc78a4b","resolution":{"observed_at":"2026-08-08T16:35:18.216740Z","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-08T16:35:18.209486Z","title":"0000029664.99615.94","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.209486Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:e413a093548e408ee1bfe7289c71573bc8e0150bfcedab0de08771bfd6326523","observation_id":"2d9ba363-574d-4387-88d3-9b90229f9bab","resolution":{"observed_at":"2026-08-08T16:35:18.209486Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.08942","last_updated":"2021-02-17T18:56:03Z","snapshot_observed_at":"2026-08-08T10:53:20.447413Z","submitted_at":"2021-02-17T18:56:03Z","title":"A Survey on Locality Sensitive Hashing Algorithms and their Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.08942","snapshot_observed_at":"2026-08-08T16:35:18.201389Z","title":"Indyk, P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":139,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.201389Z"},"links":{"cited_paper":"/paper/2102.08942","citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:70814829eba0bfc5c51938e66f6b879438dfba86f3caebf39bd18b6262eb838a","observation_id":"d5a98f77-9a84-4446-94cf-1278a2fa6157","resolution":{"observed_at":"2026-08-08T16:35:18.201389Z","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-08T16:35:18.224562Z","title":"doi: 10.1109/ICDE53745.2022.00046","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":564,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.224562Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:3cce283624712d6f053bf57e4c322d9ca7285aa90ba30fcdf146af0a93959496","observation_id":"8847831d-a05a-4a53-9baa-ddd73b9995b3","resolution":{"observed_at":"2026-08-08T16:35:18.224562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12386","last_updated":"2020-03-26T13:43:25Z","snapshot_observed_at":"2026-08-04T19:26:45.111534Z","submitted_at":"2020-03-26T13:43:25Z","title":"A New Gene Selection Algorithm using Fuzzy-Rough Set Theory for Tumor Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12386","snapshot_observed_at":"2026-08-08T16:35:18.220547Z","title":"doi: 10.1109/ ICCV .2003.1238663","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":1477,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.220547Z"},"links":{"cited_paper":"/paper/2003.12386","citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:6086175ab1c788ac733af3fcecce410d7838f62d72d01747c4a63abc9ec4d380","observation_id":"87bddf32-7484-4ca0-acae-9cc90071041e","resolution":{"observed_at":"2026-08-08T16:35:18.220547Z","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-08T16:35:18.186514Z","title":"Friggstad, Z., Rezapour, M., and Salavatipour, M","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.186514Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:3a64a50ff6ec3876718a2cbfe70c954bd13414f064960cce6371b3053a867d42","observation_id":"2e6584c1-98b2-4841-bdbb-a8ecc28ecb78","resolution":{"observed_at":"2026-08-08T16:35:18.186514Z","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-08T16:35:19.007241Z","title":"black-box","venue":null,"work_id":"88e4ee24-6c34-4849-a7da-841008172a63","year":2015},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.246467Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:24e850863ba630589b2f839bb0a06f06b5ce924e49f65b07d48fa26e5a46ee87","observation_id":"65e18c0b-2d9c-48a1-bf13-17c5a70f9fa7","resolution":{"observed_at":"2026-08-08T16:35:19.011745Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T16:35:18.213123Z","title":"URL https: //doi.org/10.1145/1772690.1772862","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.213123Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:a645e8092def50821e6b513c0e3dc8e8e2e20fa3abca3eccffb5226058f92eac","observation_id":"c096cc3c-4567-4097-abae-007dcb83aa51","resolution":{"observed_at":"2026-08-08T16:35:18.213123Z","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-08T16:35:19.019705Z","title":"Approximation guarantees There has been prior work on providing approximation guarantees for the k-means problem using techniques related to local search","venue":null,"work_id":"edcb0bcb-690c-406e-a92a-84b743ea2838","year":2002},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.242948Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:22c189551b7a4264f6a786bf09dd40fcc429436899f4b07c20ad5c407f0fc545","observation_id":"9b82e08a-b94b-4a48-9734-545afd25561f","resolution":{"observed_at":"2026-08-08T16:35:19.024323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T16:35:18.193808Z","title":"URL https: //doi.org/10.1109/CVPR.2015.7298596","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.193808Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:6cd0c055cc452fd2aa9fb59c371ad9f9f36c0346cb8ca1763a9fdaca0927b65a","observation_id":"f0a52d3a-5367-4a19-803b-4487255168bf","resolution":{"observed_at":"2026-08-08T16:35:18.193808Z","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-08T16:35:18.197812Z","title":"URL https: //doi.org/10.1145/3132847.3133091","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.197812Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:907d8edd67bda45f37f44338bf397c13037dbb35ec3e57ee30b925571b63cda6","observation_id":"07c93db4-65f9-4f22-b00a-45d5f27e44f7","resolution":{"observed_at":"2026-08-08T16:35:18.197812Z","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-08T16:35:18.181952Z","title":"Avrithis, Y ., Kalantidis, Y ., Anagnostopoulos, E., and Emiris, I","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.181952Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:7ca032649120511cdd2520e3dec247a6b1e05a51662083fffcc8562fa3fe5990","observation_id":"6854f4b6-6b33-4034-ad16-6d14bd013b2d","resolution":{"observed_at":"2026-08-08T16:35:18.181952Z","resolver_source":null,"status":"malformed_identifier"},"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-08T16:35:18.190152Z","title":"URL https: //doi.org/10.1109/TPAMI.2021.3067706","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.190152Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:e6fae4d6ff06793f7c48d89a2d722bd6bf898fe467062a110099dfae1a1eaa13","observation_id":"753de3f1-6e1f-47d3-a501-c7147faf3aad","resolution":{"observed_at":"2026-08-08T16:35:18.190152Z","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-08T16:35:18.205654Z","title":"URL https: //doi.org/10.1109/TIT.1982.1056489","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","version":1},"reference_index":9448,"source":"pdf_text","source_observed_at":"2026-08-08T16:35:18.205654Z"},"links":{"citing_paper":"/paper/2502.06163"},"observation_digest":"sha256:21785afdf232e1ab0dd5aee73f67d39ad5d70369639948f66ccbad171924f8c7","observation_id":"d225e609-32d9-4e20-a88e-5deb7dba0bb1","resolution":{"observed_at":"2026-08-08T16:35:18.205654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06163","last_updated":"2025-02-10T05:22:08Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T21:23:19.474217Z","submitted_at":"2025-02-10T05:22:08Z","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":12,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":18},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2502.06163."}