{"as_of":"2026-08-10T10:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:832de5c7f17080e6e2af461d573f01be0f695a9ad21a0da294dc24479e8870a1","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T09:21:40.944884Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.22914/citation-record","integrity":"/paper/2606.22914/integrity","json":"/paper/2606.22914/citation-record.json","paper":"/paper/2606.22914"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.09126","last_updated":"2022-08-19T02:24:16Z","snapshot_observed_at":"2026-08-02T07:42:42.456434Z","submitted_at":"2022-08-19T02:24:16Z","title":"GraphTTA: Test Time Adaptation on Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2208.09126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.09126","snapshot_observed_at":"2026-07-04T09:49:45.018703Z","title":"Con- trastive test-time adaptation","venue":null,"work_id":"67da19e0-d060-4bbc-83fc-e4e7cf51a3f4","year":2022},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"cited_paper":"/paper/2208.09126","citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:f856ad0ecaf22003fb04d35c3c8699a7bf25a0c6326460aaedf2d08706fdac8f","observation_id":"48552ea1-4861-425b-85a3-79376ff4b5f4","resolution":{"observed_at":"2026-07-04T09:49:45.020064Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T09:21:40.944884Z","title":"Do we really need compli- cated model architectures for temporal networks? In11th International Conference on Learning Representations, ICLR 2023,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:7f7c7d25521f7865bedccfbaa36ec4a0fe06c5da5206b6f9f301d8c6b18cbcc4","observation_id":"3fc6d8ac-5856-4d70-8ce9-e1b1ee3d6fc7","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","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-06-26T09:21:40.944884Z","title":"L., Leskovec, J., and Jurafsky, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:27219d29cedc68dfce41eb70e3623f071f8ba2e90a12bfe398aabe9c70101f05","observation_id":"4c5af522-af24-452b-83ed-f7c90d1f903a","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","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-06-26T09:21:40.944884Z","title":"Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing.ACM Computing Surveys, 55(9):1–35, 2023a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:049f30c31bf184577a783e8b097e21763dc4e51a7846d435570cdb83dbfc3586","observation_id":"b2b821dd-fedf-4b9b-bc86-1992b0fe452e","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","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-06-26T09:21:40.944884Z","title":"H., Lee, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:e1e250f65a7f9b451e0247742815569968988579854af3a0bbdb3f9ee1e25262","observation_id":"222c5234-00b1-4a06-b04a-877deea6b349","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14886","last_updated":"2025-06-07T03:22:18Z","snapshot_observed_at":"2026-08-08T08:03:41.865903Z","submitted_at":"2024-10-18T22:23:59Z","title":"Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Prompts","version":2},"cited_work":{"arxiv_id":"2410.14886","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14886","snapshot_observed_at":"2026-07-04T09:49:45.025902Z","title":"Zero-shot generalist graph anomaly detection with unified neighborhood prompts","venue":null,"work_id":"5b2b1f9d-bb97-4ef8-a926-923f35c0b8d4","year":2024},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"cited_paper":"/paper/2410.14886","citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:3199598601c42cd181d4b86a7f6ca0873f84aa91fcdad062de75a147e3f3f0b3","observation_id":"19d88390-e13c-4a1a-86d9-905f553c1250","resolution":{"observed_at":"2026-07-04T09:49:45.027438Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16534","last_updated":"2023-11-28T05:36:59Z","snapshot_observed_at":"2026-07-06T16:53:35.776613Z","submitted_at":"2023-11-28T05:36:59Z","title":"Graph Prompt Learning: A Comprehensive Survey and Beyond","version":1},"cited_work":{"arxiv_id":"2311.16534","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.16534","snapshot_observed_at":"2026-07-04T09:49:45.013746Z","title":"Graph prompt learn- ing: A comprehensive survey and beyond.arXiv preprint arXiv:2311.16534","venue":null,"work_id":"e1eef284-694a-4de7-a1ba-107d15700353","year":2023},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"cited_paper":"/paper/2311.16534","citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:4ad25cda553a16875131f0581885f2afb58e4eb724d30e52caf7b5d942843a2d","observation_id":"dae729c2-6db4-4fd0-8aea-ffbfdcc4681a","resolution":{"observed_at":"2026-07-04T09:49:45.015075Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.08813","last_updated":"2022-10-17T07:58:07Z","snapshot_observed_at":"2026-08-09T13:32:08.016322Z","submitted_at":"2022-10-17T07:58:07Z","title":"Test-Time Training for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2210.08813","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.08813","snapshot_observed_at":"2026-07-04T09:49:45.009155Z","title":"Inductive representation learning in temporal networks via causal anonymous walks","venue":null,"work_id":"7feb4790-3b9a-4fb8-954f-6cdcb49b178f","year":null},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"cited_paper":"/paper/2210.08813","citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:f579b1e83100ebb2e1de88073d870848cd7fe9cbcf1f176cc0af0b981e8e2bbc","observation_id":"8ccacc81-cd21-4cd7-b7f9-dbb2f233e1de","resolution":{"observed_at":"2026-07-04T09:49:45.010535Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T09:21:40.944884Z","title":"and Fang, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:ee7800b4edaeb7498d6e57b056962c39ed2517573f6040e897f6171d993973ff","observation_id":"ccf95e38-3197-4219-8780-c30026a06146","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","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":"2021.30760","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T09:49:45.011525Z","title":"Boundary- aware dual-stream network for vhr remote sensing images semantic segmentation","venue":null,"work_id":"380fc57b-19b2-48f5-b68f-23a6aa367b38","year":2021},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:6e1da3044b760634a1e9bd753047d95f15f0945635aa356fe3dec297e7879d1e","observation_id":"ef7b81d4-f05d-43f9-96bb-c7880ed652fe","resolution":{"observed_at":"2026-07-04T09:49:45.012799Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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-06-26T09:21:40.944884Z","title":"Discrete-time temporal network embedding via implicit hierarchical learning in hyperbolic space","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:d9eaf3c113ee831c029d4fb6873ad426ac208df929ef576d0c24e986325b9dcf","observation_id":"88056292-51cd-4e5f-94ff-373aeebe08c0","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13937","last_updated":"2025-03-03T05:10:46Z","snapshot_observed_at":"2026-08-09T15:33:37.256581Z","submitted_at":"2024-05-22T19:10:24Z","title":"Node-Time Conditional Prompt Learning In Dynamic Graphs","version":8},"cited_work":{"arxiv_id":"2405.13937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13937","snapshot_observed_at":"2026-07-04T09:49:45.016068Z","title":"Node-time condi- tional prompt learning in dynamic graphs.arXiv preprint arXiv:2405.13937,","venue":null,"work_id":"cc11acaa-cd02-42b9-a315-4f0dff087a5c","year":null},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"cited_paper":"/paper/2405.13937","citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:6039092026b179b06a6d2ef63f90cf75dfee5f88723a093e3ccf1ba1ce975c09","observation_id":"ee258b9d-bec6-4f86-827a-793745630894","resolution":{"observed_at":"2026-07-04T09:49:45.017463Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T09:21:40.944884Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:7b01522c3b0406960eeb58a25ffef38a73ae695ce1757686e18c3f4be35bf395","observation_id":"91f17791-d3ed-4237-a7dc-a5d504cdb06b","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","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":"8250.9772","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T09:49:45.021099Z","title":"Moreover, Matcha can be combined with existing TTA methods to jointly handle structure and attribute shifts, achieving robust performance under diverse distribution shift settings","venue":null,"work_id":"eb7baa8a-c95d-4e98-8362-bdcdf0f91824","year":2019},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:e624986c53d7e730acd43f22904690ae783547a5a2cac4fb6ecf47febe6bf6a0","observation_id":"647960ad-014f-4efd-9abb-aabba981517c","resolution":{"observed_at":"2026-07-04T09:49:45.022524Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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-06-26T09:21:40.944884Z","title":"This snapshot-based formulation aligns better with the data collection mechanisms of many real-world systems, making DTDGs a practical choice for modeling long-term data evolution","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:7d26b6db93624bcf63303cf298338cd81258f8d9d370e6f44d8605c2af098907","observation_id":"9c370bc7-0d6f-481b-9332-9f30a7a2f2c9","resolution":{"observed_at":"2026-06-26T09:21:40.944884Z","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":"3280.62370","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T09:49:45.023531Z","title":null,"venue":null,"work_id":"b7787efe-3c25-4673-9e2a-ad0477714c44","year":2000},"citing_paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T09:21:40.944884Z"},"links":{"citing_paper":"/paper/2606.22914"},"observation_digest":"sha256:1feb78467ef9e5ebb2496bed8824a195fdb60652efd3480fa4bf6c7684c863cd","observation_id":"0193ff59-90ce-47c4-8e58-af07add1e90f","resolution":{"observed_at":"2026-07-04T09:49:45.024815Z","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"}}],"paper":{"arxiv_id":"2606.22914","last_updated":"2026-06-22T06:54:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T13:39:39.335084Z","submitted_at":"2026-06-22T06:54:02Z","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":8,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":16},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2606.22914."}