{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RHVUU5KJXHLLN6IJXDMCDFPBHB","short_pith_number":"pith:RHVUU5KJ","schema_version":"1.0","canonical_sha256":"89eb4a7549b9d6b6f909b8d82195e1387fae7cd2e6750f6128bd32835eb5bd1b","source":{"kind":"arxiv","id":"2506.20980","version":1},"attestation_state":"computed","paper":{"title":"Enhancing Homophily-Heterophily Separation: Relation-Aware Learning in Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Weigang Lu, Wei Zhao, Yaming Yang, Ziyu Guan, Ziyu Zheng","submitted_at":"2025-06-26T03:54:06Z","abstract_excerpt":"Real-world networks usually have a property of node heterophily, that is, the connected nodes usually have different features or different labels. This heterophily issue has been extensively studied in homogeneous graphs but remains under-explored in heterogeneous graphs, where there are multiple types of nodes and edges. Capturing node heterophily in heterogeneous graphs is very challenging since both node/edge heterogeneity and node heterophily should be carefully taken into consideration. Existing methods typically convert heterogeneous graphs into homogeneous ones to learn node heterophily"},"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":"2506.20980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-06-26T03:54:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e82f60244488f528c031d8279f8a6ce0029428364672277946906cb4502d326d","abstract_canon_sha256":"cff85c360e749d1e9ad5f620ebaa921628dc668b16b5d08bb48c1d0815b20e4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:37.071394Z","signature_b64":"Xhl16RWdQabKDxtYp60A6lJpiR+HSTW8LyDFcAPNEDUw/qKtycCxofd+4litv8kKNOBUOnMQXmXswbyInvumBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89eb4a7549b9d6b6f909b8d82195e1387fae7cd2e6750f6128bd32835eb5bd1b","last_reissued_at":"2026-07-05T11:27:37.070851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:37.070851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Homophily-Heterophily Separation: Relation-Aware Learning in Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Weigang Lu, Wei Zhao, Yaming Yang, Ziyu Guan, Ziyu Zheng","submitted_at":"2025-06-26T03:54:06Z","abstract_excerpt":"Real-world networks usually have a property of node heterophily, that is, the connected nodes usually have different features or different labels. This heterophily issue has been extensively studied in homogeneous graphs but remains under-explored in heterogeneous graphs, where there are multiple types of nodes and edges. Capturing node heterophily in heterogeneous graphs is very challenging since both node/edge heterogeneity and node heterophily should be carefully taken into consideration. Existing methods typically convert heterogeneous graphs into homogeneous ones to learn node heterophily"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20980","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/2506.20980/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":"2506.20980","created_at":"2026-07-05T11:27:37.070906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20980v1","created_at":"2026-07-05T11:27:37.070906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20980","created_at":"2026-07-05T11:27:37.070906+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHVUU5KJXHLL","created_at":"2026-07-05T11:27:37.070906+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHVUU5KJXHLLN6IJ","created_at":"2026-07-05T11:27:37.070906+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHVUU5KJ","created_at":"2026-07-05T11:27:37.070906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB","json":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB.json","graph_json":"https://pith.science/api/pith-number/RHVUU5KJXHLLN6IJXDMCDFPBHB/graph.json","events_json":"https://pith.science/api/pith-number/RHVUU5KJXHLLN6IJXDMCDFPBHB/events.json","paper":"https://pith.science/paper/RHVUU5KJ"},"agent_actions":{"view_html":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB","download_json":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB.json","view_paper":"https://pith.science/paper/RHVUU5KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20980&json=true","fetch_graph":"https://pith.science/api/pith-number/RHVUU5KJXHLLN6IJXDMCDFPBHB/graph.json","fetch_events":"https://pith.science/api/pith-number/RHVUU5KJXHLLN6IJXDMCDFPBHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB/action/storage_attestation","attest_author":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB/action/author_attestation","sign_citation":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB/action/citation_signature","submit_replication":"https://pith.science/pith/RHVUU5KJXHLLN6IJXDMCDFPBHB/action/replication_record"}},"created_at":"2026-07-05T11:27:37.070906+00:00","updated_at":"2026-07-05T11:27:37.070906+00:00"}