{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PB6NUAPNFBY2AD2SZJBFPQ5EVM","short_pith_number":"pith:PB6NUAPN","schema_version":"1.0","canonical_sha256":"787cda01ed2871a00f52ca4257c3a4ab18c6bdeea7e3e0e6524a8a79d553bb61","source":{"kind":"arxiv","id":"2003.13663","version":5},"attestation_state":"computed","paper":{"title":"Revisiting Over-smoothing in Deep GCNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chaoqi Yang, Ruijie Wang, Shengzhong Liu, Shuochao Yao, Tarek Abdelzaher","submitted_at":"2020-03-30T17:48:04Z","abstract_excerpt":"Oversmoothing has been assumed to be the major cause of performance drop in deep graph convolutional networks (GCNs). In this paper, we propose a new view that deep GCNs can actually learn to anti-oversmooth during training. This work interprets a standard GCN architecture as layerwise integration of a Multi-layer Perceptron (MLP) and graph regularization. We analyze and conclude that before training, the final representation of a deep GCN does over-smooth, however, it learns anti-oversmoothing during training. Based on the conclusion, the paper further designs a cheap but effective trick to i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.13663","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-30T17:48:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c2cd9a051c1d1012253e514195a14c655aad2faefa52746924f5644abeb2e803","abstract_canon_sha256":"6c72269453cef82107f0b3480aa76e31ebb5db4c8e3ad06bb32a90873ef83a32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:13.224536Z","signature_b64":"HIknaEPIkX40Gn6Yu7xzUByRZejU5gbTjdHVGOMKXlRrFPecbcFGjnQ9Y9yaTw82mdhG1IWSyVqr5z/bXrCDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787cda01ed2871a00f52ca4257c3a4ab18c6bdeea7e3e0e6524a8a79d553bb61","last_reissued_at":"2026-07-05T01:11:13.224036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:13.224036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Over-smoothing in Deep GCNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chaoqi Yang, Ruijie Wang, Shengzhong Liu, Shuochao Yao, Tarek Abdelzaher","submitted_at":"2020-03-30T17:48:04Z","abstract_excerpt":"Oversmoothing has been assumed to be the major cause of performance drop in deep graph convolutional networks (GCNs). In this paper, we propose a new view that deep GCNs can actually learn to anti-oversmooth during training. This work interprets a standard GCN architecture as layerwise integration of a Multi-layer Perceptron (MLP) and graph regularization. We analyze and conclude that before training, the final representation of a deep GCN does over-smooth, however, it learns anti-oversmoothing during training. Based on the conclusion, the paper further designs a cheap but effective trick to i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13663","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.13663/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.13663","created_at":"2026-07-05T01:11:13.224094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.13663v5","created_at":"2026-07-05T01:11:13.224094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13663","created_at":"2026-07-05T01:11:13.224094+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB6NUAPNFBY2","created_at":"2026-07-05T01:11:13.224094+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB6NUAPNFBY2AD2S","created_at":"2026-07-05T01:11:13.224094+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB6NUAPN","created_at":"2026-07-05T01:11:13.224094+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.21196","citing_title":"Differential-Integral Neural Operator for Long-Term Turbulence Forecasting","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2511.06443","citing_title":"How Wide and How Deep? Mitigating Over-Squashing of GNNs via Channel Capacity Constrained Estimation","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07828","citing_title":"NSPOD: Accelerating Krylov solvers via DeepONet-learned POD subspaces","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07828","citing_title":"NSPOD: Accelerating Krylov solvers via DeepONet-learned POD subspaces","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20082","citing_title":"Concept Graph Convolutions: Message Passing in the Concept Space","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM","json":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM.json","graph_json":"https://pith.science/api/pith-number/PB6NUAPNFBY2AD2SZJBFPQ5EVM/graph.json","events_json":"https://pith.science/api/pith-number/PB6NUAPNFBY2AD2SZJBFPQ5EVM/events.json","paper":"https://pith.science/paper/PB6NUAPN"},"agent_actions":{"view_html":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM","download_json":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM.json","view_paper":"https://pith.science/paper/PB6NUAPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.13663&json=true","fetch_graph":"https://pith.science/api/pith-number/PB6NUAPNFBY2AD2SZJBFPQ5EVM/graph.json","fetch_events":"https://pith.science/api/pith-number/PB6NUAPNFBY2AD2SZJBFPQ5EVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM/action/storage_attestation","attest_author":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM/action/author_attestation","sign_citation":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM/action/citation_signature","submit_replication":"https://pith.science/pith/PB6NUAPNFBY2AD2SZJBFPQ5EVM/action/replication_record"}},"created_at":"2026-07-05T01:11:13.224094+00:00","updated_at":"2026-07-05T01:11:13.224094+00:00"}