{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZMFRU43F24T2LPKC2SFN66HPWA","short_pith_number":"pith:ZMFRU43F","schema_version":"1.0","canonical_sha256":"cb0b1a7365d727a5bd42d48adf78efb034ff98b003875421a4ae5dd38234351a","source":{"kind":"arxiv","id":"1110.3463","version":1},"attestation_state":"computed","paper":{"title":"Nonexistence Results for Tight Block Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jesse Short-Gershman, Peter Dukes","submitted_at":"2011-10-16T07:58:40Z","abstract_excerpt":"Recall that combinatorial $2s$-designs admit a classical lower bound $b \\ge \\binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely many nontrivial tight $2s$-designs for each fixed $s \\ge 5$, although no concrete understanding of `finitely many' is given. Here, we use the Smith Bound on approximate polynomial zeros to quantify this asymptotic nonexistence. Then, we outline and employ a computer search over the remaining parameter sets to establish (as expected) that there are in fact no s"},"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":"1110.3463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-16T07:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"01315d987873f64befa241d21a531ea7448e82fe90fe86dc1761e05752451d7c","abstract_canon_sha256":"efd168bcb06dfdab8c798175fc85f35169692cbdb38404fe4a06018ee018338c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:55.655174Z","signature_b64":"llCaLBI6QiVTWS5MQwZ/q7xKrvFGZPUA5eC/5lYJl4+pUyMnHRrCkRh4pgk8KGCKBp+U7b9FQwF15YTzFcjMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb0b1a7365d727a5bd42d48adf78efb034ff98b003875421a4ae5dd38234351a","last_reissued_at":"2026-05-18T04:10:55.654641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:55.654641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonexistence Results for Tight Block Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jesse Short-Gershman, Peter Dukes","submitted_at":"2011-10-16T07:58:40Z","abstract_excerpt":"Recall that combinatorial $2s$-designs admit a classical lower bound $b \\ge \\binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely many nontrivial tight $2s$-designs for each fixed $s \\ge 5$, although no concrete understanding of `finitely many' is given. Here, we use the Smith Bound on approximate polynomial zeros to quantify this asymptotic nonexistence. Then, we outline and employ a computer search over the remaining parameter sets to establish (as expected) that there are in fact no s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3463","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":"1110.3463","created_at":"2026-05-18T04:10:55.654726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3463v1","created_at":"2026-05-18T04:10:55.654726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3463","created_at":"2026-05-18T04:10:55.654726+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMFRU43F24T2","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMFRU43F24T2LPKC","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMFRU43F","created_at":"2026-05-18T12:26:47.523578+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/ZMFRU43F24T2LPKC2SFN66HPWA","json":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA.json","graph_json":"https://pith.science/api/pith-number/ZMFRU43F24T2LPKC2SFN66HPWA/graph.json","events_json":"https://pith.science/api/pith-number/ZMFRU43F24T2LPKC2SFN66HPWA/events.json","paper":"https://pith.science/paper/ZMFRU43F"},"agent_actions":{"view_html":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA","download_json":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA.json","view_paper":"https://pith.science/paper/ZMFRU43F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3463&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMFRU43F24T2LPKC2SFN66HPWA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMFRU43F24T2LPKC2SFN66HPWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA/action/storage_attestation","attest_author":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA/action/author_attestation","sign_citation":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA/action/citation_signature","submit_replication":"https://pith.science/pith/ZMFRU43F24T2LPKC2SFN66HPWA/action/replication_record"}},"created_at":"2026-05-18T04:10:55.654726+00:00","updated_at":"2026-05-18T04:10:55.654726+00:00"}