{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PVOCXORGQM2AF2GNDIX37I2LMD","short_pith_number":"pith:PVOCXORG","canonical_record":{"source":{"id":"1603.07809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-25T02:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"36b88b8e4554bad28243df0c2121ef9a23253b44d2d11d31651c4e48f0759e4b","abstract_canon_sha256":"a32a6b81a66277136bf213af96810b07f2fefdb61a3f978e5e524ab0f23abac1"},"schema_version":"1.0"},"canonical_sha256":"7d5c2bba26833402e8cd1a2fbfa34b60d8737485da3c3d935a5e5c0303e3f065","source":{"kind":"arxiv","id":"1603.07809","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PVOCXORGQM2AF2GNDIX37I2LMD","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-25T02:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"36b88b8e4554bad28243df0c2121ef9a23253b44d2d11d31651c4e48f0759e4b","abstract_canon_sha256":"a32a6b81a66277136bf213af96810b07f2fefdb61a3f978e5e524ab0f23abac1"},"schema_version":"1.0"},"canonical_sha256":"7d5c2bba26833402e8cd1a2fbfa34b60d8737485da3c3d935a5e5c0303e3f065","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:17.782107Z","signature_b64":"0IsUxYMk5wAEqx5ksTr5f2bYLJCqEAx9As7HyOljovxR10ufC3UfxWaQ5pieBBCuPV7YbcbT1Sq8CxiiKkzBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d5c2bba26833402e8cd1a2fbfa34b60d8737485da3c3d935a5e5c0303e3f065","last_reissued_at":"2026-05-18T01:18:17.781461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:17.781461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07809","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Le1V1mIji5KwDY2KrtHaSukvruehwgwm8pp7AkdcF1RiDRGKsOZuN44HH+APwidYrKH8bNj3IxbVtmPukKJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:42:12.827492Z"},"content_sha256":"f562c29e47605ec7ce93d917777e1febeda21ba8ac39a3d1218222089bc11cc8","schema_version":"1.0","event_id":"sha256:f562c29e47605ec7ce93d917777e1febeda21ba8ac39a3d1218222089bc11cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PVOCXORGQM2AF2GNDIX37I2LMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds on the size of covering arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles J. Colbourn, Kaushik Sarkar","submitted_at":"2016-03-25T02:50:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07809","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auL7GjOttiR+SAtdQcWelXJf0RyAmkUlJ8kHrvC5O7h0y4d2wFE3iB6yAz8pdAJeonmiCLQvOvGt1Roay5QvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:42:12.828150Z"},"content_sha256":"334ca95bb646f8c77aabdf5969c7486d68d2c0efa5723c5ebeaf60ecdc572934","schema_version":"1.0","event_id":"sha256:334ca95bb646f8c77aabdf5969c7486d68d2c0efa5723c5ebeaf60ecdc572934"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVOCXORGQM2AF2GNDIX37I2LMD/bundle.json","state_url":"https://pith.science/pith/PVOCXORGQM2AF2GNDIX37I2LMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVOCXORGQM2AF2GNDIX37I2LMD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-18T21:42:12Z","links":{"resolver":"https://pith.science/pith/PVOCXORGQM2AF2GNDIX37I2LMD","bundle":"https://pith.science/pith/PVOCXORGQM2AF2GNDIX37I2LMD/bundle.json","state":"https://pith.science/pith/PVOCXORGQM2AF2GNDIX37I2LMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVOCXORGQM2AF2GNDIX37I2LMD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/cj7AzRpgrd4tFOhy8sFxqQHqAWeqhT61VaYY/o7rC57TrK7dWJK4a8UorhToIJOBxckLi6XA2FLOJDs0w3FCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T21:42:12.830028Z","bundle_sha256":"4bc308f1117f72796c23551cee7061b69cb52ce31bad4ff162fa2409a591dbd2"}}