{"as_of":"2026-08-09T09:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53f9703b0c686446f89dc41c3562cd6582b8000918c9f5248e954cae4070706c","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-09T06:31:02.800959+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-07T10:36:54.491318Z","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-06T14:36:54.953714Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.04051","last_updated":"2021-06-08T02:07:21Z","snapshot_observed_at":"2026-07-06T11:16:56.255738Z","submitted_at":"2021-06-08T02:07:21Z","title":"Graph-MLP: Node Classification without Message Passing in Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04051","snapshot_observed_at":"2026-08-07T10:36:54.491318Z","title":"Graph-mlp: Node classification without message passing in graph","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-09T07:12:54.657620Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.491318Z"},"links":{"cited_paper":"/paper/2106.04051","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:cf7b0e864f81d40f73e9e7ac7cb5eeeacf05a9c9c06a433ac07e830c3e3d1bb0","observation_id":"dd6b1f81-874c-4d0e-a23a-3adcf053a2d7","resolution":{"observed_at":"2026-08-07T10:36:54.491318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04051","last_updated":"2021-06-08T02:07:21Z","snapshot_observed_at":"2026-07-06T11:16:56.255738Z","submitted_at":"2021-06-08T02:07:21Z","title":"Graph-MLP: Node Classification without Message Passing in Graph","version":1},"cited_work":{"arxiv_id":"2106.04051","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04051","snapshot_observed_at":"2026-08-06T14:36:54.953714Z","title":"Graph-MLP: Node Classification without Message Passing in Graph","venue":"cs.LG","work_id":"051775bb-256a-4a14-a3aa-5bd3ee7d4c19","year":2021},"citing_paper":{"arxiv_id":"2507.18489","last_updated":"2025-07-24T15:02:22Z","snapshot_observed_at":"2026-08-06T14:36:52.554843Z","submitted_at":"2025-07-24T15:02:22Z","title":"The Best is Yet to Come: Graph Convolution in the Testing Phase for Multimodal Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T14:36:53.911362Z"},"links":{"cited_paper":"/paper/2106.04051","citing_paper":"/paper/2507.18489"},"observation_digest":"sha256:6daa261bf09a3a2fd14d750976cbbe0c6409408b20c61b62473dc0b4b6adb453","observation_id":"da396be9-26f5-49bd-be6a-40ad5aadd4c0","resolution":{"observed_at":"2026-08-06T14:36:54.971284Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.04051/citation-record","integrity":"/paper/2106.04051/integrity","json":"/paper/2106.04051/citation-record.json","paper":"/paper/2106.04051"},"outbound":[],"paper":{"arxiv_id":"2106.04051","last_updated":"2021-06-08T02:07:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:16:56.255738Z","submitted_at":"2021-06-08T02:07:21Z","title":"Graph-MLP: Node Classification without Message Passing in Graph"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.04051."}