{"as_of":"2026-08-11T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e591ed7e04827ec67cedbc26e1a504ac0f3d5350aaf694cdd932b2ba42f02f20","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:30:57.281110Z","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-02T01:16:24.645164Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.10428","last_updated":"2022-03-20T02:08:03Z","snapshot_observed_at":"2026-08-10T22:21:03.575534Z","submitted_at":"2022-03-20T02:08:03Z","title":"PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication","version":1},"cited_work":{"arxiv_id":"2203.10428","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.10428","snapshot_observed_at":"2026-07-02T01:16:24.645164Z","title":"Pipegcn: Efficient full-graph training of graph convolutional networks with pipelined feature communication","venue":null,"work_id":"e92ce6b4-2f74-45ed-a508-f595cc0acb8b","year":2022},"citing_paper":{"arxiv_id":"2604.02651","last_updated":"2026-04-03T02:30:27Z","snapshot_observed_at":"2026-07-06T22:51:57.889822Z","submitted_at":"2026-04-03T02:30:27Z","title":"Communication-free Sampling and 4D Hybrid Parallelism for Scalable Mini-batch GNN Training","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-13T20:38:31.444109Z"},"links":{"cited_paper":"/paper/2203.10428","citing_paper":"/paper/2604.02651"},"observation_digest":"sha256:ff0d11b372b39b3c1d945cdab68fe487d3ef21c2339ce88400851856590d04f4","observation_id":"352eb37d-685b-4c8e-8027-c4ea0812c533","resolution":{"observed_at":"2026-05-13T20:43:15.375205Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.10428","last_updated":"2022-03-20T02:08:03Z","snapshot_observed_at":"2026-08-10T22:21:03.575534Z","submitted_at":"2022-03-20T02:08:03Z","title":"PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication","version":1},"cited_work":{"arxiv_id":"2203.10428","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.10428","snapshot_observed_at":"2026-07-02T01:16:24.645164Z","title":"Pipegcn: Efficient full-graph training of graph convolutional networks with pipelined feature communication","venue":null,"work_id":"e92ce6b4-2f74-45ed-a508-f595cc0acb8b","year":2022},"citing_paper":{"arxiv_id":"2606.02916","last_updated":"2026-06-01T21:41:57Z","snapshot_observed_at":"2026-07-29T18:10:40.575317Z","submitted_at":"2026-06-01T21:41:57Z","title":"GreenGNN: Energy-Aware Windowed Communication Optimization for Distributed GNN Training","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T12:20:12.433442Z"},"links":{"cited_paper":"/paper/2203.10428","citing_paper":"/paper/2606.02916"},"observation_digest":"sha256:438400c083ead289171569bfdac2a8465ff46b882436d407d18070accffada03","observation_id":"337949f6-b585-4bbc-95d5-714126e68afb","resolution":{"observed_at":"2026-07-02T01:16:24.647244Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.10428","last_updated":"2022-03-20T02:08:03Z","snapshot_observed_at":"2026-08-10T22:21:03.575534Z","submitted_at":"2022-03-20T02:08:03Z","title":"PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.10428","snapshot_observed_at":"2026-08-10T04:30:57.281110Z","title":"Pipegcn: Efficient full-graph training of graph convolutional networks with pipelined feature communication,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.06441","last_updated":"2026-08-06T11:03:36Z","snapshot_observed_at":"2026-08-11T03:10:31.425379Z","submitted_at":"2026-08-06T11:03:36Z","title":"SNI-GNN: SmartNIC-Assisted Full-Graph GNN Training with In-Network Embedding Prediction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T04:30:57.281110Z"},"links":{"cited_paper":"/paper/2203.10428","citing_paper":"/paper/2608.06441"},"observation_digest":"sha256:a9265d39b56703e785c74716f8ba1addf9d3e9f9ceaa1d3b95c56f82fcfde74b","observation_id":"ef7c1734-cb44-4028-a7bf-ca7f8b906b55","resolution":{"observed_at":"2026-08-10T04:30:57.281110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.10428/citation-record","integrity":"/paper/2203.10428/integrity","json":"/paper/2203.10428/citation-record.json","paper":"/paper/2203.10428"},"outbound":[],"paper":{"arxiv_id":"2203.10428","last_updated":"2022-03-20T02:08:03Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T22:21:03.575534Z","submitted_at":"2022-03-20T02:08:03Z","title":"PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2203.10428."}