{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OMMPGK2APT3EPKOSD2RKCEOOH2","short_pith_number":"pith:OMMPGK2A","schema_version":"1.0","canonical_sha256":"7318f32b407cf647a9d21ea2a111ce3e9925e17cb8fc70a17514d48fee7867dc","source":{"kind":"arxiv","id":"1903.08153","version":1},"attestation_state":"computed","paper":{"title":"Infinite families of $2$-designs from two classes of binary cyclic codes with three nonzeros","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunming Tang, Qi Wang, Rong Wang, Xiaoni Du","submitted_at":"2019-03-19T04:30:21Z","abstract_excerpt":"Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs from codes has been done. In this paper, we determine the weight distributions of two classes of cyclic codes: one related to the triple-error correcting binary BCH codes, and the other related to the cyclic codes with parameters satisfying the generalized Kasami case, respectively. We then obtain infinite families of $2$-designs from these codes by proving"},"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":"1903.08153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T04:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"b79a288795afc7633a6e28c64ac7c19f0ddbc52ce6d6411779a865fe6a5c0b11","abstract_canon_sha256":"07f035a5afee2da5b5844ca56a13bb0d763acb3ed7424530a67fabdf7afa74e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:50.282206Z","signature_b64":"hL87b2uFuFEdhGClwgzfagdL97PNOBnWo+FkW2WfAtGlxxX+Qjw8gm3tWOkcksAI1X5hCMSI4ORP+oq/pkiJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7318f32b407cf647a9d21ea2a111ce3e9925e17cb8fc70a17514d48fee7867dc","last_reissued_at":"2026-05-17T23:50:50.281559Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:50.281559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite families of $2$-designs from two classes of binary cyclic codes with three nonzeros","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunming Tang, Qi Wang, Rong Wang, Xiaoni Du","submitted_at":"2019-03-19T04:30:21Z","abstract_excerpt":"Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs from codes has been done. In this paper, we determine the weight distributions of two classes of cyclic codes: one related to the triple-error correcting binary BCH codes, and the other related to the cyclic codes with parameters satisfying the generalized Kasami case, respectively. We then obtain infinite families of $2$-designs from these codes by proving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08153","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":"1903.08153","created_at":"2026-05-17T23:50:50.281666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08153v1","created_at":"2026-05-17T23:50:50.281666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08153","created_at":"2026-05-17T23:50:50.281666+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMMPGK2APT3E","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMMPGK2APT3EPKOS","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMMPGK2A","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.06235","citing_title":"Combinatorial t-designs from quadratic functions","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2","json":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2.json","graph_json":"https://pith.science/api/pith-number/OMMPGK2APT3EPKOSD2RKCEOOH2/graph.json","events_json":"https://pith.science/api/pith-number/OMMPGK2APT3EPKOSD2RKCEOOH2/events.json","paper":"https://pith.science/paper/OMMPGK2A"},"agent_actions":{"view_html":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2","download_json":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2.json","view_paper":"https://pith.science/paper/OMMPGK2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08153&json=true","fetch_graph":"https://pith.science/api/pith-number/OMMPGK2APT3EPKOSD2RKCEOOH2/graph.json","fetch_events":"https://pith.science/api/pith-number/OMMPGK2APT3EPKOSD2RKCEOOH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2/action/storage_attestation","attest_author":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2/action/author_attestation","sign_citation":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2/action/citation_signature","submit_replication":"https://pith.science/pith/OMMPGK2APT3EPKOSD2RKCEOOH2/action/replication_record"}},"created_at":"2026-05-17T23:50:50.281666+00:00","updated_at":"2026-05-17T23:50:50.281666+00:00"}