MétaCan
Menu
Back to cohort
Record W2396989770

Bounded-depth Frege lower bounds for weaker pigeonhole principles

2002· article· en· W2396989770 on OpenAlexaff
J. Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsPigeonhole principleBounded functionMathematical proofLemma (botany)MathematicsUpper and lower boundsTautology (logic)Discrete mathematicsArgument (complex analysis)CombinatoricsComputer scienceMathematical analysis
DOInot available

Abstract

fetched live from OpenAlex

We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPmn where m = (1 + 1/polylog n)n. This lower bound qualitatively matches the known quasi-polynomial-size bounded-depth Frege proofs for these principles. Our technique, which uses a switching lemma argument like other lower bounds for bounded-depth Frege proofs, is novel in that the tautology to which this switching lemma is applied remains random throughout the argument.

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.009
metaresearch head score (Gemma)0.057
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: none
Teacher disagreement score0.029
Threshold uncertainty score0.098

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.057
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.005
Bibliometrics0.0030.002
Science and technology studies0.0040.007
Scholarly communication0.0060.032
Open science0.0050.011
Research integrity0.0030.014
Insufficient payload (model declined to judge)0.0290.004

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.070
GPT teacher head0.254
Teacher spread0.184 · 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

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicComplexity and Algorithms in GraphsFrench-language works237,207