{"as_of":"2026-08-13T09:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:557088c392d39eb92c1ce983e97eab0a79c15f0c374245a27d953388a1f40cee","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-13T06:32:02.005865+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-08-12T14:21:57.619081Z","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-12T14:21:57.841550Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.10102","last_updated":"2024-10-28T12:59:37Z","snapshot_observed_at":"2026-08-13T07:49:53.624278Z","submitted_at":"2021-11-19T08:54:21Z","title":"Graph Neural Networks with Feature and Structure Aware Random Walk","version":2},"cited_work":{"arxiv_id":"2111.10102","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.10102","snapshot_observed_at":"2026-08-12T14:21:57.841550Z","title":"Graph Neural Networks with Feature and Structure Aware Random Walk","venue":"cs.LG","work_id":"543c6f5f-c793-4d45-aa7b-c6f6cefdbbf3","year":2021},"citing_paper":{"arxiv_id":"2411.15458","last_updated":"2024-11-23T05:31:25Z","snapshot_observed_at":"2026-08-12T14:14:41.588665Z","submitted_at":"2024-11-23T05:31:25Z","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T14:21:57.619081Z"},"links":{"cited_paper":"/paper/2111.10102","citing_paper":"/paper/2411.15458"},"observation_digest":"sha256:74d269355205e02a77175fb035e9ca4257d2ea0f8579215e92e766ee4c0dda83","observation_id":"5187b37f-2626-4f47-afc5-7b796a6b2ff6","resolution":{"observed_at":"2026-08-12T14:21:57.866037Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.10102/citation-record","integrity":"/paper/2111.10102/integrity","json":"/paper/2111.10102/citation-record.json","paper":"/paper/2111.10102"},"outbound":[],"paper":{"arxiv_id":"2111.10102","last_updated":"2024-10-28T12:59:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T07:49:53.624278Z","submitted_at":"2021-11-19T08:54:21Z","title":"Graph Neural Networks with Feature and Structure Aware Random Walk"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2111.10102."}