{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CHIXIR3YRXMINSNH34OMZBPK7R","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":"86f0b1c4ce597f14f6d999367e206895640baa2c2995152730d956faf268a309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-18T22:20:13Z","title_canon_sha256":"7ebbf18d2b47e8ce3ea8b4707c6250f8ee1617d0e3862a6d1b51712d5eb716cd"},"schema_version":"1.0","source":{"id":"1507.05226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05226","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05226v1","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05226","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"CHIXIR3YRXMI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CHIXIR3YRXMINSNH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CHIXIR3Y","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:50a18232e1e5c7c0cea6cefb4872c1b855aa1d06c25bef668f85484d8c23a20a","target":"graph","created_at":"2026-05-18T01:36:37Z","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":"Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of $G(n,p)$ with high minimum degree. We prove that asymptotically almost surely each triangle-free spanning subgraph of $G(n,p)$ with minimum degree at least $\\big(\\frac{2}{5} + o(1)\\big)pn$ is $\\mathcal O(p^{-1}n)$-close to bipartite, and each spanning triangle-free subgraph of $G(n,p)$ with minimum degree at least $(\\frac{1}{3}+\\varepsilon)pn$ is $\\mathcal O(p^{-1}n)$-close to $r$","authors_text":"Barnaby Roberts, Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-18T22:20:13Z","title":"Triangle-free subgraphs of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05226","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:14266aee8ff4ca8f8c3de28047bec2fa685691c1c59613c357ab0c27f607bcbe","target":"record","created_at":"2026-05-18T01:36:37Z","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":"86f0b1c4ce597f14f6d999367e206895640baa2c2995152730d956faf268a309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-18T22:20:13Z","title_canon_sha256":"7ebbf18d2b47e8ce3ea8b4707c6250f8ee1617d0e3862a6d1b51712d5eb716cd"},"schema_version":"1.0","source":{"id":"1507.05226","kind":"arxiv","version":1}},"canonical_sha256":"11d17447788dd886c9a7df1ccc85eafc4d3b28652d9441a9d93df75743bf857e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11d17447788dd886c9a7df1ccc85eafc4d3b28652d9441a9d93df75743bf857e","first_computed_at":"2026-05-18T01:36:37.492894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:37.492894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sto5KKosNQ/Xc9kcJVkI/XsA8OUvjahjFheFOlTq3FEr2cwz/iDOdCo8QVzLPt1eaUqNpZli/JNeBax85efCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:37.493556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14266aee8ff4ca8f8c3de28047bec2fa685691c1c59613c357ab0c27f607bcbe","sha256:50a18232e1e5c7c0cea6cefb4872c1b855aa1d06c25bef668f85484d8c23a20a"],"state_sha256":"81eddb1914e18a60d2d27224d45688804e1dedf6eebda303062ceef1306ab215"}