{"as_of":"2026-08-19T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:206c4ee853660494982a808d27cb5c63ed5e24d3fd870a6424f8134f937eeaea","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:45:39.295729Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-09T15:05:45.020782Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01528","last_updated":"2025-02-03T17:08:26Z","snapshot_observed_at":"2026-08-17T12:56:16.316010Z","submitted_at":"2025-02-03T17:08:26Z","title":"SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T15:05:45.020782Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2502.01528"},"observation_digest":"sha256:13898ea775637add9449cf4d60d48e62c4cb7fda7da854b19a0d01b8233a0a23","observation_id":"4df4b8a7-27f8-4da9-8158-dbd47c6c884f","resolution":{"observed_at":"2026-08-09T15:05:45.020782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-15T22:45:39.295729Z","title":"CoRR abs/2308.15014, DOI 10.48550/ARXIV","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.06501","last_updated":"2025-05-10T04:02:14Z","snapshot_observed_at":"2026-08-18T03:17:35.954305Z","submitted_at":"2025-05-10T04:02:14Z","title":"Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T22:45:39.295729Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2505.06501"},"observation_digest":"sha256:f987177075ddf28b5011e5532e1e7b64a01bb6a942d3d6b466cbcb8b2bb39ded","observation_id":"191650fc-fcac-42b1-be03-e11167fbe175","resolution":{"observed_at":"2026-08-15T22:45:39.295729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-06T17:05:28.677197Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11907","last_updated":"2025-07-20T04:50:39Z","snapshot_observed_at":"2026-08-18T20:57:54.542115Z","submitted_at":"2025-07-16T04:46:28Z","title":"SIEVE: Effective Filtered Vector Search with Collection of Indexes","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:05:28.677197Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2507.11907"},"observation_digest":"sha256:9c08770a04f48d06ef10b935d6270d03df9ca3694dd56901e455ecf1e14623ed","observation_id":"bee2b17f-0745-48e3-b5bd-ca333886209b","resolution":{"observed_at":"2026-08-06T17:05:28.677197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-04T21:44:44.413882Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-13T05:28:45.073121Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:44.413882Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:509319634f7d8186eb8787f20a693d924ba037d3ba186a92fa921e89bab4253a","observation_id":"6b89367b-cf50-43e6-8c16-6aa8fd2c5184","resolution":{"observed_at":"2026-08-04T21:44:44.413882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":"2308.15014","doi":"10.48550/arxiv.2308.15014","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"59e563fd-e191-41a0-a34e-d30289d9ca27","year":2023},"citing_paper":{"arxiv_id":"2604.02522","last_updated":"2026-04-02T21:23:00Z","snapshot_observed_at":"2026-08-11T16:10:33.092074Z","submitted_at":"2026-04-02T21:23:00Z","title":"Opal: Private Memory for Personal AI","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-05-13T21:09:06.320543Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2604.02522"},"observation_digest":"sha256:c11a201f8254a64455b8a0dd0d3a19772e44db0457b88885dbbc1e4381e2a0fa","observation_id":"9cc43b27-f96c-42c0-ae7e-adb559b390d7","resolution":{"observed_at":"2026-05-13T21:13:16.707507Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":"2308.15014","doi":"10.48550/arxiv.2308.15014","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"59e563fd-e191-41a0-a34e-d30289d9ca27","year":2023},"citing_paper":{"arxiv_id":"2605.07770","last_updated":"2026-05-08T14:11:49Z","snapshot_observed_at":"2026-08-16T05:28:58.967670Z","submitted_at":"2026-05-08T14:11:49Z","title":"FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-11T02:38:26.167721Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2605.07770"},"observation_digest":"sha256:ed493007f2725e5e144731273b26a5a0812055e7ac47be5d63c28ffa75f1c721","observation_id":"168a5ca1-a0b1-43b3-bfcd-a9c4eb0e7146","resolution":{"observed_at":"2026-05-11T02:40:53.672872Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":"2308.15014","doi":"10.48550/arxiv.2308.15014","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"59e563fd-e191-41a0-a34e-d30289d9ca27","year":2023},"citing_paper":{"arxiv_id":"2606.11789","last_updated":"2026-06-10T08:21:52Z","snapshot_observed_at":"2026-08-06T05:47:55.997746Z","submitted_at":"2026-06-10T08:21:52Z","title":"Efficient Graph Indexing for Interval-Aware Vector Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:0e5781e1e40ad5b654d42f9b01b0ed1e09648a3f491df628f5b67c944751e2d7","observation_id":"60dc8085-9840-455e-b2fb-b61888cd229f","resolution":{"observed_at":"2026-07-03T13:38:18.599488Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":"2308.15014","doi":"10.48550/arxiv.2308.15014","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"59e563fd-e191-41a0-a34e-d30289d9ca27","year":2023},"citing_paper":{"arxiv_id":"2606.19898","last_updated":"2026-06-18T07:54:12Z","snapshot_observed_at":"2026-08-15T08:03:03.231323Z","submitted_at":"2026-06-18T07:54:12Z","title":"Query-aware Routing for Filtered Approximate Nearest Neighbors Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T15:30:03.463197Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2606.19898"},"observation_digest":"sha256:118531e81f0e6084f3e58e73eddb655213f87046b2b7363d1004271fb8007eac","observation_id":"a885f0d1-757c-459c-b6c0-a759cf69b4eb","resolution":{"observed_at":"2026-07-04T05:49:36.914476Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-07-31T21:58:57.964862Z","title":"arXiv preprint arXiv:2308.15014 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-19T01:24:35.251729Z","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":12,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:57.964862Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:edb72b462685bbfe23b66c7c65eed9cc005b38f137d614a2fb5f7e97d2dae248","observation_id":"deec3681-150a-403d-9004-9a449b31ed9e","resolution":{"observed_at":"2026-07-31T21:58:57.964862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-08T13:07:44.553791Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-17T02:06:16.174392Z","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":12,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.553791Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:0fb196b2055e0357791bc683cc1679d6a7aeda9d60dd6e63256aa73894c00508","observation_id":"4385eed2-3289-4833-be53-20bf3c82b84b","resolution":{"observed_at":"2026-08-08T13:07:44.553791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2308.15014/citation-record","integrity":"/paper/2308.15014/integrity","json":"/paper/2308.15014/citation-record.json","paper":"/paper/2308.15014"},"outbound":[],"paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T15:05:04.477066Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search"},"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-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 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2308.15014."}