{"as_of":"2026-08-18T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40c4ec8b3ac805927302becc566eff39cb395e6f3668241491f777dcef13cfa1","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:21:12.677418Z","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-07T15:25:54.306669Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.10341","last_updated":"2024-10-28T00:01:22Z","snapshot_observed_at":"2026-08-18T02:00:34.535363Z","submitted_at":"2024-10-14T09:54:20Z","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10341","snapshot_observed_at":"2026-08-12T10:49:25.895201Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18919","last_updated":"2025-05-28T02:22:15Z","snapshot_observed_at":"2026-08-17T00:58:49.505688Z","submitted_at":"2024-11-28T05:15:47Z","title":"Federated Continual Graph Learning","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T10:49:25.895201Z"},"links":{"cited_paper":"/paper/2410.10341","citing_paper":"/paper/2411.18919"},"observation_digest":"sha256:b72251740a04af7f02a656bcf6202b90cd991074187a5474fef84d694dabedde","observation_id":"6ae67dbb-b83a-404c-9ba9-e2d66da5be71","resolution":{"observed_at":"2026-08-12T10:49:25.895201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10341","last_updated":"2024-10-28T00:01:22Z","snapshot_observed_at":"2026-08-18T02:00:34.535363Z","submitted_at":"2024-10-14T09:54:20Z","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10341","snapshot_observed_at":"2026-08-15T21:21:12.677418Z","title":"Replay-and-forget-free graph class-incremental learning: A task profiling and prompting approach.arXiv preprint arXiv:2410.10341, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.10040","last_updated":"2025-05-15T07:35:27Z","snapshot_observed_at":"2026-08-15T21:15:34.924875Z","submitted_at":"2025-05-15T07:35:27Z","title":"Instance-Prototype Affinity Learning for Non-Exemplar Continual Graph Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:21:12.677418Z"},"links":{"cited_paper":"/paper/2410.10341","citing_paper":"/paper/2505.10040"},"observation_digest":"sha256:5584ce532007abc9a15e017877d58d2c981eb91999a4a3a110aed3d54fd08199","observation_id":"fba58cba-b8d2-4aad-bd97-cd7951a694f3","resolution":{"observed_at":"2026-08-15T21:21:12.677418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10341","last_updated":"2024-10-28T00:01:22Z","snapshot_observed_at":"2026-08-18T02:00:34.535363Z","submitted_at":"2024-10-14T09:54:20Z","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","version":2},"cited_work":{"arxiv_id":"2410.10341","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.10341","snapshot_observed_at":"2026-08-07T15:25:54.306669Z","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","venue":"cs.LG","work_id":"bcc23544-f338-4fab-8605-748c9dc71c41","year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-13T13:43:13.985874Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":239,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:49.179362Z"},"links":{"cited_paper":"/paper/2410.10341","citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:57463b5c1567661541b0f3e39fd0efd8a8dd97d761cd50e0139d4dda9ad2a926","observation_id":"70aab55b-643d-47b9-86b2-511cf4807cf3","resolution":{"observed_at":"2026-08-07T15:25:54.380595Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.10341/citation-record","integrity":"/paper/2410.10341/integrity","json":"/paper/2410.10341/citation-record.json","paper":"/paper/2410.10341"},"outbound":[],"paper":{"arxiv_id":"2410.10341","last_updated":"2024-10-28T00:01:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T02:00:34.535363Z","submitted_at":"2024-10-14T09:54:20Z","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2410.10341."}