MétaCan
Menu
Back to cohort
Record W2065441330 · doi:10.1145/2608628.2608640

Unimodular completion of polynomial matrices

2014· article· en· W2065441330 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsUnimodular matrixCombinatoricsMathematicsMatrix completionMatrix (chemical analysis)ExponentUnivariateField (mathematics)Matrix multiplicationMultiplication (music)Column (typography)Discrete mathematicsStatisticsPure mathematicsPhysicsConnection (principal bundle)Geometry

Abstract

fetched live from OpenAlex

Given a rectangular matrix F ∈ K[x]mxn with m < n of univariate polynomials over a field K. we give an efficient algorithm for computing a unimodular completion of F. Our algorithm is deterministic and computes such a completion, when it exists, with cost O~ (nωs) field operations from K. Here s is the average of the m largest column degrees of F and ω is the exponent on the cost of matrix multiplication. Here O~ is big-O but with log factors removed. If a unimodular completion does not exist for F, our algorithm computes a unimodular completion for a right cofactor of a column basis of F, or equivalently, computes a completion that preserves the generalized determinant.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.842
Threshold uncertainty score0.188

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.213
Teacher spread0.205 · 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

Quick stats

Citations17
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicPolynomial and algebraic computationFrench-language works237,207