Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint
Data sources: ZENODO
addClaim

What a Finite Expected Spectrum Can Identify (unrefereed candidate)

Authors: Anonymous;

What a Finite Expected Spectrum Can Identify (unrefereed candidate)

Abstract

A bounded theorem and replayable package for exact expected-SFS identification, sharp calendar targets and folded-SFS estimands. This additive version repairs the PDF presentation and records a formula-first priority correction: Myers, Fefferman and Patterson (2008) already establish calendar/genetic-time separation, positive same-spectrum histories and exponential projection structure; Bhaskar and Song (2014) supply the finite Laplace coordinates, SFS bridge, scale equivalence and folded parity. The target-specific sharp-window synthesis is not presented as a first discovery. The result does not identify complete linked genomic laws or adjudicate the ancient human bottleneck. Producer replay, 120 tests and hostile controls establish bounded internal consistency, not unaffiliated reproduction, formal verification, specialist review or editorial peer review.

Powered by OpenAIRE graph
Found an issue? Give us feedback