{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZK2DH27NYA7PADE4QA6UXP22DJ","short_pith_number":"pith:ZK2DH27N","schema_version":"1.0","canonical_sha256":"cab433ebedc03ef00c9c803d4bbf5a1a53284c4266083ca64f563bc2532eccc3","source":{"kind":"arxiv","id":"2211.06605","version":2},"attestation_state":"computed","paper":{"title":"Comprehensive Analysis of Over-smoothing in Graph Neural Networks from Markov Chains Perspective","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenguang Wang, Congying Han, Tiande Guo, Weichen Zhao","submitted_at":"2022-11-12T08:03:57Z","abstract_excerpt":"The over-smoothing problem is an obstacle of developing deep graph neural network (GNN). Although many approaches to improve the over-smoothing problem have been proposed, there is still a lack of comprehensive understanding and conclusion of this problem. In this work, we analyze the over-smoothing problem from the Markov chain perspective. We focus on message passing of GNN and first establish a connection between GNNs and Markov chains on the graph. GNNs are divided into two classes of operator-consistent and operator-inconsistent based on whether the corresponding Markov chains are time-ho"},"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":"2211.06605","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-12T08:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"af61b811ba39f9ef2b2fde362e04acb24dfa5e319fe2bf705b5f311205eb5cb9","abstract_canon_sha256":"ce67a817c6dc28eaad4fa3d28d46833799ec8b096e5f6c4ebc111c27e0254737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:04.803916Z","signature_b64":"ZwqC61PDPlR5j5sk880l+w9fjUGghayn550ElnaW89NysFvFkZ2VdV2NOypI+wqhn7mxBhHJvkKY2LntAnQ7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab433ebedc03ef00c9c803d4bbf5a1a53284c4266083ca64f563bc2532eccc3","last_reissued_at":"2026-07-05T05:47:04.803478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:04.803478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comprehensive Analysis of Over-smoothing in Graph Neural Networks from Markov Chains Perspective","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenguang Wang, Congying Han, Tiande Guo, Weichen Zhao","submitted_at":"2022-11-12T08:03:57Z","abstract_excerpt":"The over-smoothing problem is an obstacle of developing deep graph neural network (GNN). Although many approaches to improve the over-smoothing problem have been proposed, there is still a lack of comprehensive understanding and conclusion of this problem. In this work, we analyze the over-smoothing problem from the Markov chain perspective. We focus on message passing of GNN and first establish a connection between GNNs and Markov chains on the graph. GNNs are divided into two classes of operator-consistent and operator-inconsistent based on whether the corresponding Markov chains are time-ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06605","kind":"arxiv","version":2},"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/2211.06605/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":"2211.06605","created_at":"2026-07-05T05:47:04.803541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.06605v2","created_at":"2026-07-05T05:47:04.803541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06605","created_at":"2026-07-05T05:47:04.803541+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZK2DH27NYA7P","created_at":"2026-07-05T05:47:04.803541+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZK2DH27NYA7PADE4","created_at":"2026-07-05T05:47:04.803541+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZK2DH27N","created_at":"2026-07-05T05:47:04.803541+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08067","citing_title":"Beyond Homophily: Towards Generalized Graph Reconstruction Attack and Defense","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ","json":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ.json","graph_json":"https://pith.science/api/pith-number/ZK2DH27NYA7PADE4QA6UXP22DJ/graph.json","events_json":"https://pith.science/api/pith-number/ZK2DH27NYA7PADE4QA6UXP22DJ/events.json","paper":"https://pith.science/paper/ZK2DH27N"},"agent_actions":{"view_html":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ","download_json":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ.json","view_paper":"https://pith.science/paper/ZK2DH27N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.06605&json=true","fetch_graph":"https://pith.science/api/pith-number/ZK2DH27NYA7PADE4QA6UXP22DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZK2DH27NYA7PADE4QA6UXP22DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZK2DH27NYA7PADE4QA6UXP22DJ/action/replication_record"}},"created_at":"2026-07-05T05:47:04.803541+00:00","updated_at":"2026-07-05T05:47:04.803541+00:00"}