Zenodo (CERN)
open access
A matching repair for the ordered binary matrix construction
A written matching repair upper bound for the explicit ordered binary matrix construction in OpenAI mathematics Family 190, together with an independently certified finite repair optimum. For h≥1 and m=2^h, changing the dummy-row × shared-leaf-column block from ones to zeros gives an H-free host
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach#1389166
- Extension of MDS Codes over Finite Fields#1424141
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#781144
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#779769
- Minimum blockers for nonnested perfect matchings#1083915
Record · ID 1442244
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive