{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JMWHHRZJV3OFWLAWMARPAVBT55","short_pith_number":"pith:JMWHHRZJ","schema_version":"1.0","canonical_sha256":"4b2c73c729aedc5b2c166022f05433ef78612553b5b5ee71ea962b943b6e7b85","source":{"kind":"arxiv","id":"1610.06262","version":1},"attestation_state":"computed","paper":{"title":"There are asymptotically the same number of Latin squares of each parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian M. Wanless, Nicholas J. Cavenagh","submitted_at":"2016-10-20T01:41:03Z","abstract_excerpt":"A Latin square is reduced if its first row and column are in natural order. For Latin squares of a particular order $n$ there are four possible different parities. We confirm a conjecture of Stones and Wanless by showing asymptotic equality between the numbers of reduced Latin squares of each possible parity as the order $n\\rightarrow\\infty$."},"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":"1610.06262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-20T01:41:03Z","cross_cats_sorted":[],"title_canon_sha256":"988cad37fcafa97f522452263596671b07c8f0d844df03babc2cd5e63e812d7d","abstract_canon_sha256":"e5babb61777f515aed422d8647a9f52ac07c96a94df0b7933389c0fc2bb783a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:43.789790Z","signature_b64":"AYQUt8owdTEm1D8+7Q6c2aVZFwChpXgAmy7l73xDL6Z0BUqVp/8erZ4VGlEpcQaoa4c8K2L9S0rilBp3UQKGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b2c73c729aedc5b2c166022f05433ef78612553b5b5ee71ea962b943b6e7b85","last_reissued_at":"2026-05-18T01:01:43.788879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:43.788879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"There are asymptotically the same number of Latin squares of each parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian M. Wanless, Nicholas J. Cavenagh","submitted_at":"2016-10-20T01:41:03Z","abstract_excerpt":"A Latin square is reduced if its first row and column are in natural order. For Latin squares of a particular order $n$ there are four possible different parities. We confirm a conjecture of Stones and Wanless by showing asymptotic equality between the numbers of reduced Latin squares of each possible parity as the order $n\\rightarrow\\infty$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06262","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":"1610.06262","created_at":"2026-05-18T01:01:43.789031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06262v1","created_at":"2026-05-18T01:01:43.789031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06262","created_at":"2026-05-18T01:01:43.789031+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMWHHRZJV3OF","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMWHHRZJV3OFWLAW","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMWHHRZJ","created_at":"2026-05-18T12:30:25.849896+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/JMWHHRZJV3OFWLAWMARPAVBT55","json":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55.json","graph_json":"https://pith.science/api/pith-number/JMWHHRZJV3OFWLAWMARPAVBT55/graph.json","events_json":"https://pith.science/api/pith-number/JMWHHRZJV3OFWLAWMARPAVBT55/events.json","paper":"https://pith.science/paper/JMWHHRZJ"},"agent_actions":{"view_html":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55","download_json":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55.json","view_paper":"https://pith.science/paper/JMWHHRZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06262&json=true","fetch_graph":"https://pith.science/api/pith-number/JMWHHRZJV3OFWLAWMARPAVBT55/graph.json","fetch_events":"https://pith.science/api/pith-number/JMWHHRZJV3OFWLAWMARPAVBT55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55/action/storage_attestation","attest_author":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55/action/author_attestation","sign_citation":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55/action/citation_signature","submit_replication":"https://pith.science/pith/JMWHHRZJV3OFWLAWMARPAVBT55/action/replication_record"}},"created_at":"2026-05-18T01:01:43.789031+00:00","updated_at":"2026-05-18T01:01:43.789031+00:00"}