{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W24HBTEHJ6XOGR2SLVWECUQMKA","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":"ee484d34579b4e0a424c4b1b9c1e73f2e40ee2072ced5285f5d029fdea3071e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-30T15:41:01Z","title_canon_sha256":"d58a935c19839ba1ab6c391c409e9c80b56761d71cedffe895d8c098ebc1fd32"},"schema_version":"1.0","source":{"id":"1404.7764","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7764","created_at":"2026-05-18T00:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7764v2","created_at":"2026-05-18T00:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7764","created_at":"2026-05-18T00:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"W24HBTEHJ6XO","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W24HBTEHJ6XOGR2S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W24HBTEH","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:68cbad1a78aadf67dac36a9f40ba2f58941ce3dcc1c59e1cca27e503ecb97d48","target":"graph","created_at":"2026-05-18T00:55:28Z","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":"Let $\\mathcal{F}$ be a family of fixed graphs and let $d$ be large enough. For every $d$-regular graph $G$, we study the existence of a spanning $\\mathcal{F}$-free subgraph of $G$ with large minimum degree. This problem is well-understood if $\\mathcal{F}$ does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs.","authors_text":"Bruce Reed, Guillem Perarnau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-30T15:41:01Z","title":"Existence of spanning $\\mathcal{F}$-free subgraphs with large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7764","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:a43d680d4ef420e02a66cf58349a19157bcb2f338d90341ea313309a6778fa8f","target":"record","created_at":"2026-05-18T00:55:28Z","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":"ee484d34579b4e0a424c4b1b9c1e73f2e40ee2072ced5285f5d029fdea3071e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-30T15:41:01Z","title_canon_sha256":"d58a935c19839ba1ab6c391c409e9c80b56761d71cedffe895d8c098ebc1fd32"},"schema_version":"1.0","source":{"id":"1404.7764","kind":"arxiv","version":2}},"canonical_sha256":"b6b870cc874faee347525d6c41520c5004f116539f238fc961dccc97788ccae5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6b870cc874faee347525d6c41520c5004f116539f238fc961dccc97788ccae5","first_computed_at":"2026-05-18T00:55:28.914231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:28.914231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nsqb5/ll1IRX77mIYK8g2R+XtXn8JaW3rcFXHegO0A3hpn2NxRwbEGsad0JVyzghgsVtEFrsz8oey9RF3i5kDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:28.914823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7764","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a43d680d4ef420e02a66cf58349a19157bcb2f338d90341ea313309a6778fa8f","sha256:68cbad1a78aadf67dac36a9f40ba2f58941ce3dcc1c59e1cca27e503ecb97d48"],"state_sha256":"1dd4f59425a7656b31f8cfff03cf16232648e2ac36b1e226d7b20b9e3cbb009a"}