{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JDJXQLJH5ZQGPIWFCMICBOITLJ","short_pith_number":"pith:JDJXQLJH","schema_version":"1.0","canonical_sha256":"48d3782d27ee6067a2c5131020b9135a68fc9998c8aad48787e3ac55ba9075e0","source":{"kind":"arxiv","id":"1510.06212","version":2},"attestation_state":"computed","paper":{"title":"On the number of SQSs, latin hypercubes and MDS codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir N. Potapov","submitted_at":"2015-10-21T11:14:00Z","abstract_excerpt":"It is established that the logarithm of the number of latin $d$-cubes of order $n$ is $\\Theta(n^{d}\\ln n)$ and the logarithm of the number of pairs of orthogonal latin squares of order $n$ is $\\Theta(n^2\\ln n)$. Similar estimations are obtained for systems of mutually strong orthogonal latin $d$-cubes. As a consequence, it is constructed a set of Steiner quadruple systems of order $n$ such that the logarithm of its cardinality is $\\Theta(n^3\\ln n)$ as $n\\rightarrow\\infty$ and $n\\ {\\rm mod}\\ 6= 2\\ {\\rm or}\\ 4$."},"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":"1510.06212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-21T11:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"56bcce29fddbc2052df2a23b527aaa5f948d1ff26483231a74f39ecbb42d2289","abstract_canon_sha256":"eb7025aaf97bb0d2c82811f594bc830aa922b6191ece6e26de3db798f775fec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.394408Z","signature_b64":"jyrwdqFlSE+Pijt7gl/0t7Mc3WTif99eFxiAFsf9GdGFvLb+H/lbfOhUzb8LJPHcmL0/dQOffzdmzHIgHJOxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48d3782d27ee6067a2c5131020b9135a68fc9998c8aad48787e3ac55ba9075e0","last_reissued_at":"2026-05-18T00:17:27.393794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.393794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of SQSs, latin hypercubes and MDS codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir N. Potapov","submitted_at":"2015-10-21T11:14:00Z","abstract_excerpt":"It is established that the logarithm of the number of latin $d$-cubes of order $n$ is $\\Theta(n^{d}\\ln n)$ and the logarithm of the number of pairs of orthogonal latin squares of order $n$ is $\\Theta(n^2\\ln n)$. Similar estimations are obtained for systems of mutually strong orthogonal latin $d$-cubes. As a consequence, it is constructed a set of Steiner quadruple systems of order $n$ such that the logarithm of its cardinality is $\\Theta(n^3\\ln n)$ as $n\\rightarrow\\infty$ and $n\\ {\\rm mod}\\ 6= 2\\ {\\rm or}\\ 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06212","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":"1510.06212","created_at":"2026-05-18T00:17:27.393894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06212v2","created_at":"2026-05-18T00:17:27.393894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06212","created_at":"2026-05-18T00:17:27.393894+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDJXQLJH5ZQG","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDJXQLJH5ZQGPIWF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDJXQLJH","created_at":"2026-05-18T12:29:27.538025+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/JDJXQLJH5ZQGPIWFCMICBOITLJ","json":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ.json","graph_json":"https://pith.science/api/pith-number/JDJXQLJH5ZQGPIWFCMICBOITLJ/graph.json","events_json":"https://pith.science/api/pith-number/JDJXQLJH5ZQGPIWFCMICBOITLJ/events.json","paper":"https://pith.science/paper/JDJXQLJH"},"agent_actions":{"view_html":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ","download_json":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ.json","view_paper":"https://pith.science/paper/JDJXQLJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06212&json=true","fetch_graph":"https://pith.science/api/pith-number/JDJXQLJH5ZQGPIWFCMICBOITLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JDJXQLJH5ZQGPIWFCMICBOITLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ/action/storage_attestation","attest_author":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ/action/author_attestation","sign_citation":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ/action/citation_signature","submit_replication":"https://pith.science/pith/JDJXQLJH5ZQGPIWFCMICBOITLJ/action/replication_record"}},"created_at":"2026-05-18T00:17:27.393894+00:00","updated_at":"2026-05-18T00:17:27.393894+00:00"}