{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KOHLOMEH6SHLRJNQTRYNEXU2QC","short_pith_number":"pith:KOHLOMEH","schema_version":"1.0","canonical_sha256":"538eb73087f48eb8a5b09c70d25e9a80b6c03f37d5d63e0f3f02676514ed9ad2","source":{"kind":"arxiv","id":"2506.03612","version":2},"attestation_state":"computed","paper":{"title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Batya Kenig","submitted_at":"2025-06-04T06:44:47Z","abstract_excerpt":"Let $A$ and $B$ be disjoint, non-adjacent vertex-sets in an undirected, connected graph $G$, whose vertices are associated with positive weights. We address the problem of identifying a minimum-weight subset of vertices $S\\subseteq V(G)$ that, when removed, disconnects $A$ from $B$ while preserving the internal connectivity of both $A$ and $B$. We call such a subset of vertices a connectivity-preserving, or safe minimum $A,B$-separator. Deciding whether a safe $A,B$-separator exists is NP-hard by reduction from the 2-disjoint connected subgraphs problem, and remains NP-hard even for restricted"},"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":"2506.03612","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T06:44:47Z","cross_cats_sorted":[],"title_canon_sha256":"4b64146d63f57e68ee0561ddb543e6e3a05acf992ee60ac447bb6c6401b18306","abstract_canon_sha256":"eefc18e6d7c836bb49b1c3744baf8a6c4199b7ce73b1defefd9cf79a0003e415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:36.105825Z","signature_b64":"79VDmjxbg5gZsH8v7U3ZuH1Y9Ma2g0r7AQaaVpJyi7UjgTT4OgNWmryjhbLufH1KBmpdTuHagZVXLKZsYNgIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538eb73087f48eb8a5b09c70d25e9a80b6c03f37d5d63e0f3f02676514ed9ad2","last_reissued_at":"2026-07-05T11:16:36.105252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:36.105252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity-Preserving Minimum Separator in AT-free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Batya Kenig","submitted_at":"2025-06-04T06:44:47Z","abstract_excerpt":"Let $A$ and $B$ be disjoint, non-adjacent vertex-sets in an undirected, connected graph $G$, whose vertices are associated with positive weights. We address the problem of identifying a minimum-weight subset of vertices $S\\subseteq V(G)$ that, when removed, disconnects $A$ from $B$ while preserving the internal connectivity of both $A$ and $B$. We call such a subset of vertices a connectivity-preserving, or safe minimum $A,B$-separator. Deciding whether a safe $A,B$-separator exists is NP-hard by reduction from the 2-disjoint connected subgraphs problem, and remains NP-hard even for restricted"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03612","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03612/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":"2506.03612","created_at":"2026-07-05T11:16:36.105322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03612v2","created_at":"2026-07-05T11:16:36.105322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03612","created_at":"2026-07-05T11:16:36.105322+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOHLOMEH6SHL","created_at":"2026-07-05T11:16:36.105322+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOHLOMEH6SHLRJNQ","created_at":"2026-07-05T11:16:36.105322+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOHLOMEH","created_at":"2026-07-05T11:16:36.105322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.15849","citing_title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC","json":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC.json","graph_json":"https://pith.science/api/pith-number/KOHLOMEH6SHLRJNQTRYNEXU2QC/graph.json","events_json":"https://pith.science/api/pith-number/KOHLOMEH6SHLRJNQTRYNEXU2QC/events.json","paper":"https://pith.science/paper/KOHLOMEH"},"agent_actions":{"view_html":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC","download_json":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC.json","view_paper":"https://pith.science/paper/KOHLOMEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03612&json=true","fetch_graph":"https://pith.science/api/pith-number/KOHLOMEH6SHLRJNQTRYNEXU2QC/graph.json","fetch_events":"https://pith.science/api/pith-number/KOHLOMEH6SHLRJNQTRYNEXU2QC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/action/storage_attestation","attest_author":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/action/author_attestation","sign_citation":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/action/citation_signature","submit_replication":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/action/replication_record"}},"created_at":"2026-07-05T11:16:36.105322+00:00","updated_at":"2026-07-05T11:16:36.105322+00:00"}