Pith. Sign in

RECORD

Covering Array Bounds Using Analytical Techniques

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Ruyue Yuan, Zoe Koch, Anant Godbole

Combinatorics · Submitted 12 May 2014

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We will show how a combination of the Lov\'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of $t$-covering arrays, notably for $t = 3, 4$.

how it is stated · asserted 0.98 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1405.2844 (version 1)
Pith IDNGN3AYPN, Pith's permanent record of this paper and its review
CitationAnant Godbole, Ruyue Yuan, Zoe Koch. "Covering Array Bounds Using Analytical Techniques." arXiv:1405.2844 (2014). https://pith.science/paper/NGN3AYPN
Claim paper

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

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,187 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.11 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.14 · compares with prior results 0.18 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

A $t$-covering array with entries from the alphabet ${\cal Q}=\{0,1,\ldots,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\cal Q}$ appear at least once among the rows of the selected columns. We will show how a combination of the Lov\'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of $t$-covering arrays, notably for $t = 3, 4$. Here size is measured in the number of rows, as expressed in terms of the number of columns.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 A $t$-covering array with entries from the alphabet ${\cal Q}=\{0,1,\ldots,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\cal Q}$ appear at least once among the rows of the selected columns. background 1.00 0.05 0.03 asserted 1.00
s1 We will show how a combination of the Lov\'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of $t$-covering arrays, notably for $t = 3, 4$. contribution 0.78 0.89 0.76 asserted 0.98
s2 Here size is measured in the number of rows, as expressed in terms of the number of columns. background 0.81 0.28 0.04 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

A $t$-covering array with entries from the alphabet ${\cal Q}=\{0,1,\ldots,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\cal Q}$ appear at least once among the rows of the selected columns. We will show how a combination of the Lov\'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of $t$-covering arrays, notably for $t = 3, 4$. Here size is measured in the number of rows, as expressed in terms of the number of columns.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.