{"as_of":"2026-08-07T21:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2625ec71f765260f4f65b0ff628522a45adfdc99ce041a7fd1950fe32ede2027","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-07-30T23:40:06.694972Z","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":[{"citation":{"cited_paper":{"arxiv_id":"1912.06058","last_updated":"2019-12-12T16:06:47Z","snapshot_observed_at":"2026-08-01T22:04:45.268200Z","submitted_at":"2019-12-12T16:06:47Z","title":"Coloring graph neural networks for node disambiguation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06058","snapshot_observed_at":"2026-07-30T23:40:06.694972Z","title":"Coloring graph neural networks for node disambiguation.arXiv preprint arXiv:1912.06058,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2607.26699","last_updated":"2026-07-29T09:46:07Z","snapshot_observed_at":"2026-08-07T17:20:22.308070Z","submitted_at":"2026-07-29T09:46:07Z","title":"Universality and Approximation Rates of Graph Neural Networks with Random Features","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-07-30T23:40:06.694972Z"},"links":{"cited_paper":"/paper/1912.06058","citing_paper":"/paper/2607.26699"},"observation_digest":"sha256:ad21a6ce9e7a1a9f950edfe07bb442c022dbcf6873fb6dc53360dcd2c839d620","observation_id":"f9428d49-cefd-440e-a990-3990de99cdce","resolution":{"observed_at":"2026-07-30T23:40:06.694972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1912.06058/citation-record","integrity":"/paper/1912.06058/integrity","json":"/paper/1912.06058/citation-record.json","paper":"/paper/1912.06058"},"outbound":[],"paper":{"arxiv_id":"1912.06058","last_updated":"2019-12-12T16:06:47Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T22:04:45.268200Z","submitted_at":"2019-12-12T16:06:47Z","title":"Coloring graph neural networks for node disambiguation"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1912.06058."}