{"as_of":"2026-08-08T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47efd29998190e63f826c2614666bb4fcb08fd09a32a4960358f53949ec0c9d3","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:19:06.208402Z","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-05-23T02:22:25.144323Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-08T15:19:06.208402Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06501","last_updated":"2025-02-22T14:28:05Z","snapshot_observed_at":"2026-08-08T15:12:54.749035Z","submitted_at":"2025-02-10T14:20:01Z","title":"Learning Clustering-based Prototypes for Compositional Zero-shot Learning","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-08T15:19:06.208402Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2502.06501"},"observation_digest":"sha256:05c776cecc453b0743a28a99cf6c86603777a3b667876aed83c35eb0564de252","observation_id":"bad91d32-8e5f-4225-9348-4edbd426617f","resolution":{"observed_at":"2026-08-08T15:19:06.208402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2210.01253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":"4a89d05d-7f20-46b0-bec0-dbf4b610609c","year":2022},"citing_paper":{"arxiv_id":"2502.18816","last_updated":"2026-05-07T07:59:16Z","snapshot_observed_at":"2026-08-06T02:20:50.026726Z","submitted_at":"2025-02-26T04:50:20Z","title":"Grad-ECLIP: Gradient-based Visual and Textual Explanations for CLIP","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T02:21:09.704462Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2502.18816"},"observation_digest":"sha256:34c58adcddb6a29b14a546da2e0ded19f813f26d48fdbe8a64af3970f9c06fe0","observation_id":"825809c2-c157-4962-a845-6d2b02278f38","resolution":{"observed_at":"2026-05-23T02:22:25.146541Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-07T14:20:01.695389Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19373","last_updated":"2025-05-26T00:14:52Z","snapshot_observed_at":"2026-08-07T14:13:19.228795Z","submitted_at":"2025-05-26T00:14:52Z","title":"DiSa: Directional Saliency-Aware Prompt Learning for Generalizable Vision-Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:01.695389Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2505.19373"},"observation_digest":"sha256:efb0bd369610038bd4302b8c285a7552cc11cda54366c62db144f4daca57f20d","observation_id":"b469bb20-1a86-4bbc-9767-17b5bcfc43fa","resolution":{"observed_at":"2026-08-07T14:20:01.695389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-07T10:59:32.858957Z","title":"Plot: Prompt learning with optimal transport for vision-language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03706","last_updated":"2025-06-04T08:36:56Z","snapshot_observed_at":"2026-08-07T10:54:42.907137Z","submitted_at":"2025-06-04T08:36:56Z","title":"OV-COAST: Cost Aggregation with Optimal Transport for Open-Vocabulary Semantic Segmentation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:59:32.858957Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2506.03706"},"observation_digest":"sha256:6b8d9597a0ef0961785980503f016632aab2ebf8aa2c70babb119d3ce9b94c7b","observation_id":"a76a15da-a26a-4dae-8c3b-0bf782d138b0","resolution":{"observed_at":"2026-08-07T10:59:32.858957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-07T04:39:31.311960Z","title":"Plot: Prompt learning with optimal transport for vision-language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10182","last_updated":"2025-06-11T21:15:21Z","snapshot_observed_at":"2026-08-07T04:30:07.219990Z","submitted_at":"2025-06-11T21:15:21Z","title":"Improving Personalized Search with Regularized Low-Rank Parameter Updates","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:39:31.311960Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2506.10182"},"observation_digest":"sha256:11bce1b3f511f5f9dd1abd0c36e12aa5f64f33acc494eda8dc907c9614ad3abf","observation_id":"189352ca-c512-4d54-91b6-7de8e4ee87a1","resolution":{"observed_at":"2026-08-07T04:39:31.311960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-06T21:52:05.432881Z","title":"Plot: Prompt learning with optimal transport for vision-language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23271","last_updated":"2025-06-29T14:52:01Z","snapshot_observed_at":"2026-08-06T21:45:05.156058Z","submitted_at":"2025-06-29T14:52:01Z","title":"Mettle: Meta-Token Learning for Memory-Efficient Audio-Visual Adaptation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.432881Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2506.23271"},"observation_digest":"sha256:f374d076b708c017406c18f500071e7f3ccf7adcd2a7f1a87f3264052cc6f3a3","observation_id":"d3e70972-a2ea-426c-851b-8dcea2b82038","resolution":{"observed_at":"2026-08-06T21:52:05.432881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-06T19:01:21.726843Z","title":"arXiv preprint arXiv:2210.01253 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.06733","last_updated":"2025-07-09T10:45:52Z","snapshot_observed_at":"2026-08-06T18:53:24.811462Z","submitted_at":"2025-07-09T10:45:52Z","title":"MADPOT: Medical Anomaly Detection with CLIP Adaptation and Partial Optimal Transport","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:01:21.726843Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2507.06733"},"observation_digest":"sha256:9280dee7efd40cfa4576503b4a3c939de70f233ce9f6ee1c01121eecd44344f4","observation_id":"1a71a4bd-d533-46f0-a1d6-0046fcef23b4","resolution":{"observed_at":"2026-08-06T19:01:21.726843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-08-04T11:02:19.589586Z","title":"Plot: Prompt learning with optimal transport for vision-language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.07135","last_updated":"2025-10-08T15:29:48Z","snapshot_observed_at":"2026-08-04T11:02:17.754203Z","submitted_at":"2025-10-08T15:29:48Z","title":"Few-Shot Adaptation Benchmark for Remote Sensing Vision-Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T11:02:19.589586Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2510.07135"},"observation_digest":"sha256:a43d47ae32ab41ea2c64db6f4b033fa78b9a6e30ae334c18c563042f3a1e1eee","observation_id":"1d0f0085-efd4-44d5-b24d-d72c2af15f32","resolution":{"observed_at":"2026-08-04T11:02:19.589586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2210.01253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":"4a89d05d-7f20-46b0-bec0-dbf4b610609c","year":2022},"citing_paper":{"arxiv_id":"2510.14543","last_updated":"2026-04-12T09:52:58Z","snapshot_observed_at":"2026-08-02T15:25:02.299000Z","submitted_at":"2025-10-16T10:32:48Z","title":"Exploring Cross-Modal Flows for Few-Shot Learning","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T06:16:12.608513Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2510.14543"},"observation_digest":"sha256:77d0d77d8ba4e668fa6338938a823989a5677deb888b8c1ed9337ff5af7b165e","observation_id":"befefbba-feaa-40af-b3ff-fa119be304a5","resolution":{"observed_at":"2026-05-18T06:20:58.970331Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2210.01253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":"4a89d05d-7f20-46b0-bec0-dbf4b610609c","year":2022},"citing_paper":{"arxiv_id":"2605.04058","last_updated":"2026-04-10T08:00:28Z","snapshot_observed_at":"2026-07-06T23:16:54.673178Z","submitted_at":"2026-04-10T08:00:28Z","title":"MP-ISMoE: Mixed-Precision Interactive Side Mixture-of-Experts for Efficient Transfer Learning","version":1},"reference_index":129,"source":"arxiv_source","source_observed_at":"2026-05-10T17:19:59.247074Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2605.04058"},"observation_digest":"sha256:6c6eee8bf51e56033f1babcd2d37457076d3db3b45bd564bc6a1aa0120fe7675","observation_id":"0b82552c-e8f2-4de2-9051-46d4f7afd296","resolution":{"observed_at":"2026-05-11T07:01:09.542826Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2210.01253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":"4a89d05d-7f20-46b0-bec0-dbf4b610609c","year":2022},"citing_paper":{"arxiv_id":"2605.05910","last_updated":"2026-05-07T09:20:42Z","snapshot_observed_at":"2026-08-02T15:46:22.431560Z","submitted_at":"2026-05-07T09:20:42Z","title":"Plug-and-play Class-aware Knowledge Injection for Prompt Learning with Visual-Language Model","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-09T15:52:06.698536Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2605.05910"},"observation_digest":"sha256:e910396ea13e144c095ababc0f7167d8fb67476dbf40a05baf4d50eec9c0fce4","observation_id":"940c1a76-6c80-400d-8c59-03f88d7b7ef6","resolution":{"observed_at":"2026-05-11T16:36:09.381798Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2210.01253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":"4a89d05d-7f20-46b0-bec0-dbf4b610609c","year":2022},"citing_paper":{"arxiv_id":"2605.13835","last_updated":"2026-05-13T17:56:23Z","snapshot_observed_at":"2026-08-02T05:19:18.073348Z","submitted_at":"2026-05-13T17:56:23Z","title":"Unlocking Patch-Level Features for CLIP-Based Class-Incremental Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-14T19:11:52.801747Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2605.13835"},"observation_digest":"sha256:8adb9a82e962e9cf067e9211bf339ae4a21488d554b998fc55f74674e2cb85cf","observation_id":"e08dec3e-c261-4363-a83a-e26a9215d908","resolution":{"observed_at":"2026-05-14T19:12:50.607661Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2210.01253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.01253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt learning with optimal transport for vision-language models","venue":null,"work_id":"4a89d05d-7f20-46b0-bec0-dbf4b610609c","year":2022},"citing_paper":{"arxiv_id":"2605.17577","last_updated":"2026-05-17T18:07:08Z","snapshot_observed_at":"2026-08-03T01:04:57.342492Z","submitted_at":"2026-05-17T18:07:08Z","title":"TAME: Test-Time Adversarial Prompt Tuning via Mixture-of-Experts for Vision-Language Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-20T14:20:49.278545Z"},"links":{"cited_paper":"/paper/2210.01253","citing_paper":"/paper/2605.17577"},"observation_digest":"sha256:c6a8747c70f90b3702cc74221503574930360ba874255396bad4a35b441dd847","observation_id":"43ae5e61-1e93-4353-97ab-fe504e1775d7","resolution":{"observed_at":"2026-05-20T14:23:21.490431Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.01253/citation-record","integrity":"/paper/2210.01253/integrity","json":"/paper/2210.01253/citation-record.json","paper":"/paper/2210.01253"},"outbound":[],"paper":{"arxiv_id":"2210.01253","last_updated":"2023-02-09T23:26:37Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-07-06T13:59:15.998573Z","submitted_at":"2022-10-03T22:21:07Z","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2210.01253."}