{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D7NMOBBYLMB6RVWWTNNAU2IJO4","short_pith_number":"pith:D7NMOBBY","schema_version":"1.0","canonical_sha256":"1fdac704385b03e8d6d69b5a0a6909770708181517c126818006761b645d56c4","source":{"kind":"arxiv","id":"1401.7889","version":1},"attestation_state":"computed","paper":{"title":"Direct constructions for general families of cyclic mutually nearly orthogonal Latin squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdollah Khodkar, Diane Donovan, Fatih Demirkale","submitted_at":"2014-01-30T15:47:21Z","abstract_excerpt":"Two Latin squares $L=[l(i,j)]$ and $M=[m(i,j)]$, of even order $n$ with entries $\\{0,1,2,\\ldots,n-1\\}$, are said to be nearly orthogonal if the superimposition of $L$ on $M$ yields an $n\\times n$ array $A=[(l(i,j),m(i,j))]$ in which each ordered pair $(x,y)$, $0\\leq x,y\\leq n-1$ and $x\\neq y$, occurs at least once and the ordered pair $(x,x+n/2)$ occurs exactly twice. In this paper, we present direct constructions for the existence of general families of three cyclic mutually orthogonal Latin squares of orders $48k+14$, $48k+22$, $48k+38$ and $48k+46$. The techniques employed are based on 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":"1401.7889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T15:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"4193ac5161ceb16bb113d722ab278bdc455a30272bf87223dbbb54642b3466b6","abstract_canon_sha256":"c644bcd67f4aae11a04887a1f3c7985b67e46ad59672eef49671ec693146d0f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:38.044282Z","signature_b64":"qn/nggfTWMeNG0MRHO0hcWqYTJpShHrroAWN/3ogJe1kiIloRVMcMl4YC4A9bAbvsOQQxaVUOPZvJgv21/QsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fdac704385b03e8d6d69b5a0a6909770708181517c126818006761b645d56c4","last_reissued_at":"2026-05-18T03:00:38.043535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:38.043535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Direct constructions for general families of cyclic mutually nearly orthogonal Latin squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdollah Khodkar, Diane Donovan, Fatih Demirkale","submitted_at":"2014-01-30T15:47:21Z","abstract_excerpt":"Two Latin squares $L=[l(i,j)]$ and $M=[m(i,j)]$, of even order $n$ with entries $\\{0,1,2,\\ldots,n-1\\}$, are said to be nearly orthogonal if the superimposition of $L$ on $M$ yields an $n\\times n$ array $A=[(l(i,j),m(i,j))]$ in which each ordered pair $(x,y)$, $0\\leq x,y\\leq n-1$ and $x\\neq y$, occurs at least once and the ordered pair $(x,x+n/2)$ occurs exactly twice. In this paper, we present direct constructions for the existence of general families of three cyclic mutually orthogonal Latin squares of orders $48k+14$, $48k+22$, $48k+38$ and $48k+46$. The techniques employed are based on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7889","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":"1401.7889","created_at":"2026-05-18T03:00:38.043668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7889v1","created_at":"2026-05-18T03:00:38.043668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7889","created_at":"2026-05-18T03:00:38.043668+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7NMOBBYLMB6","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7NMOBBYLMB6RVWW","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7NMOBBY","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/D7NMOBBYLMB6RVWWTNNAU2IJO4","json":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4.json","graph_json":"https://pith.science/api/pith-number/D7NMOBBYLMB6RVWWTNNAU2IJO4/graph.json","events_json":"https://pith.science/api/pith-number/D7NMOBBYLMB6RVWWTNNAU2IJO4/events.json","paper":"https://pith.science/paper/D7NMOBBY"},"agent_actions":{"view_html":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4","download_json":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4.json","view_paper":"https://pith.science/paper/D7NMOBBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7889&json=true","fetch_graph":"https://pith.science/api/pith-number/D7NMOBBYLMB6RVWWTNNAU2IJO4/graph.json","fetch_events":"https://pith.science/api/pith-number/D7NMOBBYLMB6RVWWTNNAU2IJO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4/action/storage_attestation","attest_author":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4/action/author_attestation","sign_citation":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4/action/citation_signature","submit_replication":"https://pith.science/pith/D7NMOBBYLMB6RVWWTNNAU2IJO4/action/replication_record"}},"created_at":"2026-05-18T03:00:38.043668+00:00","updated_at":"2026-05-18T03:00:38.043668+00:00"}