{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BSLGRDE5RPH3JIEMZTYMPNQVZN","short_pith_number":"pith:BSLGRDE5","schema_version":"1.0","canonical_sha256":"0c96688c9d8bcfb4a08cccf0c7b615cb6c8a4adfbdbb824f18423eb816ba94fb","source":{"kind":"arxiv","id":"2401.09769","version":4},"attestation_state":"computed","paper":{"title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Caihua Shan, Can Xu, Chenghua Gong, Jianxiang Yu, Siqiang Luo, Xiang Li, Yao Cheng","submitted_at":"2024-01-18T07:36:38Z","abstract_excerpt":"Graphs are structured data that models complex relations between real-world entities. Heterophilic graphs, where linked nodes are prone to be with different labels or dissimilar features, have recently attracted significant attention and found many real-world applications. Meanwhile, increasing efforts have been made to advance learning from graphs with heterophily. Various graph heterophily measures, benchmark datasets, and learning paradigms are emerging rapidly. In this survey, we comprehensively review existing works on learning from graphs with heterophily. First, we overview over 500 pub"},"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.09769","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-01-18T07:36:38Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c74b72647ba6c39081174162c59735c49414e323341fedb835e44f3c39666fc6","abstract_canon_sha256":"941dd312456e0ac5613b1020d95602511ba6f21f9148604057038b65a8a60073"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:35:30.893575Z","signature_b64":"EhUb11ICWXOmnlHVsDJM4CH4zSEasX87QUPIbhwo66HPJKZS2oVuOinkBe9qMAQLIyoEu/ZsrwGe7Qljx+CCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c96688c9d8bcfb4a08cccf0c7b615cb6c8a4adfbdbb824f18423eb816ba94fb","last_reissued_at":"2026-07-05T10:35:30.892581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:35:30.892581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Caihua Shan, Can Xu, Chenghua Gong, Jianxiang Yu, Siqiang Luo, Xiang Li, Yao Cheng","submitted_at":"2024-01-18T07:36:38Z","abstract_excerpt":"Graphs are structured data that models complex relations between real-world entities. Heterophilic graphs, where linked nodes are prone to be with different labels or dissimilar features, have recently attracted significant attention and found many real-world applications. Meanwhile, increasing efforts have been made to advance learning from graphs with heterophily. Various graph heterophily measures, benchmark datasets, and learning paradigms are emerging rapidly. In this survey, we comprehensively review existing works on learning from graphs with heterophily. First, we overview over 500 pub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09769","kind":"arxiv","version":4},"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.09769/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.09769","created_at":"2026-07-05T10:35:30.892684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09769v4","created_at":"2026-07-05T10:35:30.892684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09769","created_at":"2026-07-05T10:35:30.892684+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSLGRDE5RPH3","created_at":"2026-07-05T10:35:30.892684+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSLGRDE5RPH3JIEM","created_at":"2026-07-05T10:35:30.892684+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSLGRDE5","created_at":"2026-07-05T10:35:30.892684+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22180","citing_title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22180","citing_title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN","json":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN.json","graph_json":"https://pith.science/api/pith-number/BSLGRDE5RPH3JIEMZTYMPNQVZN/graph.json","events_json":"https://pith.science/api/pith-number/BSLGRDE5RPH3JIEMZTYMPNQVZN/events.json","paper":"https://pith.science/paper/BSLGRDE5"},"agent_actions":{"view_html":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN","download_json":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN.json","view_paper":"https://pith.science/paper/BSLGRDE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09769&json=true","fetch_graph":"https://pith.science/api/pith-number/BSLGRDE5RPH3JIEMZTYMPNQVZN/graph.json","fetch_events":"https://pith.science/api/pith-number/BSLGRDE5RPH3JIEMZTYMPNQVZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN/action/storage_attestation","attest_author":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN/action/author_attestation","sign_citation":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN/action/citation_signature","submit_replication":"https://pith.science/pith/BSLGRDE5RPH3JIEMZTYMPNQVZN/action/replication_record"}},"created_at":"2026-07-05T10:35:30.892684+00:00","updated_at":"2026-07-05T10:35:30.892684+00:00"}