{"as_of":"2026-08-14T22:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23449e943054c9c5b741ff2b0fd719d427bb5e49531b5f9992cff99669643338","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:00:24.115372Z","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.650069Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.14439","last_updated":"2024-07-10T00:37:02Z","snapshot_observed_at":"2026-08-13T04:55:34.609137Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14439","snapshot_observed_at":"2026-08-07T15:00:24.115372Z","title":"Structural re-weighting improves graph domain adap- tation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16860","last_updated":"2025-05-22T16:19:19Z","snapshot_observed_at":"2026-08-10T10:11:37.902918Z","submitted_at":"2025-05-22T16:19:19Z","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:00:24.115372Z"},"links":{"cited_paper":"/paper/2312.14439","citing_paper":"/paper/2505.16860"},"observation_digest":"sha256:eff44e1c571140d54182b9b4ab85200e4c05c72f0df0d9669c1c719024ba7f61","observation_id":"82de5f34-8764-4649-a06a-9c5dec145aab","resolution":{"observed_at":"2026-08-07T15:00:24.115372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14439","last_updated":"2024-07-10T00:37:02Z","snapshot_observed_at":"2026-08-13T04:55:34.609137Z","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:cae39eb29ca344d3cb748151b9671074d9c41321f52cf3c9097b944e8529ab40","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.14439/citation-record","integrity":"/paper/2312.14439/integrity","json":"/paper/2312.14439/citation-record.json","paper":"/paper/2312.14439"},"outbound":[],"paper":{"arxiv_id":"2312.14439","last_updated":"2024-07-10T00:37:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:55:34.609137Z","submitted_at":"2023-12-22T05:09:58Z","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.14439."}