{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:37PTEKPRA3IEV3UEB4FWCHCYQB","short_pith_number":"pith:37PTEKPR","schema_version":"1.0","canonical_sha256":"dfdf3229f106d04aee840f0b611c588047e12578b2499e975306e43017563d94","source":{"kind":"arxiv","id":"1903.07459","version":1},"attestation_state":"computed","paper":{"title":"Infinite families of $2$-designs from two classes of linear codes","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-18T14:05:32Z","abstract_excerpt":"The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining the weight distributions of two classes of linear codes, we derive infinite families of $2$-designs from the supports of codewords with a fixed weight in these codes, and explicitly obtain their parameters."},"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.07459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-18T14:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"085c06a7f25c61a53d521a0c185560333b6bd647b19999be39f7f4c4441b8afe","abstract_canon_sha256":"559b1cbc1ec920ae9d679fa6eef8b2eca7215e8b6f3e671bb27574105b2cabfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.362980Z","signature_b64":"4UYEmH1Ju/HPcWn5Y6YUjuxh00SfdJmD2aJHqugP2/8irkppqAifhamdb79hAeMgUDWByPjNHLDm36eG7d+JBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfdf3229f106d04aee840f0b611c588047e12578b2499e975306e43017563d94","last_reissued_at":"2026-05-17T23:51:01.362455Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.362455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite families of $2$-designs from two classes of linear codes","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-18T14:05:32Z","abstract_excerpt":"The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining the weight distributions of two classes of linear codes, we derive infinite families of $2$-designs from the supports of codewords with a fixed weight in these codes, and explicitly obtain their parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07459","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.07459","created_at":"2026-05-17T23:51:01.362528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07459v1","created_at":"2026-05-17T23:51:01.362528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07459","created_at":"2026-05-17T23:51:01.362528+00:00"},{"alias_kind":"pith_short_12","alias_value":"37PTEKPRA3IE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"37PTEKPRA3IEV3UE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"37PTEKPR","created_at":"2026-05-18T12:33:07.085635+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":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB","json":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB.json","graph_json":"https://pith.science/api/pith-number/37PTEKPRA3IEV3UEB4FWCHCYQB/graph.json","events_json":"https://pith.science/api/pith-number/37PTEKPRA3IEV3UEB4FWCHCYQB/events.json","paper":"https://pith.science/paper/37PTEKPR"},"agent_actions":{"view_html":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB","download_json":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB.json","view_paper":"https://pith.science/paper/37PTEKPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07459&json=true","fetch_graph":"https://pith.science/api/pith-number/37PTEKPRA3IEV3UEB4FWCHCYQB/graph.json","fetch_events":"https://pith.science/api/pith-number/37PTEKPRA3IEV3UEB4FWCHCYQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB/action/storage_attestation","attest_author":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB/action/author_attestation","sign_citation":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB/action/citation_signature","submit_replication":"https://pith.science/pith/37PTEKPRA3IEV3UEB4FWCHCYQB/action/replication_record"}},"created_at":"2026-05-17T23:51:01.362528+00:00","updated_at":"2026-05-17T23:51:01.362528+00:00"}