{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XGSC4SLDQR4LKCM6ZT26U6IPGJ","short_pith_number":"pith:XGSC4SLD","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"},"canonical_sha256":"b9a42e49638478b5099eccf5ea790f327246616dc510cb7eefe0365f1925304e","source":{"kind":"arxiv","id":"1305.2516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2516","created_at":"2026-05-18T01:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2516v1","created_at":"2026-05-18T01:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2516","created_at":"2026-05-18T01:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"XGSC4SLDQR4L","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XGSC4SLDQR4LKCM6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XGSC4SLD","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XGSC4SLDQR4LKCM6ZT26U6IPGJ","target":"record","payload":{"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"},"canonical_sha256":"b9a42e49638478b5099eccf5ea790f327246616dc510cb7eefe0365f1925304e","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"},"source_kind":"arxiv","source_id":"1305.2516","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVqmmT8+SVmpmEHtCaFQYnIGkbhVfns5dGiya+pPmEZLHExual9r5ht+xOGU5BAhXQBo8F99nvYRjFrYgviPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:10:39.977678Z"},"content_sha256":"20fe78f8b4b82d396addcc9f48bbc845400d5271ba5a2f01c4bd65472635f731","schema_version":"1.0","event_id":"sha256:20fe78f8b4b82d396addcc9f48bbc845400d5271ba5a2f01c4bd65472635f731"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XGSC4SLDQR4LKCM6ZT26U6IPGJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyUVKU4hoiO4NDBxou76YeE14NVImUsxyndmzhpXUL0azZgRfx067proWZEW5o/5zOt+pXnlNW3Nd/kH0yMcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:10:39.978243Z"},"content_sha256":"793e4f316b51e9d1dfabb387eeefabe5dc097067f316425e79ebb8ff9d80f547","schema_version":"1.0","event_id":"sha256:793e4f316b51e9d1dfabb387eeefabe5dc097067f316425e79ebb8ff9d80f547"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/bundle.json","state_url":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T23:10:39Z","links":{"resolver":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ","bundle":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/bundle.json","state":"https://pith.science/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGSC4SLDQR4LKCM6ZT26U6IPGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XGSC4SLDQR4LKCM6ZT26U6IPGJ","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":"202cb049840e2e02147d9c8fcb5275a467e01e6861db30eeeda644d619f87f19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-11T15:14:26Z","title_canon_sha256":"f6cee15a1dc128527ec777f221a5791809b1dce75ca41a5b4b938b32fd9cbfe3"},"schema_version":"1.0","source":{"id":"1305.2516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2516","created_at":"2026-05-18T01:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2516v1","created_at":"2026-05-18T01:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2516","created_at":"2026-05-18T01:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"XGSC4SLDQR4L","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XGSC4SLDQR4LKCM6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XGSC4SLD","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:793e4f316b51e9d1dfabb387eeefabe5dc097067f316425e79ebb8ff9d80f547","target":"graph","created_at":"2026-05-18T01:20:22Z","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"},"paper":{"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","authors_text":"D. Conlon, M. Schacht, W. Samotij, W. T. Gowers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-11T15:14:26Z","title":"On the K{\\L}R conjecture in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2516","kind":"arxiv","version":1},"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:20fe78f8b4b82d396addcc9f48bbc845400d5271ba5a2f01c4bd65472635f731","target":"record","created_at":"2026-05-18T01:20:22Z","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":"202cb049840e2e02147d9c8fcb5275a467e01e6861db30eeeda644d619f87f19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-11T15:14:26Z","title_canon_sha256":"f6cee15a1dc128527ec777f221a5791809b1dce75ca41a5b4b938b32fd9cbfe3"},"schema_version":"1.0","source":{"id":"1305.2516","kind":"arxiv","version":1}},"canonical_sha256":"b9a42e49638478b5099eccf5ea790f327246616dc510cb7eefe0365f1925304e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a42e49638478b5099eccf5ea790f327246616dc510cb7eefe0365f1925304e","first_computed_at":"2026-05-18T01:20:22.479641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:22.479641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FckLfySbKkDm3n8uqaCOoPKEJ0xh3Apg+qlyUfVel1hxUD33hB4+CacHjeCBaaTjGhQhQpReObODdkqr8yQtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:22.480218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20fe78f8b4b82d396addcc9f48bbc845400d5271ba5a2f01c4bd65472635f731","sha256:793e4f316b51e9d1dfabb387eeefabe5dc097067f316425e79ebb8ff9d80f547"],"state_sha256":"97f91ea4a0b1099b4290b5245dfceda7108c3bb9b752b9e1773dbd8ba2c72a72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ9V5FRAfVwHRp2MCHMokdXFdWzxMkOHViSOacb52njYWwBScxpWTVD/yJiR3+CZlUrslwXztCibFVuJ3/2QDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:10:39.982342Z","bundle_sha256":"d06f89ca1cabcb8ab45b248448b254d3e07103f103c5bb31e6c211bb13d5971b"}}