{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LRMP7VX4475RCOQZVIVK7YMAEZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6f65036705110743c33a0fe58ea925e1fdeeaed0ed6e1e7ac48ca51895331c03","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T01:40:57Z","title_canon_sha256":"f00413d9af3a1e65c36d629850b654bef6c5710e711dbbb287544ef701d3ed90"},"schema_version":"1.0","source":{"id":"1701.05965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05965","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05965v1","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05965","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"LRMP7VX4475R","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LRMP7VX4475RCOQZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LRMP7VX4","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:8400e6b7b5181bf7890fe438cbb34e79bd530e9651e16b53cee624bacb37d5a1","target":"graph","created_at":"2026-05-18T00:43:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are $S(2, 3, v)$ (Steiner triple systems), $S(3, 4, v)$ (Steiner quadruple systems), and $S(2, 4, v)$. There are a few infinite families of Steiner systems $S(2, 4, v)$ in the literature. The objective of this paper is to present an infinite family of Steiner systems $S(2, 4, 2^m)$ for all $m \\equiv 2 \\pmod{4} \\geq 6$ from cyclic codes. This may be the first coding-theoretic construction of an infinite family of Steiner systems $S(2, 4, v)$. As a by-product, many infinite families of $2$-designs are also","authors_text":"Cunsheng Ding","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T01:40:57Z","title":"An infinite family of Steiner systems $S(2, 4, 2^m)$ from cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05965","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1beb3c02ec0c717a8b2de0135fd40807814fc8caab2c46fc2ff640498fb5eba6","target":"record","created_at":"2026-05-18T00:43:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6f65036705110743c33a0fe58ea925e1fdeeaed0ed6e1e7ac48ca51895331c03","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T01:40:57Z","title_canon_sha256":"f00413d9af3a1e65c36d629850b654bef6c5710e711dbbb287544ef701d3ed90"},"schema_version":"1.0","source":{"id":"1701.05965","kind":"arxiv","version":1}},"canonical_sha256":"5c58ffd6fce7fb113a19aa2aafe18026487503a7f1df29a4d96855ce35f51c06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c58ffd6fce7fb113a19aa2aafe18026487503a7f1df29a4d96855ce35f51c06","first_computed_at":"2026-05-18T00:43:18.013342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:18.013342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9rHD4bIfx1tlIA8PSt3ORfCgvlv8E2++T1gsd6UifGh7a8H5CvqPCZ2BaSTrN2/IDZ6/SM3kuFYQEX76dvFGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:18.013953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1beb3c02ec0c717a8b2de0135fd40807814fc8caab2c46fc2ff640498fb5eba6","sha256:8400e6b7b5181bf7890fe438cbb34e79bd530e9651e16b53cee624bacb37d5a1"],"state_sha256":"cb31f7551f73b89347905ab10fb204c42e909bbf50e0cabbc17153dc9ad44892"}