{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IUUAFSGPCEIH3IYOSNRWAJYEQC","short_pith_number":"pith:IUUAFSGP","schema_version":"1.0","canonical_sha256":"452802c8cf11107da30e936360270480ba0c222bc7604bdd8d246bde68dcd84c","source":{"kind":"arxiv","id":"2407.09618","version":1},"attestation_state":"computed","paper":{"title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Chenqing Hua, Doina Precup, Guy Wolf, Jian Tang, Liheng Ma, Lirong Wu, Minkai Xu, Qincheng Lu, Rex Ying, Sitao Luan, Stan Z. Li, Stefanie Jegelka, Xiao-Wen Chang, Xinyu Wang","submitted_at":"2024-07-12T18:04:32Z","abstract_excerpt":"Homophily principle, \\ie{} nodes with the same labels or similar attributes are more likely to be connected, has been commonly believed to be the main reason for the superiority of Graph Neural Networks (GNNs) over traditional Neural Networks (NNs) on graph-structured data, especially on node-level tasks. However, recent work has identified a non-trivial set of datasets where GNN's performance compared to the NN's is not satisfactory. Heterophily, i.e. low homophily, has been considered the main cause of this empirical observation. People have begun to revisit and re-evaluate most existing gra"},"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":"2407.09618","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-12T18:04:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b458e1f4652293a413c94ef5d0c500947ca24bb467df815d56f22bcb70f90013","abstract_canon_sha256":"ee32614c34457e907185b2ad11460bc20fc32a714f945e94088b0aed5504ce10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:58.065430Z","signature_b64":"nQlZynXwXMb30VXOQsE284o8TFknUv7qPwAjfP9QrSkvJD6xbYfzXDanpeum2nCAdf4W1JLbhw13Jn+TOkiNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452802c8cf11107da30e936360270480ba0c222bc7604bdd8d246bde68dcd84c","last_reissued_at":"2026-07-05T08:43:58.065005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:58.065005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Chenqing Hua, Doina Precup, Guy Wolf, Jian Tang, Liheng Ma, Lirong Wu, Minkai Xu, Qincheng Lu, Rex Ying, Sitao Luan, Stan Z. Li, Stefanie Jegelka, Xiao-Wen Chang, Xinyu Wang","submitted_at":"2024-07-12T18:04:32Z","abstract_excerpt":"Homophily principle, \\ie{} nodes with the same labels or similar attributes are more likely to be connected, has been commonly believed to be the main reason for the superiority of Graph Neural Networks (GNNs) over traditional Neural Networks (NNs) on graph-structured data, especially on node-level tasks. However, recent work has identified a non-trivial set of datasets where GNN's performance compared to the NN's is not satisfactory. Heterophily, i.e. low homophily, has been considered the main cause of this empirical observation. People have begun to revisit and re-evaluate most existing gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09618","kind":"arxiv","version":1},"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/2407.09618/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":"2407.09618","created_at":"2026-07-05T08:43:58.065059+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09618v1","created_at":"2026-07-05T08:43:58.065059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09618","created_at":"2026-07-05T08:43:58.065059+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUUAFSGPCEIH","created_at":"2026-07-05T08:43:58.065059+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUUAFSGPCEIH3IYO","created_at":"2026-07-05T08:43:58.065059+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUUAFSGP","created_at":"2026-07-05T08:43:58.065059+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00513","citing_title":"ControBench: An Interaction-Aware Benchmark for Controversial Discourse Analysis on Social Networks","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19186","citing_title":"Inductive Subgraphs as Shortcuts: Causal Disentanglement for Heterophilic Graph Learning","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15069","citing_title":"Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC","json":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC.json","graph_json":"https://pith.science/api/pith-number/IUUAFSGPCEIH3IYOSNRWAJYEQC/graph.json","events_json":"https://pith.science/api/pith-number/IUUAFSGPCEIH3IYOSNRWAJYEQC/events.json","paper":"https://pith.science/paper/IUUAFSGP"},"agent_actions":{"view_html":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC","download_json":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC.json","view_paper":"https://pith.science/paper/IUUAFSGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09618&json=true","fetch_graph":"https://pith.science/api/pith-number/IUUAFSGPCEIH3IYOSNRWAJYEQC/graph.json","fetch_events":"https://pith.science/api/pith-number/IUUAFSGPCEIH3IYOSNRWAJYEQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC/action/storage_attestation","attest_author":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC/action/author_attestation","sign_citation":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC/action/citation_signature","submit_replication":"https://pith.science/pith/IUUAFSGPCEIH3IYOSNRWAJYEQC/action/replication_record"}},"created_at":"2026-07-05T08:43:58.065059+00:00","updated_at":"2026-07-05T08:43:58.065059+00:00"}