{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OKCFGVGMMPSDHPKP62K7TTI5YH","short_pith_number":"pith:OKCFGVGM","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"},"canonical_sha256":"72845354cc63e433bd4ff695f9cd1dc1c039a83f7901fb40d79b00e15f186231","source":{"kind":"arxiv","id":"1111.0587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0587","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0587v1","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0587","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"OKCFGVGMMPSD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OKCFGVGMMPSDHPKP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OKCFGVGM","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OKCFGVGMMPSDHPKP62K7TTI5YH","target":"record","payload":{"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"},"canonical_sha256":"72845354cc63e433bd4ff695f9cd1dc1c039a83f7901fb40d79b00e15f186231","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"},"source_kind":"arxiv","source_id":"1111.0587","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dargQV4FSJIRMSbHAmK5iZ+6pRYIMrkKraHNRjNZVsjQ9zWLkghq5x+jSgwF5J5IxCe7mavs0Ji2/8UzPX+qAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:59:36.957527Z"},"content_sha256":"223620e1e0d882756c9aa20117ebf69e35b4339beedbb72a82c4585b0abdd13c","schema_version":"1.0","event_id":"sha256:223620e1e0d882756c9aa20117ebf69e35b4339beedbb72a82c4585b0abdd13c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OKCFGVGMMPSDHPKP62K7TTI5YH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/X/YZSyxDeUeHRjgT+j14vCfNKxAY3nUyogLw0p1USanjaQaFtdIMps4Zvmr+xHFnQpfEgha9V42t8/csPbpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:59:36.957879Z"},"content_sha256":"e8f6fb63be01cc2fda7ae33ef27779b818a62c8bf76702b4291b075d3134cc9a","schema_version":"1.0","event_id":"sha256:e8f6fb63be01cc2fda7ae33ef27779b818a62c8bf76702b4291b075d3134cc9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/bundle.json","state_url":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T08:59:36Z","links":{"resolver":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH","bundle":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/bundle.json","state":"https://pith.science/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKCFGVGMMPSDHPKP62K7TTI5YH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OKCFGVGMMPSDHPKP62K7TTI5YH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8cec1376076d2ffb9c911b94d51767f3cb09e34c837b60b397d62c4d9d6b9648","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T18:03:12Z","title_canon_sha256":"593037d9e2c42d4d11947aa74369944a10ca6a560d3aae738ba974b566f8c7d4"},"schema_version":"1.0","source":{"id":"1111.0587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0587","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0587v1","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0587","created_at":"2026-05-18T04:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"OKCFGVGMMPSD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OKCFGVGMMPSDHPKP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OKCFGVGM","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:e8f6fb63be01cc2fda7ae33ef27779b818a62c8bf76702b4291b075d3134cc9a","target":"graph","created_at":"2026-05-18T04:09:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dong Yeol Oh, Hyun Kwang Kim, Soohak Choi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T18:03:12Z","title":"Structures and lower bounds for binary covering arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0587","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:223620e1e0d882756c9aa20117ebf69e35b4339beedbb72a82c4585b0abdd13c","target":"record","created_at":"2026-05-18T04:09:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8cec1376076d2ffb9c911b94d51767f3cb09e34c837b60b397d62c4d9d6b9648","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-02T18:03:12Z","title_canon_sha256":"593037d9e2c42d4d11947aa74369944a10ca6a560d3aae738ba974b566f8c7d4"},"schema_version":"1.0","source":{"id":"1111.0587","kind":"arxiv","version":1}},"canonical_sha256":"72845354cc63e433bd4ff695f9cd1dc1c039a83f7901fb40d79b00e15f186231","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72845354cc63e433bd4ff695f9cd1dc1c039a83f7901fb40d79b00e15f186231","first_computed_at":"2026-05-18T04:09:44.647649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:44.647649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cm0llykqt1+dNiJv/ETNSiy/r0fj8MdX6uhBcPv0Itvd2j5ftS2rBy+RjBv2wAfBTMLwLe9Rvrn/4Uqvu3sFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:44.648209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:223620e1e0d882756c9aa20117ebf69e35b4339beedbb72a82c4585b0abdd13c","sha256:e8f6fb63be01cc2fda7ae33ef27779b818a62c8bf76702b4291b075d3134cc9a"],"state_sha256":"6978bf8f4626ea5a118fb20d487bba5fbf76c72d9b65afb144043f0b05259c04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nGkwi53pc29/DGLVc3Fu5IH9ySNDrlMTnNjnI4l/OQOGDXieQUfDP/O5Dt/vOXJew7UfFGKymOTK/JDM4cwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:59:36.959947Z","bundle_sha256":"a32e34de9204efe58af8a5739fdf0568ebdfdd2bdb50d5781c4896f71b6076b9"}}