{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6BBYBOL2CK7JM4QTQYZIMODOT7","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":"5d9776845fb041a006913c2b0e39fdce695162ba0b19ea46a035f34a60090610","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T03:34:48Z","title_canon_sha256":"c96eb623d0d8f8d0baeaf8881897d6a4ae6cdd31cfd21bdb7e0fc5488377ce7a"},"schema_version":"1.0","source":{"id":"2505.16179","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.16179","created_at":"2026-07-05T11:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"2505.16179v2","created_at":"2026-07-05T11:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16179","created_at":"2026-07-05T11:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"6BBYBOL2CK7J","created_at":"2026-07-05T11:10:57Z"},{"alias_kind":"pith_short_16","alias_value":"6BBYBOL2CK7JM4QT","created_at":"2026-07-05T11:10:57Z"},{"alias_kind":"pith_short_8","alias_value":"6BBYBOL2","created_at":"2026-07-05T11:10:57Z"}],"graph_snapshots":[{"event_id":"sha256:7ca86d0b6c09ebd210783a2975fbefd62fda9750af38a38fb6580b4bff269517","target":"graph","created_at":"2026-07-05T11:10:57Z","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/2505.16179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The paper is devoted to sufficient conditions for the existence of vertex cuts in simple graphs, where the induced subgraph on the cut vertices belongs to a specified graph class. In particular, we show that any connected graph with $n$ vertices and fewer than $(19n - 28)/8$ edges admits a forest cut. This result improves upon recent bounds, although it does not resolve the conjecture that the sharp threshold is $3n - 6$ (Chernyshev, Rauch, Rautenbach, 2024). Furthermore, we prove that if the number of edges is less than $(80n-134)/31$, then the graph admits a bipartite cut.","authors_text":"Alexei Volostnov, Elizaveta Neustroeva, Georgy Sokolov, Ilya I. Bogdanov, Nikolay Russkin, Vsevolod Voronov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16179","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:fb46c0c7223397dd17a8400180f29d0d67778d699119bdb51a850798cedfc158","target":"record","created_at":"2026-07-05T11:10:57Z","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":"5d9776845fb041a006913c2b0e39fdce695162ba0b19ea46a035f34a60090610","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T03:34:48Z","title_canon_sha256":"c96eb623d0d8f8d0baeaf8881897d6a4ae6cdd31cfd21bdb7e0fc5488377ce7a"},"schema_version":"1.0","source":{"id":"2505.16179","kind":"arxiv","version":2}},"canonical_sha256":"f04380b97a12be967213863286386e9fca16494f018ed046ae722f729471b842","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f04380b97a12be967213863286386e9fca16494f018ed046ae722f729471b842","first_computed_at":"2026-07-05T11:10:57.338791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:57.338791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5RJXfSTBHmEXyCrmHVjWgkBqm32438XEiKeYDnJACgVPWSEmZFW0nFATfvMW+dgRJdRocW+TPj6j19WM5z/jAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:57.339301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.16179","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb46c0c7223397dd17a8400180f29d0d67778d699119bdb51a850798cedfc158","sha256:7ca86d0b6c09ebd210783a2975fbefd62fda9750af38a38fb6580b4bff269517"],"state_sha256":"8c7c71c9d73962e721bb53fd8bb8ef8f9b2ddbfaa77792075700dbc3a63b1f1e"}