{"as_of":"2026-08-13T04:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30342dc35f551172c99198c65ed7f77005092dd884842f95b9483b21cbc5ec31","coverage":[{"denominator":120,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:01:17.331652Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.14754/citation-record","integrity":"/paper/2411.14754/integrity","json":"/paper/2411.14754/citation-record.json","paper":"/paper/2411.14754"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:01:16.086472Z","title":"Bounds and Approximations for Moments of Order Statistics","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.086472Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b8cb1dfc3410a92053f91ca0ffe8001687b0f3382ea93217f95cdaeb27c86e2e","observation_id":"6e81f21c-571b-4e50-9a72-918f184946f1","resolution":{"observed_at":"2026-08-12T15:01:16.086472Z","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":"10.1002/0471722162.ch3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:01:17.665752Z","title":"Expected Values and Moments","venue":null,"work_id":"a953847e-8e9d-476b-9758-177cd1e14932","year":2003},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.093731Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8b54a3b56b16a26a9ab1b40e8fcec17bee8b5ba0802a88b1b2de249124dc57f1","observation_id":"6838c689-0929-416b-ae23-2cfb8af4ce16","resolution":{"observed_at":"2026-08-12T15:01:17.675624Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.100773Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.100773Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:4ece7c69cebd1b9ef6aaa9b6c85262731db5ee4ddaea37b473a2606b93d159cd","observation_id":"e2f58abd-e597-4497-83e2-8586cb5c08af","resolution":{"observed_at":"2026-08-12T15:01:16.100773Z","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-12T15:01:16.110347Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.110347Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:e4c3bc7b5ab917d610ed620e950e939e734af8b51a2bfa13f04a8c170eb51f00","observation_id":"2ab1ca4f-db50-4167-9865-211c257523f9","resolution":{"observed_at":"2026-08-12T15:01:16.110347Z","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-12T15:01:16.118537Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.118537Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:76c5d1a11afca96de3aa5fbb3aafeab13f16e2976159fb25926e35cc6a790290","observation_id":"b201002c-4233-4427-b793-4c0dd2026504","resolution":{"observed_at":"2026-08-12T15:01:16.118537Z","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-12T15:01:16.127257Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.127257Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:34545355ce8d90c867709003979528ceb02776bd92cb85930b463983874295fc","observation_id":"2f350058-f754-4ae5-a2f4-f6a21c619272","resolution":{"observed_at":"2026-08-12T15:01:16.127257Z","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-12T15:01:16.141983Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.141983Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:1feb8baf2b49a032aa3beb33c6df080eec686e031726d0cbb77f1a58f1dd9838","observation_id":"2029b5d6-870d-4d80-9610-40b7d5c1c886","resolution":{"observed_at":"2026-08-12T15:01:16.141983Z","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-12T15:01:16.151703Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.151703Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:bdae02490648e3c03eee3405e0c14a1147e10f7aa0ce3b7b2454ce7d2656fe03","observation_id":"5ee964a1-5056-47d1-9134-6cf70f7f386c","resolution":{"observed_at":"2026-08-12T15:01:16.151703Z","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-12T15:01:16.159978Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.159978Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:0921843f4b34d150cf6c173a06b3959289e47304b6cb6fa13bd70fba6a59ee0e","observation_id":"0ae0ccd0-069e-47b4-bda3-b5c2aceb1b7b","resolution":{"observed_at":"2026-08-12T15:01:16.159978Z","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-12T15:01:16.167814Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.167814Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:1df74e11476348f720913ce61881a894fe66b2d2539b037cfe17c6ac3ed80947","observation_id":"f6c67b4f-ab9e-4eee-9ecd-569ab7353a26","resolution":{"observed_at":"2026-08-12T15:01:16.167814Z","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-12T15:01:16.178601Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.178601Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:851cab8b9bc621a9e7efc5d5fab6c2ab7509881ff8950f402d1be137c104a247","observation_id":"0082d611-234e-4f1f-8cc9-f18038cf6df2","resolution":{"observed_at":"2026-08-12T15:01:16.178601Z","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-12T15:01:16.376068Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.376068Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:7d30709221326d959257c2520d397fffd681d3b2fec6a22bef12a802d47a5999","observation_id":"ebc9debe-b5eb-44bb-8e7a-cddcb8a4dc3a","resolution":{"observed_at":"2026-08-12T15:01:16.376068Z","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-12T15:01:16.383150Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.383150Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:24268c565a863d899a767a23f6fe67486fd0a6978bfd647a0e5aa85b7a14c414","observation_id":"277526e5-28f7-4065-83fd-b7f0868b055d","resolution":{"observed_at":"2026-08-12T15:01:16.383150Z","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-12T15:01:16.394263Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.394263Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:5dacd130f71c913ddbec4f48d95eac4d5d668593d335f85ee0904c3593e6e026","observation_id":"3713aae2-e39c-40a9-b0e4-c300a96cbd32","resolution":{"observed_at":"2026-08-12T15:01:16.394263Z","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-12T15:01:16.401364Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.401364Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:d04ddb3917efbd1920df218c88d7df7ce2cc42485e0b51f77941b80ce6f45bdc","observation_id":"e6975800-3a15-4b03-be8b-0add8300fd87","resolution":{"observed_at":"2026-08-12T15:01:16.401364Z","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-12T15:01:16.407655Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.407655Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:d43e8822797f24e94c093a71d429f6144e9c7cbb1e4e8d5b045a857123a1d60f","observation_id":"5fa4503d-e158-475c-9247-5057a91930f3","resolution":{"observed_at":"2026-08-12T15:01:16.407655Z","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-12T15:01:16.421928Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.421928Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8241e688c3846ac039569e4b4d1c3e35877bb5b1833fb6e98aafee3ca4ca1594","observation_id":"c57ddce5-f93b-465a-a374-78925d69a55c","resolution":{"observed_at":"2026-08-12T15:01:16.421928Z","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-12T15:01:16.428464Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.428464Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:085b5d03e857665ce061fa0dc39245ac628d07d43c376ed3518796f34d715a5d","observation_id":"80880408-293d-419a-8758-f5172ec3bc26","resolution":{"observed_at":"2026-08-12T15:01:16.428464Z","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-12T15:01:16.439679Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.439679Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:6f6de05885bf753f5b0532da5db831cfabdabe0cbe1dbd2900aef015e77b75cc","observation_id":"0cd1ca4e-33d5-40bb-ae74-4ab622a2885d","resolution":{"observed_at":"2026-08-12T15:01:16.439679Z","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-12T15:01:16.446787Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.446787Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:f2d04c6f286208806bb4c54be74c6f86e22b2da1c5d3f6915abc1116c3dec9bc","observation_id":"24e6df84-1259-4849-a74a-1699ba9f0696","resolution":{"observed_at":"2026-08-12T15:01:16.446787Z","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-12T15:01:16.452580Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.452580Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:89c1bb904ad8423d954484f5333623ad5af0a6c9ec4c285d1fa5ca004b809e57","observation_id":"72967d90-6b79-44b5-81af-af3768fbfd1c","resolution":{"observed_at":"2026-08-12T15:01:16.452580Z","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-12T15:01:16.460466Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.460466Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:f81bfa891cc5d8cf65896e482eac1ae07f1de3f2dc38de8668d3c9b8da11583e","observation_id":"5ff7a0b0-2130-4115-810e-355f9ec1b1c5","resolution":{"observed_at":"2026-08-12T15:01:16.460466Z","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-12T15:01:16.469605Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.469605Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:1007ce159928bb3fcac3d2ea80b97f8c10ac0792f46e05b9512fb1c0e86e188c","observation_id":"eea85777-39a8-4eb9-a5ff-ef42ec692820","resolution":{"observed_at":"2026-08-12T15:01:16.469605Z","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-12T15:01:16.477554Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.477554Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:069e9d5ed673a9fd5109fd4c0a259070b1ad3978968a36cbde1b277d6f5d2ba0","observation_id":"dea81a71-04c4-4518-99ef-428e0d8af1bc","resolution":{"observed_at":"2026-08-12T15:01:16.477554Z","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-12T15:01:16.487224Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.487224Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:fbb7706216ec8860c5b727b36947efb2c6df89d22d2f93a448b21c595ecf3d42","observation_id":"e2f0a11a-0e76-4692-a446-93aa52436910","resolution":{"observed_at":"2026-08-12T15:01:16.487224Z","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-12T15:01:16.493759Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.493759Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:70a65f2eba81d0494e1b717f1a7cd2bc701d11ad5b74a5fdac61b2cf992c31fc","observation_id":"7b92d823-c6d2-46bd-b8ec-f9bddacbafe6","resolution":{"observed_at":"2026-08-12T15:01:16.493759Z","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-12T15:01:16.501022Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.501022Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b8de94ef2cb028e1570131360f920324ef6079604d0a728f17e906b09281dc72","observation_id":"79968712-0367-4384-87d1-d441dfaa3edc","resolution":{"observed_at":"2026-08-12T15:01:16.501022Z","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-12T15:01:16.516396Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.516396Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:74d38583d598ed6360c5797e9916f731e73446f7ce787d60966e41342ac15c0a","observation_id":"5ed13fee-4650-459c-b202-6ab073642c29","resolution":{"observed_at":"2026-08-12T15:01:16.516396Z","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-12T15:01:16.526128Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.526128Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:787efd912db73a805800230b9f055a9926144aac85a25c1cb9ea954b5147a781","observation_id":"98429853-4511-4975-bae2-8c3c3d16a7d2","resolution":{"observed_at":"2026-08-12T15:01:16.526128Z","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-12T15:01:16.533785Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.533785Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b3336a542dcfe5b20dcd9998d23a75cc2d861fbd9efe6bf6668a4246f6d2e6d3","observation_id":"bb5ef733-1fa1-418c-83c3-4fd237e4efc5","resolution":{"observed_at":"2026-08-12T15:01:16.533785Z","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":"8289.33683","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:01:18.020368Z","title":null,"venue":null,"work_id":"466da59f-e767-48c5-a50c-ee35f9c5738a","year":2019},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.540612Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:a82c8233a01a2b4a51b62d222413a7d30ed92bfd17513746befd50b439c7fe35","observation_id":"69ef5ad6-d1d9-49a6-bf94-4e5f33b80724","resolution":{"observed_at":"2026-08-12T15:01:18.033245Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.547733Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.547733Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:093c59de716f08246314fc6ce9148d6eaf82de2a3568c271ccf2d66660d8e17c","observation_id":"51eb56d9-3852-48d4-aa0e-381abea50dea","resolution":{"observed_at":"2026-08-12T15:01:16.547733Z","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-12T15:01:16.567174Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.567174Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:17ee8d3fd301f403bd3062375a52cb40f2f4225f55e4e2d613ba3a526ca5644e","observation_id":"3db77199-3e61-401c-aa3e-fc3f9c996dcc","resolution":{"observed_at":"2026-08-12T15:01:16.567174Z","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-12T15:01:16.576718Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.576718Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:08966d15a1d85501f779280188c6e87adab336e56cbcae4d8dfe859eca40cb68","observation_id":"8cb8d48e-ca5e-4bca-968f-806735edad76","resolution":{"observed_at":"2026-08-12T15:01:16.576718Z","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-12T15:01:16.584103Z","title":"Narendra","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.584103Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8d2ffb880cd163c8074e03dffc564f0bf5bb99a8ca2130adc626812222ad2021","observation_id":"1ea50c9f-bb41-42a4-9d4e-0e42a869fd81","resolution":{"observed_at":"2026-08-12T15:01:16.584103Z","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-12T15:01:16.590845Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.590845Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:0ee06cf7b4fa46d3c734b4dd9556473a6041285ca7b5e1640fd25d34aa6d6df6","observation_id":"4f7166af-d329-460c-bfbe-d0e3fc9f6046","resolution":{"observed_at":"2026-08-12T15:01:16.590845Z","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-12T15:01:16.602668Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.602668Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:4a5aca1ad06b79688a4641e7427c3a5a0d2c14844ba2cd302e73feb1973c1d42","observation_id":"06c70ac8-98fd-44db-a5a8-8be25024c0f6","resolution":{"observed_at":"2026-08-12T15:01:16.602668Z","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-12T15:01:16.613614Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.613614Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:47fde8dad2d0fbe4aa00cc86e1ed353da26df9fe1da133f3e469851e13630e25","observation_id":"81b43661-7e09-40af-863b-eee86e216b44","resolution":{"observed_at":"2026-08-12T15:01:16.613614Z","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-12T15:01:16.623463Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.623463Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:25313dd75e6ffd3625bca6ec123035b9e20d3a72c409b7a8d72aaca3c00112f3","observation_id":"b677ba44-49be-4e7b-a635-6c25b9999020","resolution":{"observed_at":"2026-08-12T15:01:16.623463Z","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-12T15:01:16.633960Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.633960Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:9eb4d9114e36a30cb1e1fccc53e82c839ad00cf41b53210a4e28a9b862d59ab5","observation_id":"977957c5-ab26-446f-a862-0b7a653dde46","resolution":{"observed_at":"2026-08-12T15:01:16.633960Z","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-12T15:01:16.651787Z","title":"Gray and David L","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.651787Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b5e92c5ee36ba659d6927f51656e2e6a90e07035c63ab57874512204ebd0c01f","observation_id":"56ca39ce-e139-4a45-84a8-969d218ce97a","resolution":{"observed_at":"2026-08-12T15:01:16.651787Z","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-12T15:01:16.661797Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.661797Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:05426ba6523bf55acbe2646ac257cb5a8cbf43ce278aa87b3357b0f6888da3ca","observation_id":"1b36d6c7-8abb-4ec0-87c1-18b0dcf813a1","resolution":{"observed_at":"2026-08-12T15:01:16.661797Z","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-12T15:01:16.680801Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.680801Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:f256a0387fb2df146d24a4c8436f6a9545a5c95460bb499f0894fcc127c10b29","observation_id":"b6830da3-3cd7-4763-9707-ef9accb81d9b","resolution":{"observed_at":"2026-08-12T15:01:16.680801Z","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-12T15:01:20.620669Z","title":null,"venue":null,"work_id":"c4a56812-7f9c-4aed-8f01-26651cf5f48c","year":2019},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.687700Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b4da13fbca5832006efbae3d13bffd3b5ba60320617bf02e27233826f05164ce","observation_id":"b079e4a7-189e-4b77-b914-7733dc3877ee","resolution":{"observed_at":"2026-08-12T15:01:20.634106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.695680Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.695680Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:3abf65423f7b4ce46827e5a818deb15c5bcdba39a27f7069d16b9a60893c27a0","observation_id":"17f36dfd-c8c1-4fa5-b8da-ed56353457e5","resolution":{"observed_at":"2026-08-12T15:01:16.695680Z","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-12T15:01:16.705796Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.705796Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:89ba21f55c808bea41bdefb0628324d1c5328fd45548ec12be1c9b5150f30557","observation_id":"6fdb90f1-947f-44e0-8e17-e4da611ae89d","resolution":{"observed_at":"2026-08-12T15:01:16.705796Z","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-12T15:01:20.530030Z","title":null,"venue":null,"work_id":"689e1675-ef94-4550-b908-c1777c72dc92","year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.712774Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8d39264294132e9093dd77e3c7679de25b0bdc963409dcfdd1f5a17fc89d3149","observation_id":"79dea36c-bd27-4647-8c47-10362887d3f4","resolution":{"observed_at":"2026-08-12T15:01:20.539327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.720994Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.720994Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ecb992d944347f7fea67d21b67483f4c38de7bd89798378edffe72c24e17157a","observation_id":"6c518d55-8f34-4d4e-874c-aabe52c7b6b7","resolution":{"observed_at":"2026-08-12T15:01:16.720994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-12T15:01:16.735419Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.735419Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:db16d087af23190b30dc061c4e823babe88e81a5f151b6b68fce0346445d5628","observation_id":"0a42e35d-609f-494b-80a2-97d0a270d8af","resolution":{"observed_at":"2026-08-12T15:01:16.735419Z","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-12T15:01:20.456705Z","title":null,"venue":null,"work_id":"1d6bfbdd-9cc3-4215-b48f-e4635ac08b38","year":null},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.768963Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:d1d7bf0e2f4c8006ff7c10ebb792800043c139cdab2e4ded9a55975c9b1fb33a","observation_id":"330a8df3-7f95-4a7d-9ad4-79400905b984","resolution":{"observed_at":"2026-08-12T15:01:20.467297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.339080Z","title":null,"venue":null,"work_id":"af98e920-069d-4677-b0c6-c7cc07f1b130","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.787590Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:7bd93a836e66f942b26ca11d1fd8b10a89bcd9b2963fd61c7779e52f01e480f7","observation_id":"945b5977-141c-4598-b6d4-5109fafade27","resolution":{"observed_at":"2026-08-12T15:01:20.350530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.302186Z","title":null,"venue":null,"work_id":"642a7c6b-d29a-4d2a-bb81-d99852c23772","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.795138Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:3bc6086468771b21782606857fc9831d63d11e1701a9507a083af58d234314f6","observation_id":"2c1b4b35-f3d1-44e6-8186-1d8a393ce093","resolution":{"observed_at":"2026-08-12T15:01:20.309712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.804311Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.804311Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ade9fc9329c660ebfb9fd55a5122cce17f7ff114707c7c313958c7087ab8b409","observation_id":"fb81f659-34dd-4725-8a57-77fd38742a47","resolution":{"observed_at":"2026-08-12T15:01:16.804311Z","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-12T15:01:20.240368Z","title":null,"venue":null,"work_id":"6230f7ca-1370-4a1f-8ff9-bc01c7e8ac81","year":2024},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.811434Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:d82e0732ce6be2246505cfa0e015b09b028781f072ef2ac39309bc5b96939773","observation_id":"768b9592-d123-49fd-85e7-222895dff53a","resolution":{"observed_at":"2026-08-12T15:01:20.250195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.189559Z","title":null,"venue":null,"work_id":"6efbcae3-52f9-4070-b7f3-685a53ac087d","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.819273Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ff03596a042daa7d6f361da03c52624f04324811a46f4f48288bdd9bfbe8e9e9","observation_id":"0ae671e6-a46b-4da6-91e9-be03c290d5c9","resolution":{"observed_at":"2026-08-12T15:01:20.199694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.150357Z","title":null,"venue":null,"work_id":"35243a84-7f32-4e3d-aea6-faebc26f0a08","year":2018},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.833677Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:e8cb22f7c1d6b88e46408b4b29af7fd9cf49c7c303b780cb882da95734175b0e","observation_id":"0acfd586-c12c-4e14-9fb0-d8c8f1298164","resolution":{"observed_at":"2026-08-12T15:01:20.163789Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.116406Z","title":null,"venue":null,"work_id":"02ac2a86-9be2-40de-a31b-e66499e1635e","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.847586Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b7d7423fae09b261e470dc3eaf430c3065fd4cd03642614d9cfb0e069f681cbd","observation_id":"9532e106-3884-458e-8d02-93ed326e1b12","resolution":{"observed_at":"2026-08-12T15:01:20.125137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.078114Z","title":null,"venue":null,"work_id":"a319ccba-d5bb-4867-8367-a5a127d11e46","year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.853889Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:e7a098093e3eb722a9925b17fd80987d39842c834e2ef44008b18675007c890f","observation_id":"5dd1f516-40bd-46e0-bcfd-a24edba70c4b","resolution":{"observed_at":"2026-08-12T15:01:20.087072Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:20.035605Z","title":null,"venue":null,"work_id":"9f723c9c-6933-438d-8d6a-ffc617551152","year":2017},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.862974Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:92f6cf54c7878028b541255bcc6946e61f0dbb9d29348f0227c99e4e979a2a13","observation_id":"89848453-ed79-4b26-b111-64e64ae8737d","resolution":{"observed_at":"2026-08-12T15:01:20.046209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.885976Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.885976Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:dd655bc2c0734eba14f97cdcfc9a42111e9ab185c024c7a2398ffa91907495ae","observation_id":"7222b2c7-6f6d-4b88-8198-a41c8028fedc","resolution":{"observed_at":"2026-08-12T15:01:16.885976Z","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-12T15:01:19.976779Z","title":null,"venue":null,"work_id":"774e203f-f246-4e3d-8867-8a69cc964b53","year":2018},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.895148Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:e21e9ec50bc320d11b91e708bbde185e8b921746d8783193866df9739e37f0b6","observation_id":"4375f7c5-7a0a-4d94-b253-dff96e5413ac","resolution":{"observed_at":"2026-08-12T15:01:19.986031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.938605Z","title":null,"venue":null,"work_id":"2a5199e5-a2e1-41f6-a7d8-91f90b61ed7c","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.922406Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:3b12ccb48747c96a817cd2019a00924274b8409061e81513241753222f612d87","observation_id":"b3484a43-d10f-4845-bff7-4d51cbc1e4a5","resolution":{"observed_at":"2026-08-12T15:01:19.948320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.897873Z","title":null,"venue":null,"work_id":"e258d571-708d-40f7-b7ed-9514d963957a","year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.936556Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ebb9b52749e427ad51d468243893713326a6a62d64708c59ce0723097efc7fd2","observation_id":"9c048aee-390a-4621-b83d-140eb84a2f88","resolution":{"observed_at":"2026-08-12T15:01:19.908998Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.864043Z","title":null,"venue":null,"work_id":"a743c660-abc8-443b-a337-e11aeac6b44c","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.946665Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:41430d502825473373e1c63688070b9247eea9fa2e9c90b90a26b26155e89cd9","observation_id":"8bf5a6ea-22f6-414b-99a1-b31cc2d11828","resolution":{"observed_at":"2026-08-12T15:01:19.874136Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:16.959536Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:16.959536Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:404c575e4701c8365c32fac98070f96ef887ebb86bfc7cd9685e6b58152d9cd6","observation_id":"55200bec-ef82-4ae5-8bc3-faebdc6b8f9e","resolution":{"observed_at":"2026-08-12T15:01:16.959536Z","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-12T15:01:17.002949Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.002949Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:cba12ddf6ffa832dd4287d3095fd600d8fb3a4abbe421db8dc1349953f970496","observation_id":"4d78301c-41f9-4cc8-b35a-581c54b80d56","resolution":{"observed_at":"2026-08-12T15:01:17.002949Z","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-12T15:01:17.011889Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.011889Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:c91608eaae11ee1e083007bd7dc2808272c16ae06820ec6edfc94b7591476b2a","observation_id":"f418d83a-1a67-4cb1-a404-c16deeab251c","resolution":{"observed_at":"2026-08-12T15:01:17.011889Z","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-12T15:01:19.700303Z","title":null,"venue":null,"work_id":"50eb895d-2305-4f19-ab4c-4a0619da6879","year":2015},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.019377Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ac19e2cda58423d5b24ecf854cadebddb12f12031e78b061ab46cfba843d6792","observation_id":"91dc66ee-51b7-4ee3-a9dc-e1f7eceb547c","resolution":{"observed_at":"2026-08-12T15:01:19.718211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:17.026616Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.026616Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:23933e01e5a68e41d31bcbf2ea888b765f4d398a839c6f827230dd5c8002ae4e","observation_id":"2fcc19ca-81ee-4c69-a16c-cd2be6f6201d","resolution":{"observed_at":"2026-08-12T15:01:17.026616Z","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-12T15:01:17.038107Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.038107Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8068b8d89e03f19ff13c6aaa2961e73b2e42188a364c0747236f8c2101b18cc1","observation_id":"a4e60687-2ff8-48e8-84ec-4b26b9633733","resolution":{"observed_at":"2026-08-12T15:01:17.038107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11474","last_updated":"2023-04-12T20:56:40Z","snapshot_observed_at":"2026-07-06T14:54:41.337108Z","submitted_at":"2023-02-22T16:21:37Z","title":"Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11474","snapshot_observed_at":"2026-08-12T15:01:17.066336Z","title":"Mahoney, N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.066336Z"},"links":{"cited_paper":"/paper/2302.11474","citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:fd7f583b0da098cc6a38b75a005f6e120a28f3d71f49cfa0876e1664f2da62c8","observation_id":"67ca2d0d-ee41-422d-b5b5-a3d7a5270024","resolution":{"observed_at":"2026-08-12T15:01:17.066336Z","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-12T15:01:19.576977Z","title":null,"venue":null,"work_id":"ea9f8eb9-65f4-456d-a31b-22362699ec3a","year":2002},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.076869Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:e32ab00860e34181d756e61909108150e899e06d503135f29ffe1fabcd97eb24","observation_id":"f4216cd0-771b-46d3-8376-8a888d4dd1b4","resolution":{"observed_at":"2026-08-12T15:01:19.584211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.543409Z","title":null,"venue":null,"work_id":"425bf8c9-a23b-41b5-8271-915caab27265","year":2013},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.088094Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:699082a4f293cfd862cc65db442d45a8ec4adf3ccc3ebe276e555d803dbe4f64","observation_id":"fe17847e-ad2e-4ce7-bc30-59c090ddf096","resolution":{"observed_at":"2026-08-12T15:01:19.552234Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.506827Z","title":null,"venue":null,"work_id":"d3e04987-9e65-47c8-a9f1-be40f52ae76b","year":2015},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.100937Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:b2eb5cee4809407302f4d0e36b899d5d76b687ae8bb5b09c9dad5f0b1b86facb","observation_id":"32641284-e861-41c3-a4f9-c0468e936f85","resolution":{"observed_at":"2026-08-12T15:01:19.519089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.467817Z","title":"48(3), 2019","venue":null,"work_id":"2f6aa12c-c7ea-4136-93f3-b1286d1cb96e","year":2019},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.109967Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:06de32a20d3cf6eb082bc6c8688f26d3444a3e0cc294301d657fcbaa5a37f12e","observation_id":"7720c0f2-56b4-40ed-8210-a9e0ae720547","resolution":{"observed_at":"2026-08-12T15:01:19.477734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:17.050807Z","title":"Pattern Recognition 96 (2019), 106970","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.050807Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:631776d5c41994cdbefc1c9c21ba37076b9a22410b63698e846cb7296f94451e","observation_id":"d2bacca8-b62e-4336-b419-650372af8609","resolution":{"observed_at":"2026-08-12T15:01:17.050807Z","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-12T15:01:17.132076Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.132076Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:40b1c2a5ca3546ec59c3cddef5310825f2178fb4557b299c13ca0c96fd1e6d2d","observation_id":"cadb3b9e-4164-4857-bbbe-55083661a42f","resolution":{"observed_at":"2026-08-12T15:01:17.132076Z","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-12T15:01:19.373706Z","title":null,"venue":null,"work_id":"34de4321-7b7a-4306-b443-eba4b5e842c9","year":2018},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.142957Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:233e5562828d826eb29a4e9b28f28a612fc4e132aad41b4dc6afd5de6c62d0a6","observation_id":"49901e08-b47a-499e-bad1-0dc85db26674","resolution":{"observed_at":"2026-08-12T15:01:19.382026Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.342776Z","title":null,"venue":null,"work_id":"e7b2d463-8adc-43d0-bf12-e3b1c1388e2a","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.151142Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:f020bca5e451969bd508e779dfdcc0abda7459bda95382d18552b0d1549ec5ac","observation_id":"4b9683a3-62f7-43d7-86cd-ca7f8f56173a","resolution":{"observed_at":"2026-08-12T15:01:19.352719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.304156Z","title":null,"venue":null,"work_id":"ac8de80d-d5dd-4042-b771-7f65ba1e8140","year":2020},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.159302Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:7545ad46ecb3198c71122a8aef9ade75b211e6f4d248d903e61bd3f55e5d183a","observation_id":"ae7fd77f-9e4b-4525-b37e-c42d302dfb55","resolution":{"observed_at":"2026-08-12T15:01:19.315847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.272514Z","title":null,"venue":null,"work_id":"ea6e79d3-a170-4c81-8b3f-29233bb1094e","year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.167658Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:c1a3542be584c51ef90869302f5e48bde809566d906dac67810479bd29060e9f","observation_id":"c0b0addd-684b-4134-98b4-79e533fdbba3","resolution":{"observed_at":"2026-08-12T15:01:19.284326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.432644Z","title":null,"venue":null,"work_id":"9d4b1f79-6323-4e0d-a916-53c6b8c3cfe6","year":2008},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.121726Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:3f7c8cc531d1e146f84f6e97ddb8f92ba80046cbb3affe279c39adcbfeb8aad7","observation_id":"f25cf4d5-8aa3-41e4-a8b9-0b1af931eab6","resolution":{"observed_at":"2026-08-12T15:01:19.442466Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.197776Z","title":null,"venue":null,"work_id":"b6dd6597-7735-4e1a-b825-583321060d1b","year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.183770Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:e72881c5e31cc035b24c0e3d460230245a4557a64e1a5013dcc3f09a3f022d64","observation_id":"50e19d7c-1f74-4f2f-8342-453b86bc48b7","resolution":{"observed_at":"2026-08-12T15:01:19.213607Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.166430Z","title":null,"venue":null,"work_id":"1e0915ef-7a44-4c4f-b0ef-7deeeecf6967","year":2007},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.197895Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ee7c26494fe391ed6d1e297ca2a2302083d4f91b6014d2d3a6ecb1e655038fa8","observation_id":"3af3c8c2-171b-4a74-a320-3e3ee40fc175","resolution":{"observed_at":"2026-08-12T15:01:19.175547Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:17.205203Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.205203Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:92a57fdd9734937974077a7c6f9274afce782b5ad32d7d43ac08f7e3d7529a8f","observation_id":"a0ff2289-b92d-4ff9-9db0-5269d5f7091b","resolution":{"observed_at":"2026-08-12T15:01:17.205203Z","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-12T15:01:17.211543Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.211543Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:d2a5b433a87ffd929c616f96cb806b8a3a1de8acc2da90e9e42dc8e498d1155c","observation_id":"5a71b7c8-d6eb-4958-bacf-6eb7f578245d","resolution":{"observed_at":"2026-08-12T15:01:17.211543Z","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-12T15:01:19.077381Z","title":null,"venue":null,"work_id":"62c1f38a-294b-43c9-9622-ef0bd9d605d7","year":2017},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.222628Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:13e5b52605049f8a4b858a93e990c623e79d7ca40911b5eff2b27863c6c822e1","observation_id":"a5d815f9-070e-47d3-90cf-9fed9002cb2d","resolution":{"observed_at":"2026-08-12T15:01:19.089222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.236817Z","title":null,"venue":null,"work_id":"14d828fe-3181-4ec3-8267-1fe954808fa7","year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.174221Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:ba2718e769b328dcf16e79b1b2e974cb16254dae430a5d05682dda794196295e","observation_id":"618839bb-7104-4855-9726-88640041a5bf","resolution":{"observed_at":"2026-08-12T15:01:19.245990Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.975646Z","title":null,"venue":null,"work_id":"b291b65e-2718-49c9-a014-88635dcf6e96","year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.241478Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:a9950fdd22d9524e99c1a05395638bb926f5e7d8e3c462b3b9215cab02c3f8e9","observation_id":"2df50a44-eef5-4988-8bda-788a73d8bc23","resolution":{"observed_at":"2026-08-12T15:01:18.984577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.922633Z","title":null,"venue":null,"work_id":"da4adc56-6061-430b-b017-c021938bdcb3","year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.247672Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:bbe26c31ab561bb94edb6ab83347ff60651a48e41b06b73fee474893f43e822e","observation_id":"579e7df7-2b89-4022-8597-8f328f4f65a4","resolution":{"observed_at":"2026-08-12T15:01:18.938274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:17.257135Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.257135Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8d85135dce6d8e3b25dfdf76ca1d881d045315dc32509e9431bc4222f6e33f64","observation_id":"acfad94a-1c81-415b-98c2-7424f44fe799","resolution":{"observed_at":"2026-08-12T15:01:17.257135Z","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-12T15:01:17.267014Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.267014Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:cf6f0c570ba961e9fc14299e681f26828f4c8e59fd5aca0714623aa7d03a3002","observation_id":"53277a3d-775d-481a-b3f0-d9e5a8de95b3","resolution":{"observed_at":"2026-08-12T15:01:17.267014Z","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-12T15:01:18.835649Z","title":null,"venue":null,"work_id":"807a5d44-3953-48ad-8da3-7226d9ef10b3","year":2021},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.279013Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:8e1d5149c648e3c62c853d5ff6c84f53b00665180c9a3a36940e14567502e8f5","observation_id":"abbb3abd-720d-4481-a9a7-6984bb75d75e","resolution":{"observed_at":"2026-08-12T15:01:18.848521Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:19.029629Z","title":null,"venue":null,"work_id":"d5a5e74a-8b9b-4da9-9b54-667f8bcc134a","year":2009},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.231581Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:d102f820707929c24b71ff8643b788f94d51232100c2109a2e67f72f8db737c3","observation_id":"8b8ef00a-d085-4154-bda4-e7ab01f9a3ef","resolution":{"observed_at":"2026-08-12T15:01:19.041592Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.744564Z","title":null,"venue":null,"work_id":"e7a2e394-1520-4d0e-937d-039efa41047a","year":2013},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.292873Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:174153dbb1d0ab77c2dda31896967bf5803690c572ac93b65088f1d6459b3f3f","observation_id":"33e2145d-d5f0-430b-be3b-532462de03bc","resolution":{"observed_at":"2026-08-12T15:01:18.762444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.709353Z","title":null,"venue":null,"work_id":"53a05a82-d469-4dcc-aa9d-af3ad039bd03","year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.303419Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:9b09f4149b9dca59c57fe5ada6bd7cb9e49088fd8306ba1032a519561902d640","observation_id":"0cd00ca7-a1c7-4769-aa4a-03e392e5ed92","resolution":{"observed_at":"2026-08-12T15:01:18.716221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.658959Z","title":null,"venue":null,"work_id":"4c8d061f-d945-48c0-b22c-6e638759e03d","year":2024},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.314120Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:5d55dc72a7710d292022f4636e6d78440421bae4abc581cef7aeef37d4b45ce3","observation_id":"8160001f-eec0-4f48-91ef-6d01823933f3","resolution":{"observed_at":"2026-08-12T15:01:18.671278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.620642Z","title":null,"venue":null,"work_id":"eb3934fa-3cbf-47cb-98b9-832dca6151a9","year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.325674Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:a1e17a78f5d9c6564d84e7dbe140f2d3504958dc1955b802ee341648ba0e677d","observation_id":"5c2675f8-5cf0-4562-9e86-94d9c9ec74b5","resolution":{"observed_at":"2026-08-12T15:01:18.632458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.581341Z","title":null,"venue":null,"work_id":"350d2026-9070-4431-895f-b35998777fb1","year":2024},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.331652Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:53350675da12568f6528d60b36230f82fd2fd4ab1791a4d1b21d1e777b685357","observation_id":"8cdad24b-ed3a-4b0e-8e6e-56b924d3e5e1","resolution":{"observed_at":"2026-08-12T15:01:18.589738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:01:18.800307Z","title":null,"venue":null,"work_id":"b6e551ff-9fc5-4484-ae58-22c39c22547a","year":2023},"citing_paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-12T15:01:17.285714Z"},"links":{"citing_paper":"/paper/2411.14754"},"observation_digest":"sha256:c26c77098a1fc21e46dd1ff24e70d65614013b8977f86233c88a49590513c949","observation_id":"c0e62904-9c81-4e72-b2b3-012bc521df02","resolution":{"observed_at":"2026-08-12T15:01:18.816013Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14754","last_updated":"2025-01-13T08:37:43Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-12T14:53:43.925608Z","submitted_at":"2024-11-22T06:23:10Z","title":"Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":95,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":120},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 100 of 120 outbound references and 0 inbound Pith citation observations for arXiv:2411.14754."}