{"as_of":"2026-08-11T01:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b47243035b4c27cf2342166fd37d493aa5d9982f4942b6ab44c0c5b00925c692","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T15:59:30.829000Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"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-05-17T00:01:17.281452Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-17T00:01:22.774429Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"cited_work":{"arxiv_id":"1906.10602","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.10602","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pyramid: A General Framework for Distributed Similarity Search","venue":"cs.DC","work_id":"f420aaaf-370f-4073-aa7b-556e169b6f70","year":2019},"citing_paper":{"arxiv_id":"2512.09331","last_updated":"2026-04-04T09:04:44Z","snapshot_observed_at":"2026-07-06T22:38:35.387503Z","submitted_at":"2025-12-10T05:38:59Z","title":"Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T00:01:17.281452Z"},"links":{"cited_paper":"/paper/1906.10602","citing_paper":"/paper/2512.09331"},"observation_digest":"sha256:fb4beca4e46bada695c224c1cec78b1987c152df31f253f7eee90784b5699acc","observation_id":"e98b9379-6df3-4322-9799-8f6e58edf505","resolution":{"observed_at":"2026-05-17T00:01:22.777513Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1906.10602/citation-record","integrity":"/paper/1906.10602/integrity","json":"/paper/1906.10602/citation-record.json","paper":"/paper/1906.10602"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on learning to hash","venue":null,"work_id":"8b69df97-a194-461c-983c-08b4ff6f40ca","year":2017},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:c97506b65cbfc577d2f07033a7e3dbe63c0beb9a63b083677c51ec587e70bb90","observation_id":"0455bbb2-da3a-4306-a99b-c5837eb922fc","resolution":{"observed_at":"2026-05-25T16:01:03.025205Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Locality-sensitive hashing scheme based on p-stable distributions","venue":null,"work_id":"ec796f9a-f4cc-4b2e-8a8b-c4b7b00b1205","year":2004},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:c7f5bf51e11d00b93e43f3566044f5fcc5ceed57a89b491187c8d28e23080795","observation_id":"c6b10ea0-58dc-402e-80a0-67b43853586a","resolution":{"observed_at":"2026-05-25T16:01:03.021410Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Similarity estimation techniques from rounding algorithms","venue":null,"work_id":"cf921594-2ab9-45b5-b052-836592c8013f","year":2002},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:3f031c5c91f0d0fff8749514da070c9b79796389c5075894f3a2782b683689c0","observation_id":"ad6f6995-065b-4299-baad-bdc7526a45d8","resolution":{"observed_at":"2026-05-25T16:01:03.029812Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips)","venue":null,"work_id":"9c233778-e5ec-4ca3-a692-5b9ec0effd3e","year":2014},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:3506a791394374428b11aaadf2d3bbac17b2287a19c537b872c3b198176d9531","observation_id":"f4757707-1992-46a8-a3cf-e74296af149a","resolution":{"observed_at":"2026-05-25T16:01:03.033756Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Object retrieval with large vocabularies and fast spatial matching","venue":null,"work_id":"5b58aa6a-d949-47e0-9d3d-4e0f00ddc6c0","year":2007},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:bab35460d5e3e176a56f4183591c43461d5b9759e904902f95e67a523f3e5ec4","observation_id":"23a9f7a8-024a-4792-b357-bf563730b8e0","resolution":{"observed_at":"2026-05-25T16:01:03.013273Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Low-shot learning with large-scale diffusion","venue":null,"work_id":"d9c74ff2-abdb-4e32-b587-6b2358d13b4d","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:7ed12dfbf284ae5c1e7f559a13a5f8a6a38788ab81c526f7578ebe312ed2f522","observation_id":"ee3801a3-d139-4f37-bcdd-54c64244e85e","resolution":{"observed_at":"2026-05-25T16:01:03.017508Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Matrix factorization techniques for recommender systems","venue":null,"work_id":"263d9462-d552-472b-96b8-91a9ab673312","year":2009},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:a623fb8b15881d144e3c67151a97cc6cc7fd0760ea4ff53674013f4e35c8b4e2","observation_id":"093c12c4-c0b8-4e4b-b711-6998f29c2d07","resolution":{"observed_at":"2026-05-25T16:01:03.039377Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Assembling large genomes with single-molecule sequencing and locality-sensitive hashing","venue":null,"work_id":"270d92cc-8419-4ebb-9ef4-1c4d2fc95fc3","year":2015},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:0c097c64b218db09216d1ac773974a4c7c51b0dcf669ba73f689bfef63fad9ba","observation_id":"c3252ce3-d0d6-4bbe-970b-e662b0892219","resolution":{"observed_at":"2026-05-25T16:01:03.043121Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kore: keyphrase overlap relatedness for entity disambiguation","venue":null,"work_id":"fb14d43c-99f9-441c-acb9-aedeb595d279","year":2012},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:323d99f6ce9f63465aa7d33a491ca555461611374b488133155b4ac2ca6b7df5","observation_id":"9f1251c2-5c39-44a1-9bb0-cbe52d166a1e","resolution":{"observed_at":"2026-05-25T16:01:03.047097Z","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":"1605.07427","last_updated":"2016-05-24T12:48:19Z","snapshot_observed_at":"2026-07-06T04:57:23.396208Z","submitted_at":"2016-05-24T12:48:19Z","title":"Hierarchical Memory Networks","version":1},"cited_work":{"arxiv_id":"1605.07427","doi":null,"metadata_source":"pith","pith_arxiv_id":"1605.07427","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hierarchical Memory Networks","venue":"stat.ML","work_id":"accfc5d8-7b86-43bb-92ec-c781228f66ed","year":2016},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"cited_paper":"/paper/1605.07427","citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:05558cbd3bf2ab08b889706c2bae7443b5d94076f5bfeb38982d484a6b058a81","observation_id":"49a1b621-b68e-4f2b-99c7-694f07c207dd","resolution":{"observed_at":"2026-05-25T16:01:02.354338Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-06-05T21:23:00.469572Z","title":"Scalable generalized linear bandits: Online computation and hashing","venue":null,"work_id":"3e27cd73-dc7a-4c6d-8d5c-33e8f440154b","year":2017},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:4926d01d34fd25bcc94406d8885c49efa499bcf88ed184face990050623b8a3b","observation_id":"476c0fa5-6a08-4d85-a0bf-5c3f8968c5e8","resolution":{"observed_at":"2026-05-25T16:01:03.145634Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Narendra","venue":null,"work_id":"bed140bf-7be1-4733-b347-14b306ca9df8","year":1975},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:d965e288aababf826518b59682d18b3a15e03ae67acbf86471d5bd34eb3984e3","observation_id":"e306102a-d308-419f-bbf1-5f39674c0e07","resolution":{"observed_at":"2026-05-25T16:01:03.149172Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"idistance: An adaptive b+-tree based indexing method for nearest neighbor search","venue":null,"work_id":"f534ffc9-1f62-4320-8e2e-f8732f02ec4f","year":2005},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:f9385c0b29fb304a87825952cc445eb5bed0ad6b41c6b067a841736e91352e51","observation_id":"8f4a3155-7f9a-4ab0-a585-098022f7e2c8","resolution":{"observed_at":"2026-05-25T16:01:03.153179Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximum inner-product search using cone trees","venue":null,"work_id":"57707a6f-3ffc-4fa7-b685-66f2d61882ca","year":2012},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:8173ced59486a549a9c4d0415dbf53515f37bf309a155127afd041fb55515265","observation_id":"6772bc90-a9b5-496d-809b-53eeccff7937","resolution":{"observed_at":"2026-05-25T16:01:03.157026Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality","venue":null,"work_id":"e5a25ae1-19dd-4f7e-99e7-c876ecd2d5d5","year":null},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:af895e99ea41372781dd9621db15c7797803094cfdb9fba987dc73b5ad44e64a","observation_id":"c4826b93-6ce4-4cc4-8580-32dd20ed6f3a","resolution":{"observed_at":"2026-05-25T16:01:03.134214Z","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":"1410.5518","last_updated":"2015-06-08T19:30:35Z","snapshot_observed_at":"2026-07-06T03:57:59.279183Z","submitted_at":"2014-10-21T02:00:34Z","title":"On Symmetric and Asymmetric LSHs for Inner Product Search","version":3},"cited_work":{"arxiv_id":"1410.5518","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.5518","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On Symmetric and Asymmetric LSHs for Inner Product Search","venue":"stat.ML","work_id":"08f238c7-877b-48f5-b98f-35f3ab8dc7ec","year":2014},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"cited_paper":"/paper/1410.5518","citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:6b3e0241c472d6a182d06fba59e6d296ec23f949265a6674366591457b21e54d","observation_id":"6dcdaebb-0ab6-4086-9ebb-ae4de39633aa","resolution":{"observed_at":"2026-05-25T16:01:02.376238Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-06-05T21:23:00.469572Z","title":"Product quantiza- tion for nearest neighbor search","venue":null,"work_id":"d096fa4d-938f-49f1-b683-b9e3a68c36be","year":2010},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:18bc80a343810a534e3ef12455a3a482bee2fe2f1bfcd9f970d938c4c409400b","observation_id":"b0db73b5-b15a-46bc-916e-7fa687e4c67a","resolution":{"observed_at":"2026-05-25T16:01:03.130406Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimized product quantization for approximate nearest neighbor search","venue":null,"work_id":"7fa96c62-54e9-4f8b-8a07-353e5c3b8b75","year":2013},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:53dbd6eade05e5579aabe6d256a2affeaa22d39cac6992e0d109cbf875b4ff4a","observation_id":"60c7330e-27b0-46db-acc8-2ff7276e8911","resolution":{"observed_at":"2026-05-25T16:01:03.118432Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The inverted multi-index","venue":null,"work_id":"0f725d0e-5dd7-4f68-9fac-f839ad080211","year":2014},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:bd146c88e4437092df34551b4d7f9a8369e2059f0b3c398e3644b32d2c030ba9","observation_id":"2bca31af-de8a-416c-bb56-fd0afae1ac39","resolution":{"observed_at":"2026-05-25T16:01:03.122427Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast approximate nearest-neighbor search with k-nearest neigh- bor graph","venue":null,"work_id":"0689e9cc-ef7c-4b84-9291-6262daf7b5e3","year":2011},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:f008e16e31b688822644d51eaed92300924eda477a3fb181af65ecdc7d88ee6e","observation_id":"a24749e8-69c7-4e27-9185-f4f95e77e6e3","resolution":{"observed_at":"2026-05-25T16:01:03.126493Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fanng: Fast approximate nearest neighbour graphs","venue":null,"work_id":"d0abae1e-2afe-4973-b04f-ec68e388cb56","year":2016},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:c55687c130735a67277ef4c68d2ac36064bad5219f25e0b0bd8f368740c4a0a8","observation_id":"aa62edfa-71f0-4db8-b733-c62e94db4f55","resolution":{"observed_at":"2026-05-25T16:01:03.137915Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient and robust approxi- mate nearest neighbor search using hierarchical navigable small world graphs","venue":null,"work_id":"4dbe04c1-a50f-476e-a555-d2ac1460830c","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:0fc4b190d980079dd48c5f8a1322b5e7458f76cbb5839853535579bc3acf9802","observation_id":"ff2c81dc-076b-4387-81af-f809d89fa529","resolution":{"observed_at":"2026-05-25T16:01:03.107203Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast neighborhood graph search using cartesian concatena- tion","venue":null,"work_id":"759bb602-6127-4a64-acc5-5fc2eaf38241","year":2013},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:3d60cc7554fdc9ee28414e87afae51c2e8f7f482c6f97d8809300c73b7764461","observation_id":"73bfc955-79a3-4465-ad3f-e52819cedce0","resolution":{"observed_at":"2026-05-25T16:01:03.111224Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast approxi- mate nearest neighbor search with the navigating spreading-out graph","venue":null,"work_id":"84865fb9-2ac1-44c9-9059-ab3d19dc8a08","year":2019},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:753a92a04e862e937f08cdbc8ce3bcb9ee22ab78c029451711c0223dc824e8ab","observation_id":"3599a602-a295-4db4-b259-8ce73c674388","resolution":{"observed_at":"2026-05-25T16:01:03.098001Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scalable nearest neighbor algorithms for high dimensional data","venue":null,"work_id":"f51841e1-70b4-4d1a-97c1-f3f6f7a25fa4","year":2014},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:72907ff13097c1f2a7c053c676914ce7eed95e727e864f0d0c5f06b3ebd7ab85","observation_id":"b1dd8c9f-d500-468b-b8e2-46ca3e41be1a","resolution":{"observed_at":"2026-05-25T16:01:03.102748Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Streaming similarity search over one billion tweets using parallel locality-sensitive hashing","venue":null,"work_id":"488d3a02-db20-4384-801e-d5187462b93e","year":1930},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:50635f685449afc5acb1d6ac639777801beba7472f7a0a3427bef2ec97929a53","observation_id":"402a60db-d4c6-453c-bcf6-ab58d4ab6341","resolution":{"observed_at":"2026-05-25T16:01:03.141785Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Shuffle- efficient distributed locality sensitive hashing on spark","venue":null,"work_id":"27fff963-8cd7-4879-ac1e-5a44c0463c7e","year":2016},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:ced8e47783e1a0917d86b2d4c6db40c91f04cfe2c337ed6a8c45b0785dc5b1b4","observation_id":"6401f9cd-1054-4058-8785-5fd75d8a272c","resolution":{"observed_at":"2026-05-25T16:01:03.161121Z","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":"1702.08734","last_updated":"2017-02-28T10:42:31Z","snapshot_observed_at":"2026-07-06T05:31:42.551086Z","submitted_at":"2017-02-28T10:42:31Z","title":"Billion-scale similarity search with GPUs","version":1},"cited_work":{"arxiv_id":"1702.08734","doi":"10.48550/arxiv.1702.08734","metadata_source":"pith","pith_arxiv_id":"1702.08734","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Billion-scale similarity search with GPUs","venue":"cs.CV","work_id":"53d778be-7bb9-4afb-bed9-2bd47f141488","year":2017},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"cited_paper":"/paper/1702.08734","citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:3497e9224b56ebb0c702067bd3354e0bd097e70d3ba4dee759e476d0467fee87","observation_id":"c02f8697-9fca-49d0-ade4-cabfdd0feaeb","resolution":{"observed_at":"2026-05-25T16:01:02.371133Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-01T10:08:09.582925+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T10:08:09.582925+00:00","source":"openalex_status_cache"},{"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-06-05T21:23:00.469572Z","title":"Link and code: Fast indexing with graphs and compact regression codes","venue":null,"work_id":"18e4fd25-b876-49bf-9753-49eb8b17eacf","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:b0e9c89f6830be7666d32e9172cde1fabfbac40b77d8e1475415bd4f63dd29a7","observation_id":"bf0a2f74-1900-439a-8e84-621d19431958","resolution":{"observed_at":"2026-05-25T16:01:03.086276Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"To index or not to index: Optimizing exact maximum inner product search","venue":null,"work_id":"7b9f2da2-71fc-45ec-b220-6364aa1e9f4d","year":null},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:5ff008e606fe48c188234aee3b9ea1cc8138f9f0f717796b986306988ec3c999","observation_id":"24eed079-bc5b-4361-82fb-4355ce29936f","resolution":{"observed_at":"2026-05-25T16:01:03.082502Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the inverted indices for billion-scale approximate nearest neighbors","venue":null,"work_id":"44910e8e-955c-467b-ac57-8cffc6e3e165","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:6936ffbfcc58958af7c16da05b96d26e0fe4ea0308076b9fd92d1d200eb805f5","observation_id":"1be270ee-5501-4838-9df0-580255b86b27","resolution":{"observed_at":"2026-05-25T16:01:03.090146Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Non-metric similarity graphs for maximum inner product search","venue":null,"work_id":"4d50acbf-ff74-4793-bd5a-0d6055f4387d","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:974ae8381c141b5a395307a5d9e59ac335665e724304703380beec529ff1d9ad","observation_id":"7f4a5a63-6da5-482c-a282-5c3850f63685","resolution":{"observed_at":"2026-05-25T16:01:03.093804Z","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":"1210.0477","last_updated":"2012-10-01T17:30:47Z","snapshot_observed_at":"2026-08-04T11:53:06.673206Z","submitted_at":"2012-10-01T17:30:47Z","title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","version":1},"cited_work":{"arxiv_id":"1210.0477","doi":null,"metadata_source":"pith","pith_arxiv_id":"1210.0477","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","venue":"cs.DS","work_id":"0e40bf0c-280b-48df-9e40-593306672d3b","year":2012},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"cited_paper":"/paper/1210.0477","citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:1d8f545784c2d503973b682c12a0239607c343a03fcbe791b8a72e3b539caa07","observation_id":"0a07d02c-6053-4d11-901f-8f0e95b60346","resolution":{"observed_at":"2026-05-25T16:01:02.365576Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"1507.05910","last_updated":"2015-11-30T02:26:44Z","snapshot_observed_at":"2026-08-03T17:02:01.867502Z","submitted_at":"2015-07-21T16:53:12Z","title":"Clustering is Efficient for Approximate Maximum Inner Product Search","version":3},"cited_work":{"arxiv_id":"1507.05910","doi":null,"metadata_source":"pith","pith_arxiv_id":"1507.05910","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Clustering is Efficient for Approximate Maximum Inner Product Search","venue":"cs.LG","work_id":"78f5af88-a462-472a-8705-25c4bbb317e5","year":2015},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"cited_paper":"/paper/1507.05910","citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:5b606bac288f505a5a9d00ce24dfc92765c29e7805dd0605f5152ad07319b3cc","observation_id":"f64cbd06-ba9a-4659-9c20-5eac66070469","resolution":{"observed_at":"2026-05-25T16:01:02.360178Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-06-05T21:23:00.469572Z","title":"Architectural styles and the design of network-based software architectures , volume 7","venue":null,"work_id":"fb1195c1-1b11-411c-809b-d7658caecd1c","year":2000},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:d19a64e790feac4c717972bda576b3de6672a9bc692d9d986db09511dcaa61d5","observation_id":"038e08aa-c83c-4cad-8379-d4f2ed4b1376","resolution":{"observed_at":"2026-05-25T16:01:03.066702Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient indexing of billion-scale datasets of deep descriptors","venue":null,"work_id":"e830be16-4ca8-4eb3-88ae-07fd0b82dccf","year":2055},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:2dfba842f0eaa6edb34a7a92b117e47444532ef27137371326acda1bc68a48aa","observation_id":"c83c4059-0c5c-464a-b42b-4e2e30aab4bb","resolution":{"observed_at":"2026-05-25T16:01:03.070479Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Searching in one billion vectors: re-rank with source coding","venue":null,"work_id":"1614b7cb-01b7-4d27-8ad8-9c74c72c50e4","year":2011},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:a4ac925a9e23d88940269d30a4213396ee37d3a1beb6c8a8ab7eef6d6bc0ec25","observation_id":"28c0d537-8c8d-49e0-89a5-658794043f20","resolution":{"observed_at":"2026-05-25T16:01:03.058865Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b5b96584-27a4-4921-9282-697091316535","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:23082bc2ea97e53377ba5f10038298641c5ef369270cf7cdbcf4ec54219adbb5","observation_id":"131108e2-3a4a-4677-bb4a-91db92dd7c61","resolution":{"observed_at":"2026-05-25T16:01:03.054949Z","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-06-05T21:23:00.469572Z","title":"A quantitative analysis and performance study for similarity-search methods in high- dimensional spaces","venue":null,"work_id":"a9ce7838-7ccb-413d-bedf-9ce1fbf3211d","year":1998},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:3fa58ca333a1b3a8e2e05f1cf09eed3bdef6df090375a75a59724c39ba269f98","observation_id":"d9e5c694-4600-4569-bd70-50d83f5053b3","resolution":{"observed_at":"2026-05-25T16:01:03.063049Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A general and efficient querying method for learning to hash","venue":null,"work_id":"7d2e0e5c-0ccf-469b-b6f0-78934faf4f92","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:ab22044de07c6364cdfdf9622b31b73b280555bd9efcf24c0b341eba0cd5a066","observation_id":"72a87cb6-27f5-486b-b579-d344045bb9a9","resolution":{"observed_at":"2026-05-25T16:01:03.074366Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Composite quantization for approximate nearest neighbor search","venue":null,"work_id":"94eb950d-826f-4bb2-bb64-2eba005b2006","year":2014},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:69df94b1accc6465f25280ba284602a964ea864f8d7a223a266d2c4998675821","observation_id":"3fa877bd-073a-423e-81d5-17c0ff72384b","resolution":{"observed_at":"2026-05-25T16:01:03.078233Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Norm-ranging lsh for maximum inner product search","venue":null,"work_id":"3e61356a-f670-4fcc-be9b-16ba50317348","year":2018},"citing_paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-25T15:59:30.829000Z"},"links":{"citing_paper":"/paper/1906.10602"},"observation_digest":"sha256:7a4230de4a0963bca5c182a936e73b8c637375a59561e17651edd0e4a8660c6d","observation_id":"399188a0-1eaf-4cd3-a634-ddd017c3f2ad","resolution":{"observed_at":"2026-05-25T16:01:03.051223Z","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"}}],"paper":{"arxiv_id":"1906.10602","last_updated":"2019-06-25T15:23:52Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-03T06:38:07.973758Z","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":5,"verified_fuzzy":36},"total_outbound_references":42},"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 11 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:1906.10602."}