{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6BL5T54K3QNDBEMYG6O5PNG4DO","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":"75084ce8210c96bc3d601137baab7c21dd0516444dff0c97b7120ee8cf405e9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T10:54:06Z","title_canon_sha256":"0e54495eced605f324c500e14cc5d4fc25ad126b09e76a943a5898bc008208d5"},"schema_version":"1.0","source":{"id":"2409.17724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.17724","created_at":"2026-07-05T09:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"2409.17724v1","created_at":"2026-07-05T09:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17724","created_at":"2026-07-05T09:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"6BL5T54K3QND","created_at":"2026-07-05T09:12:14Z"},{"alias_kind":"pith_short_16","alias_value":"6BL5T54K3QNDBEMY","created_at":"2026-07-05T09:12:14Z"},{"alias_kind":"pith_short_8","alias_value":"6BL5T54K","created_at":"2026-07-05T09:12:14Z"}],"graph_snapshots":[{"event_id":"sha256:c7ce004b676baa20e495486249f90923b1205173fe52cc4e722a177e2c1e43c5","target":"graph","created_at":"2026-07-05T09:12:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.17724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose the conjecture that every graph $G$ of order $n$ with less than $3n-6$ edges has a vertex cut that induces a forest. Maximal planar graphs do not have such vertex cuts and show that the density condition would be best possible. We verify the conjecture for planar graphs and show that every graph $G$ of order $n$ with less than $\\frac{11}{5}n-\\frac{18}{5}$ edges has a vertex cut that induces a forest.","authors_text":"Dieter Rautenbach, Johannes Rauch, Vsevolod Chernyshev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T10:54:06Z","title":"Forest Cuts in Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17724","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:81d9724c77210c96dc12190925c5003c4f742527a5fa676af4890762687b558b","target":"record","created_at":"2026-07-05T09:12:14Z","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":"75084ce8210c96bc3d601137baab7c21dd0516444dff0c97b7120ee8cf405e9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T10:54:06Z","title_canon_sha256":"0e54495eced605f324c500e14cc5d4fc25ad126b09e76a943a5898bc008208d5"},"schema_version":"1.0","source":{"id":"2409.17724","kind":"arxiv","version":1}},"canonical_sha256":"f057d9f78adc1a309198379dd7b4dc1ba7d1c0d1f0eb10390c550775ef7e8417","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f057d9f78adc1a309198379dd7b4dc1ba7d1c0d1f0eb10390c550775ef7e8417","first_computed_at":"2026-07-05T09:12:14.688046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:12:14.688046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYsEkOQ34IgdSMDttSlbyxaoXVNHZOmoyWVXVC9R44ScjPuEz1tAOiSR65f3f2wsOc8wjAxe0Urd7M3aqriuDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:12:14.688539Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.17724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81d9724c77210c96dc12190925c5003c4f742527a5fa676af4890762687b558b","sha256:c7ce004b676baa20e495486249f90923b1205173fe52cc4e722a177e2c1e43c5"],"state_sha256":"9adb76f9346cb373bfed0036e85cd2abf3ef1edba24a353cfcf8035ccc3a063b"}