{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SJCG33PDY4FEZG2A44TZJM5JD6","short_pith_number":"pith:SJCG33PD","schema_version":"1.0","canonical_sha256":"92446dede3c70a4c9b40e72794b3a91fbf99c1225dd6f8a63bd0f48660896ab9","source":{"kind":"arxiv","id":"1303.4065","version":1},"attestation_state":"computed","paper":{"title":"A construction of almost Steiner systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich, Rani Hod","submitted_at":"2013-03-17T14:52:41Z","abstract_excerpt":"Let $n$, $k$, and $t$ be integers satisfying $n>k>t\\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An outstanding problem in Design Theory is to determine whether a nontrivial Steiner system exists for $t\\geq6$.\n  In this note we prove that for every $k>t\\ge2$ and sufficiently large $n$, there exists an almost Steiner system with parameters $t$, $k$, and $n$; that is, there exists a $k$-uniform hypergraph on $n$ vertices such that every set of $t$ distinct vertice"},"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":"1303.4065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-17T14:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"f698403c53fc56f4b8604f3bee18f42e2425b9fd1099e931a8c3617ea9776f5c","abstract_canon_sha256":"92bc51297d6cd3481941379a8ed57bc22014786d7e5e68ea2e7c44ebb8214759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:39.951008Z","signature_b64":"Ev67RSK/yL68Z7imnwFMEKV3cvumIEHqP/mPoOI6a8VMMj+DMaMSz+bDy3OsAiqJJlJTv0yIFsPgxfJ8AN+9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92446dede3c70a4c9b40e72794b3a91fbf99c1225dd6f8a63bd0f48660896ab9","last_reissued_at":"2026-05-18T03:30:39.950099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:39.950099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A construction of almost Steiner systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Michael Krivelevich, Rani Hod","submitted_at":"2013-03-17T14:52:41Z","abstract_excerpt":"Let $n$, $k$, and $t$ be integers satisfying $n>k>t\\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An outstanding problem in Design Theory is to determine whether a nontrivial Steiner system exists for $t\\geq6$.\n  In this note we prove that for every $k>t\\ge2$ and sufficiently large $n$, there exists an almost Steiner system with parameters $t$, $k$, and $n$; that is, there exists a $k$-uniform hypergraph on $n$ vertices such that every set of $t$ distinct vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4065","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":"1303.4065","created_at":"2026-05-18T03:30:39.950242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4065v1","created_at":"2026-05-18T03:30:39.950242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4065","created_at":"2026-05-18T03:30:39.950242+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJCG33PDY4FE","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJCG33PDY4FEZG2A","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJCG33PD","created_at":"2026-05-18T12:27:59.945178+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/SJCG33PDY4FEZG2A44TZJM5JD6","json":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6.json","graph_json":"https://pith.science/api/pith-number/SJCG33PDY4FEZG2A44TZJM5JD6/graph.json","events_json":"https://pith.science/api/pith-number/SJCG33PDY4FEZG2A44TZJM5JD6/events.json","paper":"https://pith.science/paper/SJCG33PD"},"agent_actions":{"view_html":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6","download_json":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6.json","view_paper":"https://pith.science/paper/SJCG33PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4065&json=true","fetch_graph":"https://pith.science/api/pith-number/SJCG33PDY4FEZG2A44TZJM5JD6/graph.json","fetch_events":"https://pith.science/api/pith-number/SJCG33PDY4FEZG2A44TZJM5JD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6/action/storage_attestation","attest_author":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6/action/author_attestation","sign_citation":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6/action/citation_signature","submit_replication":"https://pith.science/pith/SJCG33PDY4FEZG2A44TZJM5JD6/action/replication_record"}},"created_at":"2026-05-18T03:30:39.950242+00:00","updated_at":"2026-05-18T03:30:39.950242+00:00"}