{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FWYFOPW5OIRDDMRD6FH5UL4URC","short_pith_number":"pith:FWYFOPW5","schema_version":"1.0","canonical_sha256":"2db0573edd722231b223f14fda2f948884bca6ce611c1da5044583703404848a","source":{"kind":"arxiv","id":"2006.11468","version":2},"attestation_state":"computed","paper":{"title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Danai Koutra, Jiong Zhu, Leman Akoglu, Lingxiao Zhao, Mark Heimann, Yujun Yan","submitted_at":"2020-06-20T02:05:01Z","abstract_excerpt":"We investigate the representation power of graph neural networks in the semi-supervised node classification task under heterophily or low homophily, i.e., in networks where connected nodes may have different class labels and dissimilar features. Many popular GNNs fail to generalize to this setting, and are even outperformed by models that ignore the graph structure (e.g., multilayer perceptrons). Motivated by this limitation, we identify a set of key designs -- ego- and neighbor-embedding separation, higher-order neighborhoods, and combination of intermediate representations -- that boost lear"},"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":"2006.11468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-20T02:05:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a1249fef68367df92f82010eb9c7c21bd0b591cdf856619f00c332d605018ac5","abstract_canon_sha256":"6d41bfd8e8680d9c43fda9ee97f383daaa46401ac100e89db5423d47e267b24f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:28.163444Z","signature_b64":"JG9xn2uhF/y6NpOmWfkDWuftMhkcgBrIUEuBu7qfcIKznudm1oqJx5LSudQVgxiTt9Cox0kdZ9AMffrMhii7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2db0573edd722231b223f14fda2f948884bca6ce611c1da5044583703404848a","last_reissued_at":"2026-07-05T01:45:28.163026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:28.163026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Danai Koutra, Jiong Zhu, Leman Akoglu, Lingxiao Zhao, Mark Heimann, Yujun Yan","submitted_at":"2020-06-20T02:05:01Z","abstract_excerpt":"We investigate the representation power of graph neural networks in the semi-supervised node classification task under heterophily or low homophily, i.e., in networks where connected nodes may have different class labels and dissimilar features. Many popular GNNs fail to generalize to this setting, and are even outperformed by models that ignore the graph structure (e.g., multilayer perceptrons). Motivated by this limitation, we identify a set of key designs -- ego- and neighbor-embedding separation, higher-order neighborhoods, and combination of intermediate representations -- that boost lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.11468","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/2006.11468/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":"2006.11468","created_at":"2026-07-05T01:45:28.163082+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.11468v2","created_at":"2026-07-05T01:45:28.163082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.11468","created_at":"2026-07-05T01:45:28.163082+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWYFOPW5OIRD","created_at":"2026-07-05T01:45:28.163082+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWYFOPW5OIRDDMRD","created_at":"2026-07-05T01:45:28.163082+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWYFOPW5","created_at":"2026-07-05T01:45:28.163082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20248","citing_title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21093","citing_title":"TRAVELFRAUDBENCH: A Configurable Evaluation Framework for GNN Fraud Ring Detection in Travel Networks","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC","json":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC.json","graph_json":"https://pith.science/api/pith-number/FWYFOPW5OIRDDMRD6FH5UL4URC/graph.json","events_json":"https://pith.science/api/pith-number/FWYFOPW5OIRDDMRD6FH5UL4URC/events.json","paper":"https://pith.science/paper/FWYFOPW5"},"agent_actions":{"view_html":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC","download_json":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC.json","view_paper":"https://pith.science/paper/FWYFOPW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.11468&json=true","fetch_graph":"https://pith.science/api/pith-number/FWYFOPW5OIRDDMRD6FH5UL4URC/graph.json","fetch_events":"https://pith.science/api/pith-number/FWYFOPW5OIRDDMRD6FH5UL4URC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC/action/storage_attestation","attest_author":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC/action/author_attestation","sign_citation":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC/action/citation_signature","submit_replication":"https://pith.science/pith/FWYFOPW5OIRDDMRD6FH5UL4URC/action/replication_record"}},"created_at":"2026-07-05T01:45:28.163082+00:00","updated_at":"2026-07-05T01:45:28.163082+00:00"}