The lower-bound conjecture for DET:IC density in cubic graphs

Let $G$ be a cubic graph, and let DET:IC%$(G)$ denote the minimum density of a deterministic error-detecting identifying code in $G$. Lower-bound conjecture.

$$\textrm{DET:IC\%}(G) \ge \frac{3}{4}.$$

The paper identifies $\frac{3}{4}$ as the lowest value found for cubic graphs and exhibits infinite families attaining this density. Whether every cubic graph satisfies the bound remains conjectural in the provided text.