{"as_of":"2026-08-19T14:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:846edd20a9dd0629f639190bf9ba914013a6548b01d69046ad4987ffbc0598f4","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-19T06:32:44.657259+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-15T21:26:26.342769Z","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-16T12:16:17.039197Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.16800","last_updated":"2024-05-22T20:36:13Z","snapshot_observed_at":"2026-08-18T20:13:21.012654Z","submitted_at":"2024-01-30T07:31:51Z","title":"Online Algorithm for Node Feature Forecasting in Temporal Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16800","snapshot_observed_at":"2026-08-15T21:26:26.339752Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10207","last_updated":"2025-05-15T12:03:56Z","snapshot_observed_at":"2026-08-15T21:11:57.682451Z","submitted_at":"2025-05-15T12:03:56Z","title":"How to Color Temporal Graphs to Ensure Proper Transitions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:26.339752Z"},"links":{"cited_paper":"/paper/2401.16800","citing_paper":"/paper/2505.10207"},"observation_digest":"sha256:37a6f568d63ecda359bc2bb92917b78152846e2766d2b4206e1e35a0aa1ed4af","observation_id":"deb4ef11-86e6-4b8f-9534-f438fb5fbc29","resolution":{"observed_at":"2026-08-15T21:26:26.339752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16800","last_updated":"2024-05-22T20:36:13Z","snapshot_observed_at":"2026-08-18T20:13:21.012654Z","submitted_at":"2024-01-30T07:31:51Z","title":"Online Algorithm for Node Feature Forecasting in Temporal Graphs","version":2},"cited_work":{"arxiv_id":"2401.16800","doi":"10.48550/arxiv.2401.16800","metadata_source":"pith","pith_arxiv_id":"2401.16800","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Online Algorithm for Node Feature Forecasting in Temporal Graphs","venue":"cs.LG","work_id":"94a68060-0476-41e3-9b25-f017feee818f","year":2024},"citing_paper":{"arxiv_id":"2505.10207","last_updated":"2025-05-15T12:03:56Z","snapshot_observed_at":"2026-08-15T21:11:57.682451Z","submitted_at":"2025-05-15T12:03:56Z","title":"How to Color Temporal Graphs to Ensure Proper Transitions","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:26.342769Z"},"links":{"cited_paper":"/paper/2401.16800","citing_paper":"/paper/2505.10207"},"observation_digest":"sha256:d3cc7979f9adeabdb3cac6da9b17002b97b1ba733c638ac818a23b150239e483","observation_id":"87bb2851-8757-4e3a-a342-4c9e5127d020","resolution":{"observed_at":"2026-08-15T21:26:26.377113Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.16800/citation-record","integrity":"/paper/2401.16800/integrity","json":"/paper/2401.16800/citation-record.json","paper":"/paper/2401.16800"},"outbound":[],"paper":{"arxiv_id":"2401.16800","last_updated":"2024-05-22T20:36:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T20:13:21.012654Z","submitted_at":"2024-01-30T07:31:51Z","title":"Online Algorithm for Node Feature Forecasting in Temporal Graphs"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.16800."}