{"as_of":"2026-08-17T21:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3133acba2e6c4e054d2718e5715c1e19f4b031341b588b2ac03ffe8ce1f7b061","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:40:51.655016Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:08:17.400666Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T18:08:17.750518Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"cited_work":{"arxiv_id":"2505.04121","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.04121","snapshot_observed_at":"2026-08-15T18:08:17.750518Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","venue":"cs.CV","work_id":"a65b72fd-8f38-4992-b6a3-32073480fd6d","year":2025},"citing_paper":{"arxiv_id":"2507.18997","last_updated":"2025-07-25T06:54:30Z","snapshot_observed_at":"2026-08-16T21:20:32.113764Z","submitted_at":"2025-07-25T06:54:30Z","title":"UPP: Unified Point-Level Prompting for Robust Point Cloud Analysis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:17.400666Z"},"links":{"cited_paper":"/paper/2505.04121","citing_paper":"/paper/2507.18997"},"observation_digest":"sha256:cd766d3ae39ef9f20519480ddc288bb6f1d381514a81bae8958dfa536d326595","observation_id":"d50b440b-ca9d-4b26-8462-489d9d272e05","resolution":{"observed_at":"2026-08-15T18:08:17.757573Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.04121/citation-record","integrity":"/paper/2505.04121/integrity","json":"/paper/2505.04121/citation-record.json","paper":"/paper/2505.04121"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.17274","last_updated":"2022-06-03T17:52:04Z","snapshot_observed_at":"2026-08-16T17:10:09.647539Z","submitted_at":"2022-03-31T17:59:30Z","title":"Exploring Visual Prompts for Adapting Large-Scale Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.17274","snapshot_observed_at":"2026-08-15T23:40:51.562082Z","title":"Exploring visual prompts for adapting large-scale models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.562082Z"},"links":{"cited_paper":"/paper/2203.17274","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:dce5f5931d281a4b42ce5fe1ec1fac6af59745f6d2cb9129051e30dfcff2679b","observation_id":"2345bfd0-d435-4d69-b7fd-2d4ea24f0897","resolution":{"observed_at":"2026-08-15T23:40:51.562082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:40:51.578904Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.578904Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:d94c803fe807ea95dff576547683c744bc8db003257430985ed3215bc888f4e5","observation_id":"18c39589-bd16-4d3e-85e0-7f12e740e986","resolution":{"observed_at":"2026-08-15T23:40:51.578904Z","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-15T23:40:51.854475Z","title":"Our approach does not require the re-training of the entire model, which helps to mitigate the computational cost typically associated with full fine-tuning","venue":null,"work_id":"5d4b1333-9130-4a7e-b16e-6ff0e7a2fe67","year":2017},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.649808Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:efa4f36f439d9bd83924b2aefdb2c2b62a45aa53e4b9db3b13f9ec7d08e92f25","observation_id":"b2fa5582-3b1c-49df-be63-a156bf82194c","resolution":{"observed_at":"2026-08-15T23:40:51.859710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12265","last_updated":"2020-02-18T19:49:48Z","snapshot_observed_at":"2026-08-15T23:39:52.468529Z","submitted_at":"2019-05-29T08:11:52Z","title":"Strategies for Pre-training Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12265","snapshot_observed_at":"2026-08-15T23:40:51.600578Z","title":"Vi- sion hgnn: An image is more than a graph of nodes","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.600578Z"},"links":{"cited_paper":"/paper/1905.12265","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:f74fcbfa23ed3ee1ce61104a3a1e8969b6a508ed276ae3a553c1f078fcea2bae","observation_id":"a8c038bf-8617-4b5b-99de-135b9a905eb6","resolution":{"observed_at":"2026-08-15T23:40:51.600578Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:40:51.629430Z","title":"Y ., et al","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.629430Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:99ca80b9c344ac5502254060109653107700366186155e08be501973e776e34d","observation_id":"b9aae785-4c89-4b16-a528-2ba9fcffe9d0","resolution":{"observed_at":"2026-08-15T23:40:51.629430Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:40:51.634091Z","title":"and Zisserman, A","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.634091Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:42aea91d8bd476dcf7a41f4df5d51d15952ae660539830890f23b4be4e915ba2","observation_id":"f11fc5d6-f47f-4b1d-801b-f0b260409c28","resolution":{"observed_at":"2026-08-15T23:40:51.634091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.07676","last_updated":"2021-01-25T10:56:45Z","snapshot_observed_at":"2026-08-15T23:10:43.712911Z","submitted_at":"2020-01-21T17:57:33Z","title":"Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inference","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.07676","snapshot_observed_at":"2026-08-15T23:40:51.639527Z","title":"and Sch¨utze, H","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.639527Z"},"links":{"cited_paper":"/paper/2001.07676","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:0c35975fff489b12c33d071ec09c1ea94321966d04840e887f576ce68af48e24","observation_id":"66457339-fafd-4b72-92e7-3ac03b50650f","resolution":{"observed_at":"2026-08-15T23:40:51.639527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-08-16T09:25:53.087782Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-15T23:40:51.583768Z","title":"An image is worth 16x16 words: Trans- formers for image recognition at scale","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.583768Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:12388936528527e68386a84647f4f0478add44cc0ca1aba2ae2db54b84ee9000","observation_id":"6dbe0964-6e3b-43f1-a38b-72c2c93c9166","resolution":{"observed_at":"2026-08-15T23:40:51.583768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-15T23:40:51.606058Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.606058Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:a9c4fbc7cba2432540511b2f0e0175d1283760fcf78f30f8efcce13db34b4e32","observation_id":"3013800d-db9d-44cd-aabf-1f8273e33538","resolution":{"observed_at":"2026-08-15T23:40:51.606058Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:40:51.573663Z","title":"D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.573663Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:14d5c761c74d556bda8ca46ee172889877f93e74a136dd0b67ec18ab27c57f4d","observation_id":"978ffd11-2a5b-45bf-863a-5a499f4cf13d","resolution":{"observed_at":"2026-08-15T23:40:51.573663Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:40:51.644964Z","title":"The caltech-ucsd birds-200-2011 dataset,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.644964Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:2e853edfa5614048b5269501bfa9fd6af9cdcdf28f35bf618f77e34b9c953806","observation_id":"8beead0d-e8a9-4a06-a6d9-37821bbdfd69","resolution":{"observed_at":"2026-08-15T23:40:51.644964Z","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-15T23:40:51.835241Z","title":"The learning rate is set as 0.001 and the weight decay is 0.05","venue":null,"work_id":"8b74c973-f1ad-4c26-b2cc-45596a4eb7fc","year":2023},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.655016Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:6dd5e2c36d4bfb0d273641e8200e57eeaa6ae1d124fe0197ed940e4305695e86","observation_id":"c707e766-a2be-40bd-9da4-f54e961b768c","resolution":{"observed_at":"2026-08-15T23:40:51.842538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.15240","last_updated":"2024-04-10T09:04:26Z","snapshot_observed_at":"2026-08-16T16:27:56.933103Z","submitted_at":"2022-09-30T05:19:27Z","title":"Universal Prompt Tuning for Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.15240","snapshot_observed_at":"2026-08-15T23:40:51.588945Z","title":"M., Yang, Y ., and Wang, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.588945Z"},"links":{"cited_paper":"/paper/2209.15240","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:267c287fcb4608fcb8a6eabe5059fc1f191041e66a54e0b3608095ef4e336c88","observation_id":"26e49f25-fa80-46cb-9746-39154f3d3e1c","resolution":{"observed_at":"2026-08-15T23:40:51.588945Z","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-15T23:40:51.901212Z","title":"Graphprompt: Uni- fying pre-training and downstream tasks for graph neural networks","venue":null,"work_id":"be8298e6-e2ac-4c62-a275-cce99f9248bb","year":2023},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.612322Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:f001c55c932d049e72927146018729d2b09528e7008edd9e66722b7014999ba1","observation_id":"8faba2cf-2be8-4bc7-a0eb-cc7fe17c5362","resolution":{"observed_at":"2026-08-15T23:40:51.906581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T23:40:51.568333Z","title":"Food-101– mining discriminative components with random forests","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.568333Z"},"links":{"citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:3d2dbf7b78d62d5f4554461e0b7feaea6278622412c951a054c31cceb8d1b306","observation_id":"2844a3e1-6ba5-4767-bf38-7ad4d64a91ab","resolution":{"observed_at":"2026-08-15T23:40:51.568333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13770","last_updated":"2023-07-25T19:03:21Z","snapshot_observed_at":"2026-08-16T15:13:20.099025Z","submitted_at":"2023-07-25T19:03:21Z","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13770","snapshot_observed_at":"2026-08-15T23:40:51.593986Z","title":"Eˆ 2vpt: An effective and efficient approach for visual prompt tuning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.593986Z"},"links":{"cited_paper":"/paper/2307.13770","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:b7ba97509d18dcf7493b0a284928a26b0598ae5cfb3136f9600c52c2ff93c693","observation_id":"924ec6b3-02ec-4cbe-80b2-63a42601cc5f","resolution":{"observed_at":"2026-08-15T23:40:51.593986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15973","last_updated":"2025-03-25T03:05:36Z","snapshot_observed_at":"2026-08-16T12:48:20.577813Z","submitted_at":"2025-03-20T09:16:20Z","title":"STOP: Integrated Spatial-Temporal Dynamic Prompting for Video Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15973","snapshot_observed_at":"2026-08-15T23:40:51.617779Z","title":"Stop: Integrated spatial-temporal dynamic prompting for video understanding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.617779Z"},"links":{"cited_paper":"/paper/2503.15973","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:733c372d1f0bb3152ad5b2c480e5512f898979c309ea0ed781398ba7c7f5ea80","observation_id":"cf43350f-4fd7-4823-a478-39c56cb331a7","resolution":{"observed_at":"2026-08-15T23:40:51.617779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-15T23:40:51.623920Z","title":"and Hutter, F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.623920Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:2e573eb51072a044d459d1ddbb222e0cc3f02bd38a8733c41e94e5bf9bb631ab","observation_id":"c55a2cad-f46f-4023-8ad6-b7b3fd045874","resolution":{"observed_at":"2026-08-15T23:40:51.623920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T20:03:37.557564Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":18},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2505.04121."}