{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QCMGID6BTLGL3LP6LWN4ZPQBU4","short_pith_number":"pith:QCMGID6B","schema_version":"1.0","canonical_sha256":"8098640fc19accbdadfe5d9bccbe01a728bc4abd21ca66c4152c46086e7c07fa","source":{"kind":"arxiv","id":"1904.04242","version":1},"attestation_state":"computed","paper":{"title":"Infinite families of $2$-designs from a class of cyclic codes with two non-zeros","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cuiling Fan, Rong Wang, Xiaoni Du","submitted_at":"2019-04-07T13:10:13Z","abstract_excerpt":"Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first determine the weight distribution of a class of linear codes derived from the dual of extended cyclic code with two non-zeros. We then obtain infinite families of $2$-designs and explicitly compute their parameters from the supports of all the codewords with a fixed weight in the codes. By simple counting argument, we obtain exponentially many $2$-designs."},"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":"1904.04242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-07T13:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"aacfe7794e1b716a84ae9a9bda7c34e9362c76192162242ce5e0e1fe329b35e1","abstract_canon_sha256":"11990a3f111d147ae69aade935f52ba9127be50020e735b4c73e62c5d13c0709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:59.477337Z","signature_b64":"A/4EcKBx+GUD7Tsx6t1K9RwlS1XtN6JFQt/9uV9x5hm807yDD9GM6r2ub4bo/1aiEtBsB55+fMrC1K7fWqyuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8098640fc19accbdadfe5d9bccbe01a728bc4abd21ca66c4152c46086e7c07fa","last_reissued_at":"2026-05-17T23:48:59.476904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:59.476904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite families of $2$-designs from a class of cyclic codes with two non-zeros","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cuiling Fan, Rong Wang, Xiaoni Du","submitted_at":"2019-04-07T13:10:13Z","abstract_excerpt":"Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first determine the weight distribution of a class of linear codes derived from the dual of extended cyclic code with two non-zeros. We then obtain infinite families of $2$-designs and explicitly compute their parameters from the supports of all the codewords with a fixed weight in the codes. By simple counting argument, we obtain exponentially many $2$-designs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04242","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":"1904.04242","created_at":"2026-05-17T23:48:59.476979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04242v1","created_at":"2026-05-17T23:48:59.476979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04242","created_at":"2026-05-17T23:48:59.476979+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCMGID6BTLGL","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCMGID6BTLGL3LP6","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCMGID6B","created_at":"2026-05-18T12:33:27.125529+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/QCMGID6BTLGL3LP6LWN4ZPQBU4","json":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4.json","graph_json":"https://pith.science/api/pith-number/QCMGID6BTLGL3LP6LWN4ZPQBU4/graph.json","events_json":"https://pith.science/api/pith-number/QCMGID6BTLGL3LP6LWN4ZPQBU4/events.json","paper":"https://pith.science/paper/QCMGID6B"},"agent_actions":{"view_html":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4","download_json":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4.json","view_paper":"https://pith.science/paper/QCMGID6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04242&json=true","fetch_graph":"https://pith.science/api/pith-number/QCMGID6BTLGL3LP6LWN4ZPQBU4/graph.json","fetch_events":"https://pith.science/api/pith-number/QCMGID6BTLGL3LP6LWN4ZPQBU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4/action/storage_attestation","attest_author":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4/action/author_attestation","sign_citation":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4/action/citation_signature","submit_replication":"https://pith.science/pith/QCMGID6BTLGL3LP6LWN4ZPQBU4/action/replication_record"}},"created_at":"2026-05-17T23:48:59.476979+00:00","updated_at":"2026-05-17T23:48:59.476979+00:00"}