{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Y2DPJUQMGNDMU2LFRFNQO5SVBF","short_pith_number":"pith:Y2DPJUQM","schema_version":"1.0","canonical_sha256":"c686f4d20c3346ca6965895b07765509497c8d0c2490eddc056b7deae5a26bbc","source":{"kind":"arxiv","id":"1011.0351","version":1},"attestation_state":"computed","paper":{"title":"$t$-Covering Arrays Generated by a Tiling Probability Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Michael S. Donders","submitted_at":"2010-11-01T15:40:49Z","abstract_excerpt":"A $t-\\a$ covering array is an $m\\times n$ matrix, with entries from an alphabet of size $\\alpha$, such that for any choice of $t$ rows, and any ordered string of $t$ letters of the alphabet, there exists a column such that the \"values\" of the rows in that column match those of the string of letters. We use the Lov\\'asz Local Lemma in conjunction with a new tiling-based probability model to improve the upper bound on the smallest number of columns $N=N(m,t,\\alpha)$ of a $t-\\a$ covering array."},"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":"1011.0351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-01T15:40:49Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"0228b79b52584b59076ca3388f6c6b5f3f2a3ce2b35b5d7aa3a7a7de5746de22","abstract_canon_sha256":"92998f9be43dbed34709100b2c65fcc47d49c11ac57efddf46ff34ace7c4700b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:23.361145Z","signature_b64":"FIpvKGUoreQ07rCevBgnjqiF2zAoq8YDtRHQnxFkrLUDOf4XqE1X08S9nvFBdCU84d8+Yq96gjHWGTBtB5C2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c686f4d20c3346ca6965895b07765509497c8d0c2490eddc056b7deae5a26bbc","last_reissued_at":"2026-05-18T04:37:23.360600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:23.360600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$t$-Covering Arrays Generated by a Tiling Probability Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Michael S. Donders","submitted_at":"2010-11-01T15:40:49Z","abstract_excerpt":"A $t-\\a$ covering array is an $m\\times n$ matrix, with entries from an alphabet of size $\\alpha$, such that for any choice of $t$ rows, and any ordered string of $t$ letters of the alphabet, there exists a column such that the \"values\" of the rows in that column match those of the string of letters. We use the Lov\\'asz Local Lemma in conjunction with a new tiling-based probability model to improve the upper bound on the smallest number of columns $N=N(m,t,\\alpha)$ of a $t-\\a$ covering array."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0351","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":"1011.0351","created_at":"2026-05-18T04:37:23.360658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0351v1","created_at":"2026-05-18T04:37:23.360658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0351","created_at":"2026-05-18T04:37:23.360658+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2DPJUQMGNDM","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2DPJUQMGNDMU2LF","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2DPJUQM","created_at":"2026-05-18T12:26:17.028572+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/Y2DPJUQMGNDMU2LFRFNQO5SVBF","json":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF.json","graph_json":"https://pith.science/api/pith-number/Y2DPJUQMGNDMU2LFRFNQO5SVBF/graph.json","events_json":"https://pith.science/api/pith-number/Y2DPJUQMGNDMU2LFRFNQO5SVBF/events.json","paper":"https://pith.science/paper/Y2DPJUQM"},"agent_actions":{"view_html":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF","download_json":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF.json","view_paper":"https://pith.science/paper/Y2DPJUQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0351&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2DPJUQMGNDMU2LFRFNQO5SVBF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2DPJUQMGNDMU2LFRFNQO5SVBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF/action/storage_attestation","attest_author":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF/action/author_attestation","sign_citation":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF/action/citation_signature","submit_replication":"https://pith.science/pith/Y2DPJUQMGNDMU2LFRFNQO5SVBF/action/replication_record"}},"created_at":"2026-05-18T04:37:23.360658+00:00","updated_at":"2026-05-18T04:37:23.360658+00:00"}