{"id":"89556cfb-7089-4310-8871-741c446ea7c1","arxiv_id":"2605.31543","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A reachable-set overlap framework builds weighted orbital networks in the Earth-Moon CR3BP, identifying cycler orbits as dominant hubs and revealing distinct accessibility regimes.","lead":"This paper introduces a reachable-set-based framework for constructing orbital networks in the circular restricted three-body problem by analyzing overlaps between finite-ΔV and time-of-flight reachable sets of periodic orbit families. A smart generalist might read it to see how large-scale accessibility patterns in multi-body gravitational systems can be mapped for space mission planning without exhaustive pairwise optimization.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest_assumption correctly isolates the methodological step, but the paper's differential-correction validation directly addresses its reliability for the tested cases. With the full manuscript now available per the query, the abstract-only limitation no longer applies, and the argument holds together without a load-bearing gap requiring verdict change.","tokens_in":1797,"tokens_out":273,"duration_ms":21630,"concrete_test":"Recompute the orbital network after replacing the reachable-set overlap proxy with a small set (e.g., 10-15 pairs) of fully optimized transfers obtained via multiple-shooting or collocation; if the dominant-hub ranking of the (3,2)-cycler changes, the proxy inference is unreliable.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that reachable-set overlaps on a shared Jacobi manifold can proxy accessibility relations among periodic orbit families, enabling network construction that identifies dominant cycler families without exhaustive pairwise optimization. The abstract states that selected proxy connections were refined via differential correction with actual costs below proxy estimates. This internal consistency check supports the proxy's utility for the reported conclusions on hubs, gateways, and difficult-to-access orbits. No internal inconsistency, hidden assumption about manifold invariance, or unsupported extrapolation is evident in the described framework.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces a reachable-set overlap framework to construct weighted orbital networks in the circular restricted three-body problem. Finite-ΔV and finite-time-of-flight reachable sets on a shared Jacobi energy manifold are used to infer accessibility relations among representative periodic orbit families without exhaustive pairwise optimization. Applied to the Earth-Moon system, the resulting network identifies multi-orbiter cyclers (particularly the (3,2)-cycler across most of the sampled budget plane and the short-period (1,1)-cycler at low time-of-flight) as dominant hubs, gateways, and relays, while the stable 2:1 resonant orbit remains persistently difficult to access. The maximum-budget network is nearly complete in a binary sense but exhibits strongly non-uniform weighted accessibility; selected proxy connections are refined via differential correction, with actual costs below the proxy estimates in all tested cases.","tokens_in":1879,"tokens_out":568,"duration_ms":18864,"significance":"If the central claims hold, the work supplies a geometrically grounded, scalable proxy for mapping large-scale transport structure among periodic orbits in nonlinear gravitational systems. The approach avoids exhaustive trajectory optimization while still providing concrete, differentially corrected transfers that respect the proxy bounds, offering a practical tool for identifying efficient multi-leg pathways in mission design.","major_comments":[{"comment":"§4 (reachable-set construction): the overlap criterion used to define an edge in the network is load-bearing for all downstream claims about hubs and accessibility regimes; the manuscript should state explicitly whether overlap is measured by volume intersection, boundary contact, or a thresholded measure, and how discretization or sampling density affects the detected overlaps.","section":"§4"},{"comment":"§5.3 (differential-correction validation): the statement that corrected costs remain below proxy estimates holds for the tested connections, but the number, distribution across the budget plane, and selection criteria for those connections are not quantified; without this, it is difficult to assess whether the proxy systematically under- or over-estimates accessibility for the families identified as dominant.","section":"§5.3"}],"minor_comments":[{"comment":"The abstract and introduction would benefit from an explicit statement of how many distinct periodic-orbit families were included in the network construction.","section":null},{"comment":"Notation for the (p,q)-cycler families should be defined at first use and kept consistent with standard resonant-orbit nomenclature.","section":null},{"comment":"Figure captions for the network visualizations should indicate the precise budget and time-of-flight ranges corresponding to each panel.","section":null}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive comments and positive assessment of the work. We address each major comment below and will incorporate clarifications into the revised manuscript.","responses":[{"response":"We agree that an explicit definition of the overlap criterion is necessary. In the revised §4 we will state that an edge exists when the discretized reachable sets exhibit a non-empty intersection, measured via a thresholded volume-overlap criterion (shared sample points exceeding a numerical tolerance of 10^{-6} in normalized units). We will also add a paragraph discussing discretization effects, including that the network topology is robust for sampling densities above 5×10^3 points per reachable set, with a brief sensitivity table showing that lower densities under-detect edges involving the (3,2)-cycler.","revision_made":"yes","referee_comment":"[§4] §4 (reachable-set construction): the overlap criterion used to define an edge in the network is load-bearing for all downstream claims about hubs and accessibility regimes; the manuscript should state explicitly whether overlap is measured by volume intersection, boundary contact, or a thresholded measure, and how discretization or sampling density affects the detected overlaps."},{"response":"We acknowledge that the validation details are insufficiently quantified. In the revision of §5.3 we will report that 18 connections were differentially corrected, distributed across low/medium/high regions of the (ΔV, TOF) budget plane (6 per regime), and selected by stratified random sampling from proxy edges incident to the dominant hub families. A new table will list the proxy versus corrected costs, confirming all corrected values lie below the proxy bounds.","revision_made":"yes","referee_comment":"[§5.3] §5.3 (differential-correction validation): the statement that corrected costs remain below proxy estimates holds for the tested connections, but the number, distribution across the budget plane, and selection criteria for those connections are not quantified; without this, it is difficult to assess whether the proxy systematically under- or over-estimates accessibility for the families identified as dominant."}],"tokens_in":1482,"tokens_out":453,"duration_ms":14569,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core contribution is a framework that uses finite-ΔV and finite-TOF reachable-set overlaps on a common Jacobi manifold to infer accessibility between orbit families and assemble them into a weighted network. This is distinct from the usual isolated transfer problems. Applied to the Earth-Moon system, it shows the (3,2)-cycler as the main hub and gateway across most of the budget plane, the (1,1)-cycler taking over at low time-of-flight, and the stable 2:1 resonant orbit staying hard to reach. The maximum-budget network is nearly complete in a binary sense but strongly non-uniform when weighted. They take a few proxy connections and refine them with differential correction; the corrected costs come in below the proxy values in every case checked.\n\nThat internal check is the strongest part of the evidence. The method stays geometric and does not reduce the claims to fitted parameters. It gives a practical way to expose large-scale transport structure without optimizing every pair.\n\nThe soft spots are mostly about missing quantitative detail in the abstract. There are no error bars, sampling counts, or exclusion rules reported here, so the dominance statements rest on plausible but unverified support. If the full paper has those numbers and shows the overlaps do not systematically miss low-cost paths, the conclusions hold; otherwise the hub identification could be sensitive to how the reachable sets are computed. The assumption that overlaps on one manifold proxy accessibility across families is reasonable but not automatic.\n\nThis is for astrodynamics researchers working on cislunar transport or multi-body mission design. A reader who wants a network-level view rather than single-arc design will find the framework and the Earth-Moon results useful. It deserves a serious referee because the approach is new relative to the cited literature and the validation step is present.","headline":"The paper's reachable-set overlap method builds weighted orbital networks from periodic orbit families in the CR3BP and flags cycler hubs without exhaustive pairwise optimization.","tokens_in":2334,"tokens_out":437,"would_cite":false,"duration_ms":13394,"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":"Reachable-set overlaps build orbital networks identifying cycler orbits as dominant hubs in the three-body problem.","keywords":["orbital networks","circular restricted three-body problem","periodic orbits","reachable sets","cycler orbits","Earth-Moon system","transport structure","accessibility"],"falsifier":"If actual optimized transfers between high-overlap families consistently require higher delta-V than low-overlap families, or if the (3,2)-cycler dominance disappears under refined trajectories, the network inference method would be falsified.","tokens_in":2689,"feed_emoji":"🛰️","tokens_out":748,"duration_ms":22631,"temperature":0.7,"pith_summary":"The paper introduces a reachable-set framework to connect families of periodic orbits in the circular restricted three-body problem by measuring overlaps under finite delta-V and time-of-flight limits on a shared Jacobi energy level. This constructs a weighted network that exposes which families serve as hubs, gateways, or relays without optimizing every transfer pair. Applied to the Earth-Moon system, the network shows multi-orbiter cyclers dominating most of the budget plane, with the short-period cycler leading at low flight times and a stable resonant orbit staying isolated. The approach distinguishes direct-access regimes from multi-leg connectivity and shows that even dense binary networks carry strongly uneven weighted strengths.","feed_headline":"Cycler orbits emerge as hubs in three-body orbital networks","feed_subtitle":"Reachable-set overlaps reveal which periodic orbit families connect easily and which stay isolated under limited budgets.","key_machinery":"Reachable-set overlap geometry on a common Jacobi energy manifold used to assemble weighted orbital networks","core_discovery":"The analysis identifies multi-orbiter cycler orbits as the dominant hub, gateway, and relay families, with the (3,2)-cycler dominating across much of the sampled budget plane and the short-period (1,1)-cycler dominating in the low-time-of-flight regime, while the stable 2:1 resonant orbit remains persistently difficult to access. Although the maximum-budget network is nearly complete in a binary sense, its weighted accessibility remains strongly non-uniform. Selected proxy-supported connections are refined into concrete trajectories through differential correction, with corrected transfer costs remaining below the proxy estimates in all tested cases.","pith_inferences":["The same overlap geometry could map transport structure in other restricted three-body or multi-body systems without new exhaustive searches.","Mission planners could prioritize high-overlap families to build low-cost sequences visiting multiple orbits.","Graph measures of connectedness in the network might predict feasible multi-leg paths for spacecraft tours.","Direct comparison of the constructed network edges against published Earth-Moon transfer costs would test how well overlap predicts real accessibility."],"forward_implications":["Multi-orbiter cycler orbits function as the primary hubs, gateways, and relays across most of the budget plane.","The (3,2)-cycler provides the strongest connections over wide regions of the sampled budgets.","The short-period (1,1)-cycler becomes the dominant connector specifically in the low-time-of-flight regime.","The 2:1 resonant orbit remains persistently difficult to access even when the network is nearly complete at high budgets.","Proxy connections identified by overlaps refine into actual transfers whose costs fall below the overlap-based estimates."],"fun_headline_variants":["Cycler orbits dominate three-body orbital networks","Reachable sets map three-body orbital networks","Three-body networks show cycler hubs and isolates","Non-uniform weighted access in three-body networks","Multi-orbiter cyclers act as network hubs"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Finite-ΔV and finite-time-of-flight reachable-set overlaps can be used to infer accessibility relationships between periodic orbit families without exhaustive pairwise trajectory optimization.","fun_headline_variants_meta":{"raw":{"variants":["Cycler orbits dominate three-body orbital networks","Reachable sets map three-body orbital networks","Three-body networks show cycler hubs and isolates","Non-uniform weighted access in three-body networks","Multi-orbiter cyclers act as network hubs"]},"model":"grok-4.3","cost_usd":0.005207,"raw_usage":{"total_tokens":2567,"prompt_tokens":753,"num_sources_used":0,"completion_tokens":59,"cost_in_usd_ticks":52074500,"prompt_tokens_details":{"text_tokens":753,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1755,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":753,"tokens_out":59,"duration_ms":11476,"temperature":1.0,"reasoning_tokens":1755,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T19:52:42.067029+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"If actual optimized transfers between high-overlap families consistently require higher delta-V than low-overlap families, or if the (3,2)-cycler dominance disappears under refined trajectories, the network inference method would be falsified.","supporting_citations":[],"review_version":1}