{"as_of":"2026-08-19T00:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bc16224207ebc3264d028d0ebc4398fbfc10f73340ec375612ae0f81f0c1314","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:55:41.968724Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2501.13992/citation-record","integrity":"/paper/2501.13992/integrity","json":"/paper/2501.13992/citation-record.json","paper":"/paper/2501.13992"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:55:42.641682Z","title":"Estimating local intrinsic dimensionality","venue":null,"work_id":"b8bf52ac-4ceb-4638-ac34-a09c428c34f6","year":2015},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.852245Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:f708e72315d78c7e765f6d09ca00bd6dd9e8851c22a3441dae04f8a40d709a22","observation_id":"f98d6ac0-1049-4810-b628-1e5755138678","resolution":{"observed_at":"2026-08-10T15:55:42.647705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.618264Z","title":"Babenko and V","venue":null,"work_id":"b12610b9-169a-4bb7-8b79-79c43432674c","year":2016},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.858522Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:0ac92d94e922714e6a7ca7e9c8f5194ba472a6597d05d45d1037bd39fe263fe2","observation_id":"97617bc2-3f9b-4a89-9bfd-1cefb160d43b","resolution":{"observed_at":"2026-08-10T15:55:42.628741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.599042Z","title":"Learning to route in similarity graphs","venue":null,"work_id":"b2200c58-4396-48b9-b480-4464eebf09b5","year":2019},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.865357Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:52ca3317b700e93d1db6e13c9ba4e8e8ed9691f4cce78f8e251a04957469e29a","observation_id":"799c39ce-8491-4442-8988-75580cb5dfc7","resolution":{"observed_at":"2026-08-10T15:55:42.605975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.576441Z","title":"Computational enhancements of hnsw targeted to very large datasets","venue":null,"work_id":"1bc73d85-6403-4488-9837-3cfce6adfc54","year":2023},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.872917Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:795a170e3a7cf437b48be09cd5c1119b248a49a77b3187b1cce95effd4a6c1b7","observation_id":"0c1d9277-6cc5-4e6e-89e2-04b04dfadc03","resolution":{"observed_at":"2026-08-10T15:55:42.582866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:41.879848Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.879848Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:9e91e6eced67057393be159cce1344d8c8f3a8a6898e50c36b3946f6a3023b45","observation_id":"63932c13-f262-442b-9890-0cfec6b8988c","resolution":{"observed_at":"2026-08-10T15:55:41.879848Z","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-10T15:55:42.556741Z","title":"Hand, Heikki Mannila, and Padhraic Smyth","venue":null,"work_id":"11b83494-05c6-4ca7-a93f-e8f23430b887","year":2001},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.885754Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:c3f5c6b78b7b33134716de5faeb013dd235988a964c3c108d14112488b672aa5","observation_id":"e06d7e38-17b9-4de7-a78f-c84c34ff4448","resolution":{"observed_at":"2026-08-10T15:55:42.562464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.536665Z","title":"Houle, E","venue":null,"work_id":"f65ec8c8-17e5-4ca2-ae76-41fee15a0326","year":2018},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.891906Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:b6937b938be0c302476ba48a4f70bf96e5cee8cb24b2ccff20c761f51fc5a740","observation_id":"c738eca8-6297-41e5-921a-6ee27968d504","resolution":{"observed_at":"2026-08-10T15:55:42.542163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.516742Z","title":"Billion-scale similarity search with gpus","venue":null,"work_id":"3fdb5e8e-a90e-4f0a-b0a1-af79258996b7","year":2019},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.898656Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:adbd18e7c502e05a6b18402f18ff7470a42f0f1c8122448700e98d26f7ff5b62","observation_id":"d1d54716-6120-4fe9-aa1b-317f360aa717","resolution":{"observed_at":"2026-08-10T15:55:42.522789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.497866Z","title":"Jégou, M","venue":null,"work_id":"df7119b8-3c06-4cfa-8d6c-7d7ddbeb1bc3","year":2011},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.905769Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:0c41fc01fd9b0cad1608fc4b8ba118afad7bc418a05939ad501b53a3ad3d290d","observation_id":"9b02ec68-ac00-4086-9436-892747d4800f","resolution":{"observed_at":"2026-08-10T15:55:42.502994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.472451Z","title":null,"venue":null,"work_id":"77aa9bd1-44cf-4c16-b64b-72ea97a37555","year":2004},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.911880Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:b876cb9856cf2b068f2c7fc1f817b43b846a91ce7c935803122fa367368e9286","observation_id":"36ca087b-7238-45af-bb9d-870edf0e9416","resolution":{"observed_at":"2026-08-10T15:55:42.484095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02077","last_updated":"2019-06-18T09:07:06Z","snapshot_observed_at":"2026-08-14T16:52:14.974071Z","submitted_at":"2019-04-03T16:12:55Z","title":"Graph based Nearest Neighbor Search: Promises and Failures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.02077","snapshot_observed_at":"2026-08-10T15:55:41.918732Z","title":"Graph based nearest neighbor search: Promises and failures","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.918732Z"},"links":{"cited_paper":"/paper/1904.02077","citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:71e2a4e16b6eeff23eb97139180ea25efa82e745286d04c9d8cccdbadf28d725","observation_id":"e73aeea9-fd91-4eb1-91e3-d5b2f74c23ce","resolution":{"observed_at":"2026-08-10T15:55:41.918732Z","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-10T15:55:41.924885Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.924885Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:e524e441bd3a17263c879da71b118001b14d95cb1ff73060854cfffacb952372","observation_id":"7635843f-bbd1-4128-b6e9-9540d75b630d","resolution":{"observed_at":"2026-08-10T15:55:41.924885Z","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-10T15:55:42.447455Z","title":"Pennington, R","venue":null,"work_id":"69eea9eb-34e4-441f-b22b-00f9f305a110","year":2014},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.931273Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:73a60904f257b3285d0611ed2d599ddfde8242e48a3f153e0bd4c4d3f8916e00","observation_id":"b3b40ee1-7eb2-4525-8a3b-2475b1364a4c","resolution":{"observed_at":"2026-08-10T15:55:42.454848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.429622Z","title":null,"venue":null,"work_id":"501e610e-2498-445f-a83a-b92082b7e7e1","year":2011},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.936674Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:a98fbc159a4f3aa770cd5e9d597c9151947d6debe012b1364995fd065ad6db01","observation_id":"b2c54067-11de-4042-90e7-7edd99e33b70","resolution":{"observed_at":"2026-08-10T15:55:42.435628Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:42.410279Z","title":"Connecting compression spaces with transformer for approximate nearest neighbor search","venue":null,"work_id":"6d68ffa1-e4f0-4bf2-9df5-1b8a7ec5726d","year":2022},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.942274Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:eee7fad0df5d5fedf9d3ade8053f2cf617ac1876d612f3ed0b5075d4672c6e82","observation_id":"b2769ea2-e3ea-4972-bd4a-f5dbba07d990","resolution":{"observed_at":"2026-08-10T15:55:42.417561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T15:55:41.947738Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.947738Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:0a3ab98b26684af75e34cc2d67e20d645302d470336a885cf81f3e0cec175b82","observation_id":"9c31cf9f-d9bd-4610-8664-14de4b56f3fa","resolution":{"observed_at":"2026-08-10T15:55:41.947738Z","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-10T15:55:41.954950Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.954950Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:e3d9060911e083fa2972a2176850da7dcd603b6155c8b2c0773699f0d48925d2","observation_id":"cd45a546-2be2-4c3d-94f3-825bcedfdd64","resolution":{"observed_at":"2026-08-10T15:55:41.954950Z","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-10T15:55:41.962619Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.962619Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:bc284ba96d9b88baf432ea3e9050f79ebbac88caa45fb6f9554b1f6a80c32ea4","observation_id":"156d45ec-c3bc-4056-989d-a8411fb5f24e","resolution":{"observed_at":"2026-08-10T15:55:41.962619Z","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-10T15:55:41.968724Z","title":"_ 8 BRS> <yvݵ?gm | XW ލ Zu x;ydk 8S] =`g xm c 05 ̫FXXpyתsz4a„&//4i233 ͭުDIReeٽ>RAA /ht<կ .o߾l޼9` ]w:봴4M4)5/ |]Mv >&Ol^޷o + UW`e?v[ D k0eʔ& 6h͚3gy]AAz꥙3gG mc5e ;ɻݮ]uVm޼Y۷o[8Tj]; @8","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T15:55:41.968724Z"},"links":{"citing_paper":"/paper/2501.13992"},"observation_digest":"sha256:cd99a70a671da37661f22e17a2dc1b7fec76d452cc484cc8da40aa56039ec8cb","observation_id":"771ab51b-904a-4fcd-9a30-0b41ee9fc3df","resolution":{"observed_at":"2026-08-10T15:55:41.968724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.13992","last_updated":"2025-04-25T07:22:17Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T19:25:47.938688Z","submitted_at":"2025-01-23T10:20:12Z","title":"Dual-Branch HNSW Approach with Skip Bridges and LID-Driven Optimization"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":19},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2501.13992."}