{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LZWAQDEMSJLKWD7DK5DVOOIBBH","short_pith_number":"pith:LZWAQDEM","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"},"canonical_sha256":"5e6c080c8c9256ab0fe3574757390109f31f46092e0199c70f985c7139447927","source":{"kind":"arxiv","id":"1808.09117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09117","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09117v1","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09117","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"LZWAQDEMSJLK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZWAQDEMSJLKWD7D","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZWAQDEM","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LZWAQDEMSJLKWD7DK5DVOOIBBH","target":"record","payload":{"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"},"canonical_sha256":"5e6c080c8c9256ab0fe3574757390109f31f46092e0199c70f985c7139447927","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"},"source_kind":"arxiv","source_id":"1808.09117","source_version":1,"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-05-18T00:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BaodL4cfnxuRou5jss/+gKwtygJE5lHNWIN5VPR2ypH3Fw6v5yznflpweUH9KUzvWXEm0tiS+Dg7ZI5NiUq1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:54:42.133975Z"},"content_sha256":"292b9d3f560346efdf3a8904537117f8b556ea573c088a28846ff440a0144a17","schema_version":"1.0","event_id":"sha256:292b9d3f560346efdf3a8904537117f8b556ea573c088a28846ff440a0144a17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LZWAQDEMSJLKWD7DK5DVOOIBBH","target":"graph","payload":{"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"},"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-05-18T00:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vn4A2PhQVSandDLjYyjCcfsGUt21lDHIdmhapghFqjqsOwtio/zdg/pnI2uhLeYxzYUzAvIGT+PNbXgPrvbOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:54:42.134367Z"},"content_sha256":"c08afd51c51edae939d79a031cb6cd5b0f90eeb56544f25f143dcd3bd723f6b5","schema_version":"1.0","event_id":"sha256:c08afd51c51edae939d79a031cb6cd5b0f90eeb56544f25f143dcd3bd723f6b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/bundle.json","state_url":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/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-06-25T02:54:42Z","links":{"resolver":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH","bundle":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/bundle.json","state":"https://pith.science/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZWAQDEMSJLKWD7DK5DVOOIBBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LZWAQDEMSJLKWD7DK5DVOOIBBH","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":"55ca6ad3c26c5fb8f6801e942274d3ab0026ab23b5e8fb400636a7282709051f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T04:50:49Z","title_canon_sha256":"5e24cfa3fc7a659c5d33ab7169b9a9aa7caf2fd7d09dbd28139f3604cf87e066"},"schema_version":"1.0","source":{"id":"1808.09117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09117","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09117v1","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09117","created_at":"2026-05-18T00:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"LZWAQDEMSJLK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZWAQDEMSJLKWD7D","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZWAQDEM","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:c08afd51c51edae939d79a031cb6cd5b0f90eeb56544f25f143dcd3bd723f6b5","target":"graph","created_at":"2026-05-18T00:07:04Z","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"},"paper":{"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","authors_text":"Kona Harshita, N. Sadagopan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T04:50:49Z","title":"On Some Combinatorial Problems in Cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09117","kind":"arxiv","version":1},"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:292b9d3f560346efdf3a8904537117f8b556ea573c088a28846ff440a0144a17","target":"record","created_at":"2026-05-18T00:07:04Z","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":"55ca6ad3c26c5fb8f6801e942274d3ab0026ab23b5e8fb400636a7282709051f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T04:50:49Z","title_canon_sha256":"5e24cfa3fc7a659c5d33ab7169b9a9aa7caf2fd7d09dbd28139f3604cf87e066"},"schema_version":"1.0","source":{"id":"1808.09117","kind":"arxiv","version":1}},"canonical_sha256":"5e6c080c8c9256ab0fe3574757390109f31f46092e0199c70f985c7139447927","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6c080c8c9256ab0fe3574757390109f31f46092e0199c70f985c7139447927","first_computed_at":"2026-05-18T00:07:04.440783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:04.440783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j/1UEzajjoV4q90HbwGJoIUwVybfUhYdsDUcLfn2w3ZQXJgvm6a1SlzXeID+GiZ1GB8cYVwsX0ylzEvG2Po2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:04.441360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:292b9d3f560346efdf3a8904537117f8b556ea573c088a28846ff440a0144a17","sha256:c08afd51c51edae939d79a031cb6cd5b0f90eeb56544f25f143dcd3bd723f6b5"],"state_sha256":"9a847513d89146bced36203f9e4cdd3a16468651da5f0e3c6e9a3d4ee8833b24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1roRGiPYnMwjYthcDT89HfRKXcAgxf42vzStBJ+bC63ouFrxpxrqWNDNG4LrVH5FDVGEyN9TOyi7OKw9NQhxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:54:42.136512Z","bundle_sha256":"66d80f05d54608519428e8879f87c120bd7e061d0eb56511727363db73f8eae1"}}