The Online Steinitz Problem RA1Z6BV25A

Expressions

Date	2026-10-12
Ids	arXiv 2610.16715

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Deterministic OSP upper bound	statement	theorem 3.1	arxiv
323SGKDW0F	problem	problem	arxiv
Efficient signer	statement	corollary 4.1	arxiv
Randomized lower bound for $d=1$	statement	lemma 5.4	arxiv
one-boundary-path identity	statement	lemma 2.2	arxiv
conditional composition	statement	lemma 2.4	arxiv
one-node quota repair	statement	lemma 2.3	arxiv
Sharper dimension dependence	statement	lemma 4.2	arxiv
Randomized lower bound in arbitrary dimension	statement	lemma 5.5	arxiv
Signing-to-ordering reduction	statement	theorem 2.1	arxiv
OSP for sparse vectors	statement	corollary 4.4	arxiv
Deterministic and randomized OSP lower bounds	statement	theorem 5.1	arxiv
Coordinatewise ordering	statement	corollary 4.3	arxiv
Deterministic lower bounds	statement	lemma 5.2	arxiv
Deterministic proportional routing	statement	proposition 3.2	arxiv