{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KOHLOMEH6SHLRJNQTRYNEXU2QC","short_pith_number":"pith:KOHLOMEH","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"},"canonical_sha256":"538eb73087f48eb8a5b09c70d25e9a80b6c03f37d5d63e0f3f02676514ed9ad2","source":{"kind":"arxiv","id":"2506.03612","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03612","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03612v2","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03612","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"KOHLOMEH6SHL","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"pith_short_16","alias_value":"KOHLOMEH6SHLRJNQ","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"pith_short_8","alias_value":"KOHLOMEH","created_at":"2026-07-05T11:16:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KOHLOMEH6SHLRJNQTRYNEXU2QC","target":"record","payload":{"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"},"canonical_sha256":"538eb73087f48eb8a5b09c70d25e9a80b6c03f37d5d63e0f3f02676514ed9ad2","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"},"source_kind":"arxiv","source_id":"2506.03612","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsUJZQFv1tr1Az0lOpUbmr8iHKBdVgKv8O4NyjNjKg6XlqHlK01JsF8Mg72H9OotuJEB+YUuTzEtyDe4DZkKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:21:52.523455Z"},"content_sha256":"270fde79eab415c9db9de5fb9e8fefe9be8e830ecfffd03048d19c130792284e","schema_version":"1.0","event_id":"sha256:270fde79eab415c9db9de5fb9e8fefe9be8e830ecfffd03048d19c130792284e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KOHLOMEH6SHLRJNQTRYNEXU2QC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54xv+mvTGShCcimS/qmmDWtwulN4jiTtfZcSG35bJ9kEq4yM0UHtnOSyDEh2B7y3eStIjLO5SqST2QfTstakCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:21:52.523985Z"},"content_sha256":"dd5293004a2771915f6aa1f19d2675033425a479720941b94b640e4ad50ea194","schema_version":"1.0","event_id":"sha256:dd5293004a2771915f6aa1f19d2675033425a479720941b94b640e4ad50ea194"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/bundle.json","state_url":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T00:21:52Z","links":{"resolver":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC","bundle":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/bundle.json","state":"https://pith.science/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOHLOMEH6SHLRJNQTRYNEXU2QC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KOHLOMEH6SHLRJNQTRYNEXU2QC","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":"eefc18e6d7c836bb49b1c3744baf8a6c4199b7ce73b1defefd9cf79a0003e415","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T06:44:47Z","title_canon_sha256":"4b64146d63f57e68ee0561ddb543e6e3a05acf992ee60ac447bb6c6401b18306"},"schema_version":"1.0","source":{"id":"2506.03612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03612","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03612v2","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03612","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"KOHLOMEH6SHL","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"pith_short_16","alias_value":"KOHLOMEH6SHLRJNQ","created_at":"2026-07-05T11:16:36Z"},{"alias_kind":"pith_short_8","alias_value":"KOHLOMEH","created_at":"2026-07-05T11:16:36Z"}],"graph_snapshots":[{"event_id":"sha256:dd5293004a2771915f6aa1f19d2675033425a479720941b94b640e4ad50ea194","target":"graph","created_at":"2026-07-05T11:16:36Z","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/2506.03612/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Batya Kenig","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T06:44:47Z","title":"Connectivity-Preserving Minimum Separator in AT-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03612","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:270fde79eab415c9db9de5fb9e8fefe9be8e830ecfffd03048d19c130792284e","target":"record","created_at":"2026-07-05T11:16:36Z","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":"eefc18e6d7c836bb49b1c3744baf8a6c4199b7ce73b1defefd9cf79a0003e415","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-04T06:44:47Z","title_canon_sha256":"4b64146d63f57e68ee0561ddb543e6e3a05acf992ee60ac447bb6c6401b18306"},"schema_version":"1.0","source":{"id":"2506.03612","kind":"arxiv","version":2}},"canonical_sha256":"538eb73087f48eb8a5b09c70d25e9a80b6c03f37d5d63e0f3f02676514ed9ad2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"538eb73087f48eb8a5b09c70d25e9a80b6c03f37d5d63e0f3f02676514ed9ad2","first_computed_at":"2026-07-05T11:16:36.105252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:36.105252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"79VDmjxbg5gZsH8v7U3ZuH1Y9Ma2g0r7AQaaVpJyi7UjgTT4OgNWmryjhbLufH1KBmpdTuHagZVXLKZsYNgIAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:36.105825Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:270fde79eab415c9db9de5fb9e8fefe9be8e830ecfffd03048d19c130792284e","sha256:dd5293004a2771915f6aa1f19d2675033425a479720941b94b640e4ad50ea194"],"state_sha256":"2fde061959a3799d4b03083493e15d2fb113f75832246b5e1bf255c11d73393a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgdpuaYZjULBBLABLr8cQwjT/tr9Zn/ap+S975GpKbotj09FVoptiP4F50+72FcS3n/+V9nbFDpNkD8PhLuaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:21:52.527967Z","bundle_sha256":"386177d88b9ae52059491fa2ebaa72fdff226b47e6b95db885e614cd7256a9d7"}}