{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HUDCNRHTPSBIVURJ67M6FGIRMQ","short_pith_number":"pith:HUDCNRHT","schema_version":"1.0","canonical_sha256":"3d0626c4f37c828ad229f7d9e299116414306ac4d785b76a8359dbc47ce0cc6b","source":{"kind":"arxiv","id":"2511.15849","version":4},"attestation_state":"computed","paper":{"title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Batya Kenig","submitted_at":"2025-11-19T20:13:23Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.15849","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-11-19T20:13:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8ccdc1d3184d9ab0cd2b4df4350cd9417b4e4183a9121849c9c26fdac2e17bc6","abstract_canon_sha256":"e17ab94403a79cb79060ee4bd69dcb261e7b7f149aec50304c0117e2b32c33a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:05.432132Z","signature_b64":"lDwA9IqMlKTW1nVGEuUWE6Ju4miua1yi+McFqao9U/+83HlVXu6hD5eKc4JfFo9h7/hFl43TOVk2lO1RzbTsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0626c4f37c828ad229f7d9e299116414306ac4d785b76a8359dbc47ce0cc6b","last_reissued_at":"2026-07-02T01:18:05.431691Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:05.431691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Batya Kenig","submitted_at":"2025-11-19T20:13:23Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"70bd85ca11044a0a448d7ca4409cc1cea9adff04d4a64f166a08cdc055fce93a"},"source":{"id":"2511.15849","kind":"arxiv","version":4},"verdict":{"id":"96a8f257-af78-457c-8a13-e925f46acc3b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T20:02:05.479930Z","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.","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","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.","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."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.15849/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.15849","created_at":"2026-07-02T01:18:05.431769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.15849v4","created_at":"2026-07-02T01:18:05.431769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15849","created_at":"2026-07-02T01:18:05.431769+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUDCNRHTPSBI","created_at":"2026-07-02T01:18:05.431769+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUDCNRHTPSBIVURJ","created_at":"2026-07-02T01:18:05.431769+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUDCNRHT","created_at":"2026-07-02T01:18:05.431769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ","json":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ.json","graph_json":"https://pith.science/api/pith-number/HUDCNRHTPSBIVURJ67M6FGIRMQ/graph.json","events_json":"https://pith.science/api/pith-number/HUDCNRHTPSBIVURJ67M6FGIRMQ/events.json","paper":"https://pith.science/paper/HUDCNRHT"},"agent_actions":{"view_html":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ","download_json":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ.json","view_paper":"https://pith.science/paper/HUDCNRHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.15849&json=true","fetch_graph":"https://pith.science/api/pith-number/HUDCNRHTPSBIVURJ67M6FGIRMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HUDCNRHTPSBIVURJ67M6FGIRMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ/action/storage_attestation","attest_author":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ/action/author_attestation","sign_citation":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ/action/citation_signature","submit_replication":"https://pith.science/pith/HUDCNRHTPSBIVURJ67M6FGIRMQ/action/replication_record"}},"created_at":"2026-07-02T01:18:05.431769+00:00","updated_at":"2026-07-02T01:18:05.431769+00:00"}