{"id":"86b9398f-f215-4ced-87d7-622e70ac014a","arxiv_id":"2505.14046","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"A temporal graph in which every edge appears at least once every F timesteps can be explored in F(2n-3) steps, and this is tight up to an additive constant.","lead":"This paper proves that a time-varying network can be explored by a moving agent in a number of steps bounded by how often the least frequent connection reappears, with a near-matching lower bound. The result gives simple worst-case timing guarantees for transport, communication, and periodic networks.","discovery_kind":"new_application","skeptic_critique":null,"referee_report":null,"author_rebuttal":null,"desk_editor":null,"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-08-07T15:43:55.714010+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}