{"id":"b2ab7d46-58e1-4923-b9ae-6067fa11f77f","arxiv_id":"1908.00394","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For r robots on a complete bipartite graph K_{n,N}, the universal cover of the configuration space is (ℓ-2)-connected at infinity but not (ℓ-1)-connected at infinity, where ℓ is an explicit function of the four parameters.","lead":"This paper computes exactly how connected the space of all possible motions of robots on a two-sided network stays, even after removing a large finite chunk. The result gives a precise formula for the connectivity at infinity of the associated braid groups, a measure of their large-scale shape.","discovery_kind":"extension","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-14T15:58:46.383904+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}