MétaCan
Menu
Back to cohort
Record W1202646857 · doi:10.1515/spma-2015-0007

Completely positive matrices over Boolean algebras and their CP-rank

2015· article· en· W1202646857 on OpenAlexaff
Preeti Mohindru

Bibliographic record

VenueSpecial Matrices · 2015
Typearticle
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsMathematicsRank (graph theory)Boolean algebras canonically definedStone's representation theorem for Boolean algebrasBoolean algebraCombinatoricsTwo-element Boolean algebraAlgebra over a fieldPure mathematicsDiscrete mathematicsAlgebra representation

Abstract

fetched live from OpenAlex

Abstract Drew, Johnson and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n2/4]. In this paper, we prove this conjecture for n × n completely positive matrices over Boolean algebras (finite or infinite). In addition,we formulate various CP-rank inequalities of completely positive matrices over special semirings using semiring homomorphisms.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation 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.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0030.005
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.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.019
GPT teacher head0.238
Teacher spread0.219 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueSpecial MatricesSame topicPolynomial and algebraic computationFrench-language works237,207