{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OKCFGVGMMPSDHPKP62K7TTI5YH","short_pith_number":"pith:OKCFGVGM","schema_version":"1.0","canonical_sha256":"72845354cc63e433bd4ff695f9cd1dc1c039a83f7901fb40d79b00e15f186231","source":{"kind":"arxiv","id":"1111.0587","version":1},"attestation_state":"computed","paper":{"title":"Structures and lower bounds for binary covering arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeol Oh, Hyun Kwang Kim, Soohak Choi","submitted_at":"2011-11-02T18:03:12Z","abstract_excerpt":"A $q$-ary $t$-covering array is an $m \\times n$ matrix with entries from $\\{0, 1, ..., q-1\\}$ with the property that for any $t$ column positions, all $q^t$ possible vectors of length $t$ occur at least once. One wishes to minimize $m$ for given $t$ and $n$, or maximize $n$ for given $t$ and $m$. For $t = 2$ and $q = 2$, it is completely solved by R\\'enyi, Katona, and Kleitman and Spencer. They also show that maximal binary 2-covering arrays are uniquely determined. Roux found the lower bound of $m$ for a general $t, n$, and $q$. In this article, we show that $m \\times n$ binary 2-covering arr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1111.0587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T18:03:12Z","cross_cats_sorted":[],"title_canon_sha256":"593037d9e2c42d4d11947aa74369944a10ca6a560d3aae738ba974b566f8c7d4","abstract_canon_sha256":"8cec1376076d2ffb9c911b94d51767f3cb09e34c837b60b397d62c4d9d6b9648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:44.648209Z","signature_b64":"Cm0llykqt1+dNiJv/ETNSiy/r0fj8MdX6uhBcPv0Itvd2j5ftS2rBy+RjBv2wAfBTMLwLe9Rvrn/4Uqvu3sFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72845354cc63e433bd4ff695f9cd1dc1c039a83f7901fb40d79b00e15f186231","last_reissued_at":"2026-05-18T04:09:44.647649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:44.647649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structures and lower bounds for binary covering arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeol Oh, Hyun Kwang Kim, Soohak Choi","submitted_at":"2011-11-02T18:03:12Z","abstract_excerpt":"A $q$-ary $t$-covering array is an $m \\times n$ matrix with entries from $\\{0, 1, ..., q-1\\}$ with the property that for any $t$ column positions, all $q^t$ possible vectors of length $t$ occur at least once. One wishes to minimize $m$ for given $t$ and $n$, or maximize $n$ for given $t$ and $m$. For $t = 2$ and $q = 2$, it is completely solved by R\\'enyi, Katona, and Kleitman and Spencer. They also show that maximal binary 2-covering arrays are uniquely determined. Roux found the lower bound of $m$ for a general $t, n$, and $q$. In this article, we show that $m \\times n$ binary 2-covering arr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0587","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.0587","created_at":"2026-05-18T04:09:44.647717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0587v1","created_at":"2026-05-18T04:09:44.647717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0587","created_at":"2026-05-18T04:09:44.647717+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKCFGVGMMPSD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKCFGVGMMPSDHPKP","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKCFGVGM","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH","json":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH.json","graph_json":"https://pith.science/api/pith-number/OKCFGVGMMPSDHPKP62K7TTI5YH/graph.json","events_json":"https://pith.science/api/pith-number/OKCFGVGMMPSDHPKP62K7TTI5YH/events.json","paper":"https://pith.science/paper/OKCFGVGM"},"agent_actions":{"view_html":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH","download_json":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH.json","view_paper":"https://pith.science/paper/OKCFGVGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0587&json=true","fetch_graph":"https://pith.science/api/pith-number/OKCFGVGMMPSDHPKP62K7TTI5YH/graph.json","fetch_events":"https://pith.science/api/pith-number/OKCFGVGMMPSDHPKP62K7TTI5YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/action/storage_attestation","attest_author":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/action/author_attestation","sign_citation":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/action/citation_signature","submit_replication":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/action/replication_record"}},"created_at":"2026-05-18T04:09:44.647717+00:00","updated_at":"2026-05-18T04:09:44.647717+00:00"}