{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LZWAQDEMSJLKWD7DK5DVOOIBBH","short_pith_number":"pith:LZWAQDEM","schema_version":"1.0","canonical_sha256":"5e6c080c8c9256ab0fe3574757390109f31f46092e0199c70f985c7139447927","source":{"kind":"arxiv","id":"1808.09117","version":1},"attestation_state":"computed","paper":{"title":"On Some Combinatorial Problems in Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kona Harshita, N. Sadagopan","submitted_at":"2018-08-28T04:50:49Z","abstract_excerpt":"The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper, we study some popular combinatorial problems restricted to cographs. We first present a structural characterization of minimal vertex separators in cographs. Further, we show that listing all minimal vertex separators and the complexity of some constrained vertex separators are polynomial-time solvable in cographs. We propose polynomial-time algorithms for co"},"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":"1808.09117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T04:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"5e24cfa3fc7a659c5d33ab7169b9a9aa7caf2fd7d09dbd28139f3604cf87e066","abstract_canon_sha256":"55ca6ad3c26c5fb8f6801e942274d3ab0026ab23b5e8fb400636a7282709051f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:04.441360Z","signature_b64":"j/1UEzajjoV4q90HbwGJoIUwVybfUhYdsDUcLfn2w3ZQXJgvm6a1SlzXeID+GiZ1GB8cYVwsX0ylzEvG2Po2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6c080c8c9256ab0fe3574757390109f31f46092e0199c70f985c7139447927","last_reissued_at":"2026-05-18T00:07:04.440783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:04.440783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Some Combinatorial Problems in Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kona Harshita, N. Sadagopan","submitted_at":"2018-08-28T04:50:49Z","abstract_excerpt":"The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper, we study some popular combinatorial problems restricted to cographs. We first present a structural characterization of minimal vertex separators in cographs. Further, we show that listing all minimal vertex separators and the complexity of some constrained vertex separators are polynomial-time solvable in cographs. We propose polynomial-time algorithms for co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09117","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":"1808.09117","created_at":"2026-05-18T00:07:04.440894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09117v1","created_at":"2026-05-18T00:07:04.440894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09117","created_at":"2026-05-18T00:07:04.440894+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZWAQDEMSJLK","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZWAQDEMSJLKWD7D","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZWAQDEM","created_at":"2026-05-18T12:32:37.024351+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/LZWAQDEMSJLKWD7DK5DVOOIBBH","json":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH.json","graph_json":"https://pith.science/api/pith-number/LZWAQDEMSJLKWD7DK5DVOOIBBH/graph.json","events_json":"https://pith.science/api/pith-number/LZWAQDEMSJLKWD7DK5DVOOIBBH/events.json","paper":"https://pith.science/paper/LZWAQDEM"},"agent_actions":{"view_html":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH","download_json":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH.json","view_paper":"https://pith.science/paper/LZWAQDEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09117&json=true","fetch_graph":"https://pith.science/api/pith-number/LZWAQDEMSJLKWD7DK5DVOOIBBH/graph.json","fetch_events":"https://pith.science/api/pith-number/LZWAQDEMSJLKWD7DK5DVOOIBBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/action/storage_attestation","attest_author":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/action/author_attestation","sign_citation":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/action/citation_signature","submit_replication":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/action/replication_record"}},"created_at":"2026-05-18T00:07:04.440894+00:00","updated_at":"2026-05-18T00:07:04.440894+00:00"}