{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V7MUFLBUPA223MB6YVGE7RL6MW","short_pith_number":"pith:V7MUFLBU","schema_version":"1.0","canonical_sha256":"afd942ac347835adb03ec54c4fc57e6597d9d540ef2af2c664e0de9a35fb04e8","source":{"kind":"arxiv","id":"1607.04815","version":1},"attestation_state":"computed","paper":{"title":"Infinite families of $t$-designs from a type of five-weight codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding","submitted_at":"2016-07-17T00:53:01Z","abstract_excerpt":"It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of constructing codes from $t$-designs has been made, only a small amount of work on the construction of $t$-designs from codes has been done. The objective of this paper is to construct infinite families of $2$-designs and $3$-designs from a type of binary linear codes with five-weights. The total number of $2$-designs and $3$-designs obtained in this paper are exponent"},"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":"1607.04815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-17T00:53:01Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"3ce87f7aa9d7f27bb4c402c2cdf6b743e565898646040b45f4608e890b802f38","abstract_canon_sha256":"8a1c1867e83848f5a8f6c96b96ac3d76092e893d9522fe50f51658850d578728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.450596Z","signature_b64":"9Jjs3lF3imZX8eqCJHyUh3WmDfLLgmNYKXixeFRKetCmtVjIh3ZGZf0jZEtrL3OfRCHUGDGEXGGHTvMoTy9rAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd942ac347835adb03ec54c4fc57e6597d9d540ef2af2c664e0de9a35fb04e8","last_reissued_at":"2026-05-18T00:43:18.449840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.449840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite families of $t$-designs from a type of five-weight codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding","submitted_at":"2016-07-17T00:53:01Z","abstract_excerpt":"It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of constructing codes from $t$-designs has been made, only a small amount of work on the construction of $t$-designs from codes has been done. The objective of this paper is to construct infinite families of $2$-designs and $3$-designs from a type of binary linear codes with five-weights. The total number of $2$-designs and $3$-designs obtained in this paper are exponent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04815","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":"1607.04815","created_at":"2026-05-18T00:43:18.449952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04815v1","created_at":"2026-05-18T00:43:18.449952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04815","created_at":"2026-05-18T00:43:18.449952+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7MUFLBUPA22","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7MUFLBUPA223MB6","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7MUFLBU","created_at":"2026-05-18T12:30:48.956258+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/V7MUFLBUPA223MB6YVGE7RL6MW","json":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW.json","graph_json":"https://pith.science/api/pith-number/V7MUFLBUPA223MB6YVGE7RL6MW/graph.json","events_json":"https://pith.science/api/pith-number/V7MUFLBUPA223MB6YVGE7RL6MW/events.json","paper":"https://pith.science/paper/V7MUFLBU"},"agent_actions":{"view_html":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW","download_json":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW.json","view_paper":"https://pith.science/paper/V7MUFLBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04815&json=true","fetch_graph":"https://pith.science/api/pith-number/V7MUFLBUPA223MB6YVGE7RL6MW/graph.json","fetch_events":"https://pith.science/api/pith-number/V7MUFLBUPA223MB6YVGE7RL6MW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW/action/storage_attestation","attest_author":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW/action/author_attestation","sign_citation":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW/action/citation_signature","submit_replication":"https://pith.science/pith/V7MUFLBUPA223MB6YVGE7RL6MW/action/replication_record"}},"created_at":"2026-05-18T00:43:18.449952+00:00","updated_at":"2026-05-18T00:43:18.449952+00:00"}