{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OHKHFTA5PJABPPMZBYIDXI6S22","short_pith_number":"pith:OHKHFTA5","schema_version":"1.0","canonical_sha256":"71d472cc1d7a4017bd990e103ba3d2d6a14fb863786fce2ad7eb8d319bce6319","source":{"kind":"arxiv","id":"1805.10350","version":2},"attestation_state":"computed","paper":{"title":"A general construction of Ordered Orthogonal Arrays using LFSRs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Daniel Panario, Daniel Wevrick, Mark Saaltink","submitted_at":"2018-05-25T20:06:50Z","abstract_excerpt":"In \\cite{Castoldi}, $q^t \\by (q+1)t$ ordered orthogonal arrays (OOAs) of strength $t$ over the alphabet $\\FF_q$ were constructed using linear feedback shift register sequences (LFSRs) defined by {\\em primitive} polynomials in $\\FF_q[x]$. In this paper we extend this result to all polynomials in $\\FF_q[x]$ which satisfy some fairly simple restrictions, restrictions that are automatically satisfied by primitive polynomials. While these restrictions sometimes reduce the number of columns produced from $(q+1)t$ to a smaller multiple of $t$, in many cases we still obtain the maximum number of colum"},"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":"1805.10350","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-05-25T20:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"9cc582b829eddd4a700fb6a98f056dbccc6c3dda85d1a4907df1f4e88ce33f03","abstract_canon_sha256":"85d9e89c440457fd2006123e1fa179a24504e7ee16a031b828d81ef250c247ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:41.300985Z","signature_b64":"ndJeaBv6XS8NNJJ8bwqPqJe1VqcNCZ9vUp9X6KoiSehgIfHy+fZHO7ryCWVxd1VeIy1K2QuMKWj+OpFd00a9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d472cc1d7a4017bd990e103ba3d2d6a14fb863786fce2ad7eb8d319bce6319","last_reissued_at":"2026-05-17T23:56:41.300343Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:41.300343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general construction of Ordered Orthogonal Arrays using LFSRs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Daniel Panario, Daniel Wevrick, Mark Saaltink","submitted_at":"2018-05-25T20:06:50Z","abstract_excerpt":"In \\cite{Castoldi}, $q^t \\by (q+1)t$ ordered orthogonal arrays (OOAs) of strength $t$ over the alphabet $\\FF_q$ were constructed using linear feedback shift register sequences (LFSRs) defined by {\\em primitive} polynomials in $\\FF_q[x]$. In this paper we extend this result to all polynomials in $\\FF_q[x]$ which satisfy some fairly simple restrictions, restrictions that are automatically satisfied by primitive polynomials. While these restrictions sometimes reduce the number of columns produced from $(q+1)t$ to a smaller multiple of $t$, in many cases we still obtain the maximum number of colum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10350","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":"1805.10350","created_at":"2026-05-17T23:56:41.300448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10350v2","created_at":"2026-05-17T23:56:41.300448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10350","created_at":"2026-05-17T23:56:41.300448+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHKHFTA5PJAB","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHKHFTA5PJABPPMZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHKHFTA5","created_at":"2026-05-18T12:32:43.782077+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/OHKHFTA5PJABPPMZBYIDXI6S22","json":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22.json","graph_json":"https://pith.science/api/pith-number/OHKHFTA5PJABPPMZBYIDXI6S22/graph.json","events_json":"https://pith.science/api/pith-number/OHKHFTA5PJABPPMZBYIDXI6S22/events.json","paper":"https://pith.science/paper/OHKHFTA5"},"agent_actions":{"view_html":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22","download_json":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22.json","view_paper":"https://pith.science/paper/OHKHFTA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10350&json=true","fetch_graph":"https://pith.science/api/pith-number/OHKHFTA5PJABPPMZBYIDXI6S22/graph.json","fetch_events":"https://pith.science/api/pith-number/OHKHFTA5PJABPPMZBYIDXI6S22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22/action/storage_attestation","attest_author":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22/action/author_attestation","sign_citation":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22/action/citation_signature","submit_replication":"https://pith.science/pith/OHKHFTA5PJABPPMZBYIDXI6S22/action/replication_record"}},"created_at":"2026-05-17T23:56:41.300448+00:00","updated_at":"2026-05-17T23:56:41.300448+00:00"}