Pith. sign in

REVIEW 1 cited by

The Bowl Championship Series: A Mathematical Review

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv physics/0403049 v1 pith:335TNPC3 submitted 2004-03-07 physics.pop-ph physics.data-an

Thomas Callaghan , Peter J. Mucha , Mason A. Porter This is my paper · ORCID
classification physics.pop-phphysics.data-an
keywords bowlchampionshipseriesaccessadditionalgorithmalgorithmsarguing
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We discuss individual components of the college football Bowl Championship Series, compare with a simple algorithm defined by random walks on a biased graph, attempt to predict whether the proposed changes will truly lead to increased BCS bowl access for non-BCS schools, and conclude by arguing that the true problem with the BCS Standings lies not in the computer algorithms, but rather in misguided addition.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ranking Unraveled: Recipes for LLM Rankings in Head-to-Head AI Combat

    cs.CL 2024-11 conditional novelty 4.0 of 10

    On the Chatbot Arena and SLAM datasets, Elo is hyperparameter-sensitive and order-unstable, while Bradley-Terry preserves transitivity best and Glicko offers the most stable accuracy.

Pith tools