{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AGPSED3A7RVAZP7EE4FH4QE2KR","short_pith_number":"pith:AGPSED3A","schema_version":"1.0","canonical_sha256":"019f220f60fc6a0cbfe4270a7e409a545b8e9f5324f7ea4c04f949557f1f4943","source":{"kind":"arxiv","id":"2401.09125","version":2},"attestation_state":"computed","paper":{"title":"Understanding Heterophily for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Junfu Wang, Liang Yang, Yuanfang Guo, Yunhong Wang","submitted_at":"2024-01-17T11:01:28Z","abstract_excerpt":"Graphs with heterophily have been regarded as challenging scenarios for Graph Neural Networks (GNNs), where nodes are connected with dissimilar neighbors through various patterns. In this paper, we present theoretical understandings of the impacts of different heterophily patterns for GNNs by incorporating the graph convolution (GC) operations into fully connected networks via the proposed Heterophilous Stochastic Block Models (HSBM), a general random graph model that can accommodate diverse heterophily patterns. Firstly, we show that by applying a GC operation, the separability gains are dete"},"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":"2401.09125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-17T11:01:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d7fd45207d1e0894c81bac03f7b6725465b9e1f64a41c8ee16cdd3fd86590523","abstract_canon_sha256":"1f514181c09fbf336dcc23c12050575079eaaf81f6a1103ae6d58f16b3575569"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:02.513817Z","signature_b64":"EgARpHc1BN074l8CzQFH3WfNkHQhVRtD6OFHgKNsLUnWPq6TVAgbzaqVYV94PsUopNjQupQsyzI2qLK5XOw8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"019f220f60fc6a0cbfe4270a7e409a545b8e9f5324f7ea4c04f949557f1f4943","last_reissued_at":"2026-07-05T08:27:02.513338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:02.513338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Heterophily for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Junfu Wang, Liang Yang, Yuanfang Guo, Yunhong Wang","submitted_at":"2024-01-17T11:01:28Z","abstract_excerpt":"Graphs with heterophily have been regarded as challenging scenarios for Graph Neural Networks (GNNs), where nodes are connected with dissimilar neighbors through various patterns. In this paper, we present theoretical understandings of the impacts of different heterophily patterns for GNNs by incorporating the graph convolution (GC) operations into fully connected networks via the proposed Heterophilous Stochastic Block Models (HSBM), a general random graph model that can accommodate diverse heterophily patterns. Firstly, we show that by applying a GC operation, the separability gains are dete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09125","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/2401.09125/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":"2401.09125","created_at":"2026-07-05T08:27:02.513398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09125v2","created_at":"2026-07-05T08:27:02.513398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09125","created_at":"2026-07-05T08:27:02.513398+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGPSED3A7RVA","created_at":"2026-07-05T08:27:02.513398+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGPSED3A7RVAZP7E","created_at":"2026-07-05T08:27:02.513398+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGPSED3A","created_at":"2026-07-05T08:27:02.513398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10975","citing_title":"Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR","json":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR.json","graph_json":"https://pith.science/api/pith-number/AGPSED3A7RVAZP7EE4FH4QE2KR/graph.json","events_json":"https://pith.science/api/pith-number/AGPSED3A7RVAZP7EE4FH4QE2KR/events.json","paper":"https://pith.science/paper/AGPSED3A"},"agent_actions":{"view_html":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR","download_json":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR.json","view_paper":"https://pith.science/paper/AGPSED3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09125&json=true","fetch_graph":"https://pith.science/api/pith-number/AGPSED3A7RVAZP7EE4FH4QE2KR/graph.json","fetch_events":"https://pith.science/api/pith-number/AGPSED3A7RVAZP7EE4FH4QE2KR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR/action/storage_attestation","attest_author":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR/action/author_attestation","sign_citation":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR/action/citation_signature","submit_replication":"https://pith.science/pith/AGPSED3A7RVAZP7EE4FH4QE2KR/action/replication_record"}},"created_at":"2026-07-05T08:27:02.513398+00:00","updated_at":"2026-07-05T08:27:02.513398+00:00"}