{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SSKC6CFZA4NY3GKQVM3FLNIVWG","short_pith_number":"pith:SSKC6CFZ","schema_version":"1.0","canonical_sha256":"94942f08b9071b8d9950ab3655b515b1838e250bb642f71b01bbe256ee186c37","source":{"kind":"arxiv","id":"1911.05936","version":2},"attestation_state":"computed","paper":{"title":"Small Latin arrays have a near transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darcy Best, Ian M. Wanless, Kyle Pula","submitted_at":"2019-11-14T04:39:59Z","abstract_excerpt":"A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of a diagonal is the number of different symbols on it. We show via computation that every Latin array of order $n\\le11$ has a diagonal of weight at least $n-1$. A corollary is the existence of near transversals in Latin squares of these orders.\n  More generally, for all $k\\le20$ we compute a lower bound on the order of any Latin array that does not have a diag"},"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":"1911.05936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-14T04:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"661f896a29e257e25248e370778ac13efb9a7d141a2115f2b6d029d0971728b2","abstract_canon_sha256":"641d5130c2375248e1d957163c757e0e2d334ba9fb2c8c663b3abbfb04d972e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:41.934821Z","signature_b64":"GvqG/WvEfjlbvqMRkWamCdM3BxWEbHrKL+qFqcLGL+FALe/H19fua0Y17ZUkcnR+uRpuxOien7oRZ6T+1ZmVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94942f08b9071b8d9950ab3655b515b1838e250bb642f71b01bbe256ee186c37","last_reissued_at":"2026-07-05T03:05:41.934433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:41.934433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small Latin arrays have a near transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darcy Best, Ian M. Wanless, Kyle Pula","submitted_at":"2019-11-14T04:39:59Z","abstract_excerpt":"A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of a diagonal is the number of different symbols on it. We show via computation that every Latin array of order $n\\le11$ has a diagonal of weight at least $n-1$. A corollary is the existence of near transversals in Latin squares of these orders.\n  More generally, for all $k\\le20$ we compute a lower bound on the order of any Latin array that does not have a diag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05936","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.05936/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":"1911.05936","created_at":"2026-07-05T03:05:41.934501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.05936v2","created_at":"2026-07-05T03:05:41.934501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05936","created_at":"2026-07-05T03:05:41.934501+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSKC6CFZA4NY","created_at":"2026-07-05T03:05:41.934501+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSKC6CFZA4NY3GKQ","created_at":"2026-07-05T03:05:41.934501+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSKC6CFZ","created_at":"2026-07-05T03:05:41.934501+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/SSKC6CFZA4NY3GKQVM3FLNIVWG","json":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG.json","graph_json":"https://pith.science/api/pith-number/SSKC6CFZA4NY3GKQVM3FLNIVWG/graph.json","events_json":"https://pith.science/api/pith-number/SSKC6CFZA4NY3GKQVM3FLNIVWG/events.json","paper":"https://pith.science/paper/SSKC6CFZ"},"agent_actions":{"view_html":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG","download_json":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG.json","view_paper":"https://pith.science/paper/SSKC6CFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.05936&json=true","fetch_graph":"https://pith.science/api/pith-number/SSKC6CFZA4NY3GKQVM3FLNIVWG/graph.json","fetch_events":"https://pith.science/api/pith-number/SSKC6CFZA4NY3GKQVM3FLNIVWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG/action/storage_attestation","attest_author":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG/action/author_attestation","sign_citation":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG/action/citation_signature","submit_replication":"https://pith.science/pith/SSKC6CFZA4NY3GKQVM3FLNIVWG/action/replication_record"}},"created_at":"2026-07-05T03:05:41.934501+00:00","updated_at":"2026-07-05T03:05:41.934501+00:00"}