{"as_of":"2026-08-08T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0477032232f9ec78ff8b20c0e65059a29423e24e4ff97bab5cc3dca66f72259","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:23:08.574382Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.00735/citation-record","integrity":"/paper/2509.00735/integrity","json":"/paper/2509.00735/citation-record.json","paper":"/paper/2509.00735"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.02216","last_updated":"2018-09-10T14:26:58Z","snapshot_observed_at":"2026-07-06T05:45:54.936325Z","submitted_at":"2017-06-07T14:51:05Z","title":"Inductive Representation Learning on Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02216","snapshot_observed_at":"2026-08-05T13:23:08.525457Z","title":"ArXiv, abs/1706.02216","venue":null,"work_id":null,"year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.525457Z"},"links":{"cited_paper":"/paper/1706.02216","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:b1ee76506916d510b105837d04cab5a197a8c27ac96a0c54b50708df3327353e","observation_id":"14105287-48af-4a73-be7c-6dbbf3adf43c","resolution":{"observed_at":"2026-08-05T13:23:08.525457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12987","last_updated":"2024-02-20T13:17:37Z","snapshot_observed_at":"2026-08-07T12:27:47.858710Z","submitted_at":"2024-02-20T13:17:37Z","title":"Towards Robust Graph Incremental Learning on Evolving Graphs","version":1},"cited_work":{"arxiv_id":"2402.12987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.12987","snapshot_observed_at":"2026-08-05T13:23:08.634937Z","title":"Towards Robust Graph Incremental Learning on Evolving Graphs","venue":"cs.LG","work_id":"9f3f727a-0b6e-4436-bca3-9bab45434f85","year":2024},"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":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.552314Z"},"links":{"cited_paper":"/paper/2402.12987","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:ef1f1a272d8db34d2f096cb246c11d0256a124384afdefdf524534394569a0bc","observation_id":"cffa4b54-8fde-4dc0-9607-c0785445e918","resolution":{"observed_at":"2026-08-05T13:23:08.638734Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06330","last_updated":"2024-02-09T11:09:52Z","snapshot_observed_at":"2026-07-06T17:27:54.211733Z","submitted_at":"2024-02-09T11:09:52Z","title":"Continual Learning on Graphs: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06330","snapshot_observed_at":"2026-08-05T13:23:08.555719Z","title":"ArXiv, abs/2402.06330","venue":null,"work_id":null,"year":null},"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":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.555719Z"},"links":{"cited_paper":"/paper/2402.06330","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:c493daa57301e62a81e5f1c6b24439c8572206a299af7c2b4ac97408ca7b1448","observation_id":"4a29ea96-ff1f-4b38-9b2b-603e1464e2b5","resolution":{"observed_at":"2026-08-05T13:23:08.555719Z","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-05T13:23:08.781490Z","title":"2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 13709–13718","venue":null,"work_id":"af50cf54-761d-43af-b5c0-6cdc46a403b2","year":2022},"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":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.559051Z"},"links":{"citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:466f8b145f13eed1083e5ed2faf68eae4e4ea184064925781a4418dad0e088fd","observation_id":"c14cbb49-3164-4966-b8b6-140a40d15e8f","resolution":{"observed_at":"2026-08-05T13:23:08.785291Z","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-05T13:23:08.768018Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence, 45: 4622–4636","venue":null,"work_id":"fe16aa6f-51f1-4b52-b51d-7706e1616d4d","year":2022},"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":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.566159Z"},"links":{"citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:2ba05eec5122ad2a787e7c9c97fdfabec28a11310ab620798fd9b845578c8101","observation_id":"19e002cf-30e8-493b-965d-f4d5e7909f79","resolution":{"observed_at":"2026-08-05T13:23:08.772657Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-05T13:23:08.743532Z","title":"• ER-GNN (Zhou and Cao 2021b) is a replay-based method that constructs a memory buffer by storing rep- resentative nodes selected from previous tasks","venue":null,"work_id":"fb34a0d2-4134-47a9-ac95-1fee7c72093a","year":2023},"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":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.574382Z"},"links":{"citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:e40d252a758a87fc535795b864fbb589190e534fc296c975abc7ccbfd497897a","observation_id":"868b84a0-1f09-43d6-8df0-1dd607a79e47","resolution":{"observed_at":"2026-08-05T13:23:08.747624Z","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-05T13:23:08.755898Z","title":"The objective is to classify posts into their corresponding communities (subreddits)","venue":null,"work_id":"e719e7da-701e-486d-9ac1-57feed8a75c4","year":2020},"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":2014,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.570981Z"},"links":{"citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:b4c654012c8eb341dabb76ebad92b5ea9d93fc934e0d8d488aa3c5f3700cd076","observation_id":"2e138afb-3043-4e65-a595-5d285f297c79","resolution":{"observed_at":"2026-08-05T13:23:08.759702Z","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-05T13:23:08.536984Z","title":"Arxiv, abs/1609.02907","venue":null,"work_id":null,"year":null},"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":2016,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.536984Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:6b57e16d60bf74fbcb9be11c1d5fe741dd1db3517b705755c474b5efb9f395ec","observation_id":"19d11f57-e9ca-4cf0-a6a6-68ce8e09c661","resolution":{"observed_at":"2026-08-05T13:23:08.536984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.09601","last_updated":"2018-10-05T08:40:30Z","snapshot_observed_at":"2026-07-06T06:11:17.645784Z","submitted_at":"2017-11-27T09:48:44Z","title":"Memory Aware Synapses: Learning what (not) to forget","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.09601","snapshot_observed_at":"2026-08-05T13:23:08.521206Z","title":"ArXiv, abs/1711.09601","venue":null,"work_id":null,"year":null},"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":2017,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.521206Z"},"links":{"cited_paper":"/paper/1711.09601","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:2a59dbdfe305603da4de16ed1cc4bc55210453cdadbdb113cc0b8b69726a2f6b","observation_id":"26b537d7-7c47-40fb-a16b-d0c7e534f954","resolution":{"observed_at":"2026-08-05T13:23:08.521206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00751","last_updated":"2019-06-13T17:48:30Z","snapshot_observed_at":"2026-07-06T07:30:44.870185Z","submitted_at":"2019-02-02T16:29:47Z","title":"Parameter-Efficient Transfer Learning for NLP","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.00751","snapshot_observed_at":"2026-08-05T13:23:08.529256Z","title":"arXiv:1902.00751","venue":null,"work_id":null,"year":1902},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.529256Z"},"links":{"cited_paper":"/paper/1902.00751","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:40228d3fa9b4cee58c7f7810a46c398ca1480e1e6ac3b4b2b7eac0f22548fae8","observation_id":"1cc54d3c-7af1-44bb-a669-ab63948a46bc","resolution":{"observed_at":"2026-08-05T13:23:08.529256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-06T19:12:42.155813Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-05T13:23:08.533196Z","title":"ArXiv, abs/2005.00687","venue":null,"work_id":null,"year":2005},"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":2020,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.533196Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:6ae1a3dbc0204581cf909badf7d31ba61937fee35c430810ba944b37c1aa8399","observation_id":"9d0a692f-520b-41d9-8258-dd55b59d57a0","resolution":{"observed_at":"2026-08-05T13:23:08.533196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.13586","last_updated":"2021-07-28T18:09:46Z","snapshot_observed_at":"2026-07-06T11:33:25.933445Z","submitted_at":"2021-07-28T18:09:46Z","title":"Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.13586","snapshot_observed_at":"2026-08-05T13:23:08.541155Z","title":"arXiv:2107.13586","venue":null,"work_id":null,"year":null},"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":2021,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.541155Z"},"links":{"cited_paper":"/paper/2107.13586","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:9185816cee6a14f532700aaac974462ae76cc969062ca1e3aaeaf95045191354","observation_id":"2c34310d-d4a4-44d9-a614-a0b39475f715","resolution":{"observed_at":"2026-08-05T13:23:08.541155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.09455","last_updated":"2023-09-19T01:00:15Z","snapshot_observed_at":"2026-08-01T16:05:20.511960Z","submitted_at":"2023-09-18T03:28:49Z","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","version":2},"cited_work":{"arxiv_id":"2309.09455","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.09455","snapshot_observed_at":"2026-08-05T13:23:08.664937Z","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","venue":"cs.LG","work_id":"d724f327-bff0-4f84-adc3-f5f17453f3d5","year":2023},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.544857Z"},"links":{"cited_paper":"/paper/2309.09455","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:3a11a3bf89c57a05ecd58d9845b2d673f97c2a8eb89ddc957d1a05197dd3791c","observation_id":"ca9c461b-bb16-401c-82bd-730c5e2ed86d","resolution":{"observed_at":"2026-08-05T13:23:08.668803Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14439","last_updated":"2024-07-10T00:37:02Z","snapshot_observed_at":"2026-07-06T17:06:58.615343Z","submitted_at":"2023-12-22T05:09:58Z","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","version":2},"cited_work":{"arxiv_id":"2312.14439","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.14439","snapshot_observed_at":"2026-08-05T13:23:08.650069Z","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","venue":"cs.LG","work_id":"665fabc1-1706-448d-8ed9-0d3356518765","year":2023},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-05T13:23:08.548643Z"},"links":{"cited_paper":"/paper/2312.14439","citing_paper":"/paper/2509.00735"},"observation_digest":"sha256:ddc3b1af8ac8797ef50a0b6107b9faaad240ab9d31135c18004cfe2cad7542a3","observation_id":"1e61f760-d208-48f3-93c1-5cb3088daa10","resolution":{"observed_at":"2026-08-05T13:23:08.653742Z","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"}},{"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"}}],"paper":{"arxiv_id":"2509.00735","last_updated":"2025-08-31T08:04:43Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":1,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2509.00735."}