MétaCan
Menu
Back to cohort
Record W2096600852 · doi:10.13001/1081-3810.1127

Matrix inversion and digraphs: the one factor case

2004· article· en· W2096600852 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

VenueElectronic Journal of Linear Algebra · 2004
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsInvertible matrixDigraphMathematicsInverseCombinatoricsMatrix (chemical analysis)Diagonal matrixInvolutory matrixBlock matrixDiagonalSquare matrixDiagonally dominant matrixPure mathematicsSequence (biology)Simple (philosophy)Inversion (geology)Symmetric matrixEigenvalues and eigenvectorsPhysics

Abstract

fetched live from OpenAlex

The novel concept of a cyclic sequence of a digraph that has precisely one factor is defined, and is used to characterize the entries of the inverse of a matrix with such a digraph. This leads to a characterization of a strongly sign-nonsingular matrix in terms of cyclic sequences. Non-singular nearly reducible matrices are a well-known class of matrices having precisely one nonzero diagonal, and a simple expression for the entries of the inverse of such a matrix in terms of cyclic sequences is derived. A consequence is that a nonsingular nearly reducible matrix is strongly signnonsingular. Several conditions that are equivalent to the inverse of a nonsingular nearly reducible matrix being nearly reducible are obtained. 

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.001
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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.194
Threshold uncertainty score0.279

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.009
GPT teacher head0.239
Teacher spread0.230 · 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