{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HRMRERLNTRQ5UUDR7YEPBXELER","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":"1b5286edd6bad59dbfccbde35d1ca4d62f2aceb8dc83338d8251eddfb03037e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-07T17:28:42Z","title_canon_sha256":"77ddb893bb33fb63f6a3eec6bc5ac4619fc023498b2622f1026c03877aa55968"},"schema_version":"1.0","source":{"id":"2311.04152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.04152","created_at":"2026-07-05T07:10:51Z"},{"alias_kind":"arxiv_version","alias_value":"2311.04152v2","created_at":"2026-07-05T07:10:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04152","created_at":"2026-07-05T07:10:51Z"},{"alias_kind":"pith_short_12","alias_value":"HRMRERLNTRQ5","created_at":"2026-07-05T07:10:51Z"},{"alias_kind":"pith_short_16","alias_value":"HRMRERLNTRQ5UUDR","created_at":"2026-07-05T07:10:51Z"},{"alias_kind":"pith_short_8","alias_value":"HRMRERLN","created_at":"2026-07-05T07:10:51Z"}],"graph_snapshots":[{"event_id":"sha256:951874a4340be427c61c349209ccae902af633bfe707a547c613d47e66046d50","target":"graph","created_at":"2026-07-05T07:10:51Z","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/2311.04152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A $k \\times n$ partial Latin rectangle is \\textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We prove that the probability a uniformly random $k \\times n$ Latin rectangle, where $k < (1/2 - \\alpha)n$, contains a $\\beta n$-sparse partial Latin rectangle with $\\ell$ nonempty entries is $(\\frac{1 \\pm \\varepsilon}{n})^\\ell$ for sufficiently large $n$ and sufficiently small $\\beta$. Using this result, we prove that a uniformly random order-$n$ Latin square asymptotically almost surely has no Latin subsquare of order","authors_text":"Alexander Divoux, Camille Kennedy, Jasdeep Sidhu, Tom Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-07T17:28:42Z","title":"Subsquares in random Latin squares and rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04152","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:a7886daca3114ca99caf85a32d9d844779a68850a79330b1e79026e5401f6824","target":"record","created_at":"2026-07-05T07:10:51Z","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":"1b5286edd6bad59dbfccbde35d1ca4d62f2aceb8dc83338d8251eddfb03037e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-07T17:28:42Z","title_canon_sha256":"77ddb893bb33fb63f6a3eec6bc5ac4619fc023498b2622f1026c03877aa55968"},"schema_version":"1.0","source":{"id":"2311.04152","kind":"arxiv","version":2}},"canonical_sha256":"3c5912456d9c61da5071fe08f0dc8b245688e22da2d32c474fd204464cef6069","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c5912456d9c61da5071fe08f0dc8b245688e22da2d32c474fd204464cef6069","first_computed_at":"2026-07-05T07:10:51.302067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:10:51.302067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PvZM2d4fjJhSMWBu+3ldOjVo3CwEhIgxzKeU7Np505XoTsMXEe8SNJKiwqH9ZtM8O4xoaDSs11nUzs2Wsdo6Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:10:51.302637Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.04152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7886daca3114ca99caf85a32d9d844779a68850a79330b1e79026e5401f6824","sha256:951874a4340be427c61c349209ccae902af633bfe707a547c613d47e66046d50"],"state_sha256":"108e7e7dea7e72194f0916ec5da552db7e3e5751f2d1bdb6de1a7a859f2466b0"}