Pith. sign in

Title resolution pending

[1] N · 2015

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Noisy Corruption Detection

math.CO · 2019-08-20 · conditional · novelty 7.0

For the noisy corruption detection game on constant-degree expanders, Θ(n log n) queries are necessary and sufficient when the truthful majority is small, while O(n) queries suffice when the truthful fraction is at least 1/2+δ.

citing papers explorer

Showing 1 of 1 citing paper.

  • Noisy Corruption Detection math.CO · 2019-08-20 · conditional · none · ref 1

    For the noisy corruption detection game on constant-degree expanders, Θ(n log n) queries are necessary and sufficient when the truthful majority is small, while O(n) queries suffice when the truthful fraction is at least 1/2+δ.