MétaCan
Menu
Back to cohort
Record W4396243272 · doi:10.1107/s2053273324002432

Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (<i>T</i>O<sub>4</sub>)<sup> <i>n</i>−</sup> tetrahedra

2024· article· en· W4396243272 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueActa Crystallographica Section A Foundations and Advances · 2024
Typearticle
Languageen
FieldComputer Science
TopicDigital Image Processing Techniques
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Manitoba
KeywordsRibbonTetrahedronTube (container)Chain (unit)CrystallographyTopology (electrical circuits)Materials sciencePhysicsCombinatoricsComposite materialChemistryMathematics

Abstract

fetched live from OpenAlex

In Part I of this series, all topologically possible 1-periodic infinite graphs (chain graphs) representing chains of tetrahedra with up to 6–8 vertices (tetrahedra) per repeat unit were generated. This paper examines possible restraints on embedding these chain graphs into Euclidean space such that they are compatible with the metrics of chains of tetrahedra in observed crystal structures. Chain-silicate minerals with T = Si 4+ (plus P 5+ , V 5+ , As 5+ , Al 3+ , Fe 3+ , B 3+ , Be 2+ , Zn 2+ and Mg 2+ ) have a grand nearest-neighbour 〈 T – T 〉 distance of 3.06±0.15 Å and a minimum T ... T separation of 3.71 Å between non-nearest-neighbour tetrahedra, and in order for embedded chain graphs (called unit-distance graphs) to be possible atomic arrangements in crystals, they must conform to these metrics, a process termed equalization . It is shown that equalization of all acyclic chain graphs is possible in 2D and 3D, and that equalization of most cyclic chain graphs is possible in 3D but not necessarily in 2D. All unique ways in which non-isomorphic vertices may be moved are designated modes of geometric modification . If a mode ( m ) is applied to an equalized unit-distance graph such that a new geometrically distinct unit-distance graph is produced without changing the lengths of any edges, the mode is designated as valid ( m v ); if a new geometrically distinct unit-distance graph cannot be produced, the mode is invalid ( m i ). The parameters m v and m i are used to define ranges of rigidity of the unit-distance graphs, and are related to the edge-to-vertex ratio, e / n , of the parent chain graph. The program GraphT – T was developed to embed any chain graph into Euclidean space subject to the metric restraints on T – T and T ... T . Embedding a selection of chain graphs with differing e / n ratios shows that the principal reason why many topologically possible chains cannot occur in crystal structures is due to violation of the requirement that T ... T &gt; 3.71 Å. Such a restraint becomes increasingly restrictive as e / n increases and indicates why chains with stoichiometry T O &lt;2.5 do not occur in crystal structures.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.437
Threshold uncertainty score0.690

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.006
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.011
GPT teacher head0.259
Teacher spread0.248 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it