{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5YTRVCGCIBBHPKC7SDEROTNHYG","short_pith_number":"pith:5YTRVCGC","schema_version":"1.0","canonical_sha256":"ee271a88c2404277a85f90c9174da7c19cdaf5b923abf77b9def5f8c74c60a8f","source":{"kind":"arxiv","id":"2409.05755","version":3},"attestation_state":"computed","paper":{"title":"Revealing the Pitfalls and Re-Evaluating the Advancement of Heterophilic Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenqing Hua, Jiaqi Zhu, Qincheng Lu, Sitao Luan, Xiao-Wen Chang, Xinyu Wang","submitted_at":"2024-09-09T16:11:07Z","abstract_excerpt":"Over the past decade, Graph Neural Networks (GNNs) have achieved great success on machine learning tasks with relational data. However, recent studies have found that heterophily can cause significant performance degradation of GNNs, especially on node-level tasks. Numerous heterophilic benchmark datasets have been put forward to validate the efficacy of heterophily-specific GNNs, and various homophily metrics have been designed to help recognize these challenging datasets. Nevertheless, there still exist multiple pitfalls that severely hinder the proper evaluation of new models and metrics: 1"},"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":"2409.05755","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-09T16:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"fd6300dbffc0d820fac78b5b3fc823e1f0e0e46dfd78f56f8edd0b371756a5f6","abstract_canon_sha256":"f20fe80768902878cb707b6131039b4be2d9a89dd96e6c9c9c415a31c29e2c4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:13.132126Z","signature_b64":"fiZOUDOX0kaAxyOIr0sNlA+pRMQpiqvxucykQ9jjAlfS/xl/j9Prm9FVkoITROlNAwEEZqTdqZ0UhQD/IBe1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee271a88c2404277a85f90c9174da7c19cdaf5b923abf77b9def5f8c74c60a8f","last_reissued_at":"2026-06-23T02:13:13.131663Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:13.131663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revealing the Pitfalls and Re-Evaluating the Advancement of Heterophilic Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenqing Hua, Jiaqi Zhu, Qincheng Lu, Sitao Luan, Xiao-Wen Chang, Xinyu Wang","submitted_at":"2024-09-09T16:11:07Z","abstract_excerpt":"Over the past decade, Graph Neural Networks (GNNs) have achieved great success on machine learning tasks with relational data. However, recent studies have found that heterophily can cause significant performance degradation of GNNs, especially on node-level tasks. Numerous heterophilic benchmark datasets have been put forward to validate the efficacy of heterophily-specific GNNs, and various homophily metrics have been designed to help recognize these challenging datasets. Nevertheless, there still exist multiple pitfalls that severely hinder the proper evaluation of new models and metrics: 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05755","kind":"arxiv","version":3},"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/2409.05755/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":"2409.05755","created_at":"2026-06-23T02:13:13.131721+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05755v3","created_at":"2026-06-23T02:13:13.131721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05755","created_at":"2026-06-23T02:13:13.131721+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YTRVCGCIBBH","created_at":"2026-06-23T02:13:13.131721+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YTRVCGCIBBHPKC7","created_at":"2026-06-23T02:13:13.131721+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YTRVCGC","created_at":"2026-06-23T02:13:13.131721+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.22593","citing_title":"Do Deep Ensembles Actually Capture Uncertainty in Graph Neural Networks?","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15069","citing_title":"Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG","json":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG.json","graph_json":"https://pith.science/api/pith-number/5YTRVCGCIBBHPKC7SDEROTNHYG/graph.json","events_json":"https://pith.science/api/pith-number/5YTRVCGCIBBHPKC7SDEROTNHYG/events.json","paper":"https://pith.science/paper/5YTRVCGC"},"agent_actions":{"view_html":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG","download_json":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG.json","view_paper":"https://pith.science/paper/5YTRVCGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05755&json=true","fetch_graph":"https://pith.science/api/pith-number/5YTRVCGCIBBHPKC7SDEROTNHYG/graph.json","fetch_events":"https://pith.science/api/pith-number/5YTRVCGCIBBHPKC7SDEROTNHYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG/action/storage_attestation","attest_author":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG/action/author_attestation","sign_citation":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG/action/citation_signature","submit_replication":"https://pith.science/pith/5YTRVCGCIBBHPKC7SDEROTNHYG/action/replication_record"}},"created_at":"2026-06-23T02:13:13.131721+00:00","updated_at":"2026-06-23T02:13:13.131721+00:00"}