{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7MUBNGJWJ26RGJAINCDQ2IN2G2","short_pith_number":"pith:7MUBNGJW","schema_version":"1.0","canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","source":{"kind":"arxiv","id":"1606.06730","version":1},"attestation_state":"computed","paper":{"title":"Two-stage algorithms for covering array construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SE","math.CO"],"primary_cat":"cs.DS","authors_text":"Charles J. Colbourn, Kaushik Sarkar","submitted_at":"2016-06-21T04:01:39Z","abstract_excerpt":"Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to cause a fault. Covering arrays are used to test for interactions among components systematically. A two-stage framework, providing a number of concrete algorithms, is developed for the efficient construction of covering arrays. %Our framework divides the construction in two stages. In the first stage, a time and memory efficient randomized algorithm covers mo"},"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":"1606.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T04:01:39Z","cross_cats_sorted":["cs.DM","cs.SE","math.CO"],"title_canon_sha256":"fe2a6b6c74bf51e192aa48f6d596ec38da8729b7077765bd1ed25fe0b8595d40","abstract_canon_sha256":"e3f3312c32df6366f51047e7e7e69d3eeb695bcc52b9d408c1ed8ee6ef4dad45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.209071Z","signature_b64":"aN6OCwFSNailNDijSB7ylUYXc27Io6bKCTGK0iu7ulqls4kRWQgPLdzWMQyKt/A4lztjDVPA5g9lfEm4YO6UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","last_reissued_at":"2026-05-18T01:12:01.208663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.208663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-stage algorithms for covering array construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SE","math.CO"],"primary_cat":"cs.DS","authors_text":"Charles J. Colbourn, Kaushik Sarkar","submitted_at":"2016-06-21T04:01:39Z","abstract_excerpt":"Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to cause a fault. Covering arrays are used to test for interactions among components systematically. A two-stage framework, providing a number of concrete algorithms, is developed for the efficient construction of covering arrays. %Our framework divides the construction in two stages. In the first stage, a time and memory efficient randomized algorithm covers mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06730","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":"1606.06730","created_at":"2026-05-18T01:12:01.208722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06730v1","created_at":"2026-05-18T01:12:01.208722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06730","created_at":"2026-05-18T01:12:01.208722+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MUBNGJWJ26R","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MUBNGJWJ26RGJAI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MUBNGJW","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/7MUBNGJWJ26RGJAINCDQ2IN2G2","json":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2.json","graph_json":"https://pith.science/api/pith-number/7MUBNGJWJ26RGJAINCDQ2IN2G2/graph.json","events_json":"https://pith.science/api/pith-number/7MUBNGJWJ26RGJAINCDQ2IN2G2/events.json","paper":"https://pith.science/paper/7MUBNGJW"},"agent_actions":{"view_html":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2","download_json":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2.json","view_paper":"https://pith.science/paper/7MUBNGJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06730&json=true","fetch_graph":"https://pith.science/api/pith-number/7MUBNGJWJ26RGJAINCDQ2IN2G2/graph.json","fetch_events":"https://pith.science/api/pith-number/7MUBNGJWJ26RGJAINCDQ2IN2G2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/action/storage_attestation","attest_author":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/action/author_attestation","sign_citation":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/action/citation_signature","submit_replication":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/action/replication_record"}},"created_at":"2026-05-18T01:12:01.208722+00:00","updated_at":"2026-05-18T01:12:01.208722+00:00"}