Arith / CONCEPT
Exact acquisition by positive replacement and graft words
The minimum worst number of same-source terminal gcd experiments for exact composition recovery is twice the largest prime-power digit budget.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES2
PROOF DEPTH9
DOCUMENT LINKS1
The minimum is attained for every positive modulus
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Chronological Child Prefixes for Residue Protocolsstructural-affinity · Closed
- Effective common-direction digit schedulingstructural-affinity · Closed
- Effective short positive probesstructural-affinity · Closed
- Exact Residue Fibers and Adaptive Posteriorsstructural-affinity · Closed
- One chronological acquisition trajectorystructural-affinity · Closed
- Passive Policy Normalizationstructural-affinity · Closed
- Preserving a continuous competitor's acquired informationstructural-affinity · Closed
- Returned arithmetic behavior and serial continued usestructural-affinity · Closed
- Terminal Histories and Exact First-Step Costsstructural-affinity · Closed
- The affine valuation identification lower boundstructural-affinity · Closed
- Uniform Height Bound for Residue Identificationstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance