{"as_of":"2026-08-11T19:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78bd7e9cea45171577b2670c7cc78b014cc8b225945a6181838b68954758b49a","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":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":31,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:52:03.771559Z","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-04T08:49:42.010484Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2409.08036","last_updated":"2026-04-16T21:00:42Z","snapshot_observed_at":"2026-08-02T15:48:28.524877Z","submitted_at":"2024-09-12T13:38:08Z","title":"Heterogeneous Sheaf Neural Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T20:57:34.082406Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2409.08036"},"observation_digest":"sha256:bed7554ca4b268cdeae162dda90373d4b4f34f1ac18e6ba93da5e3e7b0c2129d","observation_id":"abe5615e-6397-4a23-bc90-d6eccbec1f01","resolution":{"observed_at":"2026-05-23T20:58:26.730276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-10T22:52:03.771559Z","title":"A note on over-smoothing for graph neural networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.00762","last_updated":"2025-01-04T03:14:11Z","snapshot_observed_at":"2026-08-11T01:57:03.338571Z","submitted_at":"2025-01-01T07:35:36Z","title":"Residual connections provably mitigate oversmoothing in graph neural networks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T22:52:03.771559Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2501.00762"},"observation_digest":"sha256:d64e79c0edf343c84d4eb559956d9e104bde59ada275d32cf96580743d4a5a12","observation_id":"781dfe6c-f189-4d5d-8e2f-2b4cf2617937","resolution":{"observed_at":"2026-08-10T22:52:03.771559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-10T22:49:32.224509Z","title":"Cai and Y","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.00779","last_updated":"2025-01-01T09:13:09Z","snapshot_observed_at":"2026-08-10T22:40:34.550851Z","submitted_at":"2025-01-01T09:13:09Z","title":"REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:32.224509Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2501.00779"},"observation_digest":"sha256:1e8f23ecc8b61249047817134eee4a502d82f9c9e783d718e329bb9c16c0b423","observation_id":"028ba194-710a-4b4a-8a38-4e1d08b3414b","resolution":{"observed_at":"2026-08-10T22:49:32.224509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-10T16:57:29.049782Z","title":"A note on over-smoothing for graph neural networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.12732","last_updated":"2025-01-22T09:09:17Z","snapshot_observed_at":"2026-08-10T23:35:59.528749Z","submitted_at":"2025-01-22T09:09:17Z","title":"GRAMA: Adaptive Graph Autoregressive Moving Average Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T16:57:29.049782Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2501.12732"},"observation_digest":"sha256:745b9a32234d0eaec23ab2cd40c476b27689ba9a107ec0eabb3d1e0158a3312f","observation_id":"2f13268f-4244-4bc2-8e2a-7d903a83346c","resolution":{"observed_at":"2026-08-10T16:57:29.049782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-09T21:29:28.029182Z","title":"A note on over-smoothing for graph neural networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.19089","last_updated":"2025-05-16T21:51:27Z","snapshot_observed_at":"2026-08-10T06:37:19.673594Z","submitted_at":"2025-01-31T12:34:09Z","title":"Resolving Oversmoothing with Opinion Dissensus","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-09T21:29:28.029182Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2501.19089"},"observation_digest":"sha256:f65c857c46d1f4b199668baa2a39bb3cea5f9ce94393a3dfdac89228f368ad65","observation_id":"7c1dd11d-f251-450a-be81-7e53bbfc13bf","resolution":{"observed_at":"2026-08-09T21:29:28.029182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-09T14:12:20.851599Z","title":"& Wang, Y","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01885","last_updated":"2025-02-03T23:26:07Z","snapshot_observed_at":"2026-08-10T09:59:35.201839Z","submitted_at":"2025-02-03T23:26:07Z","title":"A Privacy-Preserving Domain Adversarial Federated learning for multi-site brain functional connectivity analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:20.851599Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2502.01885"},"observation_digest":"sha256:3dbdee6fbd109c613563307969649370a7ee43d5a72a6b90bfab37651394eb3e","observation_id":"7330a03f-5771-40fe-913c-5d0fddecd321","resolution":{"observed_at":"2026-08-09T14:12:20.851599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-08T14:33:15.919869Z","title":"and Wang, Y","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.919869Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:ec09182e6179847ab25b12fe673737fedd96fc7c53efa5e1e936498b370fab60","observation_id":"09b6e296-c660-469f-afaf-c68360f07c8d","resolution":{"observed_at":"2026-08-08T14:33:15.919869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-07T13:11:39.160435Z","title":"org/abs/2006.13318","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.22504","last_updated":"2025-05-28T15:52:22Z","snapshot_observed_at":"2026-08-10T18:40:45.113017Z","submitted_at":"2025-05-28T15:52:22Z","title":"Geometric GNNs for Charged Particle Tracking at GlueX","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:11:39.160435Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2505.22504"},"observation_digest":"sha256:adc5de137df2dfbe38d1ade1bb97bb40504b555f72a2cb976ef1cbe21867efa3","observation_id":"a414c8a2-beef-4374-a888-43a4cf08a384","resolution":{"observed_at":"2026-08-07T13:11:39.160435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-07T01:07:34.736049Z","title":"A note on over-smoothing for graph neural networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.11869","last_updated":"2025-08-22T19:08:50Z","snapshot_observed_at":"2026-08-10T12:52:01.547604Z","submitted_at":"2025-06-13T15:19:28Z","title":"How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T01:07:34.736049Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2506.11869"},"observation_digest":"sha256:95a76078cccfb17de43608ef8f4a6bd384fecd0feb91afe43549ef04150fa06f","observation_id":"622366f4-bb0c-4cc6-baee-655ff236e03d","resolution":{"observed_at":"2026-08-07T01:07:34.736049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-06T21:35:07.857578Z","title":"A note on over-smoothing for graph neural networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.857578Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:b591a6f692a3b66d1aa42caab4483157c89feb57d08fbc517c1f926958e05bf6","observation_id":"322575a8-17f1-45a1-834a-d280c63a48e1","resolution":{"observed_at":"2026-08-06T21:35:07.857578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-05T23:39:46.043567Z","title":"A note on over-smoothing for graph neural networks.arXiv preprint arXiv:2006.13318, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.05070","last_updated":"2025-08-07T06:44:01Z","snapshot_observed_at":"2026-08-09T01:06:54.658175Z","submitted_at":"2025-08-07T06:44:01Z","title":"TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:46.043567Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2508.05070"},"observation_digest":"sha256:c5c3a13a499dfff79ebdcd2c08a14103896ee6858af72112e095910081f3e114","observation_id":"40db5b14-6da4-4aee-b708-3ace3a9ae556","resolution":{"observed_at":"2026-08-05T23:39:46.043567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-05T10:25:45.787593Z","title":"Cai and Y","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.04178","last_updated":"2025-09-04T12:53:37Z","snapshot_observed_at":"2026-08-10T09:59:34.023876Z","submitted_at":"2025-09-04T12:53:37Z","title":"Comment on \"A Note on Over-Smoothing for Graph Neural Networks\"","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T10:25:45.787593Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2509.04178"},"observation_digest":"sha256:184becf61fd6988a010702db16d0eae199df073aa8c6d2eaa499c9451204a9d2","observation_id":"bdabdcd1-bff2-4c12-bafc-04c07181b95e","resolution":{"observed_at":"2026-08-05T10:25:45.787593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2511.06443","last_updated":"2025-11-09T16:25:37Z","snapshot_observed_at":"2026-08-11T11:17:21.614869Z","submitted_at":"2025-11-09T16:25:37Z","title":"How Wide and How Deep? Mitigating Over-Squashing of GNNs via Channel Capacity Constrained Estimation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-17T23:23:07.672908Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2511.06443"},"observation_digest":"sha256:2d7322a51f2e0264fc6de7f3de1cb3384fa416eed93cec9773a2be54c23f106d","observation_id":"cf700b82-eb71-4765-824d-87dffa65fbd7","resolution":{"observed_at":"2026-05-17T23:25:28.625201Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2601.01123","last_updated":"2026-05-17T16:57:28Z","snapshot_observed_at":"2026-08-06T06:45:06.116751Z","submitted_at":"2026-01-03T08:51:38Z","title":"Learning from Historical Activations in Graph Neural Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T17:14:52.859473Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2601.01123"},"observation_digest":"sha256:cc92a049290a5a5c944fd5a443393acbb961e7cf5aa40e7ec2f95d78051d5ddb","observation_id":"26bad750-b3ec-4d1f-afbc-3a9e7700dd7c","resolution":{"observed_at":"2026-05-21T17:15:25.467255Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2602.05352","last_updated":"2026-05-12T03:14:17Z","snapshot_observed_at":"2026-08-11T13:13:34.365396Z","submitted_at":"2026-02-05T06:23:25Z","title":"Smoothness Errors in Dynamics Models and How to Avoid Them","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T07:23:07.669607Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2602.05352"},"observation_digest":"sha256:778a0feb0d6f0043c1543fe257b102497365ef583a862cd947f570ed164d20aa","observation_id":"c6b523cf-922b-4a1c-ba8b-6bc3d9b57137","resolution":{"observed_at":"2026-05-16T07:27:32.243070Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-02T22:56:38.772674Z","title":"and Wang, Y","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.15634","last_updated":"2026-05-29T12:35:53Z","snapshot_observed_at":"2026-08-10T23:40:40.636542Z","submitted_at":"2026-02-17T15:03:28Z","title":"Beyond ReLU: Bifurcation, Oversmoothing, and Topological Priors","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T22:56:38.772674Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2602.15634"},"observation_digest":"sha256:4e788a59ea9fb82be24dc97f4402f8e0acd768c0d16d4c8b009d9d9fb0d086ea","observation_id":"dd899da5-6fbc-47cc-b94d-c206a2645be5","resolution":{"observed_at":"2026-08-02T22:56:38.772674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:ccc980898cc160844ed3a84024c6e879baaee08748724ac9a808edf0023d7328","observation_id":"42219ca9-eb8d-4fdd-be3b-a3fd83f865d7","resolution":{"observed_at":"2026-05-11T09:41:03.018771Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2604.19028","last_updated":"2026-04-21T03:23:34Z","snapshot_observed_at":"2026-07-06T23:05:44.499005Z","submitted_at":"2026-04-21T03:23:34Z","title":"Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors","version":1},"reference_index":263,"source":"arxiv_source","source_observed_at":"2026-05-10T03:50:44.626261Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2604.19028"},"observation_digest":"sha256:22bcf1cd508c97d7a2d358793ee7539dc6831c720914ce72a55cfd5b85a9c7b4","observation_id":"7d8c3f36-9bb2-404e-9eed-3bd7dda70c93","resolution":{"observed_at":"2026-05-11T12:21:04.805127Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2604.23324","last_updated":"2026-04-25T14:25:02Z","snapshot_observed_at":"2026-08-11T12:30:22.520647Z","submitted_at":"2026-04-25T14:25:02Z","title":"Layer Embedding Deep Fusion Graph Neural Network","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T08:22:06.951781Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2604.23324"},"observation_digest":"sha256:14d707cc9108fade62e4f79e970835367d63a4601ea7398b11644dcd8ff7070d","observation_id":"7a6add99-3e9c-41b5-af6f-c1cf77ab9889","resolution":{"observed_at":"2026-05-11T20:41:10.214896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.03861","last_updated":"2026-05-05T15:23:37Z","snapshot_observed_at":"2026-08-11T10:28:23.902798Z","submitted_at":"2026-05-05T15:23:37Z","title":"Aspect-Aware Content-Based Recommendations for Mathematical Research Papers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T14:19:18.282566Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.03861"},"observation_digest":"sha256:69a52031413152e034946bbda455b257d5cb8f5dc1a21e66ef2060c53aa26878","observation_id":"01bbc750-108e-45f2-ae09-0f31b308cec2","resolution":{"observed_at":"2026-05-12T00:46:12.998127Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.08391","last_updated":"2026-05-19T01:58:16Z","snapshot_observed_at":"2026-07-06T23:20:38.385189Z","submitted_at":"2026-05-08T19:00:34Z","title":"SACHI: Structured Agent Coordination via Holistic Information Integration in Multi-Agent Reinforcement Learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-12T01:31:19.576223Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.08391"},"observation_digest":"sha256:653ab067b5d8cc712b7fed490e70e1bef6a1a5119b0ee071472ddd3ed1853f1f","observation_id":"09412db8-f76b-4fe4-b271-d250206a6b8e","resolution":{"observed_at":"2026-05-12T07:56:27.392442Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.08391","last_updated":"2026-05-19T01:58:16Z","snapshot_observed_at":"2026-07-06T23:20:38.385189Z","submitted_at":"2026-05-08T19:00:34Z","title":"SACHI: Structured Agent Coordination via Holistic Information Integration in Multi-Agent Reinforcement Learning","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-20T22:34:46.440511Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.08391"},"observation_digest":"sha256:ba9ced5abc1fcdceec7e42743b1970b0b3e247db812d60493722f8e2a6588f97","observation_id":"8b6f1b69-1278-4e97-9229-098cf290e339","resolution":{"observed_at":"2026-05-20T22:39:10.766166Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.13834","last_updated":"2026-05-29T19:42:16Z","snapshot_observed_at":"2026-08-11T18:04:31.723192Z","submitted_at":"2026-05-13T17:56:23Z","title":"Topology-Preserving Neural Operator Learning via Hodge Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-14T19:05:31.289091Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.13834"},"observation_digest":"sha256:6da6b4d4db3130cf742bc2c99b1de7526d05a6296694f95c4bf622605d2eacc5","observation_id":"8fb699ff-ca29-4301-bd1d-7965373fe204","resolution":{"observed_at":"2026-05-14T19:07:51.550122Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.13834","last_updated":"2026-05-29T19:42:16Z","snapshot_observed_at":"2026-08-11T18:04:31.723192Z","submitted_at":"2026-05-13T17:56:23Z","title":"Topology-Preserving Neural Operator Learning via Hodge Decomposition","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-30T21:43:50.425136Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.13834"},"observation_digest":"sha256:b32603da68cd9e5b8c619982c065623dcacd0f283bed5e6864c1979cbc7983cd","observation_id":"4326657b-d397-4c87-85c7-a7569310223e","resolution":{"observed_at":"2026-06-30T21:45:05.601379Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.15524","last_updated":"2026-05-15T01:44:31Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T01:44:31Z","title":"Neural Point-Forms","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-19T15:00:51.826915Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.15524"},"observation_digest":"sha256:5ccb4a58b3fd3e7bfa8a207ae1f391189efaeb904f2bff1b13c0fc975d781208","observation_id":"42019845-f612-4759-8bf2-5269099c75f1","resolution":{"observed_at":"2026-05-19T15:02:36.572074Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2605.18387","last_updated":"2026-05-18T13:31:21Z","snapshot_observed_at":"2026-07-06T23:29:14.916114Z","submitted_at":"2026-05-18T13:31:21Z","title":"Graph Hierarchical Recurrence for Long-Range Generalization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T13:06:49.896124Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2605.18387"},"observation_digest":"sha256:4519e32d6f77c0a90ac5e9b38dda6c5990e0f69a65e146679948d668df0ad3eb","observation_id":"c48fbcdb-bac9-462b-8abd-88a2b610151a","resolution":{"observed_at":"2026-05-20T13:08:17.756805Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2606.19185","last_updated":"2026-06-17T15:24:37Z","snapshot_observed_at":"2026-08-08T05:43:23.884916Z","submitted_at":"2026-06-17T15:24:37Z","title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T21:29:20.129182Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2606.19185"},"observation_digest":"sha256:b82c127f5a480d0d85783ef87f5eb46f22ac60caaa21dbf275a31c559da0b5e8","observation_id":"1102a938-3f53-40aa-aa7d-d66f0f3feed9","resolution":{"observed_at":"2026-07-04T00:09:14.385842Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2606.22429","last_updated":"2026-06-21T10:40:33Z","snapshot_observed_at":"2026-08-07T18:47:13.612767Z","submitted_at":"2026-06-21T10:40:33Z","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:d86b4438c565eefa7f9cf47b0967cd387c1d61495dc8bc49f2c58a069a4a8dee","observation_id":"8b90488a-b86a-48ca-98e5-3e1de74bd5c0","resolution":{"observed_at":"2026-07-04T08:49:42.012875Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-01T22:29:30.198124Z","title":"A note on over-smoothing for graph neural networks,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.15773","last_updated":"2026-07-17T09:04:22Z","snapshot_observed_at":"2026-08-09T04:16:03.339300Z","submitted_at":"2026-07-17T09:04:22Z","title":"From Diffusion to Reaction-Diffusion: A Dynamical-Systems View of Oversmoothing in Hypergraph Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.198124Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2607.15773"},"observation_digest":"sha256:e7b698c4b8318fe48dedbabf6af43c81bb2609e2ecca531c31ca257542a2a90f","observation_id":"dcdee1e8-e9d9-4186-9584-1c53a58a0f98","resolution":{"observed_at":"2026-08-01T22:29:30.198124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-01T06:31:19.346482Z","title":"A note on over-smoothing for graph neural networks, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.21885","last_updated":"2026-07-24T01:29:28Z","snapshot_observed_at":"2026-08-08T16:18:42.539865Z","submitted_at":"2026-07-24T01:29:28Z","title":"Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T06:31:19.346482Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2607.21885"},"observation_digest":"sha256:11635f84955377ba727789947038ba65e1cabd098539b924e3fcea939524a14b","observation_id":"67464bd9-51e9-4640-9d03-397e515783e7","resolution":{"observed_at":"2026-08-01T06:31:19.346482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-01T05:00:11.704197Z","title":"A note on over-smoothing for graph neural networks.arXiv preprint arXiv:2006.13318, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22381","last_updated":"2026-07-24T15:07:37Z","snapshot_observed_at":"2026-08-09T01:59:27.043698Z","submitted_at":"2026-07-24T15:07:37Z","title":"Local-Global Geometric Insights for Graph Neural Networks via Entropic Curvature","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:00:11.704197Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2607.22381"},"observation_digest":"sha256:bd39d998327a87074d1040170a1d103ca1253aab25ce34a553149462d72579bc","observation_id":"c40c02ee-b0aa-4b7a-855a-543092a66d82","resolution":{"observed_at":"2026-08-01T05:00:11.704197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2006.13318/citation-record","integrity":"/paper/2006.13318/integrity","json":"/paper/2006.13318/citation-record.json","paper":"/paper/2006.13318"},"outbound":[],"paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 31 inbound Pith citation observations for arXiv:2006.13318."}