{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AJCV4UYWVKDQVSJLF4DLWVTGVT","short_pith_number":"pith:AJCV4UYW","schema_version":"1.0","canonical_sha256":"02455e5316aa870ac92b2f06bb5666acdd07c29257cc9bbab50d17de2df035f0","source":{"kind":"arxiv","id":"1910.02753","version":1},"attestation_state":"computed","paper":{"title":"Enumerating extensions of mutually orthogonal Latin squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shagnik Das, Simona Boyadzhiyska, Tibor Szab\\'o","submitted_at":"2019-10-07T12:35:44Z","abstract_excerpt":"Two $n \\times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$ pairwise-orthogonal Latin squares, and the existence and enumeration of these objects has attracted a great deal of attention.\n  Recent work of Keevash and Luria provides, for all fixed $k$, log-asymptotically tight bounds on the number of $k$-MOLS. To study the situation when $k$ grows with $n$, we bound the number of ways a $k$-MOLS can be extended to a $(k+1)$-MOLS. These "},"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":"1910.02753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-07T12:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"fb0d9b147131d1a0703991a7ee04b28c28057550199d6b09b5eaf99f6f20ac08","abstract_canon_sha256":"63e1e0b919ecb937db7e24649c2a518e21b8f5439e0dda76009bd644d2059ccc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:11.245569Z","signature_b64":"qtmxq7/2TetMvyyEebDMkcNZE6Og0N1VFlRIY4pHRRwZ3tGHe5FnZsDftTHVxmSs3Xf/VAbRBl3519LNX1F/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02455e5316aa870ac92b2f06bb5666acdd07c29257cc9bbab50d17de2df035f0","last_reissued_at":"2026-07-05T00:10:11.245190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:11.245190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating extensions of mutually orthogonal Latin squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shagnik Das, Simona Boyadzhiyska, Tibor Szab\\'o","submitted_at":"2019-10-07T12:35:44Z","abstract_excerpt":"Two $n \\times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$ pairwise-orthogonal Latin squares, and the existence and enumeration of these objects has attracted a great deal of attention.\n  Recent work of Keevash and Luria provides, for all fixed $k$, log-asymptotically tight bounds on the number of $k$-MOLS. To study the situation when $k$ grows with $n$, we bound the number of ways a $k$-MOLS can be extended to a $(k+1)$-MOLS. These "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02753","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/1910.02753/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":"1910.02753","created_at":"2026-07-05T00:10:11.245246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.02753v1","created_at":"2026-07-05T00:10:11.245246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02753","created_at":"2026-07-05T00:10:11.245246+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJCV4UYWVKDQ","created_at":"2026-07-05T00:10:11.245246+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJCV4UYWVKDQVSJL","created_at":"2026-07-05T00:10:11.245246+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJCV4UYW","created_at":"2026-07-05T00:10:11.245246+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/AJCV4UYWVKDQVSJLF4DLWVTGVT","json":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT.json","graph_json":"https://pith.science/api/pith-number/AJCV4UYWVKDQVSJLF4DLWVTGVT/graph.json","events_json":"https://pith.science/api/pith-number/AJCV4UYWVKDQVSJLF4DLWVTGVT/events.json","paper":"https://pith.science/paper/AJCV4UYW"},"agent_actions":{"view_html":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT","download_json":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT.json","view_paper":"https://pith.science/paper/AJCV4UYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.02753&json=true","fetch_graph":"https://pith.science/api/pith-number/AJCV4UYWVKDQVSJLF4DLWVTGVT/graph.json","fetch_events":"https://pith.science/api/pith-number/AJCV4UYWVKDQVSJLF4DLWVTGVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT/action/storage_attestation","attest_author":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT/action/author_attestation","sign_citation":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT/action/citation_signature","submit_replication":"https://pith.science/pith/AJCV4UYWVKDQVSJLF4DLWVTGVT/action/replication_record"}},"created_at":"2026-07-05T00:10:11.245246+00:00","updated_at":"2026-07-05T00:10:11.245246+00:00"}