{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CUEC2JNQCLIGG5MVE6CA2FY22C","short_pith_number":"pith:CUEC2JNQ","schema_version":"1.0","canonical_sha256":"15082d25b012d063759527840d171ad0a7e1f22925962ddb211cc6cca3a7baaa","source":{"kind":"arxiv","id":"2501.05438","version":1},"attestation_state":"computed","paper":{"title":"Almost every Latin square has a decomposition into transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Candida Bowtell, Richard Montgomery","submitted_at":"2025-01-09T18:49:23Z","abstract_excerpt":"In 1782, Euler conjectured that no Latin square of order $n\\equiv 2\\; \\textrm{mod}\\; 4$ has a decomposition into transversals. While confirmed for $n=6$ by Tarry in 1900, Bose, Parker, and Shrikhande constructed counterexamples in 1960 for each $n\\equiv 2\\; \\textrm{mod}\\; 4$ with $n\\geq 10$. We show that, in fact, counterexamples are extremely common, by showing that if a Latin square of order $n$ is chosen uniformly at random then with high probability it has a decomposition into transversals."},"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":"2501.05438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-09T18:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"23b234fb02534b8bff9591a1c231e9c735167074f43974b65e68b61360436c2e","abstract_canon_sha256":"1a483183f611234379e6ca9cc68f756d008734cf52076ff4527e8eef7c3811cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:09.901470Z","signature_b64":"MEClwCVFmiaNqSxOXxywzD1PxbXzqawRmFZwNRkJ2tVeWM2Nf+Te1EPEGKpYXcvqvn1yg9Kok2Apl5af5IKdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15082d25b012d063759527840d171ad0a7e1f22925962ddb211cc6cca3a7baaa","last_reissued_at":"2026-07-05T09:59:09.900985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:09.900985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost every Latin square has a decomposition into transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Candida Bowtell, Richard Montgomery","submitted_at":"2025-01-09T18:49:23Z","abstract_excerpt":"In 1782, Euler conjectured that no Latin square of order $n\\equiv 2\\; \\textrm{mod}\\; 4$ has a decomposition into transversals. While confirmed for $n=6$ by Tarry in 1900, Bose, Parker, and Shrikhande constructed counterexamples in 1960 for each $n\\equiv 2\\; \\textrm{mod}\\; 4$ with $n\\geq 10$. We show that, in fact, counterexamples are extremely common, by showing that if a Latin square of order $n$ is chosen uniformly at random then with high probability it has a decomposition into transversals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05438","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/2501.05438/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":"2501.05438","created_at":"2026-07-05T09:59:09.901042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05438v1","created_at":"2026-07-05T09:59:09.901042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05438","created_at":"2026-07-05T09:59:09.901042+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUEC2JNQCLIG","created_at":"2026-07-05T09:59:09.901042+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUEC2JNQCLIGG5MV","created_at":"2026-07-05T09:59:09.901042+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUEC2JNQ","created_at":"2026-07-05T09:59:09.901042+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18174","citing_title":"Universal probability bounds for partial Latin squares","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C","json":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C.json","graph_json":"https://pith.science/api/pith-number/CUEC2JNQCLIGG5MVE6CA2FY22C/graph.json","events_json":"https://pith.science/api/pith-number/CUEC2JNQCLIGG5MVE6CA2FY22C/events.json","paper":"https://pith.science/paper/CUEC2JNQ"},"agent_actions":{"view_html":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C","download_json":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C.json","view_paper":"https://pith.science/paper/CUEC2JNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05438&json=true","fetch_graph":"https://pith.science/api/pith-number/CUEC2JNQCLIGG5MVE6CA2FY22C/graph.json","fetch_events":"https://pith.science/api/pith-number/CUEC2JNQCLIGG5MVE6CA2FY22C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C/action/storage_attestation","attest_author":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C/action/author_attestation","sign_citation":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C/action/citation_signature","submit_replication":"https://pith.science/pith/CUEC2JNQCLIGG5MVE6CA2FY22C/action/replication_record"}},"created_at":"2026-07-05T09:59:09.901042+00:00","updated_at":"2026-07-05T09:59:09.901042+00:00"}