{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CLQRHU67R5BTAE55AQBCFZY5CP","short_pith_number":"pith:CLQRHU67","schema_version":"1.0","canonical_sha256":"12e113d3df8f433013bd040222e71d13d776773678fb327797b3bc2ad1ecf816","source":{"kind":"arxiv","id":"2212.06109","version":2},"attestation_state":"computed","paper":{"title":"Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Huy Tuan Pham, Vishesh Jain","submitted_at":"2022-12-12T18:32:04Z","abstract_excerpt":"We show that the threshold for the binomial random $3$-partite, $3$-uniform hypergraph $G^{3}((n,n,n),p)$ to contain a Latin square is $\\Theta(\\log{n}/n)$. We also prove analogous results for Steiner triple systems and proper list edge-colorings of the complete (bipartite) graph with random lists. Our results answer several related questions of Johansson, Luria-Simkin, Casselgren-H\\\"aggkvist, Simkin, and Kang-Kelly-K\\\"uhn-Methuku-Osthus."},"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":"2212.06109","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-12T18:32:04Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"ed3c8eb55b100ddc949a52f2a83e0f9153fa416e5a567242f624644da93e93dd","abstract_canon_sha256":"24c44bd9fac9b5eb94aa37a8ee2d1a951b3e069f2c89ee10587fafaac41264d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:29.199195Z","signature_b64":"ge8DpudxbuAhh+9t4a8SIkEohFvEnhM/iXEAToTGNKaha5monwREhh/uoYR8FxMdA+3zUAGBL0396xc4VcJWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e113d3df8f433013bd040222e71d13d776773678fb327797b3bc2ad1ecf816","last_reissued_at":"2026-07-05T05:26:29.198792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:29.198792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Huy Tuan Pham, Vishesh Jain","submitted_at":"2022-12-12T18:32:04Z","abstract_excerpt":"We show that the threshold for the binomial random $3$-partite, $3$-uniform hypergraph $G^{3}((n,n,n),p)$ to contain a Latin square is $\\Theta(\\log{n}/n)$. We also prove analogous results for Steiner triple systems and proper list edge-colorings of the complete (bipartite) graph with random lists. Our results answer several related questions of Johansson, Luria-Simkin, Casselgren-H\\\"aggkvist, Simkin, and Kang-Kelly-K\\\"uhn-Methuku-Osthus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06109","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/2212.06109/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":"2212.06109","created_at":"2026-07-05T05:26:29.198845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.06109v2","created_at":"2026-07-05T05:26:29.198845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06109","created_at":"2026-07-05T05:26:29.198845+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLQRHU67R5BT","created_at":"2026-07-05T05:26:29.198845+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLQRHU67R5BTAE55","created_at":"2026-07-05T05:26:29.198845+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLQRHU67","created_at":"2026-07-05T05:26:29.198845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.12607","citing_title":"Robust Hamiltonicity in families of Dirac graphs","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP","json":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP.json","graph_json":"https://pith.science/api/pith-number/CLQRHU67R5BTAE55AQBCFZY5CP/graph.json","events_json":"https://pith.science/api/pith-number/CLQRHU67R5BTAE55AQBCFZY5CP/events.json","paper":"https://pith.science/paper/CLQRHU67"},"agent_actions":{"view_html":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP","download_json":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP.json","view_paper":"https://pith.science/paper/CLQRHU67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.06109&json=true","fetch_graph":"https://pith.science/api/pith-number/CLQRHU67R5BTAE55AQBCFZY5CP/graph.json","fetch_events":"https://pith.science/api/pith-number/CLQRHU67R5BTAE55AQBCFZY5CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP/action/storage_attestation","attest_author":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP/action/author_attestation","sign_citation":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP/action/citation_signature","submit_replication":"https://pith.science/pith/CLQRHU67R5BTAE55AQBCFZY5CP/action/replication_record"}},"created_at":"2026-07-05T05:26:29.198845+00:00","updated_at":"2026-07-05T05:26:29.198845+00:00"}