{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DYPJ2XY4Z44GH3KA3X3E7YTHE7","short_pith_number":"pith:DYPJ2XY4","schema_version":"1.0","canonical_sha256":"1e1e9d5f1ccf3863ed40ddf64fe26727eabcf0cd5ab224c08675342f7ee91358","source":{"kind":"arxiv","id":"1812.05147","version":1},"attestation_state":"computed","paper":{"title":"Constructions of optimal orthogonal arrays with repeated rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch","submitted_at":"2018-12-12T20:21:58Z","abstract_excerpt":"We construct orthogonal arrays OA$_{\\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \\lambda$ is as large as possible; these OAs are termed optimal. We provide constructions of optimal OAs for any $k \\geq n+1$, albeit with large $\\lambda$. We also study basic OAs; these are optimal OAs in which $\\gcd(m,\\lambda) = 1$. We construct a basic OA with $n=2$ and $k =4t+1$, provided that a Hadamard matrix of order $8t+4$ exists. This completely solves the problem of constructing basic OAs w"},"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":"1812.05147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-12T20:21:58Z","cross_cats_sorted":[],"title_canon_sha256":"8b65f1fff91f8b448b6b7b9241dd8757f19fb144008329870a5e712030a4ed97","abstract_canon_sha256":"8cdc3e705b1df751dcf933a46071f52bc2a7a8ff2d694d3ac492dc7abcb239bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.386806Z","signature_b64":"kdT6/bpa/k8FVPVWDTWx9UJCLvtVysQAueJcK0ooCj4FwKKmlcIr+K+qHARph1jr40Epnm58g3UgC6fV7nRGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e1e9d5f1ccf3863ed40ddf64fe26727eabcf0cd5ab224c08675342f7ee91358","last_reissued_at":"2026-05-17T23:58:24.386210Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.386210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions of optimal orthogonal arrays with repeated rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch","submitted_at":"2018-12-12T20:21:58Z","abstract_excerpt":"We construct orthogonal arrays OA$_{\\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \\lambda$ is as large as possible; these OAs are termed optimal. We provide constructions of optimal OAs for any $k \\geq n+1$, albeit with large $\\lambda$. We also study basic OAs; these are optimal OAs in which $\\gcd(m,\\lambda) = 1$. We construct a basic OA with $n=2$ and $k =4t+1$, provided that a Hadamard matrix of order $8t+4$ exists. This completely solves the problem of constructing basic OAs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05147","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":"1812.05147","created_at":"2026-05-17T23:58:24.386329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05147v1","created_at":"2026-05-17T23:58:24.386329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05147","created_at":"2026-05-17T23:58:24.386329+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYPJ2XY4Z44G","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYPJ2XY4Z44GH3KA","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYPJ2XY4","created_at":"2026-05-18T12:32:19.392346+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/DYPJ2XY4Z44GH3KA3X3E7YTHE7","json":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7.json","graph_json":"https://pith.science/api/pith-number/DYPJ2XY4Z44GH3KA3X3E7YTHE7/graph.json","events_json":"https://pith.science/api/pith-number/DYPJ2XY4Z44GH3KA3X3E7YTHE7/events.json","paper":"https://pith.science/paper/DYPJ2XY4"},"agent_actions":{"view_html":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7","download_json":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7.json","view_paper":"https://pith.science/paper/DYPJ2XY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05147&json=true","fetch_graph":"https://pith.science/api/pith-number/DYPJ2XY4Z44GH3KA3X3E7YTHE7/graph.json","fetch_events":"https://pith.science/api/pith-number/DYPJ2XY4Z44GH3KA3X3E7YTHE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7/action/storage_attestation","attest_author":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7/action/author_attestation","sign_citation":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7/action/citation_signature","submit_replication":"https://pith.science/pith/DYPJ2XY4Z44GH3KA3X3E7YTHE7/action/replication_record"}},"created_at":"2026-05-17T23:58:24.386329+00:00","updated_at":"2026-05-17T23:58:24.386329+00:00"}