{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CNJYQ3WV6UMZQ3IFUGFKHG25WR","short_pith_number":"pith:CNJYQ3WV","schema_version":"1.0","canonical_sha256":"1353886ed5f519986d05a18aa39b5db4746fb0b2493fe435ca24006869f7771c","source":{"kind":"arxiv","id":"2501.08538","version":1},"attestation_state":"computed","paper":{"title":"Homophily-aware Heterogeneous Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Can Xu, Chenglong Shi, Haosen Wang, Pan Tang, Surong Yan","submitted_at":"2025-01-15T02:56:50Z","abstract_excerpt":"Heterogeneous graph pre-training (HGP) has demonstrated remarkable performance across various domains. However, the issue of heterophily in real-world heterogeneous graphs (HGs) has been largely overlooked. To bridge this research gap, we proposed a novel heterogeneous graph contrastive learning framework, termed HGMS, which leverages connection strength and multi-view self-expression to learn homophilous node representations. Specifically, we design a heterogeneous edge dropping augmentation strategy that enhances the homophily of augmented views. Moreover, we introduce a multi-view self-expr"},"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":"2501.08538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-15T02:56:50Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1563f1cc8d222b6a6e6a3a1bce84c93972377c702a1ec4a7d8de2e522ee5f91a","abstract_canon_sha256":"4652371e885d064a7d0ae50d8e74639019e049f7814bd27469d50c78ca1f239c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:20.897690Z","signature_b64":"dUWTkf8ZFcciEQzPZOHTyWjqbeYYoeQXO/iJMu7A/Snwlp2aFpPl69JBQhdEhwDb1f5riC/6xEfGFWFs0hjbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1353886ed5f519986d05a18aa39b5db4746fb0b2493fe435ca24006869f7771c","last_reissued_at":"2026-07-05T10:01:20.897203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:20.897203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homophily-aware Heterogeneous Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Can Xu, Chenglong Shi, Haosen Wang, Pan Tang, Surong Yan","submitted_at":"2025-01-15T02:56:50Z","abstract_excerpt":"Heterogeneous graph pre-training (HGP) has demonstrated remarkable performance across various domains. However, the issue of heterophily in real-world heterogeneous graphs (HGs) has been largely overlooked. To bridge this research gap, we proposed a novel heterogeneous graph contrastive learning framework, termed HGMS, which leverages connection strength and multi-view self-expression to learn homophilous node representations. Specifically, we design a heterogeneous edge dropping augmentation strategy that enhances the homophily of augmented views. Moreover, we introduce a multi-view self-expr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08538","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/2501.08538/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":"2501.08538","created_at":"2026-07-05T10:01:20.897260+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.08538v1","created_at":"2026-07-05T10:01:20.897260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08538","created_at":"2026-07-05T10:01:20.897260+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNJYQ3WV6UMZ","created_at":"2026-07-05T10:01:20.897260+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNJYQ3WV6UMZQ3IF","created_at":"2026-07-05T10:01:20.897260+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNJYQ3WV","created_at":"2026-07-05T10:01:20.897260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06682","citing_title":"Learning Robust Heterogeneous Graph Representations via Contrastive-Reconstruction under Sparse Semantics","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR","json":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR.json","graph_json":"https://pith.science/api/pith-number/CNJYQ3WV6UMZQ3IFUGFKHG25WR/graph.json","events_json":"https://pith.science/api/pith-number/CNJYQ3WV6UMZQ3IFUGFKHG25WR/events.json","paper":"https://pith.science/paper/CNJYQ3WV"},"agent_actions":{"view_html":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR","download_json":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR.json","view_paper":"https://pith.science/paper/CNJYQ3WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.08538&json=true","fetch_graph":"https://pith.science/api/pith-number/CNJYQ3WV6UMZQ3IFUGFKHG25WR/graph.json","fetch_events":"https://pith.science/api/pith-number/CNJYQ3WV6UMZQ3IFUGFKHG25WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR/action/storage_attestation","attest_author":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR/action/author_attestation","sign_citation":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR/action/citation_signature","submit_replication":"https://pith.science/pith/CNJYQ3WV6UMZQ3IFUGFKHG25WR/action/replication_record"}},"created_at":"2026-07-05T10:01:20.897260+00:00","updated_at":"2026-07-05T10:01:20.897260+00:00"}