{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5ISWBW6E4G5ZDDSOT7UETRTAZN","short_pith_number":"pith:5ISWBW6E","schema_version":"1.0","canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","source":{"kind":"arxiv","id":"1901.03594","version":2},"attestation_state":"computed","paper":{"title":"On the Structure of Small Strength-$2$ Covering Arrays","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Janne I. Kokkala, Karen Meagher, Kari J. Nurmela, Patric R. J. \\\"Osterg{\\aa}rd, Reza Naserasr","submitted_at":"2019-01-11T14:30:24Z","abstract_excerpt":"A covering array $\\rm{CA}(N;t,k,v)$ of strength $t$ is an $N \\times k$ array of symbols from an alphabet of size $v$ such that in every $N \\times t$ subarray, every $t$-tuple occurs in at least one row. A covering array is \\emph{optimal} if it has the smallest possible $N$ for given $t$, $k$, and $v$, and \\emph{uniform} if every symbol occurs $\\lfloor N/v \\rfloor$ or $\\lceil N/v \\rceil$ times in every column. Prior to this paper the only known optimal covering arrays for $t=2$ were orthogonal arrays, covering arrays with $v=2$ constructed from Sperner's Theorem and the Erd\\H{o}s-Ko-Rado Theore"},"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":"1901.03594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-11T14:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"c05fc34204223c39f35518e0ca157ae5a8853274398f7d45f40ca2b53b3b5404","abstract_canon_sha256":"acaa96c0fcd972508b2a598763a816f1a5093802bb09e6a99fa7ed9a3680bf87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.620942Z","signature_b64":"QCYwxjMDqd1rftn444wqyq3D+7bZE8IEKOc+Ek7Cl3+i7Op81r3drmROHTXBcjJUhP0EsM2Alzf4TvrkXgo/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea2560dbc4e1bb918e4e9fe849c660cb660283d59b100f8a359da5cea40fa6fb","last_reissued_at":"2026-05-17T23:42:02.620249Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.620249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Structure of Small Strength-$2$ Covering Arrays","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Janne I. Kokkala, Karen Meagher, Kari J. Nurmela, Patric R. J. \\\"Osterg{\\aa}rd, Reza Naserasr","submitted_at":"2019-01-11T14:30:24Z","abstract_excerpt":"A covering array $\\rm{CA}(N;t,k,v)$ of strength $t$ is an $N \\times k$ array of symbols from an alphabet of size $v$ such that in every $N \\times t$ subarray, every $t$-tuple occurs in at least one row. A covering array is \\emph{optimal} if it has the smallest possible $N$ for given $t$, $k$, and $v$, and \\emph{uniform} if every symbol occurs $\\lfloor N/v \\rfloor$ or $\\lceil N/v \\rceil$ times in every column. Prior to this paper the only known optimal covering arrays for $t=2$ were orthogonal arrays, covering arrays with $v=2$ constructed from Sperner's Theorem and the Erd\\H{o}s-Ko-Rado Theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03594","kind":"arxiv","version":2},"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":"1901.03594","created_at":"2026-05-17T23:42:02.620342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03594v2","created_at":"2026-05-17T23:42:02.620342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03594","created_at":"2026-05-17T23:42:02.620342+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ISWBW6E4G5Z","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ISWBW6E4G5ZDDSO","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ISWBW6E","created_at":"2026-05-18T12:33:10.108867+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/5ISWBW6E4G5ZDDSOT7UETRTAZN","json":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN.json","graph_json":"https://pith.science/api/pith-number/5ISWBW6E4G5ZDDSOT7UETRTAZN/graph.json","events_json":"https://pith.science/api/pith-number/5ISWBW6E4G5ZDDSOT7UETRTAZN/events.json","paper":"https://pith.science/paper/5ISWBW6E"},"agent_actions":{"view_html":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN","download_json":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN.json","view_paper":"https://pith.science/paper/5ISWBW6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03594&json=true","fetch_graph":"https://pith.science/api/pith-number/5ISWBW6E4G5ZDDSOT7UETRTAZN/graph.json","fetch_events":"https://pith.science/api/pith-number/5ISWBW6E4G5ZDDSOT7UETRTAZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/action/storage_attestation","attest_author":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/action/author_attestation","sign_citation":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/action/citation_signature","submit_replication":"https://pith.science/pith/5ISWBW6E4G5ZDDSOT7UETRTAZN/action/replication_record"}},"created_at":"2026-05-17T23:42:02.620342+00:00","updated_at":"2026-05-17T23:42:02.620342+00:00"}