claim
active
claim:self-correcting-search-is-pareto-optimal-across-tested-conditioning-strengths

Self-correcting search is Pareto-optimal across tested conditioning strengths.

Asserts that the method maintains efficiency across a range of constraint strengths without degradation.

Source paper

extracted_from
Using Self-Correcting Search to Accelerate Materials Discovery
(2026) · Dron Hazra · Adeesh Kolluru · Mark Bissell · Delia McGrath +2

Neighborhood — ranked by edge-count

Findings (2)

finding

Communities (3)

community

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.