MétaCan
Menu
Back to cohort
Record W2153235257 · doi:10.4086/toc.2009.v005a011

[no title]

2009· article· en· W2153235257 on OpenAlexfundno aff
John Watrous

Bibliographic record

VenueTheory of Computing · 2009
Typearticle
Languageen
FieldMathematics
TopicAdvanced Optimization Algorithms Research
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaCanadian Institute for Advanced Research
KeywordsMathematical proofTRACE (psycholinguistics)Bounded functionMathematicsSemidefinite programmingPure mathematicsDiscrete mathematicsAlgebra over a fieldMathematical optimizationMathematical analysis

Abstract

fetched live from OpenAlex

The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate proofs of some known facts about them.

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.001
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.992
Threshold uncertainty score0.000

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0080.002

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.062
GPT teacher head0.389
Teacher spread0.327 · 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.

Study designNot applicable
Domainnot available
GenreOther

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

Citations198
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueTheory of ComputingSame topicAdvanced Optimization Algorithms ResearchFrench-language works237,207