{"id":"7a201b21-6063-46db-abec-b088684b1cb7","arxiv_id":"2504.12013","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"DetJet and DetFlows are the first deterministic parallel hypergraph partitioners whose quality matches or beats non-deterministic state-of-the-art solvers, at a modest time cost.","lead":"This paper builds fast parallel algorithms that split large hypergraphs into balanced parts while always producing the exact same result on every run. These deterministic partitioners match the solution quality of the best non-deterministic solvers, which matters for reproducibility and for VLSI design workflows that depend on stable outputs.","discovery_kind":"new_method","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-16T12:40:48.562225+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}