{"ID":2825815,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.20311","arxiv_id":"2512.20311","title":"Algorithm for Interpretable Graph Features via Motivic Persistent Cohomology","abstract":"We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous complexity results: CPA is exponential in the worst case, fixed-parameter tractable in treewidth, and nearly linear for common graph families such as trees, cycles, and series-parallel graphs. Finally, we demonstrate its practical applicability through a controlled experiment on molecular-like graph structures.","short_abstract":"We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous complexity results: CPA is exponential in the worst case, fixed-parameter tractabl...","url_abs":"https://arxiv.org/abs/2512.20311","url_pdf":"https://arxiv.org/pdf/2512.20311v1","authors":"[\"Yoshihiro Maruyama\"]","published":"2025-12-23T12:29:58Z","proceeding":"cs.CG","tasks":"[\"cs.CG\",\"cs.DM\",\"cs.LG\"]","methods":"[]","has_code":false}