{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XGSC4SLDQR4LKCM6ZT26U6IPGJ","short_pith_number":"pith:XGSC4SLD","schema_version":"1.0","canonical_sha256":"b9a42e49638478b5099eccf5ea790f327246616dc510cb7eefe0365f1925304e","source":{"kind":"arxiv","id":"1305.2516","version":1},"attestation_state":"computed","paper":{"title":"On the K{\\L}R conjecture in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Conlon, M. Schacht, W. Samotij, W. T. Gowers","submitted_at":"2013-05-11T15:14:26Z","abstract_excerpt":"The K{\\L}R conjecture of Kohayakawa, {\\L}uczak, and R\\\"odl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficiently large p : = p(n), satisfy an embedding lemma which complements the sparse regularity lemma of Kohayakawa and R\\\"odl. We prove a variant of this conjecture which is sufficient for most known applications to random graphs. In particular, our result implies a number of recent probabilistic versions, due to Conlon, Gowers, and Schacht, of classical extremal combinatorial theorems. We also discuss several fur"},"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":"1305.2516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-11T15:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6cee15a1dc128527ec777f221a5791809b1dce75ca41a5b4b938b32fd9cbfe3","abstract_canon_sha256":"202cb049840e2e02147d9c8fcb5275a467e01e6861db30eeeda644d619f87f19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:22.480218Z","signature_b64":"FckLfySbKkDm3n8uqaCOoPKEJ0xh3Apg+qlyUfVel1hxUD33hB4+CacHjeCBaaTjGhQhQpReObODdkqr8yQtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a42e49638478b5099eccf5ea790f327246616dc510cb7eefe0365f1925304e","last_reissued_at":"2026-05-18T01:20:22.479641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:22.479641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the K{\\L}R conjecture in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Conlon, M. Schacht, W. Samotij, W. T. Gowers","submitted_at":"2013-05-11T15:14:26Z","abstract_excerpt":"The K{\\L}R conjecture of Kohayakawa, {\\L}uczak, and R\\\"odl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficiently large p : = p(n), satisfy an embedding lemma which complements the sparse regularity lemma of Kohayakawa and R\\\"odl. We prove a variant of this conjecture which is sufficient for most known applications to random graphs. In particular, our result implies a number of recent probabilistic versions, due to Conlon, Gowers, and Schacht, of classical extremal combinatorial theorems. We also discuss several fur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2516","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":"1305.2516","created_at":"2026-05-18T01:20:22.479723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2516v1","created_at":"2026-05-18T01:20:22.479723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2516","created_at":"2026-05-18T01:20:22.479723+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGSC4SLDQR4L","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGSC4SLDQR4LKCM6","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGSC4SLD","created_at":"2026-05-18T12:28:06.772260+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/XGSC4SLDQR4LKCM6ZT26U6IPGJ","json":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ.json","graph_json":"https://pith.science/api/pith-number/XGSC4SLDQR4LKCM6ZT26U6IPGJ/graph.json","events_json":"https://pith.science/api/pith-number/XGSC4SLDQR4LKCM6ZT26U6IPGJ/events.json","paper":"https://pith.science/paper/XGSC4SLD"},"agent_actions":{"view_html":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ","download_json":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ.json","view_paper":"https://pith.science/paper/XGSC4SLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2516&json=true","fetch_graph":"https://pith.science/api/pith-number/XGSC4SLDQR4LKCM6ZT26U6IPGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XGSC4SLDQR4LKCM6ZT26U6IPGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/action/storage_attestation","attest_author":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/action/author_attestation","sign_citation":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/action/citation_signature","submit_replication":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/action/replication_record"}},"created_at":"2026-05-18T01:20:22.479723+00:00","updated_at":"2026-05-18T01:20:22.479723+00:00"}