MétaCan
Menu
Back to cohort
Record W4224209627 · doi:10.1145/3532737.3532746

Guest Column

2022· article· en· W4224209627 on OpenAlexaff
Susanna F. de Rezende, Mika Göös, Robert Robere

Bibliographic record

VenueACM SIGACT News · 2022
Typearticle
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer sciencePerspective (graphical)Communication complexityTheoretical computer scienceColumn (typography)Circuit complexityUpper and lower boundsComputational complexity theoryMathematicsAlgorithmArtificial intelligenceElectronic circuit

Abstract

fetched live from OpenAlex

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search problems (TFNP) as a unifying language for these connections and discuss how this perspective suggests a whole programme for further research.

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.010
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: Not applicable
GenreCandidate signal: Editorial · Consensus signal: none
Teacher disagreement score0.790
Threshold uncertainty score0.300

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.003
Science and technology studies0.0020.001
Scholarly communication0.0070.004
Open science0.0020.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.7900.725

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.030
GPT teacher head0.252
Teacher spread0.222 · 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
GenreEditorial

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

Citations6
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueACM SIGACT NewsSame topicComplexity and Algorithms in GraphsFrench-language works237,207