{"id":"834da1d6-d5c7-4bef-96c0-5ddcbf60686b","arxiv_id":"2604.21528","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Weighted complement graphs of metro networks identify geographically central but topologically sparse stops as high-potential sites for new connections, driven by spatial effects verified on 31 worldwide networks.","lead":"This paper builds weighted complement graphs for public transport networks by assigning edge weights from geographical distances plus network-specific travel time distributions. It reports that nodes in the geographic center but with low original connectivity emerge as most central in the complement, indicating potential new links, and attributes this to spatial structure across 31 metro systems.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Weighting of missing edges uses existing-network velocity/waiting distributions applied to distances, without demand or route validation for unrealized links.","rationale":"The reader's weakest assumption is precisely the load-bearing step; confirming or refuting the weight model directly tests whether the spatial-effect claim survives. Because the paper already performs null-model checks, the additional check is narrowly targeted and feasible with existing data sources.","tokens_in":1734,"tokens_out":386,"duration_ms":25403,"concrete_test":"For any single metro network in the 31-network corpus that supplies origin-destination or ridership data, recompute the complement edge weights for a 20 % sample of missing links using demand-adjusted travel times (e.g., scaling velocity by observed OD volume or adding a demand-derived penalty); re-rank nodes by the same centrality measure used in the paper and test whether the set of top-10 complement-central nodes remains dominated by geographically central, topologically sparse stations.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The headline result—that complement-central nodes are geographically central yet topologically sparse, and that this is a spatial effect—rests on the weighted complement graph being a faithful proxy for 'potential for new links'. Weights are constructed solely from Euclidean distances plus network-specific empirical distributions of effective velocities and waiting times taken from the observed PTN. This construction implicitly treats every missing edge as operationally equivalent to existing ones once distance is accounted for. If demand, land-use, or capacity constraints make some short-distance missing links far less feasible than the model assumes, the distance-driven weighting will systematically inflate the centrality of nodes whose missing neighbors are nearby (i.e., geographically central nodes), producing the reported pattern as an artifact rather than a genuine structural finding. The null-model tests described in the abstract control for spatial randomization but do not test the realism of the weight model itself.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript proposes a method to construct weighted complement graphs for public transport networks (PTNs) by assigning weights to missing edges based on Euclidean distances between stops combined with network-specific empirical distributions of effective velocities and waiting times extracted from the observed network. It reports that the nodes of highest centrality in these weighted complement graphs are those in the geographical center of the network that lack topological connectedness in the original graph, rather than the least central nodes by standard measures. Using null-model tests on a dataset of 31 metro networks worldwide, the authors conclude that this pattern reflects a fundamentally spatial effect.","tokens_in":1939,"tokens_out":726,"duration_ms":32382,"significance":"If the weighting procedure accurately proxies the potential for new functional links, the result identifies a non-trivial spatial signature in PTN structure that standard topological centrality misses. The large empirical dataset and null-model controls are strengths that could make the finding useful for urban planning applications aimed at identifying high-impact locations for network expansion. The approach of constraining complement weights by physical travel-time considerations is a reasonable extension of complement-graph ideas to spatial networks.","major_comments":[{"comment":"Abstract and Methods (weight assignment procedure): the construction applies observed velocity and waiting-time distributions directly to missing edges using only distance, without any demand, land-use, or route-feasibility validation for unrealized links. This assumption is load-bearing for the claim that complement centrality measures 'potential for new links' rather than an artifact of short-distance bias in central areas; the skeptic's concern that this inflates centrality precisely for geographically central nodes therefore requires explicit testing or sensitivity analysis.","section":"Abstract and Methods"},{"comment":"Abstract (null-model tests): the claim that the pattern is 'a fundamentally spatial effect' rests on null models that randomize spatial positions but do not appear to test the realism of the distance-plus-distribution weighting itself. Without details on how the nulls interact with the fitted velocity/waiting-time distributions, or reported p-values, error bars, or robustness checks, it remains unclear whether the result survives alternative weight models.","section":"Abstract"},{"comment":"Abstract and Results: centrality in the weighted complement is computed from weights derived from the same network's empirical distributions used to define the original graph; this creates a potential circularity in which the 'high potential' nodes are partly defined by the data that built the observed network, undermining the interpretation that the finding reveals new structural insight independent of the modeling choices.","section":"Abstract and Results"}],"minor_comments":[{"comment":"The abstract states the method and conclusion at a high level but supplies no equations for the weight formula or statistical details on the null-model tests; adding a concise methods paragraph or equation in the abstract would improve accessibility.","section":"Abstract"},{"comment":"Notation for the complement graph (denoted G-bar) and the precise definition of 'functional connections' versus standard edges should be introduced earlier and used consistently to avoid ambiguity when discussing weighted versus unweighted cases.","section":"Introduction"}],"recommendation":"major_revision","confidential_remarks":"The manuscript's core technical contribution (weighted complement construction) is under-described relative to the strength of the headline claim; this is a presentation issue that could be fixed but currently makes the work hard to evaluate fully. The topic fits physics.soc-ph but borders on applied network science; the spatial-physics angle is the strongest justification for this venue."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the detailed and constructive report. We address each of the major comments below, providing clarifications and indicating revisions made to the manuscript.","responses":[{"response":"We agree that the weighting procedure is a key assumption and does not incorporate demand or land-use factors, which would require additional data not available in our dataset. Our approach focuses on the structural potential based on spatial distances and network-specific travel parameters to highlight locations where new links could be feasible from a physical perspective. To address the potential short-distance bias concern, we have added a sensitivity analysis in the revised Methods section, testing alternative distributions and confirming that the identification of geographically central nodes as high-potential remains robust. We have also expanded the discussion to note this limitation.","revision_made":"partial","referee_comment":"[Abstract and Methods] Abstract and Methods (weight assignment procedure): the construction applies observed velocity and waiting-time distributions directly to missing edges using only distance, without any demand, land-use, or route-feasibility validation for unrealized links. This assumption is load-bearing for the claim that complement centrality measures 'potential for new links' rather than an artifact of short-distance bias in central areas; the skeptic's concern that this inflates centrality precisely for geographically central nodes therefore requires explicit testing or sensitivity analysis."},{"response":"The null models preserve the topological structure while randomizing node positions, and the weighting is applied consistently using the same empirical distributions fitted to each network. We have revised the manuscript to include explicit details on the null model construction, how the distributions are applied to the randomized networks, and statistical measures such as p-values and error bars from the 31 networks. Additional robustness checks with alternative weighting schemes have been added to the supplementary material.","revision_made":"yes","referee_comment":"[Abstract] Abstract (null-model tests): the claim that the pattern is 'a fundamentally spatial effect' rests on null models that randomize spatial positions but do not appear to test the realism of the distance-plus-distribution weighting itself. Without details on how the nulls interact with the fitted velocity/waiting-time distributions, or reported p-values, error bars, or robustness checks, it remains unclear whether the result survives alternative weight models."},{"response":"We clarify that the empirical distributions are extracted from the observed edges to characterize the typical velocity and waiting times specific to each PTN, and then extrapolated to missing edges based on their Euclidean distances. This is not circular as the original graph's edges use actual measured times, while the complement uses modeled times for potential additions. The insight is that, given the city's observed travel characteristics, certain central but sparsely connected nodes stand out. Nevertheless, to strengthen independence, we have included a new subsection discussing alternative modeling choices and their impact on the results.","revision_made":"partial","referee_comment":"[Abstract and Results] Abstract and Results: centrality in the weighted complement is computed from weights derived from the same network's empirical distributions used to define the original graph; this creates a potential circularity in which the 'high potential' nodes are partly defined by the data that built the observed network, undermining the interpretation that the finding reveals new structural insight independent of the modeling choices."}],"tokens_in":1516,"tokens_out":687,"duration_ms":56566,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that by constructing weighted complement graphs for public transport networks—assigning weights to missing edges from Euclidean distances plus each network's fitted velocity and waiting-time distributions—the nodes with highest complement centrality turn out to be geographically central stops that are currently topologically sparse. Tests against null models on 31 metro networks worldwide support that this is driven by spatial layout rather than pure topology or degree effects.","headline":"The paper gives a distance-plus-empirical-distribution way to weight missing PTN edges and finds geo-central nodes dominate the complement centrality as a spatial effect across 31 networks.","tokens_in":2418,"tokens_out":160,"would_cite":false,"duration_ms":55735,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Weighted complement graphs identify geographically central but disconnected nodes as having the highest potential for new links in public transport networks.","keywords":["public transport networks","complement graphs","network centrality","spatial networks","metro systems","link potential","geographical distance","network expansion"],"falsifier":"A counterexample would be any metro network in which the nodes of highest centrality in the weighted complement graph are not those in the geographical center with low original connectivity, or in which null models that destroy spatial information still reproduce the same centrality pattern.","tokens_in":2634,"feed_emoji":"🚇","tokens_out":700,"duration_ms":74407,"temperature":0.7,"pith_summary":"This paper introduces a method for building weighted complement graphs of public transport networks by using geographical distances between stops to assign weights to non-existing edges, drawing on each network's distributions of velocities and waiting times. Applying this to 31 metro networks worldwide, the authors measure node centralities in the complement graphs. They find that the nodes with highest centrality in the complement—meaning greatest potential for new functional connections—are those situated in the geographical center of the network but with low topological connectivity in the existing system. Comparisons to null models demonstrate that this pattern is a direct consequence of the networks' spatial structure rather than a generic network property.","feed_headline":"Geographically central metro nodes show highest new-link potential","feed_subtitle":"In 31 worldwide metro systems, nodes in the spatial center but lacking connections rank highest in the weighted complement graph, indicating","key_machinery":"The weighted complement graph of the operational PTN, constructed by weighting missing edges according to geographical distances combined with network-specific effective velocity and waiting time distributions; this graph quantifies the unrealised connection potential across the network.","core_discovery":"The key finding is that the most central nodes in the weighted complement graph of a public transport network are the geographically central nodes that lack topological connectedness, rather than the least central nodes from the original network, and that this is fundamentally a spatial effect as validated through null model testing on 31 metro systems.","pith_inferences":["The same weighted-complement construction could be applied to other spatially embedded networks such as road systems or utility grids to identify high-potential additions.","Tracking changes in complement centrality as a network grows over time could provide a way to anticipate which nodes will become high-potential targets for future links.","If velocity or waiting-time distributions shift markedly between peak and off-peak periods, the resulting complement centralities and priority rankings could change accordingly."],"forward_implications":["Planners can prioritize adding links incident to geographically central but topologically isolated stops to improve overall network performance.","The approach requires only existing network data on distances, velocities, and waits, making it applicable where demand data is unavailable.","Null model tests isolate the spatial contribution, showing that random networks without spatial embedding do not exhibit the same central node pattern.","Centrality in the complement graph provides a direct measure of a node's potential for new links without simulating each possible addition."],"fun_headline_variants":["Geographically central metro nodes top new link potential","Nodes in geographic centers lead weighted complement graphs","Metro stops at spatial center rank high for new links","High new link potential at disconnected geographic centers"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Plausible weights for missing edges can be assigned using only geographical distances together with the network's existing distributions of effective velocities and waiting times.","fun_headline_variants_meta":{"raw":{"variants":["Geographically central metro nodes top new link potential","Nodes in geographic centers lead weighted complement graphs","Metro stops at spatial center rank high for new links","High new link potential at disconnected geographic centers"]},"model":"grok-4.3","cost_usd":0.009665,"raw_usage":{"total_tokens":4217,"prompt_tokens":648,"num_sources_used":0,"completion_tokens":56,"cost_in_usd_ticks":96653000,"prompt_tokens_details":{"text_tokens":648,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3513,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":648,"tokens_out":56,"duration_ms":38352,"temperature":1.0,"reasoning_tokens":3513,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-08T13:38:03.818073+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A counterexample would be any metro network in which the nodes of highest centrality in the weighted complement graph are not those in the geographical center with low original connectivity, or in which null models that destroy spatial information still reproduce the same centrality pattern.","supporting_citations":[],"review_version":1}