{"as_of":"2026-08-04T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec1100b3a04bef0d65aff2cd7231d2fe8e11d2564dc44a78173ec8699323aea9","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-04T06:34:03.388597+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-04T09:18:29.549961Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T16:27:09.769959Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.08274","last_updated":"2023-12-06T06:38:01Z","snapshot_observed_at":"2026-08-03T18:35:44.074085Z","submitted_at":"2023-06-14T06:24:58Z","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.08274","snapshot_observed_at":"2026-08-04T09:18:29.549961Z","title":"Why using either ag- gregated features or adjacency lists in directed or undirected graph? empirical study and simple classification method,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.16311","last_updated":"2026-06-18T15:18:42Z","snapshot_observed_at":"2026-08-04T09:18:26.918730Z","submitted_at":"2025-10-18T02:46:53Z","title":"Toward General Digraph Contrastive Learning: A Dual Spatial Perspective","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T09:18:29.549961Z"},"links":{"cited_paper":"/paper/2306.08274","citing_paper":"/paper/2510.16311"},"observation_digest":"sha256:1c22f6e2aa45ee438cd19316f8edc46d9b3052a69e54ff9bc19f6bd051e6f36f","observation_id":"7d1e604d-6975-4383-9776-ccaa2557ba05","resolution":{"observed_at":"2026-08-04T09:18:29.549961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08274","last_updated":"2023-12-06T06:38:01Z","snapshot_observed_at":"2026-08-03T18:35:44.074085Z","submitted_at":"2023-06-14T06:24:58Z","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","version":2},"cited_work":{"arxiv_id":"2306.08274","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.08274","snapshot_observed_at":"2026-07-02T16:27:09.769959Z","title":"arXiv preprint arXiv:2306.08274 (2023)","venue":null,"work_id":"86d46053-c5eb-4a21-aea4-f356184cde8b","year":2023},"citing_paper":{"arxiv_id":"2606.07475","last_updated":"2026-06-05T17:28:19Z","snapshot_observed_at":"2026-07-06T23:47:05.104295Z","submitted_at":"2026-06-05T17:28:19Z","title":"Graph Neural Network leveraging Higher-order Class Label Connectivity for Heterophilous Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T22:35:28.297617Z"},"links":{"cited_paper":"/paper/2306.08274","citing_paper":"/paper/2606.07475"},"observation_digest":"sha256:edb8bf097246e0af5b1e11b75e8455fc3751ef1185847df3b3ca177030088a97","observation_id":"428db860-6906-4944-b436-e27723635b55","resolution":{"observed_at":"2026-07-02T16:27:09.771581Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.08274/citation-record","integrity":"/paper/2306.08274/integrity","json":"/paper/2306.08274/citation-record.json","paper":"/paper/2306.08274"},"outbound":[],"paper":{"arxiv_id":"2306.08274","last_updated":"2023-12-06T06:38:01Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T18:35:44.074085Z","submitted_at":"2023-06-14T06:24:58Z","title":"A Simple and Scalable Graph Neural Network for Large Directed 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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.08274."}