{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KIAZRT7DZTBG5PJZMIRTS6ODCO","short_pith_number":"pith:KIAZRT7D","canonical_record":{"source":{"id":"1612.09143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-29T13:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"615ca875b92b94875d77e4ae8c37226dad854c0e2270e4fc33e887b6e5d6e761","abstract_canon_sha256":"bab34b71f432f9263e9a8acf395a8d07c491af49a8209d5355f2914d001d27c2"},"schema_version":"1.0"},"canonical_sha256":"520198cfe3ccc26ebd3962233979c313b567a7909414c8fe4776cb4c7a2a157e","source":{"kind":"arxiv","id":"1612.09143","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09143","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09143v2","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09143","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"KIAZRT7DZTBG","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KIAZRT7DZTBG5PJZ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KIAZRT7D","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KIAZRT7DZTBG5PJZMIRTS6ODCO","target":"record","payload":{"canonical_record":{"source":{"id":"1612.09143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-29T13:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"615ca875b92b94875d77e4ae8c37226dad854c0e2270e4fc33e887b6e5d6e761","abstract_canon_sha256":"bab34b71f432f9263e9a8acf395a8d07c491af49a8209d5355f2914d001d27c2"},"schema_version":"1.0"},"canonical_sha256":"520198cfe3ccc26ebd3962233979c313b567a7909414c8fe4776cb4c7a2a157e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.283352Z","signature_b64":"UwnLjalGvvqHw3w2q3jGk8FOQ3mr7eenAd88M384YlReGqpgMVEL9UPrmDirBmtIhwHKGzC36DG2rlupdv/eDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"520198cfe3ccc26ebd3962233979c313b567a7909414c8fe4776cb4c7a2a157e","last_reissued_at":"2026-05-18T00:30:17.282500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.282500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.09143","source_version":2,"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-18T00:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVKYdUrNEO8aBDRnOR5kZWsiNFVa8HVjfgAS+jiTjJJ162vLRbNb2/9DW9nl1tgtS8Z7TVv2FXv+yL4e5moXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:53:25.495811Z"},"content_sha256":"4fba0dabe568486b5dfce854f89b9efbf52c76e70103dbf6caaaa2918fe130b9","schema_version":"1.0","event_id":"sha256:4fba0dabe568486b5dfce854f89b9efbf52c76e70103dbf6caaaa2918fe130b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KIAZRT7DZTBG5PJZMIRTS6ODCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many cliques in $H$-free subgraphs of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Clara Shikhelman, Noga Alon","submitted_at":"2016-12-29T13:49:27Z","abstract_excerpt":"For two fixed graphs $T$ and $H$ let $ex(G(n,p),T,H)$ be the random variable counting the maximum number of copies of $T$ in an $H$-free subgraph of the random graph $G(n,p)$. We show that for the case $T=K_m$ and $\\chi(H)> m$ the behavior of $ex(G(n,p),K_m,H)$ depends strongly on the relation between $p$ and $m_2(H)=\\max_{H'\\subset H, |V(H')|'\\geq 3}\\left\\{ \\frac{e(H')-1}{v(H')-2} \\right\\}$.\n  When $m_2(H)> m_2(K_m)$ we prove that with high probability, depending on the value of $p$, either one can maintain almost all copies of $K_m$, or it is asymptotically best to take a $\\chi(H)-1$ partite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09143","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":""},"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-18T00:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8+My4im7cNKviasACHHKPh3qHECGa/+OiUFsmhRkqxTugT9TMAqlvmcn9gzFYbyNiQWOxXGsLlcE6FSh/ReAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:53:25.496159Z"},"content_sha256":"2158c0dd5ab6528384b5593815bd5c110d6c3102f4f418652fb5c13e77ca2ed3","schema_version":"1.0","event_id":"sha256:2158c0dd5ab6528384b5593815bd5c110d6c3102f4f418652fb5c13e77ca2ed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO/bundle.json","state_url":"https://pith.science/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO/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-01T03:53:25Z","links":{"resolver":"https://pith.science/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO","bundle":"https://pith.science/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO/bundle.json","state":"https://pith.science/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIAZRT7DZTBG5PJZMIRTS6ODCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KIAZRT7DZTBG5PJZMIRTS6ODCO","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":"bab34b71f432f9263e9a8acf395a8d07c491af49a8209d5355f2914d001d27c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-29T13:49:27Z","title_canon_sha256":"615ca875b92b94875d77e4ae8c37226dad854c0e2270e4fc33e887b6e5d6e761"},"schema_version":"1.0","source":{"id":"1612.09143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09143","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09143v2","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09143","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"KIAZRT7DZTBG","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KIAZRT7DZTBG5PJZ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KIAZRT7D","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:2158c0dd5ab6528384b5593815bd5c110d6c3102f4f418652fb5c13e77ca2ed3","target":"graph","created_at":"2026-05-18T00:30:17Z","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":"For two fixed graphs $T$ and $H$ let $ex(G(n,p),T,H)$ be the random variable counting the maximum number of copies of $T$ in an $H$-free subgraph of the random graph $G(n,p)$. We show that for the case $T=K_m$ and $\\chi(H)> m$ the behavior of $ex(G(n,p),K_m,H)$ depends strongly on the relation between $p$ and $m_2(H)=\\max_{H'\\subset H, |V(H')|'\\geq 3}\\left\\{ \\frac{e(H')-1}{v(H')-2} \\right\\}$.\n  When $m_2(H)> m_2(K_m)$ we prove that with high probability, depending on the value of $p$, either one can maintain almost all copies of $K_m$, or it is asymptotically best to take a $\\chi(H)-1$ partite","authors_text":"Alexandr Kostochka, Clara Shikhelman, Noga Alon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-29T13:49:27Z","title":"Many cliques in $H$-free subgraphs of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09143","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:4fba0dabe568486b5dfce854f89b9efbf52c76e70103dbf6caaaa2918fe130b9","target":"record","created_at":"2026-05-18T00:30:17Z","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":"bab34b71f432f9263e9a8acf395a8d07c491af49a8209d5355f2914d001d27c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-29T13:49:27Z","title_canon_sha256":"615ca875b92b94875d77e4ae8c37226dad854c0e2270e4fc33e887b6e5d6e761"},"schema_version":"1.0","source":{"id":"1612.09143","kind":"arxiv","version":2}},"canonical_sha256":"520198cfe3ccc26ebd3962233979c313b567a7909414c8fe4776cb4c7a2a157e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"520198cfe3ccc26ebd3962233979c313b567a7909414c8fe4776cb4c7a2a157e","first_computed_at":"2026-05-18T00:30:17.282500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:17.282500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UwnLjalGvvqHw3w2q3jGk8FOQ3mr7eenAd88M384YlReGqpgMVEL9UPrmDirBmtIhwHKGzC36DG2rlupdv/eDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:17.283352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.09143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fba0dabe568486b5dfce854f89b9efbf52c76e70103dbf6caaaa2918fe130b9","sha256:2158c0dd5ab6528384b5593815bd5c110d6c3102f4f418652fb5c13e77ca2ed3"],"state_sha256":"bc042c41e9748c4543d2b80562522df111ed5ce1664d051352aa695fee95a6b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Nbdaye+8JqEqWioRUPpXPYUeTfeM7WBLfiAX/9sQiMzE1nksWajtGjclI6twvk7mV4bkwI4RviUhanSIFU2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:53:25.498242Z","bundle_sha256":"8b53615882683163cd948437de61ccd739beeb76b808ef40959626106bb4bf20"}}