{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SSKC6CFZA4NY3GKQVM3FLNIVWG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"641d5130c2375248e1d957163c757e0e2d334ba9fb2c8c663b3abbfb04d972e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-14T04:39:59Z","title_canon_sha256":"661f896a29e257e25248e370778ac13efb9a7d141a2115f2b6d029d0971728b2"},"schema_version":"1.0","source":{"id":"1911.05936","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05936","created_at":"2026-07-05T03:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05936v2","created_at":"2026-07-05T03:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05936","created_at":"2026-07-05T03:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"SSKC6CFZA4NY","created_at":"2026-07-05T03:05:41Z"},{"alias_kind":"pith_short_16","alias_value":"SSKC6CFZA4NY3GKQ","created_at":"2026-07-05T03:05:41Z"},{"alias_kind":"pith_short_8","alias_value":"SSKC6CFZ","created_at":"2026-07-05T03:05:41Z"}],"graph_snapshots":[{"event_id":"sha256:490696e2efe1b4760fa5f2f49ec06b39e6cb053bd04e6238d2aea3852ca26f66","target":"graph","created_at":"2026-07-05T03:05:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.05936/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Darcy Best, Ian M. Wanless, Kyle Pula","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-14T04:39:59Z","title":"Small Latin arrays have a near transversal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05936","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ba3f00de8e4955db612ec3c433cf43ca254e720a5c3c1d4ba57bb2ae9629e530","target":"record","created_at":"2026-07-05T03:05:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"641d5130c2375248e1d957163c757e0e2d334ba9fb2c8c663b3abbfb04d972e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-14T04:39:59Z","title_canon_sha256":"661f896a29e257e25248e370778ac13efb9a7d141a2115f2b6d029d0971728b2"},"schema_version":"1.0","source":{"id":"1911.05936","kind":"arxiv","version":2}},"canonical_sha256":"94942f08b9071b8d9950ab3655b515b1838e250bb642f71b01bbe256ee186c37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94942f08b9071b8d9950ab3655b515b1838e250bb642f71b01bbe256ee186c37","first_computed_at":"2026-07-05T03:05:41.934433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:41.934433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GvqG/WvEfjlbvqMRkWamCdM3BxWEbHrKL+qFqcLGL+FALe/H19fua0Y17ZUkcnR+uRpuxOien7oRZ6T+1ZmVBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:41.934821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.05936","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba3f00de8e4955db612ec3c433cf43ca254e720a5c3c1d4ba57bb2ae9629e530","sha256:490696e2efe1b4760fa5f2f49ec06b39e6cb053bd04e6238d2aea3852ca26f66"],"state_sha256":"30880586c80039e1102ac628eb19587f3840cd7178c8f27a4a699060c67ba026"}