{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CN3HDJHPC5ULOJSOKOZGTZAWEE","short_pith_number":"pith:CN3HDJHP","schema_version":"1.0","canonical_sha256":"137671a4ef1768b7264e53b269e416213a69967bf728f3e093de6c63958e9dbd","source":{"kind":"arxiv","id":"2412.00480","version":1},"attestation_state":"computed","paper":{"title":"Improvements for lower bounds of mutually orthogonal Latin squares of sizes $54$, $96$ and $108$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ingo Janiszczak, Reiner Staszewski, R. Julian R. Abel","submitted_at":"2024-11-30T13:36:52Z","abstract_excerpt":"We will show that there are at least 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of orders $n=54$, $96$ and $108$. The cases $n=54$ and $96$ are obtained by constructing separable permutation codes consisting of $8 \\times 54$ and $10 \\times 96$ codeword respectively; in addition, these codes respectively have lengths $54$, $96$ and minimum distances $53$, $95$. Here we will follow exactly the procedure given in \\cite{JS2019}. The case $n=108$ is obtained by constructing a $(108,10,1)$ difference matrix. Also, an error in \\cite{ACD} for $n=45$ will be corrected."},"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":"2412.00480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-30T13:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"83cb2bf8051b98ecb19a8af52bbc4b5ff6ab2a0a31b1f75e3474e601fa2b2fdb","abstract_canon_sha256":"bb56ab7e5964ba0af4febabe3842bb1e1d7b50c35c7ec482307fe8668d821694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:42.147128Z","signature_b64":"s3fpC9jjQnXGgyelJbQapMQM6Cr3NhKk15Oy6lvO3DoK3tVikCNafurV71IxSVqdwIgGhgvq4e7ZAU/OJJNsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"137671a4ef1768b7264e53b269e416213a69967bf728f3e093de6c63958e9dbd","last_reissued_at":"2026-07-05T09:42:42.146703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:42.146703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improvements for lower bounds of mutually orthogonal Latin squares of sizes $54$, $96$ and $108$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ingo Janiszczak, Reiner Staszewski, R. Julian R. Abel","submitted_at":"2024-11-30T13:36:52Z","abstract_excerpt":"We will show that there are at least 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of orders $n=54$, $96$ and $108$. The cases $n=54$ and $96$ are obtained by constructing separable permutation codes consisting of $8 \\times 54$ and $10 \\times 96$ codeword respectively; in addition, these codes respectively have lengths $54$, $96$ and minimum distances $53$, $95$. Here we will follow exactly the procedure given in \\cite{JS2019}. The case $n=108$ is obtained by constructing a $(108,10,1)$ difference matrix. Also, an error in \\cite{ACD} for $n=45$ will be corrected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00480","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/2412.00480/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":"2412.00480","created_at":"2026-07-05T09:42:42.146769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00480v1","created_at":"2026-07-05T09:42:42.146769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00480","created_at":"2026-07-05T09:42:42.146769+00:00"},{"alias_kind":"pith_short_12","alias_value":"CN3HDJHPC5UL","created_at":"2026-07-05T09:42:42.146769+00:00"},{"alias_kind":"pith_short_16","alias_value":"CN3HDJHPC5ULOJSO","created_at":"2026-07-05T09:42:42.146769+00:00"},{"alias_kind":"pith_short_8","alias_value":"CN3HDJHP","created_at":"2026-07-05T09:42:42.146769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01606","citing_title":"An Improved Upper Bound on the Zarankiewicz Number z(43;2)","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE","json":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE.json","graph_json":"https://pith.science/api/pith-number/CN3HDJHPC5ULOJSOKOZGTZAWEE/graph.json","events_json":"https://pith.science/api/pith-number/CN3HDJHPC5ULOJSOKOZGTZAWEE/events.json","paper":"https://pith.science/paper/CN3HDJHP"},"agent_actions":{"view_html":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE","download_json":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE.json","view_paper":"https://pith.science/paper/CN3HDJHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00480&json=true","fetch_graph":"https://pith.science/api/pith-number/CN3HDJHPC5ULOJSOKOZGTZAWEE/graph.json","fetch_events":"https://pith.science/api/pith-number/CN3HDJHPC5ULOJSOKOZGTZAWEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE/action/storage_attestation","attest_author":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE/action/author_attestation","sign_citation":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE/action/citation_signature","submit_replication":"https://pith.science/pith/CN3HDJHPC5ULOJSOKOZGTZAWEE/action/replication_record"}},"created_at":"2026-07-05T09:42:42.146769+00:00","updated_at":"2026-07-05T09:42:42.146769+00:00"}