{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NGN3AYPN4JEWSTOFLKODUIBJP6","short_pith_number":"pith:NGN3AYPN","schema_version":"1.0","canonical_sha256":"699bb061ede249694dc55a9c3a20297f89ba56845e42f3cda4b963a4ba0c56d7","source":{"kind":"arxiv","id":"1405.2844","version":1},"attestation_state":"computed","paper":{"title":"Covering Array Bounds Using Analytical Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Ruyue Yuan, Zoe Koch","submitted_at":"2014-05-12T17:27:06Z","abstract_excerpt":"A $t$-covering array with entries from the alphabet ${\\cal Q}=\\{0,1,\\ldots,q-1\\}$ is a $k\\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\\cal Q}$ appear at least once among the rows of the selected columns. We will show how a combination of the Lov\\'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of $t$-covering arrays, notably for $t = 3, 4$. Here size is measured in the number of rows, as expressed in terms of the"},"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":"1405.2844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-12T17:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"88d95fa0947f5aaf86f4648dac55014112dc7f4f19c00282e7d7ec3512db9e66","abstract_canon_sha256":"f2da20f7cd5aebfdee32a52c983ad8accc1f8f3a6b19aa77d9df551c70afe630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.679816Z","signature_b64":"MtueMQ7WjaxpEY4l9P0un+laH88CPJcnaexx+tjBdDYf305R1Dw5yCzU3/2my9OrudM3q7fq0n+z7P0YVLO3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"699bb061ede249694dc55a9c3a20297f89ba56845e42f3cda4b963a4ba0c56d7","last_reissued_at":"2026-05-18T02:52:04.679425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.679425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Array Bounds Using Analytical Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Ruyue Yuan, Zoe Koch","submitted_at":"2014-05-12T17:27:06Z","abstract_excerpt":"A $t$-covering array with entries from the alphabet ${\\cal Q}=\\{0,1,\\ldots,q-1\\}$ is a $k\\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\\cal Q}$ appear at least once among the rows of the selected columns. We will show how a combination of the Lov\\'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of $t$-covering arrays, notably for $t = 3, 4$. Here size is measured in the number of rows, as expressed in terms of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2844","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":"1405.2844","created_at":"2026-05-18T02:52:04.679480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2844v1","created_at":"2026-05-18T02:52:04.679480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2844","created_at":"2026-05-18T02:52:04.679480+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGN3AYPN4JEW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGN3AYPN4JEWSTOF","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGN3AYPN","created_at":"2026-05-18T12:28:41.024544+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/NGN3AYPN4JEWSTOFLKODUIBJP6","json":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6.json","graph_json":"https://pith.science/api/pith-number/NGN3AYPN4JEWSTOFLKODUIBJP6/graph.json","events_json":"https://pith.science/api/pith-number/NGN3AYPN4JEWSTOFLKODUIBJP6/events.json","paper":"https://pith.science/paper/NGN3AYPN"},"agent_actions":{"view_html":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6","download_json":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6.json","view_paper":"https://pith.science/paper/NGN3AYPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2844&json=true","fetch_graph":"https://pith.science/api/pith-number/NGN3AYPN4JEWSTOFLKODUIBJP6/graph.json","fetch_events":"https://pith.science/api/pith-number/NGN3AYPN4JEWSTOFLKODUIBJP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6/action/storage_attestation","attest_author":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6/action/author_attestation","sign_citation":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6/action/citation_signature","submit_replication":"https://pith.science/pith/NGN3AYPN4JEWSTOFLKODUIBJP6/action/replication_record"}},"created_at":"2026-05-18T02:52:04.679480+00:00","updated_at":"2026-05-18T02:52:04.679480+00:00"}