RECORD
New proof of a Theorem on k-hypertournament losing scores
Combinatorics · Submitted 5 Sep 2006
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7]. | contribution 1.00 | 0.92 | 0.72 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.