{"id":"palomar/PALOMAR-2026-10-20-000013","url":"https://github.com/shaikidris/priority-controller-phase1/tree/4defc1bfee6f82a50c5d48e6ad4fe6e01df73cc0","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-20-000013-v1.json","repo":"https://github.com/shaikidris/priority-controller-phase1","tags":["cs.DM","msc:68Q25","msc:68Q60","discrete-mathematics","detecting-sets","combinatorial-optimization","complexity"],"score":0,"title":"Forest detection and attained healthy-zero maximum weight","trust":"high","domain":"cs.DM","source":"palomar","authors":["Idris Ali Shaik"],"reviews":0,"subject":"cs.DM","summary":"Formula-forest detection execution and nonnegative-weight optimal detecting sets for healthy-zero observations. Complete source construction and word-storage proofs are supplied as checked companion modules.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"verified":true,"discussed":0,"published":"2026-10-20","reactions":{},"formalized":true,"formalizes":[{"title":"Polynomial Fault Detection Without Bounded Width: Exact Reachable Sets in Priority Controllers","identifier":"doi:10.5281/zenodo.23400057","relationship":"formalizes"}]}