{"as_of":"2026-08-08T20:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b08e2d1c7eba79cb91ed92de04db2e1f8d2b3ce12919a6efaa82adf57e6d40d2","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:53:24.245642Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-05T13:23:08.562277Z","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-05T13:23:08.604626Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"cited_work":{"arxiv_id":"2502.06327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06327","snapshot_observed_at":"2026-08-05T13:23:08.604626Z","title":"Prompt-Driven Continual Graph Learning","venue":"cs.LG","work_id":"cce942fa-78f8-41eb-a6dd-f97480a72edf","year":2025},"citing_paper":{"arxiv_id":"2509.00735","last_updated":"2025-08-31T08:04:43Z","snapshot_observed_at":"2026-08-08T17:21:30.687531Z","submitted_at":"2025-08-31T08:04:43Z","title":"Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.562277Z"},"links":{"cited_paper":"/paper/2502.06327","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:b9bb0c1e867c392d87efcbd302bbae2d5bd97084356864041739378426ea8f56","observation_id":"2bacf7a9-0ed3-4b00-8881-24fbaa96a611","resolution":{"observed_at":"2026-08-05T13:23:08.610267Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06327/citation-record","integrity":"/paper/2502.06327/integrity","json":"/paper/2502.06327/citation-record.json","paper":"/paper/2502.06327"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:23.661669Z","title":"A comprehensive survey on graph neural networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.661669Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:53f95e18c0604908d9f536bfe8f01ebf8fdcd9ed0cf4cff67de67c47a6e5ddc5","observation_id":"d49d42ad-6b16-4ab1-b60e-5c494a178a83","resolution":{"observed_at":"2026-08-08T15:53:23.661669Z","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-08T15:53:26.022172Z","title":"Efficient subgraph search over large uncertain graphs,","venue":null,"work_id":"26c40272-f53a-4804-8be7-0ad275ca73f3","year":2011},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.680777Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:281f97ae7198914815522e16ee8480aa00a63e18f0b08c72e9d49179fedfacbe","observation_id":"f06dd3f7-7055-4ee5-a02b-86daede86417","resolution":{"observed_at":"2026-08-08T15:53:26.026474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:26.011596Z","title":"Cgmega: explainable graph neural network framework with attention mechanisms for cancer gene module dissection,","venue":null,"work_id":"a704bb6f-8c39-447b-8442-8d2b216d5902","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.692699Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:c292e6ce149a028a53df34f90e2f6419d2371bc49fbc64fb37b0969f9dab5935","observation_id":"6dfc62be-e798-4eb6-ac45-818fb0198d3b","resolution":{"observed_at":"2026-08-08T15:53:26.014808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:26.001153Z","title":"A weighted symmetric graph embedding approach for link prediction in undirected graphs,","venue":null,"work_id":"e8f92903-d5de-416f-9431-c985b7ce52fe","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.696215Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:c671e5644d611f63bd15e331667056e1189c5edc312b019154aee141fa5dfe7d","observation_id":"eaa739ad-a4f3-4d76-9679-a4784a7b3833","resolution":{"observed_at":"2026-08-08T15:53:26.004362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.989074Z","title":"Semisuper- vised graph neural networks for graph classification,","venue":null,"work_id":"bcff64be-71fb-47a7-ad95-c2243621df6b","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.699637Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:825ec5326fee07d2ce7e98a95ea38fd528b5f1f7ba4bd5f57627cd08b61e1c03","observation_id":"affc4a53-5dbf-41f7-8799-50dcaeb19df4","resolution":{"observed_at":"2026-08-08T15:53:25.993175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.976542Z","title":"Noise-resistant graph neural networks for session-based recommenda- tion,","venue":null,"work_id":"38b93ac0-cca4-473a-8cb0-3d17413514a4","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.703052Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:a43ce5725ec6fbd5bd23bf2b3fdcb9de41516e10ef29f3500788fbffb7606a42","observation_id":"b996e67a-595e-40b8-b889-1465b3290e1e","resolution":{"observed_at":"2026-08-08T15:53:25.981327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.954242Z","title":"Grakerformer: A transformer with graph kernel for unsupervised graph representation learning,","venue":null,"work_id":"433d4e37-8821-4ceb-a624-75e19739f2cc","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.706707Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:7217aa461f9f2833ebee89a3bb6d600194daf440f081afac34305f531f5f3049","observation_id":"1fc65bec-d1a2-42f9-9601-398ec4c8d541","resolution":{"observed_at":"2026-08-08T15:53:25.968653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.850022Z","title":"Overcoming catastrophic forgetting in graph neural networks,","venue":null,"work_id":"28bc952b-081a-45ec-bfe1-ef5a2fb19949","year":2021},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.710079Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:6601204949e715bf860bac2e3342a261fd83a6334f8adbc96e6e697b4f402156","observation_id":"67cb1750-66cf-4dff-9312-8e2dd9972c92","resolution":{"observed_at":"2026-08-08T15:53:25.908587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.625933Z","title":"Lifelong graph learning,","venue":null,"work_id":"581eb0fa-5c41-4bee-bee0-976044e56168","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.715734Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:f2a0bef534cd3b3cfc7f58f8504f3e7df3d278c97f974d6648e98f99b16e0ae0","observation_id":"220fef02-448f-43c5-bc81-2ed402787b83","resolution":{"observed_at":"2026-08-08T15:53:25.723427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.567334Z","title":"Adaptive cointegration analysis and modified rpca with continual learning ability for monitoring multimode nonstationary processes,","venue":null,"work_id":"6c51f04d-cc62-4ee8-9339-ce7f50e51a61","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.720723Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:8706e621470c934c3b3f53852f98e6fd9eade0050d1253a715e34b03b7784284","observation_id":"e84fcb01-05e9-495e-a295-5d360d867771","resolution":{"observed_at":"2026-08-08T15:53:25.581288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.556920Z","title":"Cglb: Benchmark tasks for continual graph learning,","venue":null,"work_id":"97035195-bb60-49f8-bf6e-f5aa8f9905fd","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.724215Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:6b30cb5acdc0e28025259094e15518e342f87b105285f878fec9444f0d195194","observation_id":"6b469680-be12-43e2-a4fe-2100abf324d9","resolution":{"observed_at":"2026-08-08T15:53:25.560743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.546206Z","title":"Rein- forced continual learning for graphs,","venue":null,"work_id":"4b385cd7-203f-458b-adfa-f7748299d81e","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.727822Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:7295c4da991e865860ec245915a1c2aedd04f00b592176fbb9412784f17bd0f5","observation_id":"3d22d30c-fe99-4df7-be24-50562c6e3a73","resolution":{"observed_at":"2026-08-08T15:53:25.549725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.534382Z","title":"Multimodal continual graph learning with neural architecture search,","venue":null,"work_id":"afa86beb-37e8-4e73-a35c-0b0da9c58feb","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.730623Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:6fa772e261d6ad3528eb4433dce310ceb6acf3631168ab01baddbb6e7d41f81d","observation_id":"4424b13b-6486-42ed-8802-ae41bea3a915","resolution":{"observed_at":"2026-08-08T15:53:25.538491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2402.11565","last_updated":"2024-02-18T12:24:45Z","snapshot_observed_at":"2026-08-08T15:13:20.011402Z","submitted_at":"2024-02-18T12:24:45Z","title":"Continual Learning on Graphs: Challenges, Solutions, and Opportunities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11565","snapshot_observed_at":"2026-08-08T15:53:23.758308Z","title":"Continual learning on graphs: Chal- lenges, solutions, and opportunities,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.758308Z"},"links":{"cited_paper":"/paper/2402.11565","citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:b592fdd7ebbc9841d54fd731a342577e1adcebaf5ce0c855bfdb6753684a4060","observation_id":"3e5bc351-5a11-4dab-bfa2-ac9318662173","resolution":{"observed_at":"2026-08-08T15:53:23.758308Z","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-08T15:53:25.507394Z","title":"Hierarchical prototype networks for continual graph representation learning,","venue":null,"work_id":"72ab09b0-785a-4e69-a452-9ce9dd764fdb","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.819046Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:0128f3fd3b312e5e31b0bbc9d8b8eb372e64905e0b4408fb09e7baa43d6cba26","observation_id":"7a5349fa-a138-41d4-976e-ddc3f3dd006b","resolution":{"observed_at":"2026-08-08T15:53:25.521957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.488140Z","title":"Continual learning on dynamic graphs via parameter isolation,","venue":null,"work_id":"60242118-396e-486a-ab0f-472874119b01","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.860933Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:bec2dd5541e1fb95fed4ebc2b98b3ebabf97bdaf33ef77adeef11bc18be5cdfd","observation_id":"1887c213-77d3-4901-a1ad-9754204631f7","resolution":{"observed_at":"2026-08-08T15:53:25.494998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.471935Z","title":"Overcoming catastrophic forgetting in graph neural networks with experience replay,","venue":null,"work_id":"3e838842-9160-40f8-866b-d5918760c6f7","year":2021},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.908936Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:c50b9f1510911bc199331e1dd00ee86d14d373131c3af38ff65d0fd712646c7c","observation_id":"fcf98064-62ea-4d2a-9e60-a44aa23d44a0","resolution":{"observed_at":"2026-08-08T15:53:25.477682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.454290Z","title":"Sparsified subgraph memory for continual graph representation learning,","venue":null,"work_id":"d9456303-33fa-4d57-a81d-38c5e8a22fae","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.960985Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:b57ede43a294eb59bcaa02e55cb5bf83e625d804059d867985329e2c9d5c82ba","observation_id":"3287b2cd-6d31-48eb-9ef6-7f34498b0a96","resolution":{"observed_at":"2026-08-08T15:53:25.460767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.406663Z","title":"Dygrain: An incremental learning frame- work for dynamic graphs","venue":null,"work_id":"bb2cad6e-40a7-438d-9f34-e2b9e0e2b4d1","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:23.979938Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:af72798c23a9553e07afb13cf9d503d1966e0354c8e8bc4825373f8ef059321e","observation_id":"b3fdb1e7-9a0b-425b-8b7e-4ff1e24bf5d8","resolution":{"observed_at":"2026-08-08T15:53:25.424821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.348502Z","title":"Cat: Balanced continual graph learning with graph condensation,","venue":null,"work_id":"c014f8b0-83ea-4c02-aa37-d8e85f4365cb","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.002331Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:6873d1f48df4d3b6a2a13e36980572b95c6b85c645dad522c0a55ddc6ec8a4cf","observation_id":"69f2b97c-26c4-49fe-984c-0d9c9719fe98","resolution":{"observed_at":"2026-08-08T15:53:25.376842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.327803Z","title":"Ricci curvature-based graph sparsifi- cation for continual graph representation learning,","venue":null,"work_id":"cdf456c5-4c4a-4e45-a489-f8e56d5a377d","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.038135Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:663425d819df4c87c0141efc2f281a015e1b04d4f1a895fc7418801d18a6e5cc","observation_id":"1bb4b482-0b8d-4aee-a212-7eca63c0ee86","resolution":{"observed_at":"2026-08-08T15:53:25.338180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.266877Z","title":"A federated graph neural network framework for privacy-preserving personalization,","venue":null,"work_id":"4ff8d42d-c697-4686-8d23-da516e60798a","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.054117Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:6fc02d8e2924131add74b25cac3d74d7c9b2998952f385a1eab14eebb7ea99e5","observation_id":"a960c4a8-b22d-4a12-87fb-1c640fb4964a","resolution":{"observed_at":"2026-08-08T15:53:25.295652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.134420Z","title":"Making pre-trained language models end-to-end few-shot learners with contrastive prompt tuning,","venue":null,"work_id":"0b3a2a6c-1373-4149-b018-96e74760eb9d","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.091596Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:6e4e30ec9910a6621b1a5147f964cdc11cd6e25b8464d86f0b6dd33ca2d80e82","observation_id":"6ef8ca9b-4059-40bc-bb7c-35edb77400f3","resolution":{"observed_at":"2026-08-08T15:53:25.202410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:25.034172Z","title":"Learning to prompt for continual learning,","venue":null,"work_id":"676c0794-fa7a-4868-8889-5e2c9a9737d5","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.117076Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:a99586c697d9051c897672638eea10bbf6e8092fe7e34a830352b62ca470d085","observation_id":"0d67f731-1338-4816-b84d-03c3d1d668e7","resolution":{"observed_at":"2026-08-08T15:53:25.066963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.133064Z","title":"Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.133064Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:e3a98f37f2ed72070a297d4cbb6fbcaadf1914025225bea13b83d3e6158708e3","observation_id":"5a388f04-f193-4fca-a2d4-898f10c9f627","resolution":{"observed_at":"2026-08-08T15:53:24.133064Z","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-08T15:53:24.901523Z","title":"Prefix-tuning: Optimizing continuous prompts for generation,","venue":null,"work_id":"7bdbc344-836b-4d4e-b90b-ebd16e7323f7","year":2021},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.152463Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:7429c2b92aa1d44a285bd7d4f04e01af4c2998a4394fb862bda610e9172e655e","observation_id":"6a58e091-1dc1-4afc-945a-1a0e89703699","resolution":{"observed_at":"2026-08-08T15:53:24.963326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.867638Z","title":"Universal prompt tuning for graph neural networks,","venue":null,"work_id":"757266a9-427e-4b88-a21c-5ca3a2a64f94","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.160443Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:148b920a6e70b8bef4531e79ea5cfa1ccbac2bd190f360818e276b0d30cda15f","observation_id":"96688e77-ff12-4644-bccf-8003c8ed511d","resolution":{"observed_at":"2026-08-08T15:53:24.871937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.857075Z","title":"All in one: Multi-task prompting for graph neural networks,","venue":null,"work_id":"69678125-4e08-476f-b924-97fa1f8e3350","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.166150Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:a43b8beb32c29152aba9d411f3cbc7dbe1db5dd06ab007c7c25b7cec56e3a925","observation_id":"3fa120ea-d12f-4d88-980c-a00f73dc33ec","resolution":{"observed_at":"2026-08-08T15:53:24.860698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16534","snapshot_observed_at":"2026-08-08T15:53:24.169189Z","title":"Graph prompt learning: A comprehensive survey and beyond,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.169189Z"},"links":{"cited_paper":"/paper/2311.16534","citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:0e5e140d224e3952199a4ea7ba71aa0aff94c7728bf592485b6e03b15660eca8","observation_id":"ab1e0326-d98c-4cfb-b2e8-ba3e4dc4eea4","resolution":{"observed_at":"2026-08-08T15:53:24.169189Z","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-08T15:53:24.845814Z","title":"Virtual node tuning for few-shot node classification,","venue":null,"work_id":"56fef791-fcb9-42ff-acb8-da0d42ed3cf8","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.172466Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:ea1f2b8b0fc87d00052f867f7255e808721d55cf45223354bbad15d35ad588a0","observation_id":"bcf77160-266f-4ce4-ad26-13a5b54b3441","resolution":{"observed_at":"2026-08-08T15:53:24.850054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.835058Z","title":"Gppt: Graph pre-training and prompt tuning to generalize graph neural networks,","venue":null,"work_id":"388fbc6d-45af-4529-80b2-1f9c52241b18","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.175402Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:4d2e683ae10284f35a9ee88476ed375a7e0e7066576fb97bed57eb678d1b352d","observation_id":"6e73e663-d612-442b-9f28-36afbb93f3c5","resolution":{"observed_at":"2026-08-08T15:53:24.838461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.823792Z","title":"It’s not just size that matters: Small language models are also few-shot learners,","venue":null,"work_id":"c4826f35-9f1d-42d4-a1f1-78ad7ce8d09e","year":2021},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.178587Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:d09288aff0b112f45fc82b8381a35938e7f4d6231a2a6609201b5433b800e64a","observation_id":"4df9a0a7-a5e7-42a1-b655-88f2c7e74d67","resolution":{"observed_at":"2026-08-08T15:53:24.827231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-08T15:53:24.181999Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.181999Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:c61ef7dfd2ff439276ace59df1147e90036495aa66934a266278779ef97c2f2c","observation_id":"903d67d9-f8be-407a-a541-b5611439daf1","resolution":{"observed_at":"2026-08-08T15:53:24.181999Z","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-08T15:53:24.185412Z","title":"Learning to prompt for vision-language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.185412Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:837f19c938383fcf449af58201245e392935967c93438cd4fc5771d6cdfc9dd8","observation_id":"22eaf51a-1aea-4d82-a9ff-4db651b61154","resolution":{"observed_at":"2026-08-08T15:53:24.185412Z","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-08T15:53:24.188371Z","title":"Conditional prompt learning for vision-language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.188371Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:0a532c49726744cf10741cab979e624a62248dfc62d16043afdf2e0779e6316a","observation_id":"a60456ba-3aad-4652-ae60-9af012f61f85","resolution":{"observed_at":"2026-08-08T15:53:24.188371Z","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-08T15:53:24.797259Z","title":"Visual prompt tuning,","venue":null,"work_id":"f8380dc2-2e6d-4227-9df6-a66f553ea045","year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.192130Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:fd11aa8715893dcee75a56ad5a770fa1dd1049c5c33f9d22320cc68f0385eab0","observation_id":"9cb51439-3525-435b-9e70-32cb6374ab35","resolution":{"observed_at":"2026-08-08T15:53:24.801650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.195493Z","title":"Adaptformer: Adapting vision transformers for scalable visual recog- nition,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.195493Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:09ccfc0d883c87dec535481cf0a2490f65c86739fa61e3bfec3597498d5ec0f7","observation_id":"f35959d7-1530-464e-b129-6f2ccdc44dee","resolution":{"observed_at":"2026-08-08T15:53:24.195493Z","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-08T15:53:24.775077Z","title":"Prompt switch: Efficient clip adaptation for text-video retrieval,","venue":null,"work_id":"40861154-5152-4432-8cd7-b53a7e49b340","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.199034Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:38f6b9c0740dc0f64e98eabe48d225fe55372ddcedc1187937d78c0e237c4c3e","observation_id":"731fb02c-133b-4ea5-bce1-ca49fd2aa14d","resolution":{"observed_at":"2026-08-08T15:53:24.780569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2211.09699","last_updated":"2023-08-17T21:43:24Z","snapshot_observed_at":"2026-08-05T17:48:17.937618Z","submitted_at":"2022-11-15T19:07:53Z","title":"PromptCap: Prompt-Guided Task-Aware Image Captioning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09699","snapshot_observed_at":"2026-08-08T15:53:24.202171Z","title":"Promptcap: Prompt-guided task-aware image captioning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.202171Z"},"links":{"cited_paper":"/paper/2211.09699","citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:49a40e3c339d8cd0ea7ef74a092370bedf216e919d20657c23e3a58f4accdc7f","observation_id":"b7089b11-485d-499a-95c0-5986a3eb4d3e","resolution":{"observed_at":"2026-08-08T15:53:24.202171Z","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-08T15:53:24.750329Z","title":"Exploring low-resource medical image classification with weakly supervised prompt learning,","venue":null,"work_id":"93f6bed4-eb5a-40be-a502-1ccb461a1c38","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.206070Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:866123e8973d25ef3fb4412d4b04209345636a32e5f150f166fe5844521228c1","observation_id":"9b9a43dc-c649-41c5-bf44-fd1bf5531b09","resolution":{"observed_at":"2026-08-08T15:53:24.763692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.209480Z","title":"Learning to prompt for open-vocabulary object detection with vision-language model,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.209480Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:e55aae433e0c1bd1a9e884de10bcae5eef5c40b85e1075e7f14bfcd299bc810e","observation_id":"4069efbe-0f17-480a-9c55-0089a811ac19","resolution":{"observed_at":"2026-08-08T15:53:24.209480Z","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-08T15:53:24.711576Z","title":"Learning background prompts to discover implicit knowledge for open vocabu- lary object detection,","venue":null,"work_id":"2c25505f-cc64-4879-ad84-260045ca2230","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.212219Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:dbbfc8016e3e9a7a4af5aeb0b45705956e96e1eecca85b1df62bc4586e2fb747","observation_id":"39d2eefe-a70a-43ef-afb8-ea9b59a07d01","resolution":{"observed_at":"2026-08-08T15:53:24.721108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.667866Z","title":"Vscode: General visual salient and camouflaged object detection with 2d prompt learning,","venue":null,"work_id":"875c58aa-3fb9-47ce-a179-fa16d20f78da","year":2024},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.215090Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:1bc16e0829246a4c6bd39adbed7479ded367b5cffe00804ef6c0382501eb9557","observation_id":"dac76d64-b548-476e-b871-4e894ca62d64","resolution":{"observed_at":"2026-08-08T15:53:24.687528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.608423Z","title":"Graphprompt: Unifying pre- training and downstream tasks for graph neural networks,","venue":null,"work_id":"b31b1758-a8fb-451c-82a9-fb75a1573e74","year":2023},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.218599Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:8f395e9940bb6b8d4fabf85f5be03cb2ebb2f502e1033929bfa3a2696c466114","observation_id":"f52b45f5-e9f2-42e9-8bfe-3f54aac497ad","resolution":{"observed_at":"2026-08-08T15:53:24.647252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.511635Z","title":"Automating the construction of internet portals with machine learning,","venue":null,"work_id":"85c6f036-d0bf-46fe-8ee3-115ec1b55351","year":2000},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.221795Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:99457f6019faaf767b7b352c3779a547089664e5e46b5718362fcbf6cdae502a","observation_id":"f8705297-f19b-4d9d-9207-ecb436cce50a","resolution":{"observed_at":"2026-08-08T15:53:24.539867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.456385Z","title":"Open graph benchmark: Datasets for machine learning on graphs,","venue":null,"work_id":"e519d144-d260-4d7a-b612-927a3dc4bba9","year":2020},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.225151Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:3fb4982d9fcfbaea2cb6d8dce9410390cd1fbdbc22139bb505473369dc972d06","observation_id":"da6187ef-5aea-4cf3-a741-06e13b95c981","resolution":{"observed_at":"2026-08-08T15:53:24.479439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.228005Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.228005Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:ceab811677e04731ce0cabe9cd2507f8628fea37b987f73c3fdadab8f22b5c7a","observation_id":"320b7ff1-24c5-4027-a3bb-15c8030c1d30","resolution":{"observed_at":"2026-08-08T15:53:24.228005Z","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-08T15:53:24.231326Z","title":"Overcoming catastrophic forgetting in neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.231326Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:28bededf38278dfa3cc2fb406ed53561f38d87f47ede21c10364f1a64c9231d7","observation_id":"0e0d5ef3-a1e9-4f9a-9cac-f899c9b31c3f","resolution":{"observed_at":"2026-08-08T15:53:24.231326Z","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-08T15:53:24.356395Z","title":"Memory aware synapses: Learning what (not) to forget,","venue":null,"work_id":"91ebcc70-bc11-4960-995e-9fbb261ddea6","year":2018},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.234609Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:4e7411de3d076891b02ed4ccf3bae6c3bd45fcbc0f8d341d8d97cdc3b64a8275","observation_id":"ec971eb1-6c96-43da-8f2c-58b883bc9feb","resolution":{"observed_at":"2026-08-08T15:53:24.390534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:53:24.238328Z","title":"Gradient episodic memory for continual learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.238328Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:924a79bb40b1d4f5da1ee0d2411e1681be2a2c54fe4b7686a06e81886d096b62","observation_id":"2f2959b4-3d8c-4818-a799-1156b4bb125d","resolution":{"observed_at":"2026-08-08T15:53:24.238328Z","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-08T15:53:24.241741Z","title":"Learning without forgetting,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.241741Z"},"links":{"citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:9c222a180a8a15c7604073e9580900accda9dd4c5728ae049780571504f896f4","observation_id":"5f35b198-a9d0-4362-8d1a-ed225ccaf290","resolution":{"observed_at":"2026-08-08T15:53:24.241741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-08T15:53:24.245642Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T15:53:24.245642Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2502.06327"},"observation_digest":"sha256:8a0208204054543cd54fe4c2543cb828454ec29540e47b64e781a134e720fb96","observation_id":"bd2d5f58-f847-4111-af73-05d1dc611ab9","resolution":{"observed_at":"2026-08-08T15:53:24.245642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06327","last_updated":"2025-02-10T10:28:11Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T15:45:52.523293Z","submitted_at":"2025-02-10T10:28:11Z","title":"Prompt-Driven Continual Graph Learning"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":52},"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 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2502.06327."}