{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DDRBEM3T7RPMSGTEHD5J6WEKET","short_pith_number":"pith:DDRBEM3T","schema_version":"1.0","canonical_sha256":"18e2123373fc5ec91a6438fa9f588a24de55335b5aed247848aecefceed77ce8","source":{"kind":"arxiv","id":"1404.6800","version":2},"attestation_state":"computed","paper":{"title":"Semi-cyclic holey group divisible designs with block size three and applications to sampling designs and optical orthogonal codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruizhong Wei, Tao Feng, Xiaomiao Wang","submitted_at":"2014-04-27T17:53:09Z","abstract_excerpt":"We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\\neq 8 or t is doubly even and t\\neq 8, the existence problem is completely solved; when t is singly even, many infinite families are obtained. Applications of our results to two-dimensional balanced sampling plans and optimal two-dimensional optical orthogonal codes are also discussed."},"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":"1404.6800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-27T17:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"b9f63d410acbde7d1e172350246fcb2682d8be0ace9324900a48b95a236cacfb","abstract_canon_sha256":"6e7427510e36e488ad3accdd1976cd66495540fcfa73b9153f1fee974a8ecc16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:38.125709Z","signature_b64":"AqQVf+khPbY5DtjEqvewUL4meFSqSEVGy9SVBVNyQJy80dO+gdYyl7182d+jX/n/6ZrkhcDSWtW/GeqLotcDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e2123373fc5ec91a6438fa9f588a24de55335b5aed247848aecefceed77ce8","last_reissued_at":"2026-05-18T02:39:38.125299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:38.125299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-cyclic holey group divisible designs with block size three and applications to sampling designs and optical orthogonal codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruizhong Wei, Tao Feng, Xiaomiao Wang","submitted_at":"2014-04-27T17:53:09Z","abstract_excerpt":"We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\\neq 8 or t is doubly even and t\\neq 8, the existence problem is completely solved; when t is singly even, many infinite families are obtained. Applications of our results to two-dimensional balanced sampling plans and optimal two-dimensional optical orthogonal codes are also discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6800","kind":"arxiv","version":2},"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":"1404.6800","created_at":"2026-05-18T02:39:38.125371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6800v2","created_at":"2026-05-18T02:39:38.125371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6800","created_at":"2026-05-18T02:39:38.125371+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDRBEM3T7RPM","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDRBEM3T7RPMSGTE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDRBEM3T","created_at":"2026-05-18T12:28:25.294606+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/DDRBEM3T7RPMSGTEHD5J6WEKET","json":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET.json","graph_json":"https://pith.science/api/pith-number/DDRBEM3T7RPMSGTEHD5J6WEKET/graph.json","events_json":"https://pith.science/api/pith-number/DDRBEM3T7RPMSGTEHD5J6WEKET/events.json","paper":"https://pith.science/paper/DDRBEM3T"},"agent_actions":{"view_html":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET","download_json":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET.json","view_paper":"https://pith.science/paper/DDRBEM3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6800&json=true","fetch_graph":"https://pith.science/api/pith-number/DDRBEM3T7RPMSGTEHD5J6WEKET/graph.json","fetch_events":"https://pith.science/api/pith-number/DDRBEM3T7RPMSGTEHD5J6WEKET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET/action/storage_attestation","attest_author":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET/action/author_attestation","sign_citation":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET/action/citation_signature","submit_replication":"https://pith.science/pith/DDRBEM3T7RPMSGTEHD5J6WEKET/action/replication_record"}},"created_at":"2026-05-18T02:39:38.125371+00:00","updated_at":"2026-05-18T02:39:38.125371+00:00"}