Metraipolis › archive › dc_425efe1e3703

A property-registry contract for retrieve-or-refuse thermal-mechanical lattice search — arXiv:2609.14741

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14741
License (as archived)
CC0-1.0
Archived
2026-10-15T22:53:16.630Z
SHA-256 of the archived text
ef17f9df3a49a9fbda57e9752dc6dee789b279a9d0d6d975c35641a7eeb49fb6
Stable URL of this page
https://metraipolis.com/documento/dc_425efe1e3703

How to cite

A property-registry contract for retrieve-or-refuse thermal-mechanical lattice search — arXiv:2609.14741 — arXiv (en), https://arxiv.org/abs/2609.14741 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_425efe1e3703 (Metraipolis archive dc_425efe1e3703, sha256 ef17f9df3a49a9fbda57e9752dc6dee789b279a9d0d6d975c35641a7eeb49fb6)
BibTeX
@misc{dc425efe1e3703,
  title = {A property-registry contract for retrieve-or-refuse thermal-mechanical lattice search — arXiv:2609.14741},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14741},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_425efe1e3703; sha256 ef17f9df3a49a9fbda57e9752dc6dee789b279a9d0d6d975c35641a7eeb49fb6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14741. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Early thermal-mechanical lattice requirements are knowledge-intensive and often jointly unsatisfiable: an engineer asks for a cell that is light, stiff, laterally conducting and cheap, and no cell in the library satisfies it. A design system should say so, and say which requirement to loosen and by how much, rather than return the nearest row. A generative model can return a candidate even when the library holds none. This work applies established conflict diagnosis to a catalogue of homogenised properties. Search over 1,397 homogenised unit cells and 19 base materials (26,543 combinations) returns a catalogue row that a second solver can rebuild, or, for an empty feasible set of at most eight constraints, inclusion-minimal unsatisfiable subsets (MUS) and the slack of a repair, not a neighbour. One registry declaration generates the prompt and the evaluator, so undeclared parsed keys cannot reach search. On a frozen suite of 64 typed queries, retrieve-or-refuse matches min-repair on every feasible query (48/48) and refuses every empty one (16/16) with MUS and slack. Constraint-ignoring nearest-neighbour and penalty search violate stated cost or density limits. On 216 empty queries, repairs printed at three significant figures and rounded outward stay feasible in every case (216/216). When density and cost must be kept, a list of minimum-cardinality repairs keeps them on 209 of 211 queries; a protection-first repair keeps them on all 211, the same as full diagnosis. A 308-request parse benchmark is a template-text check, not unconstrained engineer prose.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.AI).
Categorie arXiv: Computational Engineering, Finance, and Science (cs.CE) ; Materials Science (cond-mat.mtrl-sci); Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.14741 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T22:29:03.719Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).