{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KDMHOVXUPL4HH6PDZPE52CNVIU","short_pith_number":"pith:KDMHOVXU","schema_version":"1.0","canonical_sha256":"50d87756f47af873f9e3cbc9dd09b5451411b56d8fb86804150c915fd640cf29","source":{"kind":"arxiv","id":"1901.05386","version":2},"attestation_state":"computed","paper":{"title":"Upper bounds on the sizes of variable strength covering arrays using the Lov\\'{a}sz local lemma","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Lucia Moura, Sebastian Raaphorst","submitted_at":"2019-01-16T16:51:35Z","abstract_excerpt":"Covering arrays are generalizations of orthogonal arrays that have been widely studied and are used in software testing. The probabilistic method has been employed to derive upper bounds on the sizes of minimum covering arrays and give asymptotic upper bounds that are logarithmic on the number of columns of the array. This corresponds to test suites with a desired level of coverage of the parameter space where we guarantee the number of test cases is logarithmic on the number of parameters of the system. In this paper, we study variable strength covering arrays, a generalization of covering ar"},"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.05386","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-01-16T16:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"3c505485eb0f9ac6e4177160bab9a42ee4f3fb758b4cb20e09b2ded95857b8f7","abstract_canon_sha256":"29d9c746829a32b5763e49ff72b8efa89676e2a63a094d1e737eff7e000e9e05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:50.193012Z","signature_b64":"/IY+X21gnAPysvFBEqHONtm7hbN+IVXvPryEL42zqF53Ie339y/pTRROThJgC/PH/+UW/KYSPXrlVjPVgfbwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50d87756f47af873f9e3cbc9dd09b5451411b56d8fb86804150c915fd640cf29","last_reissued_at":"2026-05-17T23:49:50.192528Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:50.192528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds on the sizes of variable strength covering arrays using the Lov\\'{a}sz local lemma","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Lucia Moura, Sebastian Raaphorst","submitted_at":"2019-01-16T16:51:35Z","abstract_excerpt":"Covering arrays are generalizations of orthogonal arrays that have been widely studied and are used in software testing. The probabilistic method has been employed to derive upper bounds on the sizes of minimum covering arrays and give asymptotic upper bounds that are logarithmic on the number of columns of the array. This corresponds to test suites with a desired level of coverage of the parameter space where we guarantee the number of test cases is logarithmic on the number of parameters of the system. In this paper, we study variable strength covering arrays, a generalization of covering ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05386","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.05386","created_at":"2026-05-17T23:49:50.192596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05386v2","created_at":"2026-05-17T23:49:50.192596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05386","created_at":"2026-05-17T23:49:50.192596+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDMHOVXUPL4H","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDMHOVXUPL4HH6PD","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDMHOVXU","created_at":"2026-05-18T12:33:21.387695+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/KDMHOVXUPL4HH6PDZPE52CNVIU","json":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU.json","graph_json":"https://pith.science/api/pith-number/KDMHOVXUPL4HH6PDZPE52CNVIU/graph.json","events_json":"https://pith.science/api/pith-number/KDMHOVXUPL4HH6PDZPE52CNVIU/events.json","paper":"https://pith.science/paper/KDMHOVXU"},"agent_actions":{"view_html":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU","download_json":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU.json","view_paper":"https://pith.science/paper/KDMHOVXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05386&json=true","fetch_graph":"https://pith.science/api/pith-number/KDMHOVXUPL4HH6PDZPE52CNVIU/graph.json","fetch_events":"https://pith.science/api/pith-number/KDMHOVXUPL4HH6PDZPE52CNVIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU/action/storage_attestation","attest_author":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU/action/author_attestation","sign_citation":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU/action/citation_signature","submit_replication":"https://pith.science/pith/KDMHOVXUPL4HH6PDZPE52CNVIU/action/replication_record"}},"created_at":"2026-05-17T23:49:50.192596+00:00","updated_at":"2026-05-17T23:49:50.192596+00:00"}