{"as_of":"2026-08-10T19:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ac74cb0840bb872c32dc2929557c796fee508cb3c7164e72702cc5e56d73625","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-10T06:31:04.303077+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-10T13:06:59.732007Z","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:61b74e048a100c82eb2dacb120b3b17f96568d4877147dc68867815a02f27a2d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/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-10T13:06:59.732007Z","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:141dbc398d3b825a57050ace1a00e44ec714c8953763ad0aeeb9e8213ccd54f7","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-10T13:06:59.732007Z","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:c113debd056d70efc399229a05a649786c669f75fde52856eafe5942ba00d13d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:b0177bd7c69a85b5e7cc99ca5f5307528275f56ea1fab1bcc1e256e5ee7a3e08","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:c69bf762ef1f8a3c848a83c5cde83dcf824da2dbfc5d828da79c808ae57423e2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:4d6393679ab89007c7df82fa7bf7087949c0792aeef2b74565908abaacb84bfc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:17483eb7753395d48adf5fd7e442ec81f435ed8671980be2afa51289aa820aea","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:056e5a0f8732cc9451c40bfca166628ae38a733dcac3c483fd116585236220f7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:35b8d6ff2a7753a55fdd1fac89b4bb49f2a89b21c3aae9fef6359b217f9d6c46","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:8d4008a120137cbca82b4337427cabef729b91134341f9987c679570c95d0cc5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:d2b4d9bade663afc225ee87f82d0c893534e9e8138e79e592012c11183199140","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:de3801aee633928aa9ad7543d61f10bb2f9c8fd186c58421ff6091153fdb72d8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:75a66139e41709e49e2fa93ab00e2527f8633204391e4c945c9cf3dd1d329d28","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:f59003dfeac594fc4981b6e90501fddc82fe052662463c760369e02552618183","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-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":"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-10T13:06:59.732007Z","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:7648bc3030580f399022603fb73dfede01c0570d6e6b3f0fe87edf204890b57e","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-10T13:06:59.732007Z","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:fbc6662cf8dfc4fd5f63e554fd20e549cc4f111512b167d25aefc603811324e8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:df2b6299e3316ac868a5efa47f8b6c6d05f165cf355eaffb1c156bafb593319b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:6095e0ba86974c56de85256f631ef71308ec78c76e3fa2543509962885bf4f56","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:a1aab1fbdaee7e244e462d48845b6a4dbc630c7e74ab88740a41735495bbe5a5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:73412e2342333e704dfb2e3ed3bbddb95dec09f9c06e3c741e407d98a152f2f7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:e32908e09a3fda9c21538884031c4631f7c066f6a0c1e9925f405e0a33c9f54f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:1c3c8e28398b959bd1db9e1619f03d7359a8480a8c8a32110311fdc79e91f00d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:9b7589b17a69b8aec1ac3166cafa953b434a431e14f4ed00a4c98674bfb7dc42","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:6dd46dd5c7bf5263ff430ae24e573d4c1d8b5857a8e7614fcebab613e0b99fbe","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:772271772bbf1c83739447a931bdd78a33eda79ab6a8d55450ad12cdb2a784de","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:3ef237ed960fbc437414b01495f667d0b44f85d68bc8b2f5f12f7fc6c3a36309","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-10T13:06:59.732007Z","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:bc88370eae79a174a588ca79fabafaca789b85c1ecf3304142084d304617f960","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:a48e1d2c328eccadd8626f3963e8cd098c5a089cba7e588e187b4b87b3877236","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:8b12dc9b041d428c3056bcba5a9466d7b1e64c6fc635de9cccf0daf1def3c214","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-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-08-10T12:42:53.690107Z","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-10T13:06:59.732007Z","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:0e0714063b9ea73d90ba53366d6be7c234c2e328d48bf900abf7594afce7efda","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-10T13:06:59.732007Z","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:7836868af247b909437b4848e3386c4d6746294de80bfca94d6e07cfc3462c53","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:962a21e61dddca4f135c9ae2e0306b09a0eee88be097185edcfc55ece84bbca0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:0fbc3a5fe28512d7c1a559fcf8164a7067f51cee3c077c9bd1d2be0d1176d581","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-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":"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-10T13:06:59.732007Z","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:663eeea5b5b492dd3c542651e879acc4fa5668025a70f0213f1fbb9a60cc1113","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-10T13:06:59.732007Z","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:f433d75aed915d384019d765e15ddea0c6d45af5d38f755b0e7c920807077fb3","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-10T13:06:59.732007Z","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:25f72da2b58c520904b90ff25b5e9b2c1f79feba63d5fc65fe29e4dcfb59dc16","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-10T13:06:59.732007Z","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:0d1259c186b2cec2ede1ef5984e4074bc85be87647cc50b25f2fe71efe86201d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:4683da823a58bccf779791ca22eebc63a09736998febd3bf37e9a2ce0deb4708","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-10T13:06:59.732007Z","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:d9753c7d35b4ba9b837b12ba53baeeb7872840d2070d2ca56c23c2c030503d94","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-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":"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-10T13:06:59.732007Z","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:0d2e9375d5ae2c6b33e06ac5cbda4e9f217976ac98712169c77f1784bcb3c7a6","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-10T13:06:59.732007Z","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:3775946a6ca0caa180479bdaecdd875ad1292d34a929410e19319c932b556a66","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:b82e5b341687e0fe85b1126a977a4d749b0fbdf70fac85f176228ff6dd6d6039","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-10T13:06:59.732007Z","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:75faf74000818253b69e80e4573768d77aba00ef517649f0b0b025c518d37f49","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:9b8fc22402a611ac7f5b6adfc32228e44c8a0d91c0907bec4c8b94ff66135a57","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:538ba41a0cdf242556ebd9618ff1f42be894cee4e064f696a8bfb2e245cce188","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:220b874e0097e379c00a6b33e4fe76ee646efaa87fce8c7a227e0d6d1bc4bc9d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:059eec90058209813c68702a9ba47fce4049fd36d2b83c6be340b1c868b5063c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:0077f5a261be71d1897a3c0096d0acdc8d528683fd3e164fa525c949fa92cf05","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-10T13:06:59.732007Z","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:6010cf254cfeb76d5613b6a1fe8d0e0d73823473bfac1f9beaf83dbb1933acd4","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-10T13:06:59.732007Z","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:7a5d80f8fd296797def95ed7e76fd0a3d60de97078b312f3334e5172da8d4dc8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-10T13:06:59.732007Z","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:261a45282c3e1fcdd73f5db8dfac4a150059cc7dc3febd5fe555673e6f208162","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-10T13:06:59.732007Z","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:1ab0b651f588282b8c05bf3ccbcbaa977de2dfe75c4011648b975455b44585c5","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-10T13:06:59.732007Z","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:39d47b1749c8c62e4e60bad6fa1c70631feaf0bfdeca13cef4c9f1d7741e6a77","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-10T13:06:59.732007Z","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-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 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2502.06327."}