{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KMDVQG72OSYP64S3EVR2OARFT2","short_pith_number":"pith:KMDVQG72","schema_version":"1.0","canonical_sha256":"5307581bfa74b0ff725b2563a702259e82d12f8bef1434418c5214604e924f93","source":{"kind":"arxiv","id":"1706.06825","version":2},"attestation_state":"computed","paper":{"title":"New lower bounds for $t$-coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Rakhi Singh","submitted_at":"2017-06-21T11:08:26Z","abstract_excerpt":"Fisher proved in 1940 that any $2$-$(v,k,\\lambda)$ design with $v>k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$-$(v,k,\\lambda)$ design with $v \\geq k+\\lfloor t/2 \\rfloor$ has at least $\\binom{v}{\\lfloor t/2 \\rfloor}$ blocks. By combining methods used by Bose and Wilson in proofs of these results, we obtain new lower bounds on the size of $t$-$(v,k,\\lambda)$ coverings. Our results generalise lower bounds on the size of $2$-$(v,k,\\lambda)$ coverings recently obtained by the first author."},"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":"1706.06825","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T11:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"76ae70b77b2942048cc9a2256b752adbc09b6c3e99b7ca5b000cda22fdd023a2","abstract_canon_sha256":"14da1eee3fb4a3b7452908604596392f60e8c9c665251d2dec6767025b7db02a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:43.454329Z","signature_b64":"/phwsqks9CVyXQg3qJKJdr+uEKdclnBC8h5jCKvHK0SFZcZ4QCz3QnhO3PKuhtvNaf+mErQBaBpakd67Kac7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5307581bfa74b0ff725b2563a702259e82d12f8bef1434418c5214604e924f93","last_reissued_at":"2026-05-18T00:33:43.453734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:43.453734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New lower bounds for $t$-coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Rakhi Singh","submitted_at":"2017-06-21T11:08:26Z","abstract_excerpt":"Fisher proved in 1940 that any $2$-$(v,k,\\lambda)$ design with $v>k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$-$(v,k,\\lambda)$ design with $v \\geq k+\\lfloor t/2 \\rfloor$ has at least $\\binom{v}{\\lfloor t/2 \\rfloor}$ blocks. By combining methods used by Bose and Wilson in proofs of these results, we obtain new lower bounds on the size of $t$-$(v,k,\\lambda)$ coverings. Our results generalise lower bounds on the size of $2$-$(v,k,\\lambda)$ coverings recently obtained by the first author."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06825","kind":"arxiv","version":2},"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":"1706.06825","created_at":"2026-05-18T00:33:43.453814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06825v2","created_at":"2026-05-18T00:33:43.453814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06825","created_at":"2026-05-18T00:33:43.453814+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMDVQG72OSYP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMDVQG72OSYP64S3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMDVQG72","created_at":"2026-05-18T12:31:24.725408+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/KMDVQG72OSYP64S3EVR2OARFT2","json":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2.json","graph_json":"https://pith.science/api/pith-number/KMDVQG72OSYP64S3EVR2OARFT2/graph.json","events_json":"https://pith.science/api/pith-number/KMDVQG72OSYP64S3EVR2OARFT2/events.json","paper":"https://pith.science/paper/KMDVQG72"},"agent_actions":{"view_html":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2","download_json":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2.json","view_paper":"https://pith.science/paper/KMDVQG72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06825&json=true","fetch_graph":"https://pith.science/api/pith-number/KMDVQG72OSYP64S3EVR2OARFT2/graph.json","fetch_events":"https://pith.science/api/pith-number/KMDVQG72OSYP64S3EVR2OARFT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2/action/storage_attestation","attest_author":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2/action/author_attestation","sign_citation":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2/action/citation_signature","submit_replication":"https://pith.science/pith/KMDVQG72OSYP64S3EVR2OARFT2/action/replication_record"}},"created_at":"2026-05-18T00:33:43.453814+00:00","updated_at":"2026-05-18T00:33:43.453814+00:00"}