{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YA3NBAZJAKGACV7O45TWDYGF32","short_pith_number":"pith:YA3NBAZJ","schema_version":"1.0","canonical_sha256":"c036d08329028c0157eee76761e0c5debbf84619c85b89d2976d7d044fc983d3","source":{"kind":"arxiv","id":"2506.00429","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Chunming Tang, Cuiling Fan, Hengfeng Liu, Rong Luo","submitted_at":"2025-05-31T07:16:20Z","abstract_excerpt":"In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for the incidence structures to form $1$-designs in finite abelian $p$-groups, generalizing existing results on vector spaces over finite fields. For finite abelian groups of exponent $pq$, we also propose sufficient and necessary conditions for the incidence structures to form a $1$-designs. Furthermore, some interesting observations of the general case when the "},"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":"2506.00429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-31T07:16:20Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0edd22d6e952f7c5e704046cd8ad530178c0745cac79b37d11460fc2dcb70eb6","abstract_canon_sha256":"bc0dc1cc30af575da487283c238989343485b31049db8885d07a9a252ae152ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:34.654467Z","signature_b64":"qRN9CwDnC1pJBqig/9g4CeoFJfMU5fwquS1gig8tM6RbrMHZH2qeJ19IKSmU2ivbIXOkZkiCqUXyVJZo/nGcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c036d08329028c0157eee76761e0c5debbf84619c85b89d2976d7d044fc983d3","last_reissued_at":"2026-07-05T11:13:34.654009Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:34.654009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Chunming Tang, Cuiling Fan, Hengfeng Liu, Rong Luo","submitted_at":"2025-05-31T07:16:20Z","abstract_excerpt":"In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for the incidence structures to form $1$-designs in finite abelian $p$-groups, generalizing existing results on vector spaces over finite fields. For finite abelian groups of exponent $pq$, we also propose sufficient and necessary conditions for the incidence structures to form a $1$-designs. Furthermore, some interesting observations of the general case when the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00429","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.00429/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.00429","created_at":"2026-07-05T11:13:34.654066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00429v1","created_at":"2026-07-05T11:13:34.654066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00429","created_at":"2026-07-05T11:13:34.654066+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA3NBAZJAKGA","created_at":"2026-07-05T11:13:34.654066+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA3NBAZJAKGACV7O","created_at":"2026-07-05T11:13:34.654066+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA3NBAZJ","created_at":"2026-07-05T11:13:34.654066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.16793","citing_title":"A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32","json":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32.json","graph_json":"https://pith.science/api/pith-number/YA3NBAZJAKGACV7O45TWDYGF32/graph.json","events_json":"https://pith.science/api/pith-number/YA3NBAZJAKGACV7O45TWDYGF32/events.json","paper":"https://pith.science/paper/YA3NBAZJ"},"agent_actions":{"view_html":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32","download_json":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32.json","view_paper":"https://pith.science/paper/YA3NBAZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00429&json=true","fetch_graph":"https://pith.science/api/pith-number/YA3NBAZJAKGACV7O45TWDYGF32/graph.json","fetch_events":"https://pith.science/api/pith-number/YA3NBAZJAKGACV7O45TWDYGF32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32/action/storage_attestation","attest_author":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32/action/author_attestation","sign_citation":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32/action/citation_signature","submit_replication":"https://pith.science/pith/YA3NBAZJAKGACV7O45TWDYGF32/action/replication_record"}},"created_at":"2026-07-05T11:13:34.654066+00:00","updated_at":"2026-07-05T11:13:34.654066+00:00"}