{"id":"7ee7d9c7-58fc-44da-a103-75a80fa8962b","arxiv_id":"2607.14324","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":7,"one_line_summary":"In hybrid HCF/SMF networks, bounded-detour transition-aware routing (BD-TPAR) cuts fiber-type transitions by ~11% at a ~1% throughput cost, and the best scheme depends on the operator's transition-to-throughput exchange rate.","lead":"This simulation study compares six routing schemes for hybrid hollow-core/single-mode fiber networks and finds that two new intermediate schemes, GMR-T and BD-TPAR, reduce fiber-type transitions by 11-22% at a throughput cost of only 1-3%, while aggressive minimizers halve transitions but lose 20-25% of carried traffic. A smart generalist might read it for the practical decision rule mapping an operator's transition cost to the best routing choice.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Decision rule hinges on unvalidated β=0.60 in HC1; no β sweep, so κ breakpoints may shift","rationale":"The reader's weakest-assumption analysis correctly identifies the HC1 latency-asymmetry constraint as the dominant blocking mechanism and flags β=0.60 as an unvalidated constant. This is the single most load-bearing concern because the paper's central deliverable is a numerical decision rule with specific κ thresholds, and those thresholds are governed by the carried-traffic penalties of TPAR/GFJ, which the paper itself attributes to HC1. A change in β would directly alter the utility lines in Eq. (9) and could move the breakpoints, undermining the operator guidance. The paper does not sweep β or cite a transponder buffer specification, so the concern is not merely theoretical. The rest of the study is internally consistent: paired seeds, confidence intervals, and a sensitivity sweep for ηtrans are provided, and the qualitative ranking (BD-TPAR/GMR-T as intermediate, TPAR/GFJ as expensive minimizers) is plausible. But the quantitative thresholds lack robustness evidence. Therefore the reader's CONDITIONAL verdict remains appropriate; no verdict change is needed, and the concrete test above would either validate the decision rule or show that it needs reparameterization.","tokens_in":16484,"tokens_out":6714,"duration_ms":68288,"concrete_test":"Sweep β over a plausible range, e.g., {0.2, 0.4, 0.6, 0.8, 1.0}, at 50% HCF and 300 Erlang on CORONET and at least one other topology (e.g., NSFNET), holding all else fixed. Recompute the carried-traffic lifts (Fig. 3c), transition counts (Fig. 3b), and the Eq. (9) κ breakpoints. If the breakpoints move by more than ~5 units (e.g., the BD-TPAR/GMR-T boundary leaves the 9–16 range) or the TPAR/GFJ ordering changes, the decision rule is not robust to the unvalidated constant. Additionally, check whether the HC1 rejection share stays in the 69–75% range across β; if HC1 ceases to dominate, the paper's explanation of the trade-off loses its basis.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central decision rule (Eq. 9 and the κ breakpoints) is built from carried-traffic penalties whose dominant cause is the HC1 latency-asymmetry constraint. Eq. (3) fixes Δτmax = 0.60 × mean shortest-path length × (1/vg,SMF − 1/vg,HCF). The constant β=0.60 is introduced without derivation or citation to transponder differential-delay buffer specifications, and Section 5 reports no β sweep. Because HC1 accounts for 69–75% of rejections on CORONET (Section F) and is specifically the reason TPAR/GFJ lose 20–25% carried traffic (Discussion, Section B), any error in β directly rescales the utility differences in Eq. (9). For example, a larger buffer would relax HC1, likely reducing TPAR/GFJ's penalty and shifting the κ≥40 and κ≥77 thresholds downward; a smaller buffer would do the opposite. The paper's claim that an operator can map κ to a single best scheme therefore depends on an unvalidated numerical constant that is not tested. The ηtrans sweep does not cover this because ηtrans affects feasibility uniformly, whereas β differentially changes the blocking mechanism that separates the aggressive minimizers from the baselines.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies routing in hybrid hollow-core/single-mode fiber networks, where each HCF-SMF transition carries a physical-layer penalty. Using a common event-driven simulator with paired seeds and 95% confidence intervals, it compares six protected routing schemes over six topologies, five HCF deployment fractions, and dynamic loads. The central findings are that aggressive transition-minimizing schemes (TPAR, GFJ) roughly halve per-demand transitions at a 20-25% carried-traffic penalty; intermediate schemes (GMR-T, BD-TPAR) offer smaller transition reductions at much lower cost; and a decision rule based on an operator-supplied transition-to-throughput exchange rate κ selects among schemes. The paper also presents L-band and availability cross-checks and a sensitivity sweep of the per-transition GSNR penalty ηtrans.","tokens_in":16770,"tokens_out":3360,"duration_ms":38614,"significance":"If the results hold, the paper provides a useful, directly actionable rule for operators choosing among transition-aware routing schemes in hybrid fiber networks. The strengths of the work are its controlled experimental design: all schemes share the same seeds, topologies, and demand realizations; the block-reason decomposition identifies the dominant blocking mechanism; the ηtrans sweep and the L-band/availability cross-checks test the sensitivity of the main conclusions; and the decision rule is a clear, falsifiable output. The paper is honest about the exploratory nature of several modeling choices, and it explicitly distinguishes measured parameters from conservative estimates.","major_comments":[{"comment":"The decision rule of Eq. (9) and the stated κ breakpoints depend on the carried-traffic penalties of TPAR/GFJ, which the paper attributes primarily to the latency-asymmetry hard constraint HC1. Eq. (3) fixes Δτmax = 0.60 × mean shortest-path length × group-delay gap, and the constant β=0.60 is introduced without derivation, citation, or a companion sweep. Fig. 7 shows that HC1 accounts for 69-75% of rejections on CORONET, so the magnitude of the TPAR/GFJ penalty is directly set by an unvalidated constant. A larger differential-delay buffer would relax HC1 and likely reduce the TPAR/GFJ penalty, shifting the κ≥40 and κ≥77 thresholds downward; a smaller buffer would do the opposite. The ηtrans sweep does not cover this concern because ηtrans affects feasibility uniformly while β changes the dominant blocking mechanism that separates the aggressive minimizers from the baselines. Please just","section":"Section 2.D, Eq. (3); Section 5.F, Fig. 7; Section 6.B"},{"comment":"The breakpoints κ=9, 16, 40, and 77 are computed from the point estimates ws and n̄s in Fig. 3, which are six-topology means at a single operating point (50% HCF, 300 Erlang). The carried-traffic differences among DA-RSA, BD-TPAR, and GMR-T are small (about -1.2% to -3.5%), and the paper itself states that per-topology differences among the four leading schemes are modest at 95% confidence. The breakpoints that separate DA-RSA/BD-TPAR/GMR-T are therefore likely to be sensitive to seed noise and to the choice of averaging, yet no uncertainty propagation or sensitivity analysis of the breakpoints is reported. At minimum, report confidence intervals for the crossing points or show that the region boundaries are robust across topologies rather than relying on pooled means.","section":"Section 6.B; Fig. 3(c)"}],"minor_comments":[{"comment":"Several internal cross-references appear to point to non-existent or ambiguous sections: e.g., Section 2.C refers to the ηtrans sweep as 'Section E' when the sweep appears in Section 5.E; Section 5.B refers to 'Section D' for contiguous rollout; Section 5.F is sometimes called 'Section F' in the text. The manuscript would benefit from consistent, resolved section numbering.","section":"Throughout"},{"comment":"There is an unresolved placeholder reference in the text: 'gain-control loops must suppress [?]'. If this is meant to be a citation, it should be filled in before publication.","section":"Section 2.C"},{"comment":"The y-axis label 'Block-reason rate' is ambiguous: the four stacked components appear to sum to the total blocking probability, but the reader has to infer this. Please clarify whether these are rates as a fraction of all demands or as a fraction of blocked demands, and add the total blocking probability to the figure or caption.","section":"Fig. 7"},{"comment":"The light-load claim that middle-ground schemes edge ahead of DA-RSA by +2 to +3% at 50-100 Erlang is not shown in a figure. A corresponding plot or at least a table would make the claim verifiable.","section":"Section 6.B"},{"comment":"The data availability statement indicates that data are not publicly available. Given the paper's contribution is a decision rule derived from simulation, releasing the simulator or the per-seed results would substantially strengthen reproducibility.","section":"Data availability"}],"recommendation":"major_revision","confidential_remarks":"The paper is a solid simulation study with a clear practical message, but the central decision rule is built on a hard-constraint constant β that is neither measured nor swept. The authors should treat the β calibration as a first-class input and either justify it from transponder differential-delay buffer specifications or provide a sensitivity analysis. The second concern about uncertainty in the κ breakpoints is also worth addressing, since the small throughput differences among the leading schemes may not support sharp thresholds."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThis paper is a genuinely useful simulation study of transition-aware routing in hybrid HCF/SMF networks. The two new schemes—GMR-T and BD-TPAR—fill a real gap between transition-blind and aggressive transition-minimizing routing, and the experimental design is careful: paired seeds, confidence intervals, six topologies, five HCF fractions, several loads, and honest sensitivity sweeps for the per-transition penalty eta_trans. BD-TPAR's roughly 11% transition cut at about 1% throughput cost is a result worth having.\n\nThe main soft spot is Eq. (3). The latency-asymmetry bound HC1 sets Delta_tau_max = 0.60 times a topology-scaled group-delay gap, and beta=0.60 is introduced without derivation or reference to transponder buffer specifications. This matters because HC1 accounts for 69–75% of blocking on CORONET at 300 Erlang, and it is the dominant reason TPAR and GFJ lose 20–25% of carried traffic. The paper sweeps eta_trans but not beta. If the real buffer is larger than what beta=0.60 implies, the aggressive minimizers' penalty shrinks and the kappa breakpoints in the decision rule move down; if smaller, they move up. The qualitative finding that intermediate schemes are attractive survives, but the specific breakpoints (40 and 77) should not be taken as calibrated.\n\nTwo smaller gaps: the missing citation placeholder ('[?]' in Section 2.C) is a polish issue, and the lack of released code or data makes the quantitative claims hard to check independently. \"Available on request\" is not the same as shipping the artifacts.\n\nFor whom: anyone working on routing for mixed-fiber networks or planning incremental HCF deployment. It deserves a serious referee. I would ask for at least a beta sensitivity sweep and ideally the seed/parameter files. I would cite it for the schemes and the exchange-rate framing, but not quote the kappa breakpoints without the sensitivity check.\n\nBest,\n[You]","headline":"A carefully run simulation study whose two new middle-ground schemes and exchange-rate framing are useful, but the decision-rule breakpoints rest on an unvalidated beta=0.60 in the dominant blocking constraint and need a sensitivity sweep before they are quoted.","tokens_in":17282,"tokens_out":3640,"would_cite":true,"duration_ms":38359,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"In hybrid hollow-core/single-mode fiber networks, the best protected routing scheme is determined by a single operator parameter: the exchange rate κ between transitions avoided and throughput lost.","keywords":["hollow-core fiber","single-mode fiber","routing and spectrum assignment","GSNR","transition penalty","dynamic provisioning","protected lightpaths","decision rule"],"falsifier":"Measure the differential-delay tolerance of a production 1+1 coherent transponder on a hybrid HCF/SMF link: if the receiver can realign working and protection copies with delay asymmetry larger than the paper's Δτmax (β=0.60) without bit errors, then the HC1 blocking fraction in Fig. 7 should fall and the carried-traffic penalty of TPAR/GFJ should drop below 20–25%, invalidating the κ thresholds that depend on it.","tokens_in":16321,"feed_emoji":"⚖️","tokens_out":9736,"duration_ms":93599,"temperature":0.7,"pith_summary":"The paper tackles a routing problem that appears only when a network mixes hollow-core fiber (HCF) with standard single-mode fiber (SMF): every HCF–SMF handover costs physical-layer margin, but avoiding handovers forces detours that waste spectrum. Using an event-driven simulator with a per-transition GSNR (generalized signal-to-noise ratio) penalty, six protected routing schemes are compared across six topologies and five HCF deployment fractions. Two newly introduced middle-ground schemes—GMR-T, which reranks GSNR-optimal candidates by transition count, and BD-TPAR, which bounds detours to 20%—cut transitions by roughly 22% and 11% at only 3% and 1% throughput cost, while the aggressive minimizers TPAR (transition-penalty-aware routing) and GFJ (joint GSNR-fiber-transition scheme) halve transitions at a 20–25% cost. The paper's key practical output is a piecewise decision rule mapping an operator's transition-to-throughput exchange rate κ to one of five schemes, and the finding that contiguous HCF deployment reduces transitions by ~40% on average while improving carried traffic.","feed_headline":"One exchange rate decides which routing scheme wins in hybrid fiber","feed_subtitle":"The transition-to-throughput exchange rate κ tells an operator when avoiding fiber handovers is worth the detour.","key_machinery":"The state-augmented graph used by TPAR and GFJ: each physical node is duplicated as (node, incoming-fiber-type), so an edge cost becomes link length (or inverse GSNR) plus a transition penalty matrix P[HCF→SMF, SMF→HCF] that charges every fiber-type handover. Around this, the decision rule is the upper envelope of six utility lines Us = ws + κ(n̄DA-RSA − n̄s), where ws is carried-traffic lift over DA-RSA and n̄s is mean transitions per accepted demand; the crossing points of those lines define the five κ regions.","core_discovery":"The central claim is that transition-aware routing in hybrid HCF/SMF networks is not a binary choice — the right scheme depends on how much a transition costs the operator relative to a unit of carried traffic. Concretely, the paper models each HCF↔SMF crossing with a calibrated 0.4 dB GSNR penalty and a hard latency-asymmetry constraint, then shows that pure transition minimizers (TPAR, GFJ) halve the mean transition count but sacrifice 20–25% of carried traffic, mostly because they trip the latency-asymmetry gate (HC1). The introduced middle-ground schemes avoid most of that penalty: BD-TPAR (−11% transitions, −1.2% throughput) and GMR-T (−22%, −3%). These numbers feed a linear utility mod","pith_inferences":["The upper-envelope decision method is not specific to fiber transitions: the same utility-line construction could price other additive per-route costs (security checkpoints, regulatory boundaries, maintenance-heavy segments) in any network.","Because the 20–25% penalty of TPAR/GFJ is driven by the assumed receiver buffer budget β=0.60 in Eq. (3), a transponder with a larger differential-delay tolerance would likely rescue much of that throughput loss and shift the κ thresholds downward; this is testable against public DSP buffer specifications.","The small (~4%) transition reduction of pure GMR suggests that GSNR awareness alone does not avoid fiber crossings, so an operator running GSNR-only routing in a hybrid plant is systematically leaving transition savings unclaimed — explicit transition terms are needed.","Contiguous deployment achieves transition reductions comparable to the most aggressive routing schemes without their throughput penalty, implying deployment order and routing weight could be co-optimized to reach the same gain at lower routing complexity."],"forward_implications":["An operator needs to estimate only one number, κ, to choose among DA-RSA, BD-TPAR, GMR-T, TPAR, and GFJ; no per-topology recalibration is required for the choice.","Under fragmented (random) HCF rollout, BD-TPAR is the practical default at ~11% fewer transitions for ~1% throughput cost, with GMR-T as a lower-complexity fallback offering ~22% for ~3%.","Contiguous HCF deployment is a stronger lever than any routing scheme, cutting transitions by 23–54% (mean ~42%) while raising carried traffic, so rollout planning should prioritize geographic clustering before tuning routing.","The scheme ordering and κ-based rule persist in the L-band under a band-averaged CO2 absorption penalty, so the decision applies across both C- and L-band transmission.","At heavy load, latency-asymmetry rejection (HC1), not spectrum scarcity, is the dominant blocking mechanism, implying that hardware improvements in receiver differential-delay buffering would reshape the throughput trade-off landscape."],"fun_headline_variants":["Hybrid fiber: 11% fewer handoffs for 1% throughput","Transition cost, not aversion, decides best hybrid fiber route","Hybrid fiber routing: avoid handoffs only if they're expensive","In hybrid fiber, routing choice hinges on handoff cost","Fiber handoffs: 11% cut for 1% throughput, or 22% for 3%?"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The central trade-off's magnitude rests on the hard latency-asymmetry limit Δτmax = 0.60 × mean shortest-path length × (1/vg,SMF − 1/vg,HCF), which is assumed to model receiver buffer capability and drives 69–75% of blocking at 300 Erlang; if real transponders allow more than 60% of that worst-case delay gap, the throughput penalty of transition-minimizing schemes shrinks and the decision-rule thresholds change.","fun_headline_variants_meta":{"raw":{"variants":["Hybrid fiber: 11% fewer handoffs for 1% throughput","Transition cost, not aversion, decides best hybrid fiber route","Hybrid fiber routing: avoid handoffs only if they're expensive","In hybrid fiber, routing choice hinges on handoff cost","Fiber handoffs: 11% cut for 1% throughput, or 22% for 3%?"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000719,"raw_usage":{"total_tokens":3133,"prompt_tokens":882,"completion_tokens":2251,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":626,"completion_tokens_details":{"reasoning_tokens":2152}},"tokens_in":626,"tokens_out":2251,"duration_ms":18797,"temperature":1.0,"reasoning_tokens":2152,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T02:25:46.270085+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Measure the differential-delay tolerance of a production 1+1 coherent transponder on a hybrid HCF/SMF link: if the receiver can realign working and protection copies with delay asymmetry larger than the paper's Δτmax (β=0.60) without bit errors, then the HC1 blocking fraction in Fig. 7 should fall and the carried-traffic penalty of TPAR/GFJ should drop below 20–25%, invalidating the κ thresholds that depend on it.","supporting_citations":[],"review_version":1}