{"id":"2b630766-ec4a-4e6c-882e-86af857217df","arxiv_id":"2606.17481","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"RATIO introduces continuously tunable redundancy via stochastic forwarding on reduced DAGs, achieving higher timely packet delivery ratio and better efficiency than deterministic multi-path baselines in vehicular network simulations.","lead":"The paper proposes RATIO, a new stochastic routing method for vehicular networks that builds a weighted DAG and uses per-link forwarding probabilities with a modulo rule to allow fine-tuned redundancy. A smart generalist might read it to see how wireless networks can trade off reliability against congestion in fast-moving environments like connected cars.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"H-RATIO local iterations' closeness to idealized load-minimizing optimum under mobility unquantified","rationale":"The reader's weakest_assumption pinpoints the exact transition from idealized model to practical heuristic that the performance claims depend on; no stronger internal inconsistency or simulation artifact is visible from the abstract and description.","tokens_in":1817,"tokens_out":281,"duration_ms":15383,"concrete_test":"Extract 20 static snapshots from the SUMO traces at different densities; for each, solve the idealized load-minimizing optimization on the reduced DAG (using an off-the-shelf solver on the resulting LP) and compare the resulting per-link probabilities and achieved load/reliability against H-RATIO outputs on the identical snapshot; deviation >15% in aggregate load for >30% of snapshots would indicate the heuristic assumption is weak.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on H-RATIO's local scoring and replication-adjustment iterations producing forwarding probabilities close to the load-minimizing optimum of the idealized formulation. The paper explicitly notes the optimization is intractable under time-varying dynamics and therefore adopts the heuristic, yet supplies neither approximation bounds nor direct empirical comparisons (e.g., on frozen snapshots) between heuristic outputs and optimal solutions. Simulation superiority versus baselines therefore does not confirm that the stochastic redundancy control itself is near-optimal.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper proposes RATIO, a stochastic multi-hop routing scheme for vehicular networks that builds a weighted reduced DAG with per-link forwarding probabilities and employs a modulo-based stochastic rule at forks to enable continuously tunable redundancy (aggregate probability >1). An idealized formulation minimizes load subject to timely-reliability and capacity constraints, but is intractable under dynamics; the practical H-RATIO heuristic uses local scoring and replication-adjustment iterations on the union of candidate paths. Trace-driven SUMO/ns-3 co-simulations are reported to show RATIO/H-RATIO attaining the highest timely PDR and superior delivery efficiency versus baselines, especially under high load.","tokens_in":1913,"tokens_out":518,"duration_ms":25697,"significance":"If the central claim holds, the work would demonstrate a practical method for continuously controllable redundancy that improves the reliability-efficiency trade-off in highly dynamic vehicular settings relative to deterministic replication. The stochastic forwarding rule and reduced-DAG construction are technically interesting contributions to the routing literature.","major_comments":[{"comment":"The transition from the idealized load-minimizing optimization to the H-RATIO heuristic (the section describing local scoring and replication-adjustment iterations) asserts that the heuristic produces forwarding probabilities close to the optimum under time-varying conditions, yet provides neither approximation bounds nor direct empirical comparisons (e.g., on frozen network snapshots) between heuristic outputs and solutions of the idealized problem. This assumption is load-bearing for interpreting the simulation gains as evidence for the stochastic redundancy-control mechanism itself.","section":"H-RATIO heuristic description"},{"comment":"The evaluation section reports that RATIO/H-RATIO consistently achieves the highest timely PDR and substantially better delivery efficiency, but supplies no information on baseline definitions, whether heuristic parameters were tuned on the same traces used for evaluation, statistical significance tests, or error bars across runs. These omissions directly affect the strength of the empirical support for the central performance claim.","section":"Evaluation / simulation results"}],"minor_comments":[{"comment":"The definition and motivation of the modulo-based stochastic forwarding rule would benefit from an explicit small example showing how aggregate probability >1 is realized without violating per-link feasibility.","section":"RATIO design"},{"comment":"Notation for the per-link forwarding probabilities and the reduced DAG construction could be made more uniform between the idealized formulation and the H-RATIO description.","section":"Notation and formulation"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive feedback. We address each major comment below, providing clarifications and committing to revisions that strengthen the manuscript.","responses":[{"response":"We agree that the manuscript lacks both approximation bounds and direct empirical comparisons between H-RATIO and the idealized formulation. Deriving theoretical bounds remains challenging given the dynamic setting, but we will add empirical comparisons on frozen network snapshots in the revision. This will involve extracting static instances from the traces, solving the idealized optimization on those snapshots, and reporting the resulting probability and load differences relative to H-RATIO outputs.","revision_made":"yes","referee_comment":"[H-RATIO heuristic description] The transition from the idealized load-minimizing optimization to the H-RATIO heuristic (the section describing local scoring and replication-adjustment iterations) asserts that the heuristic produces forwarding probabilities close to the optimum under time-varying conditions, yet provides neither approximation bounds nor direct empirical comparisons (e.g., on frozen network snapshots) between heuristic outputs and solutions of the idealized problem. This assumption is load-bearing for interpreting the simulation gains as evidence for the stochastic redundancy-control mechanism itself."},{"response":"We will revise the evaluation section to supply the missing details: explicit definitions and citations for all baselines, confirmation that H-RATIO parameters were tuned on a disjoint validation trace set, results of statistical significance tests (e.g., paired t-tests) against baselines, and error bars showing standard deviation over ten independent runs with varied random seeds.","revision_made":"yes","referee_comment":"[Evaluation / simulation results] The evaluation section reports that RATIO/H-RATIO consistently achieves the highest timely PDR and substantially better delivery efficiency, but supplies no information on baseline definitions, whether heuristic parameters were tuned on the same traces used for evaluation, statistical significance tests, or error bars across runs. These omissions directly affect the strength of the empirical support for the central performance claim."}],"tokens_in":1482,"tokens_out":417,"duration_ms":27924,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The new piece is the forwarding rule that lets aggregate probability exceed one at fork nodes and then uses modulo arithmetic to pick which outgoing links actually carry the packet. This turns redundancy into a continuous parameter instead of integer copies. They build a weighted reduced DAG from candidate paths, then run local scoring plus replication-adjustment iterations in H-RATIO to set the per-link probabilities.\n\nThe simulations are the strongest part. Trace-driven SUMO/ns-3 runs show RATIO/H-RATIO posting the highest timely PDR while cutting overhead relative to the baselines, especially when load is high. That matches the engineering goal of balancing reliability against contention in mobile vehicular settings.\n\nThe soft spot is exactly the one flagged in the stress test. The idealized load-minimizing formulation is declared intractable under time-varying channels, so they switch to the heuristic without supplying approximation bounds or even snapshot comparisons between heuristic outputs and optimal solutions on frozen topologies. Superiority over baselines therefore does not confirm that the stochastic control itself is near the load-minimizing point; it only shows this particular implementation beats the chosen comparators.\n\nNo internal contradictions appear in the abstract or the described approach, and the evaluation uses external traces rather than fitted parameters. The work is a targeted protocol tweak rather than a broad theoretical advance.\n\nIt is aimed at people who design or simulate multi-hop routing for connected vehicles. A serious editor should send it to referees because the mechanism is distinct from prior deterministic replication and the evaluation is concrete, even though the optimality gap needs tighter evidence.","headline":"RATIO's modulo stochastic rule on reduced DAGs gives continuous redundancy control, but the heuristic's distance to the idealized optimum stays unquantified.","tokens_in":2409,"tokens_out":382,"would_cite":false,"duration_ms":18806,"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":"RATIO routing assigns per-link forwarding probabilities on a reduced DAG to control redundancy continuously instead of by integer duplication.","keywords":["vehicular networks","stochastic routing","redundancy control","multi-hop delivery","packet delivery ratio","directed acyclic graph","forwarding probabilities","ns-3 simulation"],"falsifier":"A SUMO/ns-3 trace in which channel coherence time is shortened to a few hundred milliseconds and H-RATIO timely PDR falls below that of a deterministic multi-path baseline would falsify the central claim.","tokens_in":2698,"feed_emoji":"🚗","tokens_out":672,"duration_ms":32017,"temperature":0.7,"pith_summary":"The paper develops RATIO to improve reliable low-latency multi-hop delivery in vehicular networks where mobility and blockage cause frequent route breaks. It builds a weighted reduced directed acyclic graph for each flow, sets edge weights as forwarding probabilities that may sum above one at forks, and applies a modulo-based stochastic rule to realize non-integer redundancy levels. An idealized version minimizes total load subject to per-flow timely reliability and capacity limits, but because the problem is hard under time-varying conditions a local heuristic called H-RATIO is introduced that builds the DAG from candidate paths and tunes probabilities through iterative scoring and replication adjustment. Trace-driven co-simulations with SUMO and ns-3 show the method yields the highest timely packet delivery ratio while using fewer transmissions than deterministic baselines, especially when load is high.","feed_headline":"Stochastic probabilities tune redundancy for vehicular routing","feed_subtitle":"RATIO sets per-link forwarding odds on a DAG and uses a modulo rule at branches so redundancy can vary continuously rather than in whole-pat","key_machinery":"Weighted reduced DAG whose edges carry forwarding probabilities together with the modulo-based stochastic forwarding rule at fork nodes","core_discovery":"For each active flow RATIO constructs a weighted reduced directed acyclic graph whose edge weights are per-link forwarding probabilities. At fork nodes the aggregate outgoing probability is permitted to exceed one and a modulo-based stochastic forwarding rule guarantees that each packet is sent exactly once while realizing the intended redundancy. The design is first posed as a load-minimizing optimization subject to timely-reliability and link-capacity constraints; because the full problem is intractable under dynamic wireless conditions, the practical H-RATIO heuristic solves it approximately by successive local scoring and replication-adjustment iterations on a compact DAG formed from the","pith_inferences":["The same probability-based control could be tested in other mobile ad-hoc settings such as drone swarms where topology changes are also rapid.","Adding explicit prediction of link quality into the local scoring step might reduce the gap between the heuristic and the idealized optimum.","Running the method on hardware testbeds with real 802.11p radios would show how closely the simulated efficiency gains survive hardware timing and interference effects."],"forward_implications":["Timely packet delivery ratio exceeds that of conventional deterministic replication schemes.","Transmission overhead drops especially under high offered load because redundancy is not forced to integer multiples of whole paths.","Forwarding decisions remain feasible at every node while the total load stays within link capacities.","Redundancy level can be varied continuously rather than in discrete steps, allowing adaptation to instantaneous network state."],"fun_headline_variants":["RATIO routes via weighted DAG probabilities for vehicular redundancy control","Stochastic per-link odds on DAG enable tunable redundancy in vehicle networks","Modulo rule allows continuous redundancy without integer packet duplication","H-RATIO optimizes local forwarding probs for reliable multi-hop vehicular delivery","Reduced DAG with stochastic edges balances load and timely reliability in VANETs"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The local scoring and replication-adjustment iterations in H-RATIO keep the chosen forwarding probabilities close to the global load-minimizing optimum even when wireless channels and vehicle positions change over time.","fun_headline_variants_meta":{"raw":{"variants":["RATIO routes via weighted DAG probabilities for vehicular redundancy control","Stochastic per-link odds on DAG enable tunable redundancy in vehicle networks","Modulo rule allows continuous redundancy without integer packet duplication","H-RATIO optimizes local forwarding probs for reliable multi-hop vehicular delivery","Reduced DAG with stochastic edges balances load and timely reliability in VANETs"]},"model":"grok-4.3","cost_usd":0.003536,"raw_usage":{"total_tokens":1913,"prompt_tokens":782,"num_sources_used":0,"completion_tokens":84,"cost_in_usd_ticks":35362000,"prompt_tokens_details":{"text_tokens":782,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1047,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":782,"tokens_out":84,"duration_ms":10097,"temperature":1.0,"reasoning_tokens":1047,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T22:50:46.294055+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A SUMO/ns-3 trace in which channel coherence time is shortened to a few hundred milliseconds and H-RATIO timely PDR falls below that of a deterministic multi-path baseline would falsify the central claim.","supporting_citations":[],"review_version":1}