{"as_of":"2026-08-09T12:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:86d6002c82afb54d737310bd85f9688d893d4ad5fcb50e839fb8fa7922c9fbf0","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:29:46.597246Z","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-22T07:04:41.445060Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.03199","last_updated":"2020-01-28T13:24:15Z","snapshot_observed_at":"2026-08-09T01:25:36.003122Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03199","snapshot_observed_at":"2026-08-08T20:29:46.597246Z","title":"What graph neural networks cannot learn: Depth vs width,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-09T01:26:15.755794Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":214,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:46.597246Z"},"links":{"cited_paper":"/paper/1907.03199","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:0e8f0afeeb192ea427b461ed2d4a56d5589c2ec69bbe2583906e0974c1aa8eec","observation_id":"05dfd8ad-a7a9-42a2-ab95-b5fb5a10fe0a","resolution":{"observed_at":"2026-08-08T20:29:46.597246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03199","last_updated":"2020-01-28T13:24:15Z","snapshot_observed_at":"2026-08-09T01:25:36.003122Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03199","snapshot_observed_at":"2026-08-07T14:18:38.716308Z","title":"What graph neural networks cannot learn: depth vs width.arXiv preprint arXiv:1907.03199, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-09T01:26:31.176700Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.716308Z"},"links":{"cited_paper":"/paper/1907.03199","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:f7b8a60062dc2c82b62021e77f274fde603af513f1de1fc018d7615082405cc1","observation_id":"3f7f895e-d2f0-4647-a086-30823c06b47f","resolution":{"observed_at":"2026-08-07T14:18:38.716308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03199","last_updated":"2020-01-28T13:24:15Z","snapshot_observed_at":"2026-08-09T01:25:36.003122Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03199","snapshot_observed_at":"2026-08-06T18:50:08.542762Z","title":"What graph neural networks cannot learn: depth vs width.arXiv preprint arXiv:1907.03199,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.07414","last_updated":"2025-07-10T04:13:53Z","snapshot_observed_at":"2026-08-09T01:27:09.521401Z","submitted_at":"2025-07-10T04:13:53Z","title":"GNN-CNN: An Efficient Hybrid Model of Convolutional and Graph Neural Networks for Text Representation","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T18:50:08.542762Z"},"links":{"cited_paper":"/paper/1907.03199","citing_paper":"/paper/2507.07414"},"observation_digest":"sha256:1f263e4f3d3d64b05872cb4dec5212268dc5e2217491f31dbc555ea60d0b4536","observation_id":"8ea97d15-db01-4e13-a495-b7f546918062","resolution":{"observed_at":"2026-08-06T18:50:08.542762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03199","last_updated":"2020-01-28T13:24:15Z","snapshot_observed_at":"2026-08-09T01:25:36.003122Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width","version":2},"cited_work":{"arxiv_id":"1907.03199","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.03199","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1907.03199 , year=","venue":null,"work_id":"2e6d7f07-6a8a-4bda-b7e2-2f25718d1d4f","year":1907},"citing_paper":{"arxiv_id":"2605.22471","last_updated":"2026-05-21T13:32:20Z","snapshot_observed_at":"2026-08-02T11:52:59.155097Z","submitted_at":"2026-05-21T13:32:20Z","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-22T07:03:52.438466Z"},"links":{"cited_paper":"/paper/1907.03199","citing_paper":"/paper/2605.22471"},"observation_digest":"sha256:bba7962f1f2ce1762b687bd69bf98fbf2a97729d5da751c2ed5e6044dcd44433","observation_id":"ef2177a8-13c9-4052-b707-79651f04125b","resolution":{"observed_at":"2026-05-22T07:04:41.447278Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03199","last_updated":"2020-01-28T13:24:15Z","snapshot_observed_at":"2026-08-09T01:25:36.003122Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03199","snapshot_observed_at":"2026-07-30T23:40:06.731824Z","title":"What graph neural networks cannot learn: depth vs width.arXiv preprint arXiv:1907.03199,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2607.26699","last_updated":"2026-07-29T09:46:07Z","snapshot_observed_at":"2026-08-07T17:20:22.308070Z","submitted_at":"2026-07-29T09:46:07Z","title":"Universality and Approximation Rates of Graph Neural Networks with Random Features","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T23:40:06.731824Z"},"links":{"cited_paper":"/paper/1907.03199","citing_paper":"/paper/2607.26699"},"observation_digest":"sha256:cb2a5365d962232040ce5688556e6612d9297a1d7ef466c19a1bb713e0d1bb3f","observation_id":"80d52464-2eca-4060-a2c3-b1cfda5af7b8","resolution":{"observed_at":"2026-07-30T23:40:06.731824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.03199/citation-record","integrity":"/paper/1907.03199/integrity","json":"/paper/1907.03199/citation-record.json","paper":"/paper/1907.03199"},"outbound":[],"paper":{"arxiv_id":"1907.03199","last_updated":"2020-01-28T13:24:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:25:36.003122Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width"},"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 5 inbound Pith citation observations for arXiv:1907.03199."}