{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ATBISSRDZTFC62QE2CBFW5TYND","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":"cb0c37dae672af647afed38b36893553c749be60c03619ef5fc07cf6024bbd02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T12:00:27Z","title_canon_sha256":"572cca8c70a7a96caa37d6ff49889768794bd39aad2ab181c3e3b61ba78ce6a6"},"schema_version":"1.0","source":{"id":"1806.06609","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06609","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06609v2","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06609","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"ATBISSRDZTFC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ATBISSRDZTFC62QE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ATBISSRD","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:f97a1e0d18e25a0ecdf0e9250cf085fff6143a12b4a000735153b1af070b19f1","target":"graph","created_at":"2026-05-17T23:50:59Z","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":"We study the following generalization of the Tur\\'an problem in sparse random graphs. Given graphs $T$ and $H$, let $\\mathrm{ex}\\big(G(n,p), T, H\\big)$ be the random variable that counts the largest number of copies of $T$ in a subgraph of $G(n,p)$ that does not contain $H$. We study the threshold phenomena arising in the evolution of the typical value of this random variable, for every $H$ and an arbitrary $2$-balanced $T$.\n  Our results in the case when $m_2(H) > m_2(T)$ are a natural generalization of the Erd\\H{o}s--Stone theorem for $G(n,p)$, which was proved several years ago by Conlon an","authors_text":"Clara Shikhelman, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T12:00:27Z","title":"A generalized Tur\\'an problem in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06609","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:2d60155a382b40d09b64bb64d3355d2cbc1b8f4cc9054200122366fdb823e9f7","target":"record","created_at":"2026-05-17T23:50:59Z","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":"cb0c37dae672af647afed38b36893553c749be60c03619ef5fc07cf6024bbd02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T12:00:27Z","title_canon_sha256":"572cca8c70a7a96caa37d6ff49889768794bd39aad2ab181c3e3b61ba78ce6a6"},"schema_version":"1.0","source":{"id":"1806.06609","kind":"arxiv","version":2}},"canonical_sha256":"04c2894a23ccca2f6a04d0825b767868fd1fb8a232d7de75da069b388052aaa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04c2894a23ccca2f6a04d0825b767868fd1fb8a232d7de75da069b388052aaa8","first_computed_at":"2026-05-17T23:50:59.603042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:59.603042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qSx/wWkbpgs7e8czgLeZsQFBJ4DpXXKlhutAUuNMWFh9qTFKhbB9gTdWRsE/hF9eUGKIjSDXchAVE4Jw54GdBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:59.603642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06609","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d60155a382b40d09b64bb64d3355d2cbc1b8f4cc9054200122366fdb823e9f7","sha256:f97a1e0d18e25a0ecdf0e9250cf085fff6143a12b4a000735153b1af070b19f1"],"state_sha256":"f07107ece89abe73959e3360db75a7de542cc2fc17dd413c83a4b5f8ca8ce46f"}