{"as_of":"2026-08-08T18:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d63e7772f70f7a192c9888443f4d12f4ad57731401d170388b4b068132c3da86","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-08T06:32:00.761636+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-08T16:39:14.214668Z","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-23T19:53:23.447374Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.06444","last_updated":"2025-01-11T05:54:10Z","snapshot_observed_at":"2026-07-06T20:19:36.202156Z","submitted_at":"2025-01-11T05:54:10Z","title":"On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective","version":1},"cited_work":{"arxiv_id":"2501.06444","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.06444","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the computational capability of graph neural networks: A circuit complexity bound perspective.CoRR, abs/2501.06444","venue":null,"work_id":"5c1e3ea0-a605-4d33-8658-e1c00c781215","year":2025},"citing_paper":{"arxiv_id":"2410.01308","last_updated":"2026-05-08T07:54:40Z","snapshot_observed_at":"2026-07-06T19:25:48.444990Z","submitted_at":"2024-10-02T08:01:50Z","title":"How Hard Is It for Message-Passing GNNs to Simulate One Weisfeiler-Lehman Color-Refinement Step?","version":6},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-23T19:48:39.681300Z"},"links":{"cited_paper":"/paper/2501.06444","citing_paper":"/paper/2410.01308"},"observation_digest":"sha256:1093147435c643bebe53e37cef91ae0f50545da8b36d0294ff5c096818e28c38","observation_id":"5f066297-9c76-4c6e-bd0a-aa47e1b5ac99","resolution":{"observed_at":"2026-05-23T19:53:23.450589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06444","last_updated":"2025-01-11T05:54:10Z","snapshot_observed_at":"2026-07-06T20:19:36.202156Z","submitted_at":"2025-01-11T05:54:10Z","title":"On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06444","snapshot_observed_at":"2026-08-08T16:39:14.214668Z","title":"On the computational capability of graph neural networks: A circuit complexity bound perspective","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-08T16:28:42.719100Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.214668Z"},"links":{"cited_paper":"/paper/2501.06444","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:2d5f9401b332547dbba7bca08f98238fa1c664800803202f0418b27ea91cb11a","observation_id":"1ebc143a-4690-4b2d-8d98-764c8624b273","resolution":{"observed_at":"2026-08-08T16:39:14.214668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06444","last_updated":"2025-01-11T05:54:10Z","snapshot_observed_at":"2026-07-06T20:19:36.202156Z","submitted_at":"2025-01-11T05:54:10Z","title":"On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06444","snapshot_observed_at":"2026-08-07T14:21:01.419305Z","title":"On the computational capability of graph neural networks: A circuit complexity bound perspective.arXiv preprint arXiv:2501.06444,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19531","last_updated":"2025-05-26T05:33:26Z","snapshot_observed_at":"2026-08-08T07:05:10.715675Z","submitted_at":"2025-05-26T05:33:26Z","title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:21:01.419305Z"},"links":{"cited_paper":"/paper/2501.06444","citing_paper":"/paper/2505.19531"},"observation_digest":"sha256:72fa5d246d02fca0abf9899fffb398bc197b28cba2606e0c07cd6a822634e4a1","observation_id":"15190e46-7116-43bb-bada-dbb6eb711a62","resolution":{"observed_at":"2026-08-07T14:21:01.419305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.06444/citation-record","integrity":"/paper/2501.06444/integrity","json":"/paper/2501.06444/citation-record.json","paper":"/paper/2501.06444"},"outbound":[],"paper":{"arxiv_id":"2501.06444","last_updated":"2025-01-11T05:54:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:19:36.202156Z","submitted_at":"2025-01-11T05:54:10Z","title":"On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.06444."}