Pith. sign in

REVIEW 1 cited by

The Curious Case of the Diamond Network

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2107.02144 v1 pith:2UILCYEI submitted 2021-07-05 cs.IT math.COmath.IT

Allison Beemer , Alberto Ravagnani This is my paper · ORCID
classification cs.ITmath.COmath.IT
keywords networkdiamondboundscapacitycut-setgivenetworksone-shot
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This work considers the one-shot capacity of communication networks subject to adversarial noise affecting a subset of network edges. In particular, we examine previously-established upper bounds on one-shot capacity. We introduce the Diamond Network as a minimal example to show that known cut-set bounds are not sharp in general. We then give a capacity-achieving scheme for the Diamond Network that implements an adversary detection strategy. Finally, we give a sufficient condition for tightness of the Singleton Cut-Set Bound in a family of two-level networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multishot Capacity of Networks with Restricted Adversaries

    cs.IT 2025-06 conditional novelty 5.0 of 10

    The i-shot capacities of the Diamond, Butterfly, and E_t networks under a fixed-edge adversary are log_{|A|}(|A|^i - b)/i, while a switching adversary yields no gain over one-shot capacity.

Pith tools