{"as_of":"2026-08-11T00:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7d68bef0733457aa9c9d1946db1e1ab084d6a489ea1a07e96ddfbf797c6d0397","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T17:45:25.423190Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T11:49:00.258724Z","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-02T01:36:25.224864Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2508.15694","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.15694","snapshot_observed_at":"2026-07-02T01:36:25.224864Z","title":null,"venue":null,"work_id":"f8ad6d9d-0ac3-4cfa-88ba-02fcb3aabe59","year":2025},"citing_paper":{"arxiv_id":"2602.23342","last_updated":"2026-05-14T05:09:37Z","snapshot_observed_at":"2026-08-08T11:17:45.876126Z","submitted_at":"2026-02-26T18:48:29Z","title":"AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.239255Z"},"links":{"cited_paper":"/paper/2508.15694","citing_paper":"/paper/2602.23342"},"observation_digest":"sha256:1d1285183380a60e4bb74a180d53c5af360306acfe3ab41198fe3e9e3070c04b","observation_id":"b895685b-f1ab-4481-9f8b-f2cd48d41ada","resolution":{"observed_at":"2026-05-15T18:46:29.434402Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2508.15694","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.15694","snapshot_observed_at":"2026-07-02T01:36:25.224864Z","title":null,"venue":null,"work_id":"f8ad6d9d-0ac3-4cfa-88ba-02fcb3aabe59","year":2025},"citing_paper":{"arxiv_id":"2606.02784","last_updated":"2026-06-01T18:49:44Z","snapshot_observed_at":"2026-07-31T18:47:56.958921Z","submitted_at":"2026-06-01T18:49:44Z","title":"LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T11:49:00.258724Z"},"links":{"cited_paper":"/paper/2508.15694","citing_paper":"/paper/2606.02784"},"observation_digest":"sha256:9502fa5ac3106c39c37112aa9b716f958ec98cf36489a539f773c3c9c545141b","observation_id":"d8fe8a89-962f-45d8-88cd-e2371bb7de54","resolution":{"observed_at":"2026-07-02T01:36:25.226896Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.15694/citation-record","integrity":"/paper/2508.15694/integrity","json":"/paper/2508.15694/citation-record.json","paper":"/paper/2508.15694"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.14846","last_updated":"2025-05-21T14:42:25Z","snapshot_observed_at":"2026-08-08T16:21:15.089858Z","submitted_at":"2025-02-20T18:55:30Z","title":"Scaling Text-Rich Image Understanding via Code-Guided Synthetic Multimodal Data Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14846","snapshot_observed_at":"2026-08-05T17:45:21.174003Z","title":"Scaling text-rich image understanding via code-guided synthetic multimodal data generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.174003Z"},"links":{"cited_paper":"/paper/2502.14846","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:04aa843321c310bef8ff2ade762b071f9c767eab4c34141cd352c5a34bd9761f","observation_id":"6a0ab228-bffd-4b7a-b5f4-ca9c246f834b","resolution":{"observed_at":"2026-08-05T17:45:21.174003Z","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-05T17:45:30.104606Z","title":"Making the v in vqa matter: elevating the role of image understanding in visual question answering","venue":null,"work_id":"ee5443ad-03eb-49cd-8618-9bc525612c75","year":2017},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.257056Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:1eeccb1ca5d135096dd89fcce5747c7f316400e080343314d8fa7b0b99dcce69","observation_id":"195b0436-3f9d-4ae7-93a9-73081992c9ec","resolution":{"observed_at":"2026-08-05T17:45:30.106850Z","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-05T17:45:30.097360Z","title":"Bigham, Chandrika Jayant, Hanjie Ji, Greg Little, Andrew Miller, Robert C","venue":null,"work_id":"1d096940-ef2d-41ec-8b29-9a9f41e7a1b7","year":2010},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.367908Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:ee48eb1dc37236d2c36b44b65a2d4e7669c6c7f5f179e6e057db74ef24fe5bcf","observation_id":"eee97256-1ae1-44f0-9a04-380009d78164","resolution":{"observed_at":"2026-08-05T17:45:30.099639Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T17:45:21.440746Z","title":"Pradhan, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.440746Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:ab55bb1ad72e022325f178d8352aa10336f2028a90fd1e656271b09a622223ed","observation_id":"eff4b6e3-abad-4ca9-95f4-3bc95f9ecd17","resolution":{"observed_at":"2026-08-05T17:45:21.440746Z","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-05T17:45:30.090572Z","title":null,"venue":null,"work_id":"aa4cb194-4ad0-4071-8a0c-4ae395d4dd8e","year":2021},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.538829Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:2ffe20240867ede2e036ee570c6beb2b2c78bcbd15d8d482a94faec22e1d359d","observation_id":"b7dee1d5-63a9-4571-83ae-e3facc8545ea","resolution":{"observed_at":"2026-08-05T17:45:30.092720Z","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-05T17:45:30.082888Z","title":"Making the V in VQA matter: elevating the role of image understanding in visual question answering","venue":null,"work_id":"015b265a-e0a2-4658-8fb4-34a39cb6184c","year":2017},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.610790Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:acd0178883ceb5b153106acd2765ae4a7621eb5cf7f290bf5e3cc490f4ed8f5f","observation_id":"b496248d-20ad-46fb-9b72-7f66acdfb488","resolution":{"observed_at":"2026-08-05T17:45:30.085293Z","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":{"arxiv_id":"1505.02074","last_updated":"2015-11-29T22:45:12Z","snapshot_observed_at":"2026-07-06T04:17:17.884583Z","submitted_at":"2015-05-08T15:59:44Z","title":"Exploring Models and Data for Image Question Answering","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.02074","snapshot_observed_at":"2026-08-05T17:45:21.718831Z","title":"CocoQA: question answering for image datasets","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.718831Z"},"links":{"cited_paper":"/paper/1505.02074","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:e2b51900976cc982c49c7dfe8ee0e3111162ebb3c9ae92fec5f11ab8bfe78468","observation_id":"ef9def71-d0b6-43d1-9882-f7d609c37f99","resolution":{"observed_at":"2026-08-05T17:45:21.718831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.10244","last_updated":"2022-03-19T05:00:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-03-19T05:00:30Z","title":"ChartQA: A Benchmark for Question Answering about Charts with Visual and Logical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.10244","snapshot_observed_at":"2026-08-05T17:45:21.828808Z","title":"ChartQA: visual and logical reasoning over charts","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.828808Z"},"links":{"cited_paper":"/paper/2203.10244","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:9d8e49469c9a161b57c86925348d6171b04d5192bd927cf659c75047111dcfa3","observation_id":"9809b9cd-458f-4efe-9364-60455e8a4776","resolution":{"observed_at":"2026-08-05T17:45:21.828808Z","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-05T17:45:30.076693Z","title":"PlotQA: reasoning over scientific plots","venue":null,"work_id":"bf818121-7852-425a-b0fd-0d86088745e0","year":2023},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:21.936875Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:fa388113ca7c17bf1d72c68209a96beae8ec31b063f47d36cfef2772788c0580","observation_id":"142f34a2-ec60-4bfd-9cfb-6461f015b05a","resolution":{"observed_at":"2026-08-05T17:45:30.078943Z","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-05T17:45:30.068362Z","title":"TAT-DQA: technical document QA","venue":null,"work_id":"3953684f-30bf-478e-a3b3-3a15cc2ea2e0","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.042147Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:47d769cc057b6298eb32e8db225792aa275acb4397f3c504fbaeefd75b5951f1","observation_id":"412a2a90-ec76-4d8c-98cf-9ec0553143bd","resolution":{"observed_at":"2026-08-05T17:45:30.070405Z","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-05T17:45:30.061482Z","title":"TabFact: verifying table facts","venue":null,"work_id":"dd5b3c94-801d-4c23-9298-6fa5b9258f7c","year":2020},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.143357Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:172f2d4c4e47a6d379bf365bd4c78d1a1f6a410e6a5bb8c697bae0f38c44790d","observation_id":"06caf902-2391-46c8-8173-73757767059b","resolution":{"observed_at":"2026-08-05T17:45:30.064000Z","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":{"arxiv_id":"2304.08485","last_updated":"2023-12-11T17:46:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-04-17T17:59:25Z","title":"Visual Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08485","snapshot_observed_at":"2026-08-05T17:45:22.223391Z","title":"LLaV A: large language and vision assistant","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.223391Z"},"links":{"cited_paper":"/paper/2304.08485","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:17145d5fcf95eda6d789835ca7293af264c20167df95dc7d8cf96f2dac475c87","observation_id":"c2acc496-f137-46cb-89f4-47003f5589d5","resolution":{"observed_at":"2026-08-05T17:45:22.223391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13601","last_updated":"2024-05-28T05:36:23Z","snapshot_observed_at":"2026-08-10T21:32:36.140961Z","submitted_at":"2024-01-24T17:10:45Z","title":"MM-LLMs: Recent Advances in MultiModal Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13601","snapshot_observed_at":"2026-08-05T17:45:22.287401Z","title":"Qwen-VL: efficient vision-language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.287401Z"},"links":{"cited_paper":"/paper/2401.13601","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:e90dd73b57911469a029a1dc2602b8f05c216d9b52056328ad5e725ea7f358d4","observation_id":"dcfad811-1b64-4a47-ac0f-7df54e931407","resolution":{"observed_at":"2026-08-05T17:45:22.287401Z","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-05T17:45:30.054427Z","title":"BLIP-2: bootstrapping language-image pre-training with frozen image encoders and large language models","venue":null,"work_id":"6014d456-5e2d-44b4-8386-32d587e8795d","year":2023},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.391772Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:6d19250b6b3978ae1579baa49a03ec4025e9df3830ecc92e3143c369ade8e455","observation_id":"b00ac9e9-864c-4ee3-8eef-bb42f838e825","resolution":{"observed_at":"2026-08-05T17:45:30.056714Z","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-05T17:45:30.046015Z","title":"PaLI-X: multitask vision-language model","venue":null,"work_id":"3aa2328f-9215-4fc8-903b-688960cc62d3","year":2023},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.497315Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:029c2f9f9d70afc3e5a2bd1b1ac58af8f38e7898e52a5dcafcce714e0fbb1c41","observation_id":"96654bdd-e6b8-48f3-9900-16d34d0c04fe","resolution":{"observed_at":"2026-08-05T17:45:30.048465Z","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":{"arxiv_id":"2411.15453","last_updated":"2024-11-23T05:03:32Z","snapshot_observed_at":"2026-07-06T19:55:51.415524Z","submitted_at":"2024-11-23T05:03:32Z","title":"Enhancing Instruction-Following Capability of Visual-Language Models by Reducing Image Redundancy","version":1},"cited_work":{"arxiv_id":"2411.15453","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.15453","snapshot_observed_at":"2026-08-05T17:45:25.594440Z","title":"Enhancing Instruction-Following Capability of Visual-Language Models by Reducing Image Redundancy","venue":"cs.CV","work_id":"e42e1849-1fea-4e44-9e4e-ca5c2f3e1d94","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.575645Z"},"links":{"cited_paper":"/paper/2411.15453","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:39ebb34f8eb6f479d7b37d9000a6a000003d60ef352f02803bcd44c3980755da","observation_id":"a3f681dd-5629-44b2-99c5-05cccb89b915","resolution":{"observed_at":"2026-08-05T17:45:25.681289Z","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-05T17:45:30.038698Z","title":"GQA: scene graph-based QA","venue":null,"work_id":"9a43cd36-7694-40f0-bdc8-8d26e04b1f3c","year":2019},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.681102Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:8c2944a3426b146831f8c28b58a6a36704d64c935eaa27369e79c0dbc109d075","observation_id":"d0ebb797-0e4f-4c72-a106-6c3242a4ae46","resolution":{"observed_at":"2026-08-05T17:45:30.041552Z","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-05T17:45:30.029429Z","title":"TextVQA: text-based visual QA","venue":null,"work_id":"eb2b2f6e-532f-452e-92a7-a59d257e1efa","year":2020},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.787707Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:f7ab4397dc58f85ef7352ba42dc6c0c8fd817be65defeed9d877ee5de268fdd8","observation_id":"bf097f75-d165-4a7e-b7bf-5ea270547625","resolution":{"observed_at":"2026-08-05T17:45:30.032736Z","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":{"arxiv_id":"2112.13706","last_updated":"2022-02-06T10:20:16Z","snapshot_observed_at":"2026-07-06T12:22:43.206246Z","submitted_at":"2021-12-27T14:28:04Z","title":"Multi-Image Visual Question Answering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13706","snapshot_observed_at":"2026-08-05T17:45:22.886261Z","title":"TallyQA: counting questions in images","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.886261Z"},"links":{"cited_paper":"/paper/2112.13706","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:2eb03788889e853e26432ff7db09afb99e17c22873075fe83f3861df2c60b99d","observation_id":"9f071b31-8ed3-406c-9476-db90f7dd55bc","resolution":{"observed_at":"2026-08-05T17:45:22.886261Z","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-05T17:45:29.976427Z","title":"ScienceQA: multimodal multiple-choice QA","venue":null,"work_id":"dbb90e9e-06f5-4150-a394-03e59dd7ea03","year":2022},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:22.998875Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:8a4df637f4aa3cd8becb4860a89d10e22cab6fd9dfeef26e3e5364ec51e71dca","observation_id":"d368c8ef-d9e2-468e-a139-e0dbd093585e","resolution":{"observed_at":"2026-08-05T17:45:30.021954Z","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-05T17:45:29.624572Z","title":"MMBench: comprehensive VLM evaluation","venue":null,"work_id":"49fedc1c-b0e1-46c3-b0be-7ae5a2fec408","year":2023},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.107346Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:9df049d376be7b74cf0149e250c1234374e3baf2f3bb607505aacb6646295525","observation_id":"e00ab641-3b86-47fb-9adc-d9b1ec275976","resolution":{"observed_at":"2026-08-05T17:45:29.800236Z","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-05T17:45:29.209176Z","title":"TableVQA-Bench: a visual question answering benchmark on multiple table domains","venue":null,"work_id":"220e5b8d-7bda-4afc-b8c4-d1980efea68d","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.188362Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:9cb346ef22c6dce3e81f5d96fe1de2c5360e4ffe2b742dca0a337f2de83009b3","observation_id":"fe875797-4299-4c99-ba05-f8abc1fe045f","resolution":{"observed_at":"2026-08-05T17:45:29.377744Z","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":{"arxiv_id":"2505.21771","last_updated":"2026-05-23T17:30:43Z","snapshot_observed_at":"2026-08-10T02:26:00.772378Z","submitted_at":"2025-05-27T21:09:11Z","title":"MMTABREAL: Real-World Benchmark for Multimodal Table Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.21771","snapshot_observed_at":"2026-08-05T17:45:23.285417Z","title":"MMTBENCH: multimodal table reasoning benchmark","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.285417Z"},"links":{"cited_paper":"/paper/2505.21771","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:3867a70b3a676a9d516c3bac9005e7140873fc5abd7e3d4bcccf478c58f0d51d","observation_id":"ffb47acb-5908-406c-856d-0fe4b243527b","resolution":{"observed_at":"2026-08-05T17:45:23.285417Z","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-05T17:45:28.981973Z","title":"M3SciQA: multi-modal multi-document scientific QA","venue":null,"work_id":"96149773-27b8-4192-94fa-20d539d00a93","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.432301Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:45897d36007c173ee9551e09615169e90c186566236e877c26a4de4b43388139","observation_id":"e3ecd34f-1a5d-4ab4-9bfd-8103d7150aa4","resolution":{"observed_at":"2026-08-05T17:45:29.034923Z","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-05T17:45:28.844519Z","title":"SceMQA: scientific college entrance multimodal QA","venue":null,"work_id":"31dccdd6-818e-469d-a0e4-f76bfc847f2d","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.536821Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:6629f77f2b8bbf27eea50552274cef84d43319fcc9312055bcd6beaeaf27400c","observation_id":"7bead254-7386-43d6-af88-28ca1012e737","resolution":{"observed_at":"2026-08-05T17:45:28.903774Z","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-05T17:45:28.681375Z","title":"A benchmark for compositional visual reasoning","venue":null,"work_id":"1f715f5f-fa9c-4b59-9908-a5cd9ee4c011","year":2022},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.638787Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:6b5ccafd718d1d0702c4289765349b4035d99d4af957e79d346e0812d7fad185","observation_id":"22a32ccd-a284-4253-a033-885db1dd97a0","resolution":{"observed_at":"2026-08-05T17:45:28.751288Z","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-05T17:45:28.516618Z","title":"Shamma, et al","venue":null,"work_id":"34ff058b-5145-4e0e-b4fd-ec3493fccff2","year":2017},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.765320Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:758ec26dc7fa04aeddbe32ae5d50bb671e871ebc68224c078519fa41f179daca","observation_id":"3f899f7b-19df-4a46-9b1e-52ba65d8b234","resolution":{"observed_at":"2026-08-05T17:45:28.589714Z","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-05T17:45:28.297283Z","title":"GQA-OOD: out-of-distribution evaluation for visual question answering","venue":null,"work_id":"d3715529-399a-451d-8546-75e3e079e025","year":2020},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:23.897079Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:6eb5df5f499283211b76a59091090765f84a02f66d5879a4cb5eacedc10e13dc","observation_id":"187064cc-935c-435d-92ea-51dc31ba5a44","resolution":{"observed_at":"2026-08-05T17:45:28.402970Z","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-05T17:45:28.088643Z","title":"Structured multimodal attentions for TextVQA","venue":null,"work_id":"27cd4a57-7ec0-4d90-ac4d-8bab5081d1e3","year":2020},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.015161Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:745f5c66c1de7e5968f428e415b673e61cd3be3419736ed0714ffa1d018fb4fe","observation_id":"b5903173-389e-4318-8118-9f81a56fa9ee","resolution":{"observed_at":"2026-08-05T17:45:28.216998Z","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-05T17:45:27.935798Z","title":"ChartQA-X: generating explanations for chart QA","venue":null,"work_id":"95b1de13-119a-4163-b132-2ef17eeb0bff","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.162153Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:663f6ddd1fa33b33ca2a0ca5698ca236964fff1126aec717cac98a8af03fe1c6","observation_id":"2f4516be-8144-43ab-b642-954019dcbfd7","resolution":{"observed_at":"2026-08-05T17:45:27.992180Z","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-05T17:45:27.768356Z","title":"SPIQA: scientific paper figure QA","venue":null,"work_id":"71d9029f-4311-42e7-9014-1a3f00abd5ae","year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.223872Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:66b67b7409a2797b805dbba88a9810f28d5a02ee535b31494dc8bf7a431347ca","observation_id":"94e9fc12-762e-4cc0-a1bd-64192051a0eb","resolution":{"observed_at":"2026-08-05T17:45:27.856830Z","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":{"arxiv_id":"2404.18796","last_updated":"2024-05-01T15:37:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-04-29T15:33:23Z","title":"Replacing Judges with Juries: Evaluating LLM Generations with a Panel of Diverse Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.18796","snapshot_observed_at":"2026-08-05T17:45:24.305631Z","title":"Replacing judges with juries: evaluating LLM generations with a panel of diverse models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.305631Z"},"links":{"cited_paper":"/paper/2404.18796","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:72f7618f162549fb2bca534fd3a3da1d345ea61f85834df5e2a7f856de6476ae","observation_id":"0057fe83-aee6-468c-b62d-700896704317","resolution":{"observed_at":"2026-08-05T17:45:24.305631Z","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-05T17:45:27.612497Z","title":null,"venue":null,"work_id":"d1d329be-ce8b-4834-bf72-008ab80c1229","year":1979},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.411166Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:d5a3650662b31be808a91f06a9e2df85f058b3cd8a058115e3807d43f64bc2ea","observation_id":"40951150-7233-4b5c-b9fb-08dba06cec72","resolution":{"observed_at":"2026-08-05T17:45:27.697305Z","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-05T17:45:27.432953Z","title":null,"venue":null,"work_id":"f6967cab-9931-4fe7-9354-8ddbc7c0af83","year":2008},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.490471Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:7950641a385e14651702ab13be41321c41a5bd5dfe95d567f82cb29f633ee865","observation_id":"b0d45db6-40b3-49f4-ade6-7937977320f8","resolution":{"observed_at":"2026-08-05T17:45:27.533105Z","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-05T17:45:27.208696Z","title":"Whose vote should count more: optimal integration of labels from labelers of unknown expertise","venue":null,"work_id":"dce22408-5ecd-4049-be17-5c61c562d8b6","year":2009},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.595990Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:8335362a5e510e123d004c879e5e7a15ba0837406975aebdefb875fbad174f7f","observation_id":"68e159b2-e18e-459e-99da-876d34c246dc","resolution":{"observed_at":"2026-08-05T17:45:27.316293Z","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-05T17:45:27.004169Z","title":"Raykar, Shipeng Yu, Linda H","venue":null,"work_id":"95dc7d7c-8467-44c3-9d77-1b622b76f969","year":2010},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.667328Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:a186f347ab2ebeeb02975cf205993b9a5e12cd74fd589f8a6d2249d1fbb26f0f","observation_id":"76b12233-c78e-41c4-9e56-2d6e0368b2f1","resolution":{"observed_at":"2026-08-05T17:45:27.094812Z","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":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-05T17:45:24.757665Z","title":"Achiam, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.757665Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:13b333db3faaefd5cae6a79eee27b836d7a9d0b7c12e7572055c6cee1fae7ff0","observation_id":"a019a56c-3203-4936-8e46-fe26a350c3c2","resolution":{"observed_at":"2026-08-05T17:45:24.757665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13923","last_updated":"2025-02-19T18:00:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-19T18:00:14Z","title":"Qwen2.5-VL Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13923","snapshot_observed_at":"2026-08-05T17:45:24.829489Z","title":"Qwen2.5-VL: Technical Report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.829489Z"},"links":{"cited_paper":"/paper/2502.13923","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:a81ff17ee0fbaaced5b359f36d2cd0d4dcc7b4416ed342bf5423fde98e7fda8b","observation_id":"14b3a7d7-4955-411e-8427-243736d5d789","resolution":{"observed_at":"2026-08-05T17:45:24.829489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07073","last_updated":"2024-10-10T17:59:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-09T17:16:22Z","title":"Pixtral 12B","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07073","snapshot_observed_at":"2026-08-05T17:45:24.915344Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.915344Z"},"links":{"cited_paper":"/paper/2410.07073","citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:fa47ec3cefc171e86192ef87ee8b8bac3288a0f241eaa4eb995207bc114c98bb","observation_id":"d483c0f2-f175-45cc-b312-766d832a43a1","resolution":{"observed_at":"2026-08-05T17:45:24.915344Z","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-05T17:45:26.800762Z","title":"Each row represented a (model, subset) pair with correctness, grounding, completeness, format fidelity, and average score","venue":null,"work_id":"917822ae-fb62-4acc-bf5f-a8d5d1594e03","year":null},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:24.992272Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:2e157565598cb8375fffbb26e873a2003c80c2b89a2e2788ac6ce3d68e079fa0","observation_id":"c8ae3926-d7ab-43cb-a58c-93339386e3aa","resolution":{"observed_at":"2026-08-05T17:45:26.908583Z","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-05T17:45:26.615477Z","title":null,"venue":null,"work_id":"6777a588-e9f8-4273-920d-a55c31d2ed1f","year":null},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:25.083454Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:e8af6d0b0d6ef288f69bcd226691ded56c0905a111b85b44176a3b90dca3483c","observation_id":"5e907e51-7918-465f-8f07-bb25691dd416","resolution":{"observed_at":"2026-08-05T17:45:26.683248Z","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-05T17:45:26.455373Z","title":null,"venue":null,"work_id":"9eece512-7cdb-4891-96f8-722dad422ad3","year":null},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:25.191947Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:cc8969a1dd2b890f8827b3f91b40a74c3ef18f2ffe012e681680838bf2d087d6","observation_id":"462688fb-b2b7-4bf5-936c-277218006de9","resolution":{"observed_at":"2026-08-05T17:45:26.520645Z","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-05T17:45:26.243646Z","title":null,"venue":null,"work_id":"de6a3754-b89b-4310-a972-b1b3753d8f11","year":null},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:25.265523Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:6591e1166bf04f735f8be4c462f599b033c27e308216cf7f9c091fd42d09c36c","observation_id":"e4299a87-7431-4b16-a141-01ceefa25972","resolution":{"observed_at":"2026-08-05T17:45:26.366698Z","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-05T17:45:26.054430Z","title":"Although the sample size is limited (n = 5), the analysis highlights trends between architectural design and reasoning performance","venue":null,"work_id":"daaa087d-c5c9-46d0-bf16-7e1c13505ac0","year":null},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:25.349799Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:277e5487d4fe0aa66b39112bd8f33a6ffa840a9101c2f62cd9c28e84c1eeec73","observation_id":"6dcc0c26-3b67-4dd7-b417-1267a9f1c853","resolution":{"observed_at":"2026-08-05T17:45:26.155111Z","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-05T17:45:25.900490Z","title":"role\": \"user","venue":null,"work_id":"52bac8b2-1023-427a-8ee5-889622903368","year":2025},"citing_paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T17:45:25.423190Z"},"links":{"citing_paper":"/paper/2508.15694"},"observation_digest":"sha256:d8541bad14632df2ae568aa14f6f11a1a0cfdc3daf892c2974ba7c5b67a164f3","observation_id":"e5207db3-6381-4e91-bbf1-e1eb2011e625","resolution":{"observed_at":"2026-08-05T17:45:25.941694Z","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"}}],"paper":{"arxiv_id":"2508.15694","last_updated":"2025-08-21T16:21:46Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T13:17:20.811880Z","submitted_at":"2025-08-21T16:21:46Z","title":"GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":45},"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 11 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 2 inbound Pith citation observations for arXiv:2508.15694."}