{"as_of":"2026-08-10T19:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:545b1e06380e02046e5b5526b39771f3e2adccd93b6dd061cccaca657e74fe4a","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:16:19.047471Z","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-05-25T07:50:28.971124Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-08-10T16:16:19.047471Z","title":"Nagphormer: A tokenized graph transformer for node classification in large graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13456","last_updated":"2025-03-11T08:59:12Z","snapshot_observed_at":"2026-08-10T15:53:53.974044Z","submitted_at":"2025-01-23T08:14:55Z","title":"KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T16:16:19.047471Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2501.13456"},"observation_digest":"sha256:dba0bc0991e7f01f816c219b16b3c5d999ded58a2b53a1fa5d5f16f7c04797d3","observation_id":"d2c47016-4e14-4e1f-b721-53139e174e8f","resolution":{"observed_at":"2026-08-10T16:16:19.047471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-08-09T18:13:53.885327Z","title":"Nagphormer: A tokenized graph transformer for node classification in large graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01681","last_updated":"2025-05-20T08:17:48Z","snapshot_observed_at":"2026-08-09T18:30:08.670680Z","submitted_at":"2025-02-02T05:25:34Z","title":"DeepGate4: Efficient and Effective Representation Learning for Circuit Design at Scale","version":3},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-09T18:13:53.885327Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2502.01681"},"observation_digest":"sha256:426143243ac7c3d69c700a84466212a2fc1316a65b4546b828332473b81840bb","observation_id":"5c397035-610d-4446-ae3a-4ab4ffc0c240","resolution":{"observed_at":"2026-08-09T18:13:53.885327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":"2206.04910","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","venue":null,"work_id":"a77bf593-743e-4f88-b969-e0bdcf27ac23","year":2022},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-04T10:00:45.966173Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T07:49:39.057087Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:bbfd38fd37428cc74cd81df009d11f87ecbbe82f081128e09557277aea927965","observation_id":"8c5af6b5-c470-4691-95ca-5d1e7c5622c8","resolution":{"observed_at":"2026-05-25T07:50:28.974966Z","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":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-08-04T10:00:47.299288Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-04T10:00:45.966173Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T10:00:47.299288Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:cd1148867524b4459031be780306748cd7e42115164f9f9c2238d09da8d0e726","observation_id":"dc17c607-b6b4-4fb9-930d-100d5a5282b0","resolution":{"observed_at":"2026-08-04T10:00:47.299288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":"2206.04910","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","venue":null,"work_id":"a77bf593-743e-4f88-b969-e0bdcf27ac23","year":2022},"citing_paper":{"arxiv_id":"2605.20248","last_updated":"2026-05-18T06:47:41Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-18T06:47:41Z","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:32.410473Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2605.20248"},"observation_digest":"sha256:fe75d23404534c2176efad416a88571b1b43e28a5fb55187b080bd2123879997","observation_id":"17211a6c-6036-4880-bcbd-418154c6ed2d","resolution":{"observed_at":"2026-05-21T08:34:05.471937Z","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":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-08-06T13:57:14.411745Z","title":"Nagphormer: A tokenized graph transformer for node classification in large graphs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.04905","last_updated":"2026-08-05T14:33:59Z","snapshot_observed_at":"2026-08-10T06:30:22.006797Z","submitted_at":"2026-08-05T14:33:59Z","title":"PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T13:57:14.411745Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2608.04905"},"observation_digest":"sha256:a470851f8d566d26d61b20ac84bef3f0f56c2776dee235de4ab52827bcf46306","observation_id":"94d6538d-7655-4fab-be7f-69c88e9f5dd5","resolution":{"observed_at":"2026-08-06T13:57:14.411745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.04910/citation-record","integrity":"/paper/2206.04910/integrity","json":"/paper/2206.04910/citation-record.json","paper":"/paper/2206.04910"},"outbound":[],"paper":{"arxiv_id":"2206.04910","last_updated":"2023-02-27T11:39:09Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:19:23.070974Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2206.04910."}