{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AWZ4RP5MLMWARNWOKUDY33HMDM","short_pith_number":"pith:AWZ4RP5M","schema_version":"1.0","canonical_sha256":"05b3c8bfac5b2c08b6ce55078decec1b099b8b1c7520a49a612d9a02a48d68e6","source":{"kind":"arxiv","id":"2307.08430","version":6},"attestation_state":"computed","paper":{"title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chao Li, Hao Xu, Kun He, Qiuting He, Zijie Guo","submitted_at":"2023-07-17T12:20:07Z","abstract_excerpt":"Utilizing long-range dependency, a concept extensively studied in homogeneous graphs, remains underexplored in heterogeneous graphs, especially on large ones, posing two significant challenges: Reducing computational costs while maximizing effective information utilization in the presence of heterogeneity, and overcoming the over-smoothing issue in graph neural networks. To address this gap, we investigate the importance of different meta-paths and introduce an automatic framework for utilizing long-range dependency on heterogeneous graphs, denoted as Long-range Meta-path Search through Progre"},"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":"2307.08430","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-07-17T12:20:07Z","cross_cats_sorted":[],"title_canon_sha256":"61f8f4265af3c12377d184f7708ea4f012faa3032479a1e78540872ff7bf4733","abstract_canon_sha256":"ec711174eaad6de207562d1e3440bf3a6b443921925b576ce085003cf45a3420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:30.809178Z","signature_b64":"GX2hji/3hOrHWAszBQai8+GUY/PCelCxaWomdwGaQBIQsdQhQbT2icgVlxxU3BgXcI5gGx1qmvwXzP6ERCDJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05b3c8bfac5b2c08b6ce55078decec1b099b8b1c7520a49a612d9a02a48d68e6","last_reissued_at":"2026-07-05T10:38:30.808729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:30.808729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chao Li, Hao Xu, Kun He, Qiuting He, Zijie Guo","submitted_at":"2023-07-17T12:20:07Z","abstract_excerpt":"Utilizing long-range dependency, a concept extensively studied in homogeneous graphs, remains underexplored in heterogeneous graphs, especially on large ones, posing two significant challenges: Reducing computational costs while maximizing effective information utilization in the presence of heterogeneity, and overcoming the over-smoothing issue in graph neural networks. To address this gap, we investigate the importance of different meta-paths and introduce an automatic framework for utilizing long-range dependency on heterogeneous graphs, denoted as Long-range Meta-path Search through Progre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08430","kind":"arxiv","version":6},"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/2307.08430/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":"2307.08430","created_at":"2026-07-05T10:38:30.808785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08430v6","created_at":"2026-07-05T10:38:30.808785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08430","created_at":"2026-07-05T10:38:30.808785+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWZ4RP5MLMWA","created_at":"2026-07-05T10:38:30.808785+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWZ4RP5MLMWARNWO","created_at":"2026-07-05T10:38:30.808785+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWZ4RP5M","created_at":"2026-07-05T10:38:30.808785+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08743","citing_title":"Bridging RDF Knowledge Graphs with Graph Neural Networks for Semantically-Rich Recommender Systems","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM","json":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM.json","graph_json":"https://pith.science/api/pith-number/AWZ4RP5MLMWARNWOKUDY33HMDM/graph.json","events_json":"https://pith.science/api/pith-number/AWZ4RP5MLMWARNWOKUDY33HMDM/events.json","paper":"https://pith.science/paper/AWZ4RP5M"},"agent_actions":{"view_html":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM","download_json":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM.json","view_paper":"https://pith.science/paper/AWZ4RP5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08430&json=true","fetch_graph":"https://pith.science/api/pith-number/AWZ4RP5MLMWARNWOKUDY33HMDM/graph.json","fetch_events":"https://pith.science/api/pith-number/AWZ4RP5MLMWARNWOKUDY33HMDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM/action/storage_attestation","attest_author":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM/action/author_attestation","sign_citation":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM/action/citation_signature","submit_replication":"https://pith.science/pith/AWZ4RP5MLMWARNWOKUDY33HMDM/action/replication_record"}},"created_at":"2026-07-05T10:38:30.808785+00:00","updated_at":"2026-07-05T10:38:30.808785+00:00"}