{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/long-range-dependency-based-multi-layer","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","arxiv_id":"2307.08430","date":"2023-07-17","proceeding":null,"authors":["Chao Li","Zijie Guo","Qiuting He","Hao Xu","Kun He"],"abstract":"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 Progressive Sampling (LMSPS). Specifically, we develop a search space with all meta-paths related to the target node type. By employing a progressive sampling algorithm, LMSPS dynamically shrinks the search space with hop-independent time complexity. Through a sampling evaluation strategy, LMSPS conducts a specialized and effective meta-path selection, leading to retraining with only effective meta-paths, thus mitigating costs and over-smoothing. Extensive experiments across diverse heterogeneous datasets validate LMSPS's capability in discovering effective long-range meta-paths, surpassing state-of-the-art methods. Our code is available at https://github.com/JHL-HUST/LMSPS.","url_abs":"https://arxiv.org/abs/2307.08430v6","url_pdf":"https://arxiv.org/pdf/2307.08430v6.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"long-range-dependency-based-multi-layer","repo_url":"https://github.com/jhl-hust/ldmlp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"long-range-dependency-based-multi-layer","repo_url":"https://github.com/jhl-hust/lmsps","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"long-range-dependency-based-multi-layer","repo_url":"https://github.com/JHL-HUST/LDMLP/tree/main/ogbn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"long-range-dependency-based-multi-layer","repo_url":"https://github.com/JHL-HUST/LMSPS/tree/main/ogbn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-property-prediction","task_name":"Node Property Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset":"ogbn-mag","model":"LMSPS (w/o embs)","rank_in_archive_order":4,"of":39,"metrics":{"Ext. data":"No","Number of params":"16470044","Test Accuracy":"0.5784 ± 0.0022","Validation Accuracy":"0.5951 ± 0.0007"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset":"ogbn-mag","model":"LMSPS(w/o ComplEx embs)","rank_in_archive_order":6,"of":39,"metrics":{"Ext. data":"No","Number of params":"16470044","Test Accuracy":"0.5767 ± 0.0015","Validation Accuracy":"0.5902 ± 0.0016"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset":"ogbn-mag","model":"LDMLP(w/o ComplEx embs)","rank_in_archive_order":9,"of":39,"metrics":{"Ext. data":"No","Number of params":"13177884","Test Accuracy":"0.5739 ± 0.0012","Validation Accuracy":"0.5888 ± 0.0015"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2307.08430","atlas_url":"https://app.syntology.ai/?focus=2307.08430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08430"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2307.08430"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2307.08430"},"call":"get_harvested_code_for_paper(arxiv_id=\"2307.08430\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2307.08430"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2307.08430\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2307.08430"},"call":"get_concepts_for_paper(arxiv_id=\"2307.08430\")"}],"by_repo":[{"repo":"jhl-hust/ldmlp","kind":"official","samples":7,"ran":3,"instrument":0,"unverified":4},{"repo":"jhl-hust/lmsps","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2307.08430.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2307.08430.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jhl-hust/lmsps","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/JHL-HUST/LDMLP/tree/main/ogbn","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jhl-hust/ldmlp","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/JHL-HUST/LMSPS/tree/main/ogbn","reach":{"status":"ok"}}],"summary":{"ran":3,"unverified":4},"n_samples":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":7,"ran":3,"n_ran_checked":3,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":7,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"bdd10a0559cd9f67","code_sha256_prefix":"bdd10a0559cd9f67","entry":"evaluator","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"hgb/utils.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/hgb/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"gt:Tensor/2/int, pred:Tensor/2/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/evaluator-2","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"bdd10a0559cd9f67"}},{"code_sha256":"76cefceaf1693dd9","code_sha256_prefix":"76cefceaf1693dd9","entry":"infer_eval","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"hgb/utils.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/hgb/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, criterion:callable/0/?, eval_loader:list/1/tuple, device:str/0/str, index_sampled:set/0/?, trainval_point:int/0/int, valtest_point:int/0/int, labels:Tensor/1/int","fixture_out_type":"float","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"76cefceaf1693dd9"}},{"code_sha256":"6e0ca78e6b055583","code_sha256_prefix":"6e0ca78e6b055583","entry":"project_op","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"hgb/utils.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/hgb/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"keys:list/1/str, model:callable/0/?, criterion:callable/0/?, eval_loader:list/1/tuple, device:device/0/?, trainval_point:int/0/int, valtest_point:int/0/int, labels:Tensor/1/int, repeat:int/0/int","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"6e0ca78e6b055583"}},{"code_sha256":"8eb64db85c51b748","code_sha256_prefix":"8eb64db85c51b748","entry":"parse_args","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"hgb/main_path.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/hgb/main_path.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/parse-args","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"8eb64db85c51b748"}},{"code_sha256":"d3e41752dea9554e","code_sha256_prefix":"d3e41752dea9554e","entry":"parse_args","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"hgb/train_search.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/hgb/train_search.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/parse-args","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"d3e41752dea9554e"}},{"code_sha256":"87498f3a0ca6b721","code_sha256_prefix":"87498f3a0ca6b721","entry":"parse_args","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"ogbn/main_path.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/ogbn/main_path.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/parse-args","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"87498f3a0ca6b721"}},{"code_sha256":"423bc5659e28c499","code_sha256_prefix":"423bc5659e28c499","entry":"parse_args","repo":"jhl-hust/ldmlp","repo_kind":"official","path":"ogbn/main_path_nested.py","file_url":"https://github.com/jhl-hust/ldmlp/blob/HEAD/ogbn/main_path_nested.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/parse-args","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhl-hust/ldmlp when it was checked","mcp_get_code":{"code_sha256":"423bc5659e28c499"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a5a1e56fdad414804d5bb2623970924a26ac9fc6a6f77b7db289d59a9d9342ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}