{"as_of":"2026-08-09T11:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf6ade7c53b5e5d60c554afda23cdb6a96af090bf69db4695b3ab5556632faa7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:07:44.595109Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T02:57:34.461120Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-08-06T17:05:32.043217Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11907","last_updated":"2025-07-20T04:50:39Z","snapshot_observed_at":"2026-08-06T16:56:19.340216Z","submitted_at":"2025-07-16T04:46:28Z","title":"SIEVE: Effective Filtered Vector Search with Collection of Indexes","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T17:05:32.043217Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2507.11907"},"observation_digest":"sha256:9bfe1108e45f904568dc62c0eb66d97386659f3829a80558adbe217d5715bf2a","observation_id":"b1d36a65-93e9-4ee6-8a78-13a1d23c77f7","resolution":{"observed_at":"2026-08-06T17:05:32.043217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-08-03T03:53:56.488555Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.06721","last_updated":"2026-05-28T06:51:41Z","snapshot_observed_at":"2026-08-03T10:22:00.755057Z","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:56.488555Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:132930caf11c1e3026b37bc73991dc15d55d2911bfeb889a9977e8131ae14796","observation_id":"2d651bd0-4835-495d-a02e-c552b60b2fe8","resolution":{"observed_at":"2026-08-03T03:53:56.488555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2604.06616","last_updated":"2026-04-30T00:32:29Z","snapshot_observed_at":"2026-07-06T22:55:01.863342Z","submitted_at":"2026-04-08T02:49:55Z","title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T17:34:24.958030Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2604.06616"},"observation_digest":"sha256:1dc641319a04096994db4f3c4fff5ec8502f92054d395c612cbc7c5b51a7d687","observation_id":"2db8a124-e674-43ef-a514-d3b8d0802b81","resolution":{"observed_at":"2026-05-11T06:36:03.042267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2605.01342","last_updated":"2026-06-02T21:03:40Z","snapshot_observed_at":"2026-08-08T03:12:25.681409Z","submitted_at":"2026-05-02T09:26:04Z","title":"Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T16:13:24.701615Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2605.01342"},"observation_digest":"sha256:a4dfb78e920338576dbc0961e8b9640f27b1bdf94f1b7ae5954fe986f4bc38c5","observation_id":"7d684039-7082-4ca6-b694-668cf669773a","resolution":{"observed_at":"2026-05-11T09:10:59.294832Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2605.01342","last_updated":"2026-06-02T21:03:40Z","snapshot_observed_at":"2026-08-08T03:12:25.681409Z","submitted_at":"2026-05-02T09:26:04Z","title":"Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-14T21:33:06.260347Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2605.01342"},"observation_digest":"sha256:de4b52f376502cfd6dff7886ebe944a05da99b979f0a70800f35b029f1b2f620","observation_id":"ec949567-100c-4348-9d9e-e14e61c4fd22","resolution":{"observed_at":"2026-05-14T21:38:01.194732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2605.01342","last_updated":"2026-06-02T21:03:40Z","snapshot_observed_at":"2026-08-08T03:12:25.681409Z","submitted_at":"2026-05-02T09:26:04Z","title":"Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-01T00:51:46.143673Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2605.01342"},"observation_digest":"sha256:566df6fec09fa464e355e44cf0ab1ec97233effed410b44b587597af5a770ca9","observation_id":"24ccf61f-72d7-4594-a2a7-3f3f4f998e2a","resolution":{"observed_at":"2026-07-01T00:55:11.890568Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2606.29968","last_updated":"2026-06-29T08:44:33Z","snapshot_observed_at":"2026-08-08T07:25:29.192084Z","submitted_at":"2026-06-29T08:44:33Z","title":"CLIP: Lightweight Cosine-Law-Based Inverted-List Pruning for IVF-Based Vector Search","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-30T03:53:53.669169Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2606.29968"},"observation_digest":"sha256:e3d56044d9880624330a186a4b0eeaf37e070eab632beba4f60ad7543730d953","observation_id":"bad58ad0-0f8e-46ae-8589-bf6afcd2b1ba","resolution":{"observed_at":"2026-07-01T15:15:48.245015Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2607.00768","last_updated":"2026-07-01T10:52:09Z","snapshot_observed_at":"2026-08-03T20:26:39.740621Z","submitted_at":"2026-07-01T10:52:09Z","title":"RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-02T03:11:31.712329Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2607.00768"},"observation_digest":"sha256:35cbcc82740d51832a40f23e86420a9a1581f2e9d0e3a0f01a52722ea805aee1","observation_id":"89f45c0e-a3e1-42a4-a5a1-30f87195041a","resolution":{"observed_at":"2026-07-02T03:16:33.281008Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":"2203.13601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-03T02:57:34.461120Z","title":null,"venue":null,"work_id":"a9a8adc4-8790-463e-816f-cd8d3ed1a9c7","year":2022},"citing_paper":{"arxiv_id":"2607.02338","last_updated":"2026-07-05T02:09:42Z","snapshot_observed_at":"2026-08-02T19:20:45.091703Z","submitted_at":"2026-07-02T15:44:43Z","title":"HNSW with Accuracy Guarantees Using Graph Spanners","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-03T02:55:42.606201Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2607.02338"},"observation_digest":"sha256:e0ef80493dd3644de44e10f6ea165b62d69bc4213fd8632c41ba6643e656a9ee","observation_id":"c2a39fd2-175d-4dbd-8b9b-66985d0bedc5","resolution":{"observed_at":"2026-07-03T02:57:34.462634Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-12T08:12:08.041225Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02338","last_updated":"2026-07-05T02:09:42Z","snapshot_observed_at":"2026-08-02T19:20:45.091703Z","submitted_at":"2026-07-02T15:44:43Z","title":"HNSW with Accuracy Guarantees Using Graph Spanners","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-12T08:12:08.041225Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2607.02338"},"observation_digest":"sha256:ef09c974f614bb85169574a1cb0d8c6bd495d2d110e24171a23f15c5914a407d","observation_id":"ef849e7b-ac69-46dd-8bfb-e8bfd01fbd85","resolution":{"observed_at":"2026-07-12T08:12:08.041225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-07-31T21:58:59.454756Z","title":"arXiv preprint arXiv:2203.13601 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-03T03:53:23.301758Z","submitted_at":"2026-07-27T08:55:09Z","title":"Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.454756Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:928b8ecbaec1f358b35536e83dc1f847d2eeee9424bb4e708e3d58458ea2171a","observation_id":"8a76358a-5f19-49bb-8264-de1c711e6d7c","resolution":{"observed_at":"2026-07-31T21:58:59.454756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-08-04T01:22:30.549017Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00650","last_updated":"2026-08-01T13:09:51Z","snapshot_observed_at":"2026-08-08T11:48:20.923413Z","submitted_at":"2026-08-01T13:09:51Z","title":"TEngineDB-V: An OLAP-Native Vector Search System for Large-$k$ Workloads at Tencent","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T01:22:30.549017Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2608.00650"},"observation_digest":"sha256:2bb5242d96852babc11665fac4db7f38482067e217dfec05c4bfe79438231cb9","observation_id":"cdaf99f2-9b9d-43b0-866b-0f13f8c39f61","resolution":{"observed_at":"2026-08-04T01:22:30.549017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13601","snapshot_observed_at":"2026-08-08T13:07:44.595109Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T11:11:27.700340Z","submitted_at":"2026-08-05T22:20:01Z","title":"Filtered Vector Search in a Disaggregated Lakehouse: Composing Table-Format Pruning with Per-File ANN","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.595109Z"},"links":{"cited_paper":"/paper/2203.13601","citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:026c31bff57775974f740d9de5224e0bfe60f5ddad236f043d55f03c69715441","observation_id":"bcda84f9-63e2-4693-96e6-470cbaa56879","resolution":{"observed_at":"2026-08-08T13:07:44.595109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.13601/citation-record","integrity":"/paper/2203.13601/integrity","json":"/paper/2203.13601/citation-record.json","paper":"/paper/2203.13601"},"outbound":[],"paper":{"arxiv_id":"2203.13601","last_updated":"2022-03-25T12:02:37Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-07-06T12:52:28.057954Z","submitted_at":"2022-03-25T12:02:37Z","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2203.13601."}