{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FE55B5KJ6G2HKGKWOVJHBD24WT","short_pith_number":"pith:FE55B5KJ","schema_version":"1.0","canonical_sha256":"293bd0f549f1b47519567552708f5cb4d4f239375652a59650c6b7800b335869","source":{"kind":"arxiv","id":"1506.00983","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of Latin transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Roman Glebov, Zur Luria","submitted_at":"2015-06-02T18:37:08Z","abstract_excerpt":"Let $T(n)$ denote the maximal number of transversals in an order-$n$ Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \\leq \\left((1+o(1))\\frac{n}{e^2}\\right)^{n}$, and conjectured that this bound is tight.\n  We prove via a probabilistic construction that indeed $T(n) = \\left((1+o(1))\\frac{n}{e^2}\\right)^{n}$. Until the present paper, no superexponential lower bound for $T(n)$ was known. We also give a simpler proof of the upper bound."},"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":"1506.00983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-02T18:37:08Z","cross_cats_sorted":[],"title_canon_sha256":"bac983cd99e295c0cca18efd82b776b6d5e0e41bb58cfa2274539ed6614a8bb9","abstract_canon_sha256":"257a3c2469c9749f639e28b56f84d152288d1a355815c53542d3bc9571eafec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:33.954082Z","signature_b64":"mjsd6r0sM4ZvNuQyPEny4tgUAXbAf9NSUHLAkcwyKPVV+rAVbx2T7IGba8ubbMCQ+LIded8CJK0dfyEiE09ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"293bd0f549f1b47519567552708f5cb4d4f239375652a59650c6b7800b335869","last_reissued_at":"2026-05-18T01:59:33.953450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:33.953450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of Latin transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Roman Glebov, Zur Luria","submitted_at":"2015-06-02T18:37:08Z","abstract_excerpt":"Let $T(n)$ denote the maximal number of transversals in an order-$n$ Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \\leq \\left((1+o(1))\\frac{n}{e^2}\\right)^{n}$, and conjectured that this bound is tight.\n  We prove via a probabilistic construction that indeed $T(n) = \\left((1+o(1))\\frac{n}{e^2}\\right)^{n}$. Until the present paper, no superexponential lower bound for $T(n)$ was known. We also give a simpler proof of the upper bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00983","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":"1506.00983","created_at":"2026-05-18T01:59:33.953550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00983v1","created_at":"2026-05-18T01:59:33.953550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00983","created_at":"2026-05-18T01:59:33.953550+00:00"},{"alias_kind":"pith_short_12","alias_value":"FE55B5KJ6G2H","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FE55B5KJ6G2HKGKW","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FE55B5KJ","created_at":"2026-05-18T12:29:19.899920+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/FE55B5KJ6G2HKGKWOVJHBD24WT","json":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT.json","graph_json":"https://pith.science/api/pith-number/FE55B5KJ6G2HKGKWOVJHBD24WT/graph.json","events_json":"https://pith.science/api/pith-number/FE55B5KJ6G2HKGKWOVJHBD24WT/events.json","paper":"https://pith.science/paper/FE55B5KJ"},"agent_actions":{"view_html":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT","download_json":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT.json","view_paper":"https://pith.science/paper/FE55B5KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00983&json=true","fetch_graph":"https://pith.science/api/pith-number/FE55B5KJ6G2HKGKWOVJHBD24WT/graph.json","fetch_events":"https://pith.science/api/pith-number/FE55B5KJ6G2HKGKWOVJHBD24WT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT/action/storage_attestation","attest_author":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT/action/author_attestation","sign_citation":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT/action/citation_signature","submit_replication":"https://pith.science/pith/FE55B5KJ6G2HKGKWOVJHBD24WT/action/replication_record"}},"created_at":"2026-05-18T01:59:33.953550+00:00","updated_at":"2026-05-18T01:59:33.953550+00:00"}