{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PVOCXORGQM2AF2GNDIX37I2LMD","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":"a32a6b81a66277136bf213af96810b07f2fefdb61a3f978e5e524ab0f23abac1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-25T02:50:39Z","title_canon_sha256":"36b88b8e4554bad28243df0c2121ef9a23253b44d2d11d31651c4e48f0759e4b"},"schema_version":"1.0","source":{"id":"1603.07809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07809","created_at":"2026-05-18T01:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07809v1","created_at":"2026-05-18T01:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07809","created_at":"2026-05-18T01:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"PVOCXORGQM2A","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PVOCXORGQM2AF2GN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PVOCXORG","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:334ca95bb646f8c77aabdf5969c7486d68d2c0efa5723c5ebeaf60ecdc572934","target":"graph","created_at":"2026-05-18T01:18:17Z","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":"Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the parameters $t,k$ and $v$. Asymptotic upper bounds for CAN$(t,k,v)$ have earlier been established using the Stein-Lov\\'asz-Johnson strategy and the Lov\\'asz local lemma. A series of improvements on these bounds is developed in this paper. First an estimate for the discrete Stein-Lov\\'asz-Johnson bound is derived. Then using alteration, the Stein-Lov\\'asz-Johnson","authors_text":"Charles J. Colbourn, Kaushik Sarkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-25T02:50:39Z","title":"Upper bounds on the size of covering arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07809","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:f562c29e47605ec7ce93d917777e1febeda21ba8ac39a3d1218222089bc11cc8","target":"record","created_at":"2026-05-18T01:18:17Z","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":"a32a6b81a66277136bf213af96810b07f2fefdb61a3f978e5e524ab0f23abac1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-25T02:50:39Z","title_canon_sha256":"36b88b8e4554bad28243df0c2121ef9a23253b44d2d11d31651c4e48f0759e4b"},"schema_version":"1.0","source":{"id":"1603.07809","kind":"arxiv","version":1}},"canonical_sha256":"7d5c2bba26833402e8cd1a2fbfa34b60d8737485da3c3d935a5e5c0303e3f065","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d5c2bba26833402e8cd1a2fbfa34b60d8737485da3c3d935a5e5c0303e3f065","first_computed_at":"2026-05-18T01:18:17.781461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:17.781461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0IsUxYMk5wAEqx5ksTr5f2bYLJCqEAx9As7HyOljovxR10ufC3UfxWaQ5pieBBCuPV7YbcbT1Sq8CxiiKkzBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:17.782107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f562c29e47605ec7ce93d917777e1febeda21ba8ac39a3d1218222089bc11cc8","sha256:334ca95bb646f8c77aabdf5969c7486d68d2c0efa5723c5ebeaf60ecdc572934"],"state_sha256":"44230ebbd75dfd3cc95f0fccf7761b3d8163f6fcef3b1e750c48fc4ecbcd83d6"}