{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HUDCNRHTPSBIVURJ67M6FGIRMQ","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":"e17ab94403a79cb79060ee4bd69dcb261e7b7f149aec50304c0117e2b32c33a6","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-11-19T20:13:23Z","title_canon_sha256":"8ccdc1d3184d9ab0cd2b4df4350cd9417b4e4183a9121849c9c26fdac2e17bc6"},"schema_version":"1.0","source":{"id":"2511.15849","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.15849","created_at":"2026-07-02T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"2511.15849v4","created_at":"2026-07-02T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15849","created_at":"2026-07-02T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"HUDCNRHTPSBI","created_at":"2026-07-02T01:18:05Z"},{"alias_kind":"pith_short_16","alias_value":"HUDCNRHTPSBIVURJ","created_at":"2026-07-02T01:18:05Z"},{"alias_kind":"pith_short_8","alias_value":"HUDCNRHT","created_at":"2026-07-02T01:18:05Z"}],"graph_snapshots":[{"event_id":"sha256:81e7870ebc0a5bf4eb56eb042a9478f96264c8fffe1543a6290ed0fe58c9ddd4","target":"graph","created_at":"2026-07-02T01:18:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our main result shows that this family is highly structured: the number of connectivity-preserving important separators of size at most k is 2^{O(k log k)}, and they can be enumerated within the same bound up to polynomial factors."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The framework assumes that the connectivity constraints (equivalence classes of terminals that must remain connected) are provided explicitly and that the underlying graph is undirected and simple; if the constraints are implicit or the graph has directed edges or weights, the enumeration bound may not apply directly."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Connectivity-preserving important separators of size at most k number 2^{O(k log k)} and can be enumerated in the same bound, yielding 2^{O(k log k)} FPT time for constant-class Node Multiway Cut-Uncut."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Connectivity-preserving important separators can be enumerated in 2^{O(k log k)} time, extending classical separator techniques to cut-uncut problems that require both disconnection and internal connectivity preservation."}],"snapshot_sha256":"70bd85ca11044a0a448d7ca4409cc1cea9adff04d4a64f166a08cdc055fce93a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.15849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Important separators are a cornerstone of parameterized algorithms for graph separation: they reduce an a priori enormous search space of separators to a small, structured family that can be enumerated efficiently. This principle has been remarkably successful for parameterized separation problems, but it does not address cut-uncut problems, where one must cut some connections while preserving the connectivity of a given set of terminals. These connectivity-preservation requirements create a qualitatively different type of structure, and the classical important-separator machinery no longer gi","authors_text":"Batya Kenig","cross_cats":["cs.CC"],"headline":"Connectivity-preserving important separators can be enumerated in 2^{O(k log k)} time, extending classical separator techniques to cut-uncut problems that require both disconnection and internal connectivity preservation.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-11-19T20:13:23Z","title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.15849","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-17T20:02:05.479930Z","id":"96a8f257-af78-457c-8a13-e925f46acc3b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Connectivity-preserving important separators of size at most k number 2^{O(k log k)} and can be enumerated in the same bound, yielding 2^{O(k log k)} FPT time for constant-class Node Multiway Cut-Uncut.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Connectivity-preserving important separators can be enumerated in 2^{O(k log k)} time, extending classical separator techniques to cut-uncut problems that require both disconnection and internal connectivity preservation.","strongest_claim":"Our main result shows that this family is highly structured: the number of connectivity-preserving important separators of size at most k is 2^{O(k log k)}, and they can be enumerated within the same bound up to polynomial factors.","weakest_assumption":"The framework assumes that the connectivity constraints (equivalence classes of terminals that must remain connected) are provided explicitly and that the underlying graph is undirected and simple; if the constraints are implicit or the graph has directed edges or weights, the enumeration bound may not apply directly."}},"verdict_id":"96a8f257-af78-457c-8a13-e925f46acc3b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83643c0e495dcff32bc0069e7b8af75fee650c70a4b710eea0a36095e72cc97c","target":"record","created_at":"2026-07-02T01:18:05Z","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":"e17ab94403a79cb79060ee4bd69dcb261e7b7f149aec50304c0117e2b32c33a6","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-11-19T20:13:23Z","title_canon_sha256":"8ccdc1d3184d9ab0cd2b4df4350cd9417b4e4183a9121849c9c26fdac2e17bc6"},"schema_version":"1.0","source":{"id":"2511.15849","kind":"arxiv","version":4}},"canonical_sha256":"3d0626c4f37c828ad229f7d9e299116414306ac4d785b76a8359dbc47ce0cc6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d0626c4f37c828ad229f7d9e299116414306ac4d785b76a8359dbc47ce0cc6b","first_computed_at":"2026-07-02T01:18:05.431691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:05.431691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lDwA9IqMlKTW1nVGEuUWE6Ju4miua1yi+McFqao9U/+83HlVXu6hD5eKc4JfFo9h7/hFl43TOVk2lO1RzbTsBg==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:05.432132Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.15849","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83643c0e495dcff32bc0069e7b8af75fee650c70a4b710eea0a36095e72cc97c","sha256:81e7870ebc0a5bf4eb56eb042a9478f96264c8fffe1543a6290ed0fe58c9ddd4"],"state_sha256":"e8132622f687bf2878debd8f1bcf5150e9961a6d2d75a2cc683410a8825f9cc8"}