{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6VNC7CNEKEHPWH47MDXSJ3VIPC","short_pith_number":"pith:6VNC7CNE","schema_version":"1.0","canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","source":{"kind":"arxiv","id":"1605.02131","version":1},"attestation_state":"computed","paper":{"title":"Partial Covering Arrays: Algorithms and Asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Annalisa De Bonis, Charles J. Colbourn, Kaushik Sarkar, Ugo Vaccaro","submitted_at":"2016-05-07T02:09:26Z","abstract_excerpt":"A covering array $\\mathsf{CA}(N;t,k,v)$ is an $N\\times k$ array with entries in $\\{1, 2, \\ldots , v\\}$, for which every $N\\times t$ subarray contains each $t$-tuple of $\\{1, 2, \\ldots , v\\}^t$ among its rows. Covering arrays find application in interaction testing, including software and hardware testing, advanced materials development, and biological systems. A central question is to determine or bound $\\mathsf{CAN}(t,k,v)$, the minimum number $N$ of rows of a $\\mathsf{CA}(N;t,k,v)$. The well known bound $\\mathsf{CAN}(t,k,v)=O((t-1)v^t\\log k)$ is not too far from being asymptotically optimal."},"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":"1605.02131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-07T02:09:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0efeba9ed595226eb3037b592d766c4672a31de02e249bb3aea36cd0b655d376","abstract_canon_sha256":"2e6c52d2d0d94524d2ff4f196da12d843b3f398c1249eb8a402818d395c1c0bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.999534Z","signature_b64":"VYUe9ZlY0RkiTjUUTi2GmeVL1Jne6HQaxLJVso0QXvrbWgEC6Ca8y9YH9CCsfREMWZFZzivc2Z9D8UKan7s3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f55a2f89a4510efb1f9f60ef24eea8788d6964eefd0c999c60c2cce1431953bc","last_reissued_at":"2026-05-18T01:15:21.998715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.998715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Covering Arrays: Algorithms and Asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Annalisa De Bonis, Charles J. Colbourn, Kaushik Sarkar, Ugo Vaccaro","submitted_at":"2016-05-07T02:09:26Z","abstract_excerpt":"A covering array $\\mathsf{CA}(N;t,k,v)$ is an $N\\times k$ array with entries in $\\{1, 2, \\ldots , v\\}$, for which every $N\\times t$ subarray contains each $t$-tuple of $\\{1, 2, \\ldots , v\\}^t$ among its rows. Covering arrays find application in interaction testing, including software and hardware testing, advanced materials development, and biological systems. A central question is to determine or bound $\\mathsf{CAN}(t,k,v)$, the minimum number $N$ of rows of a $\\mathsf{CA}(N;t,k,v)$. The well known bound $\\mathsf{CAN}(t,k,v)=O((t-1)v^t\\log k)$ is not too far from being asymptotically optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02131","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":"1605.02131","created_at":"2026-05-18T01:15:21.998847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02131v1","created_at":"2026-05-18T01:15:21.998847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02131","created_at":"2026-05-18T01:15:21.998847+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VNC7CNEKEHP","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VNC7CNEKEHPWH47","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VNC7CNE","created_at":"2026-05-18T12:30:04.600751+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/6VNC7CNEKEHPWH47MDXSJ3VIPC","json":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC.json","graph_json":"https://pith.science/api/pith-number/6VNC7CNEKEHPWH47MDXSJ3VIPC/graph.json","events_json":"https://pith.science/api/pith-number/6VNC7CNEKEHPWH47MDXSJ3VIPC/events.json","paper":"https://pith.science/paper/6VNC7CNE"},"agent_actions":{"view_html":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC","download_json":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC.json","view_paper":"https://pith.science/paper/6VNC7CNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02131&json=true","fetch_graph":"https://pith.science/api/pith-number/6VNC7CNEKEHPWH47MDXSJ3VIPC/graph.json","fetch_events":"https://pith.science/api/pith-number/6VNC7CNEKEHPWH47MDXSJ3VIPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/action/storage_attestation","attest_author":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/action/author_attestation","sign_citation":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/action/citation_signature","submit_replication":"https://pith.science/pith/6VNC7CNEKEHPWH47MDXSJ3VIPC/action/replication_record"}},"created_at":"2026-05-18T01:15:21.998847+00:00","updated_at":"2026-05-18T01:15:21.998847+00:00"}