{"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/towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","arxiv_id":"2503.09008","date":"2025-03-12","proceeding":null,"authors":["Huidong Liang","Haitz Sáez de Ocáriz Borde","Baskaran Sripathmanathan","Michael Bronstein","Xiaowen Dong"],"abstract":"Long-range dependencies are critical for effective graph representation learning, yet most existing datasets focus on small graphs tailored to inductive tasks, offering limited insight into long-range interactions. Current evaluations primarily compare models employing global attention (e.g., graph transformers) with those using local neighborhood aggregation (e.g., message-passing neural networks) without a direct measurement of long-range dependency. In this work, we introduce City-Networks, a novel large-scale transductive learning dataset derived from real-world city roads. This dataset features graphs with over $10^5$ nodes and significantly larger diameters than those in existing benchmarks, naturally embodying long-range information. We annotate the graphs using an eccentricity-based approach, ensuring that the classification task inherently requires information from distant nodes. Furthermore, we propose a model-agnostic measurement based on the Jacobians of neighbors from distant hops, offering a principled quantification of long-range dependencies. Finally, we provide theoretical justifications for both our dataset design and the proposed measurement - particularly by focusing on over-smoothing and influence score dilution - which establishes a robust foundation for further exploration of long-range interactions in graph neural networks.","url_abs":"https://arxiv.org/abs/2503.09008v1","url_pdf":"https://arxiv.org/pdf/2503.09008v1.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":"towards-quantifying-long-range-interactions","repo_url":"https://github.com/leonresearch/city-networks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"transductive-learning","task_name":"Transductive Learning"}],"methods":[{"method_slug":"attention","method_name":"Attention"},{"method_slug":"focus","method_name":"Focus"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[{"slug":"city-networks","name":"City-Networks","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-log-angeles","task":"Node Classification","dataset":"Log Angeles","model":"ChebNet","rank_in_archive_order":2,"of":5,"metrics":{"Average Top-1 Accuracy":"54.1 ± 0.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-log-angeles","task":"Node Classification","dataset":"Log Angeles","model":"GraphSAGE","rank_in_archive_order":3,"of":5,"metrics":{"Average Top-1 Accuracy":"53.3 ± 0.7"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-log-angeles","task":"Node Classification","dataset":"Log Angeles","model":"SGFormer","rank_in_archive_order":4,"of":5,"metrics":{"Average Top-1 Accuracy":"47.2 ± 0.5"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-log-angeles","task":"Node Classification","dataset":"Log Angeles","model":"GCN","rank_in_archive_order":5,"of":5,"metrics":{"Average Top-1 Accuracy":"45.9 ± 1.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-london","task":"Node Classification","dataset":"London","model":"ChebNet","rank_in_archive_order":2,"of":5,"metrics":{"Average Top-1 Accuracy":"49.4 ± 0.4"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-london","task":"Node Classification","dataset":"London","model":"GraphSAGE","rank_in_archive_order":3,"of":5,"metrics":{"Average Top-1 Accuracy":"48.2 ± 0.8"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-london","task":"Node Classification","dataset":"London","model":"SGFormer","rank_in_archive_order":4,"of":5,"metrics":{"Average Top-1 Accuracy":"45.7 ± 0.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-london","task":"Node Classification","dataset":"London","model":"GCN","rank_in_archive_order":5,"of":5,"metrics":{"Average Top-1 Accuracy":"43.8 ± 0.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-paris","task":"Node Classification","dataset":"Paris","model":"ChebNet","rank_in_archive_order":2,"of":5,"metrics":{"Average Top-1 Accuracy":"49.5  ± 0.4"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-paris","task":"Node Classification","dataset":"Paris","model":"GraphSAGE","rank_in_archive_order":3,"of":5,"metrics":{"Average Top-1 Accuracy":"49.1 ± 0.6"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-paris","task":"Node Classification","dataset":"Paris","model":"GCN","rank_in_archive_order":4,"of":5,"metrics":{"Average Top-1 Accuracy":"47.3 ± 0.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-paris","task":"Node Classification","dataset":"Paris","model":"SGFormer","rank_in_archive_order":5,"of":5,"metrics":{"Average Top-1 Accuracy":"45.0 ± 0.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-shanghai","task":"Node Classification","dataset":"Shanghai","model":"GraphSAGE","rank_in_archive_order":2,"of":5,"metrics":{"Average Top-1 Accuracy":"60.4 ± 0.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-shanghai","task":"Node Classification","dataset":"Shanghai","model":"ChebNet","rank_in_archive_order":3,"of":5,"metrics":{"Average Top-1 Accuracy":"57.9 ± 1.4"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-shanghai","task":"Node Classification","dataset":"Shanghai","model":"SGFormer","rank_in_archive_order":4,"of":5,"metrics":{"Average Top-1 Accuracy":"53.5 ± 0.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-shanghai","task":"Node Classification","dataset":"Shanghai","model":"GCN","rank_in_archive_order":5,"of":5,"metrics":{"Average Top-1 Accuracy":"52.4  ± 0.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2503.09008","atlas_url":"https://app.syntology.ai/?focus=2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2503.09008"},"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":"2503.09008"},"call":"get_harvested_code_for_paper(arxiv_id=\"2503.09008\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2503.09008"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2503.09008\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2503.09008"},"call":"get_concepts_for_paper(arxiv_id=\"2503.09008\")"}],"by_repo":[{"repo":"leonresearch/city-networks","kind":"official","samples":3,"ran":3,"instrument":2,"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","assemblies":[{"assembly_sha256":"f41cb2d209a54cfd","source_kind":"harvested","method_name":"generic measurement based on the Jacobians of neighbors from distant hops","realizes_method":"generic measurement based on the Jacobians of neighbors from distant hops","graph_method":"generic measurement based on the Jacobians of neighbors from distant hops","realizes_severed":false,"claim":"Implements a generic measurement based on the Jacobians of neighbors from distant hops to quantify long-range interactions in graph machine learning.","centrality":"contribution","entry":"jacobian_l1","entry_sha256":"3fcb47df1cd821d3","n_bricks":1,"bricks":[{"entry":"jacobian_l1","code_sha256":"3fcb47df1cd821d3","role":"entry","order":0,"level":1,"status":"ran_honours"}],"ran_individually":1,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_honours":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"44a7003dfe8b","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"44a7003dfe8b","realizes_method":"generic measurement based on the Jacobians of neighbors from distant hops","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["f41cb2d209a54cfd"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2503.09008"},"call":"assembly(arxiv_id=\"2503.09008\")"},"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/2503.09008.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/2503.09008.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":"deterministic:regex_extraction","url":"https://github.com/LeonResearch/City-Networks","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/leonresearch/city-networks","reach":{"status":"ok"}}],"summary":{"ran_honours":1,"ran_fixture":2},"n_samples":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"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":3,"ran":3,"n_ran_checked":1,"n_instrument":2,"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":3,"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":1,"n_ran_without_level_date":2,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","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"},"samples":[{"code_sha256":"3fcb47df1cd821d3","code_sha256_prefix":"3fcb47df1cd821d3","entry":"jacobian_l1","repo":"leonresearch/city-networks","repo_kind":"official","path":"influence/influence.py","file_url":"https://github.com/leonresearch/city-networks/blob/HEAD/influence/influence.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, data:callable/0/?, max_hops:int/0/int, node_idx:int/0/int, device:str/0/str, vectorize:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+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, leonresearch/city-networks when it was checked","mcp_get_code":{"code_sha256":"3fcb47df1cd821d3"}},{"code_sha256":"c7329955ef54debb","code_sha256_prefix":"c7329955ef54debb","entry":"k_hop_subsets_exact","repo":"leonresearch/city-networks","repo_kind":"official","path":"influence/influence.py","file_url":"https://github.com/leonresearch/city-networks/blob/HEAD/influence/influence.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"node_idx:int/0/int, num_hops:int/0/int, edge_index:Tensor/2/int, num_nodes:int/0/int, device:device/0/?","fixture_out_type":"list","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, leonresearch/city-networks when it was checked","mcp_get_code":{"code_sha256":"c7329955ef54debb"}},{"code_sha256":"d69d53cccdbbd6ad","code_sha256_prefix":"d69d53cccdbbd6ad","entry":"k_hop_subsets_rough","repo":"leonresearch/city-networks","repo_kind":"official","path":"influence/influence.py","file_url":"https://github.com/leonresearch/city-networks/blob/HEAD/influence/influence.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"node_idx:int/0/int, num_hops:int/0/int, edge_index:Tensor/2/int, num_nodes:int/0/int","fixture_out_type":"list","retrieve_with":{"tool":"get_code","code_sha256":"d69d53cccdbbd6ad"},"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, leonresearch/city-networks when it was checked","mcp_get_code":{"code_sha256":"d69d53cccdbbd6ad"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"53225ff4e5238a5aca7ae50c96180a3cd7ccd984911fafe176c1547325facf4f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}