{"as_of":"2026-08-10T07:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f6c00b53ab75eae0371e237cfb01b3443dd092524e717eecd34d1b302b9e5ec2","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:07:44.599035Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2608.05441/citation-record","integrity":"/paper/2608.05441/integrity","json":"/paper/2608.05441/citation-record.json","paper":"/paper/2608.05441"},"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-08T13:07:45.039073Z","title":null,"venue":null,"work_id":"20a8ecc1-5a68-4152-8239-6758840c42d4","year":2023},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":1,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.506353Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:40bac5b0217baeb3864a490e47e45c05674b97d689ffc0a641a6d627d4ce84bb","observation_id":"b1534140-6d67-49bc-a62f-d04515cd71ff","resolution":{"observed_at":"2026-08-08T13:07:45.043333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:45.022679Z","title":null,"venue":null,"work_id":"f26d8091-ebba-4229-8eac-eebb7755d5d1","year":2023},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":2,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.510563Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:43523448183b8e7512ec7a7ffe731a21ad6be417e1b5ac3d35d5fa59774a3d6b","observation_id":"f52a7c09-9cb0-4189-be7a-8390f3dc1277","resolution":{"observed_at":"2026-08-08T13:07:45.027524Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:45.006275Z","title":null,"venue":null,"work_id":"f46db4d8-6fa1-4b3a-b4ab-fb6f6c326a4c","year":2021},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":3,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.514230Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:d5d13900ba0b8edda8b62bc758edb85949b35fb381ab1288704d6ac3a4a1c56e","observation_id":"a493f53d-9334-40ad-8c21-c1ec8649630b","resolution":{"observed_at":"2026-08-08T13:07:45.011290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.992054Z","title":null,"venue":null,"work_id":"2e1d2c3b-8a0a-485b-8d2e-3aae598bd41d","year":2022},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":4,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.517958Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:da6daa83ede41c9afa91a418e6a958b6fb6a7ff6b8364eddd75c51d1a176b7bf","observation_id":"94a56578-8676-4687-b293-0ff90b448c23","resolution":{"observed_at":"2026-08-08T13:07:44.995583Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.04196","last_updated":"2026-06-02T20:27:42Z","snapshot_observed_at":"2026-07-06T23:44:19.059079Z","submitted_at":"2026-06-02T20:27:42Z","title":"Puffin-Backed Vector Indexes: Attaching Approximate Nearest Neighbor Indexes to Apache Iceberg Snapshots for Compute-Disaggregated Query Engines","version":1},"cited_work":{"arxiv_id":"2606.04196","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.04196","snapshot_observed_at":"2026-08-08T13:07:44.800442Z","title":"Puffin-Backed Vector Indexes: Attaching Approximate Nearest Neighbor Indexes to Apache Iceberg Snapshots for Compute-Disaggregated Query Engines","venue":"cs.DB","work_id":"06680b34-9185-4288-8422-a40998152a61","year":2026},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":5,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.522094Z"},"links":{"cited_paper":"/paper/2606.04196","citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:daf8a0d1ba914d4090cf7f8e3b318fb81be68fc5567ebc2c062437651376da8c","observation_id":"e58161a5-9d5a-4448-b8e6-25d135724dfd","resolution":{"observed_at":"2026-08-08T13:07:44.805934Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.981889Z","title":null,"venue":null,"work_id":"a74f44b5-0e70-4e7a-97bc-8e5089b7fb50","year":2021},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":6,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.526247Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:4253a370fcdb399cbd5d98441df4f7af7cb2314bc5d4b280555873a60a144abd","observation_id":"c05e1001-378b-4f3b-9aa4-28b165d29edb","resolution":{"observed_at":"2026-08-08T13:07:44.985334Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.971154Z","title":null,"venue":null,"work_id":"27d6952d-109a-4273-98ca-2c41eeb34043","year":2025},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":7,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.530583Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:bb52ae1d5f1ae78e8058a9eef000a5107957d93c207287f0c535850e5028cdd8","observation_id":"e19f8591-8f4e-42b1-96d1-c96491142233","resolution":{"observed_at":"2026-08-08T13:07:44.974778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.961005Z","title":null,"venue":null,"work_id":"80be771b-7cee-4604-b292-22abbe323972","year":2024},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":8,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.538333Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:0b9839eaf682e1c1ec2b955b59e16d56ac2b950be85b61569a5b7297181f323c","observation_id":"f12bbab5-b844-4ab9-8929-f6b016bcf6aa","resolution":{"observed_at":"2026-08-08T13:07:44.964737Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.951080Z","title":null,"venue":null,"work_id":"3cf7a7d5-359f-4245-b3e4-7fe3de715984","year":2016},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":9,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.542186Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:20589e91c6d5049518a4790963439a29ba84cd88b0e548ff6b4b0a1b5e155bd7","observation_id":"46197ce7-934e-40e2-a47a-eded6b3fe1be","resolution":{"observed_at":"2026-08-08T13:07:44.954475Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.940768Z","title":null,"venue":null,"work_id":"75d7f603-5de2-4c37-8ae1-c9f372412c99","year":2024},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":10,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.545940Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:0cb493daf57e10d7056bdbe401075b3c785c7f3d796eab263ef7cc9a5f909e06","observation_id":"7e0d3fbf-304e-4e8d-8fa8-f73328f40b37","resolution":{"observed_at":"2026-08-08T13:07:44.944434Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.930639Z","title":null,"venue":null,"work_id":"f1145bd7-b7f2-48cd-a540-5f34754640da","year":2023},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":11,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.549754Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:ec8502174127dcd4728cfb49ab700b6b50f547db31dc913cdfb2a641e4580d4e","observation_id":"d2385708-62fc-4b7c-9eef-9332996c7a0c","resolution":{"observed_at":"2026-08-08T13:07:44.934183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-03T18:44:21.028766Z","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-09T23:10:50.216341Z","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:f3864ffd5168f69301f4d6cf8a572ba06d98d4b23a462b7064566aad9bd791a9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.919678Z","title":null,"venue":null,"work_id":"e75c8972-d421-4b5f-829e-aa6d1dd2b6f9","year":2011},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":13,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.558009Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:8ec73e7ed21099e93172db6a6a298909b4b2c3b096ec70f509a6104d1ee035c7","observation_id":"2f82a446-cce7-454a-952a-38f1b73b46db","resolution":{"observed_at":"2026-08-08T13:07:44.923903Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.909439Z","title":null,"venue":null,"work_id":"6761dc12-0634-4877-9217-4e6f9e81d1f3","year":2024},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":14,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.561852Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:f1a1e2a7df167faef477d00913a4f7bf71fad30dcf483a63d60069f081894746","observation_id":"291d36f4-9e1e-4f52-ad60-fa2a24a28470","resolution":{"observed_at":"2026-08-08T13:07:44.912940Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.898746Z","title":null,"venue":null,"work_id":"6c93b142-2034-40cd-a65d-1376eace2293","year":2024},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":15,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.565622Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:ec7007cbca39e34107d45c5f1f7b07f09ad19441a18c6cbd3b3f6b166cde9d5f","observation_id":"eb307e47-dce1-489c-8ffc-1734727e45bf","resolution":{"observed_at":"2026-08-08T13:07:44.902337Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.888216Z","title":null,"venue":null,"work_id":"f5a1a959-eae8-43f5-a8b3-4bf1f56e797a","year":null},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":16,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.569456Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:20e3c5ffb4ef54370b71bf8de758921a0e023d7120f094c71a4ded8e967cdfe0","observation_id":"eb4483a0-cde8-4881-98ff-f76f005cb594","resolution":{"observed_at":"2026-08-08T13:07:44.891870Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.876325Z","title":"Malkov and Dmitry A","venue":null,"work_id":"cf696a66-2667-43ef-b7fb-31b858bf0e53","year":2020},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":17,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.576844Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:a388180e0542e676e5ef046268b10ce3d11d6f53c48eb8e8322045536b63cf13","observation_id":"d71ae908-31ba-420f-8a30-215fc9ee26b9","resolution":{"observed_at":"2026-08-08T13:07:44.880284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.864001Z","title":null,"venue":null,"work_id":"66da3e10-d27d-4bd5-9182-d3922c2594ca","year":2024},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":18,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.580428Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:cecd8525918bb5b14b3e9843c598484520504f460f1562c365e8f8e224b7f113","observation_id":"66aaeb9e-d761-4a82-a9b3-b6315b1f64e7","resolution":{"observed_at":"2026-08-08T13:07:44.868252Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.851194Z","title":null,"venue":null,"work_id":"b40c4795-5cb4-4880-a628-bb07ef1c3727","year":2019},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":19,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.584386Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:34158889ad3cd84a212248397293651477c6b3e62e412202c2ef48fbcf8b35a6","observation_id":"334d50ed-3bbf-42a0-8942-e46abbb51389","resolution":{"observed_at":"2026-08-08T13:07:44.855161Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.838957Z","title":"Thaler and Chinya V","venue":null,"work_id":"13077023-28ab-445e-b12c-57279edd02ec","year":1998},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":20,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.587922Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:cb2d59999a5033c7f64409ff26f5ccbc1ce2609f9365806ec66b25d2f778a562","observation_id":"3104e012-57ca-44ea-bb9c-39452b8dfc75","resolution":{"observed_at":"2026-08-08T13:07:44.842938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.826759Z","title":null,"venue":null,"work_id":"ad2d1566-bb8d-4146-8a40-6b6bdc898283","year":2021},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":21,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.591501Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:05616c9129d1067af67df213138b215ce48d737e391cc34382c61c927f03bfbd","observation_id":"ac19c155-68ed-4a08-84bf-01bc7ca360e2","resolution":{"observed_at":"2026-08-08T13:07:44.830686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"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-09T23:10:50.216341Z","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:3a68a91606b5615166621800f25fb6b64e0d0cded1c7d8c255e58c0e22f52c93","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.814365Z","title":null,"venue":null,"work_id":"29cc579a-0c1c-4177-8cd0-37b120b8b8cd","year":2024},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":23,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.599035Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:8082f202907e1b71ff0385f0cae86455f332c4b8a507ea8171fc2e3d2c89f3fc","observation_id":"5bf16e86-aa08-4783-b276-8b356e1922b0","resolution":{"observed_at":"2026-08-08T13:07:44.818435Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.16263","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.698309Z","title":null,"venue":null,"work_id":"737cab4c-665d-47cc-b45d-f3eb47fc0c00","year":2025},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":2025,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.573289Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:707ae607e11d7c318c075d8b330f3e7bbd69925e3ce4489e4ed39a18a8938b27","observation_id":"d09404a6-5cd2-4dfe-9d91-ad6fc689dc3a","resolution":{"observed_at":"2026-08-08T13:07:44.704822Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0601.37507","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T13:07:44.779926Z","title":null,"venue":null,"work_id":"169faba1-a364-489f-9130-48410f8ca918","year":null},"citing_paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","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":5492,"source":"pdf_text","source_observed_at":"2026-08-08T13:07:44.534449Z"},"links":{"citing_paper":"/paper/2608.05441"},"observation_digest":"sha256:1f2f205792847f7f314ca1eb36d310d029ccc943133d490b4984051cee62dea7","observation_id":"f4077ede-f63e-411f-9120-e6788acf547c","resolution":{"observed_at":"2026-08-08T13:07:44.786176Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.05441","last_updated":"2026-08-05T22:20:01Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T23:10:50.216341Z","submitted_at":"2026-08-05T22:20:01Z","title":"Filtered Vector Search in a Disaggregated Lakehouse: Composing Table-Format Pruning with Per-File ANN"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":20,"verified_exact":2,"verified_fuzzy":2},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.05441."}