# A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments

Source: [A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments](<https://www.sota2.com/research/paper/68fa58901e209131ce9af6c4>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:24:38.666Z

Authors: Paul K. Stockmeyer

Published: 2021-10-12T16:52:37.000Z

## Abstract

Continuing the program begun in the first paper of this series, we present a pair of non-reconstructable tournament on $p$ vertices for each $p=2^n \\ge 4$.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2110.06158>)

[PDF](<https://arxiv.org/pdf/2110.06158.pdf>)
