{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GQCUXZO2A5EQN47JDDOPY7SEW5","short_pith_number":"pith:GQCUXZO2","canonical_record":{"source":{"id":"1607.04813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-17T00:47:02Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"de547ea91339d073d5abac6b161f3a7727144a136624819d27765396a9ce31f3","abstract_canon_sha256":"c2d5db60b433d0a6f7704cf6b28810d12fc4996f05814183cb6b81d9c7fcdf0e"},"schema_version":"1.0"},"canonical_sha256":"34054be5da074906f3e918dcfc7e44b773625cfc51b0f72a22384b607f793848","source":{"kind":"arxiv","id":"1607.04813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04813","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04813v1","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04813","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"GQCUXZO2A5EQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GQCUXZO2A5EQN47J","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GQCUXZO2","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GQCUXZO2A5EQN47JDDOPY7SEW5","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-17T00:47:02Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"de547ea91339d073d5abac6b161f3a7727144a136624819d27765396a9ce31f3","abstract_canon_sha256":"c2d5db60b433d0a6f7704cf6b28810d12fc4996f05814183cb6b81d9c7fcdf0e"},"schema_version":"1.0"},"canonical_sha256":"34054be5da074906f3e918dcfc7e44b773625cfc51b0f72a22384b607f793848","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.461109Z","signature_b64":"XmCAmbavgQzcrxZbnxtBSjXoH6JYO0426BW8PTDZcNY+jYzKs1uoNx0/RbG67QHsPEzPF4jjLQeS0TtruCUtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34054be5da074906f3e918dcfc7e44b773625cfc51b0f72a22384b607f793848","last_reissued_at":"2026-05-18T00:43:18.460502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.460502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04813","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbEv/j6N3V72dP0EZguG08NDWIdTlW9mlo2OYfsMUt9LMVx/F29vLBRhHU9LVhs0y8zddzdZZjlPD7atmkpgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:05:30.281061Z"},"content_sha256":"6351e089ebd2c01619ece54d85b3a148ca061ae14c69c5b54478738ac7d04299","schema_version":"1.0","event_id":"sha256:6351e089ebd2c01619ece54d85b3a148ca061ae14c69c5b54478738ac7d04299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GQCUXZO2A5EQN47JDDOPY7SEW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite families of 2-designs and 3-designs from linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Cunsheng Ding","submitted_at":"2016-07-17T00:47:02Z","abstract_excerpt":"The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs were derived from some linear codes of certain parameters. The major objective of this paper is to construct many infinite families of $2$-designs and $3$-designs from linear codes. The parameters of some known $t$-designs are also derived. In addition, many conjectured infinite families of $2$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04813","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DOrV6Uvut3jhW5R/9PdZUwf5G5nd46+764UcIJ2AmUr7o5wcxv0RnjrUL2cO3lSpgCDN7kxMZ4RjIHdAEuEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:05:30.281404Z"},"content_sha256":"5f11a19ec47497186d8bb6a65e5bbda69b18a0c06ca3d4cb84934a6b6c1a9273","schema_version":"1.0","event_id":"sha256:5f11a19ec47497186d8bb6a65e5bbda69b18a0c06ca3d4cb84934a6b6c1a9273"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQCUXZO2A5EQN47JDDOPY7SEW5/bundle.json","state_url":"https://pith.science/pith/GQCUXZO2A5EQN47JDDOPY7SEW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQCUXZO2A5EQN47JDDOPY7SEW5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T06:05:30Z","links":{"resolver":"https://pith.science/pith/GQCUXZO2A5EQN47JDDOPY7SEW5","bundle":"https://pith.science/pith/GQCUXZO2A5EQN47JDDOPY7SEW5/bundle.json","state":"https://pith.science/pith/GQCUXZO2A5EQN47JDDOPY7SEW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQCUXZO2A5EQN47JDDOPY7SEW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GQCUXZO2A5EQN47JDDOPY7SEW5","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":"c2d5db60b433d0a6f7704cf6b28810d12fc4996f05814183cb6b81d9c7fcdf0e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-17T00:47:02Z","title_canon_sha256":"de547ea91339d073d5abac6b161f3a7727144a136624819d27765396a9ce31f3"},"schema_version":"1.0","source":{"id":"1607.04813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04813","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04813v1","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04813","created_at":"2026-05-18T00:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"GQCUXZO2A5EQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GQCUXZO2A5EQN47J","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GQCUXZO2","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:5f11a19ec47497186d8bb6a65e5bbda69b18a0c06ca3d4cb84934a6b6c1a9273","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":"The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs were derived from some linear codes of certain parameters. The major objective of this paper is to construct many infinite families of $2$-designs and $3$-designs from linear codes. The parameters of some known $t$-designs are also derived. In addition, many conjectured infinite families of $2$-","authors_text":"Chengju Li, Cunsheng Ding","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-17T00:47:02Z","title":"Infinite families of 2-designs and 3-designs from linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04813","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:6351e089ebd2c01619ece54d85b3a148ca061ae14c69c5b54478738ac7d04299","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":"c2d5db60b433d0a6f7704cf6b28810d12fc4996f05814183cb6b81d9c7fcdf0e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-17T00:47:02Z","title_canon_sha256":"de547ea91339d073d5abac6b161f3a7727144a136624819d27765396a9ce31f3"},"schema_version":"1.0","source":{"id":"1607.04813","kind":"arxiv","version":1}},"canonical_sha256":"34054be5da074906f3e918dcfc7e44b773625cfc51b0f72a22384b607f793848","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34054be5da074906f3e918dcfc7e44b773625cfc51b0f72a22384b607f793848","first_computed_at":"2026-05-18T00:43:18.460502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:18.460502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XmCAmbavgQzcrxZbnxtBSjXoH6JYO0426BW8PTDZcNY+jYzKs1uoNx0/RbG67QHsPEzPF4jjLQeS0TtruCUtCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:18.461109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6351e089ebd2c01619ece54d85b3a148ca061ae14c69c5b54478738ac7d04299","sha256:5f11a19ec47497186d8bb6a65e5bbda69b18a0c06ca3d4cb84934a6b6c1a9273"],"state_sha256":"ab31444e5ada46e6d75dbaf530fe6f5eb3bd1ebe9aa0a9c1f581fb0dbc15f18f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Id9CYADJHVndm79XNpB+6EwKqlEO+R0roCNgkeOuLSSLcbRK2D5EwvQzGhLgZPeUcw6LcM+OmPfqPI5+wlmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:05:30.283938Z","bundle_sha256":"fbcb7fc23808eed1cd847694395d703f2b4dab792bf3cd12fdbf1354b5a773c5"}}