{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XSUW2XN45OINA3LVAWDB5UL3GP","short_pith_number":"pith:XSUW2XN4","schema_version":"1.0","canonical_sha256":"bca96d5dbceb90d06d7505861ed17b33cfc7eb6e0cb954eddb20f1eff27213a7","source":{"kind":"arxiv","id":"1103.2913","version":1},"attestation_state":"computed","paper":{"title":"A Characterization of all Stable Minimal Separator Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Gaurav Maheswari, Mrinal Kumar, N.Sadagopan","submitted_at":"2011-03-15T13:58:15Z","abstract_excerpt":"In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We show that such graphs are precisely those in which the induced subgraph, namely, a cycle with exactly one chord is forbidden. We also show that deciding maximum such forbidden subgraph is NP-complete by establishing a polynomial time reduction from maximum induced cycle problem [1]. This result is of independent interest and can be used in other combinatorial"},"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":"1103.2913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-15T13:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"4b16daaae181b3b3eb7bd8a99993218b0110cfe84549ff919e430e65e64c5a1b","abstract_canon_sha256":"d44c9094fd9173d63d9794e086f58bc3a838c1324a66da35383f17aaddef2e90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:46.270863Z","signature_b64":"G3fuBXz2o98L3TIIjS/U4Tvr3tuI52pLkw1/a/ax76g5ahY0tJ8+9JvH3SW1FfnUkdLM6eJAEXOZ9Q7C0wO4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bca96d5dbceb90d06d7505861ed17b33cfc7eb6e0cb954eddb20f1eff27213a7","last_reissued_at":"2026-05-18T04:26:46.270106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:46.270106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterization of all Stable Minimal Separator Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Gaurav Maheswari, Mrinal Kumar, N.Sadagopan","submitted_at":"2011-03-15T13:58:15Z","abstract_excerpt":"In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We show that such graphs are precisely those in which the induced subgraph, namely, a cycle with exactly one chord is forbidden. We also show that deciding maximum such forbidden subgraph is NP-complete by establishing a polynomial time reduction from maximum induced cycle problem [1]. This result is of independent interest and can be used in other combinatorial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2913","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1103.2913","created_at":"2026-05-18T04:26:46.270239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2913v1","created_at":"2026-05-18T04:26:46.270239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2913","created_at":"2026-05-18T04:26:46.270239+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSUW2XN45OIN","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSUW2XN45OINA3LV","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSUW2XN4","created_at":"2026-05-18T12:26:47.523578+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/XSUW2XN45OINA3LVAWDB5UL3GP","json":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP.json","graph_json":"https://pith.science/api/pith-number/XSUW2XN45OINA3LVAWDB5UL3GP/graph.json","events_json":"https://pith.science/api/pith-number/XSUW2XN45OINA3LVAWDB5UL3GP/events.json","paper":"https://pith.science/paper/XSUW2XN4"},"agent_actions":{"view_html":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP","download_json":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP.json","view_paper":"https://pith.science/paper/XSUW2XN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2913&json=true","fetch_graph":"https://pith.science/api/pith-number/XSUW2XN45OINA3LVAWDB5UL3GP/graph.json","fetch_events":"https://pith.science/api/pith-number/XSUW2XN45OINA3LVAWDB5UL3GP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP/action/storage_attestation","attest_author":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP/action/author_attestation","sign_citation":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP/action/citation_signature","submit_replication":"https://pith.science/pith/XSUW2XN45OINA3LVAWDB5UL3GP/action/replication_record"}},"created_at":"2026-05-18T04:26:46.270239+00:00","updated_at":"2026-05-18T04:26:46.270239+00:00"}