MétaCan
Menu
Back to cohort
Record W4400004372 · doi:10.1137/23m1603856

Erratum: Multitasking Capacity: Hardness Results and Improved Constructions

2024· erratum· en· W4400004372 on OpenAlexaff
Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner

Bibliographic record

VenueSIAM Journal on Discrete Mathematics · 2024
Typeerratum
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsHuman multitaskingMathematicsCombinatoricsDiscrete mathematicsCognitive psychologyPsychology

Abstract

fetched live from OpenAlex

Abstract. We correct an error in the appendix of [N. Alon et al., SIAM J. Discrete Math., 34 (2020), pp. 885–903] and prove that it is NP-hard to approximate the size of a maximum induced matching of a bipartite graph within any constant factor.

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.003
metaresearch head score (Gemma)0.036
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.084
Threshold uncertainty score0.280

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.036
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.004
Science and technology studies0.0050.004
Scholarly communication0.0050.013
Open science0.0040.003
Research integrity0.0040.013
Insufficient payload (model declined to judge)0.0840.028

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.032
GPT teacher head0.270
Teacher spread0.238 · 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 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

Citations1
Published2024
Admission routes1
Has abstractno

Explore more

Same venueSIAM Journal on Discrete MathematicsSame topicComplexity and Algorithms in GraphsFrench-language works237,207