{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:X4T4C6VFH2FA64ULGW5XHXRCPF","short_pith_number":"pith:X4T4C6VF","schema_version":"1.0","canonical_sha256":"bf27c17aa53e8a0f728b35bb73de227962fc67eac861e7918f79009804e23e73","source":{"kind":"arxiv","id":"1106.6061","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for Unipolar and Generalized Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Elaine M. Eschen, Xiaoqiang Wang","submitted_at":"2011-06-29T20:37:24Z","abstract_excerpt":"A graph $G=(V,E)$ is a {\\it unipolar graph} if there exits a partition $V=V_1 \\cup V_2$ such that, $V_1$ is a clique and $V_2$ induces the disjoint union of cliques. The complement-closed class of {\\it generalized split graphs} are those graphs $G$ such that either $G$ {\\it or} the complement of $G$ is unipolar. Generalized split graphs are a large subclass of perfect graphs. In fact, it has been shown that almost all $C_5$-free (and hence, almost all perfect graphs) are generalized split graphs. In this paper we present a recognition algorithm for unipolar graphs that utilizes a minimal trian"},"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":"1106.6061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-29T20:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"057cf65bd5f3033ca805e8ae5c0bf073d2f56828b8abba5b3c46182a5bea9d93","abstract_canon_sha256":"98be4c0f49aa84c705e547cece301d49e7231cd1496c646dd3a56c0d18880b0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:46.732855Z","signature_b64":"2IncSTOeydcsZwl8SGNJj/UFh/glut2Vmt3saUe+8UFs9xjdRBb/CtolQVn5Yrobe4iqaucfzbYC8cLBkWVICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf27c17aa53e8a0f728b35bb73de227962fc67eac861e7918f79009804e23e73","last_reissued_at":"2026-05-18T03:12:46.732115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:46.732115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Unipolar and Generalized Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Elaine M. Eschen, Xiaoqiang Wang","submitted_at":"2011-06-29T20:37:24Z","abstract_excerpt":"A graph $G=(V,E)$ is a {\\it unipolar graph} if there exits a partition $V=V_1 \\cup V_2$ such that, $V_1$ is a clique and $V_2$ induces the disjoint union of cliques. The complement-closed class of {\\it generalized split graphs} are those graphs $G$ such that either $G$ {\\it or} the complement of $G$ is unipolar. Generalized split graphs are a large subclass of perfect graphs. In fact, it has been shown that almost all $C_5$-free (and hence, almost all perfect graphs) are generalized split graphs. In this paper we present a recognition algorithm for unipolar graphs that utilizes a minimal trian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6061","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":""},"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":"1106.6061","created_at":"2026-05-18T03:12:46.732235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.6061v2","created_at":"2026-05-18T03:12:46.732235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6061","created_at":"2026-05-18T03:12:46.732235+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4T4C6VFH2FA","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4T4C6VFH2FA64UL","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4T4C6VF","created_at":"2026-05-18T12:26:44.992195+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/X4T4C6VFH2FA64ULGW5XHXRCPF","json":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF.json","graph_json":"https://pith.science/api/pith-number/X4T4C6VFH2FA64ULGW5XHXRCPF/graph.json","events_json":"https://pith.science/api/pith-number/X4T4C6VFH2FA64ULGW5XHXRCPF/events.json","paper":"https://pith.science/paper/X4T4C6VF"},"agent_actions":{"view_html":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF","download_json":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF.json","view_paper":"https://pith.science/paper/X4T4C6VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.6061&json=true","fetch_graph":"https://pith.science/api/pith-number/X4T4C6VFH2FA64ULGW5XHXRCPF/graph.json","fetch_events":"https://pith.science/api/pith-number/X4T4C6VFH2FA64ULGW5XHXRCPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/action/storage_attestation","attest_author":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/action/author_attestation","sign_citation":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/action/citation_signature","submit_replication":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/action/replication_record"}},"created_at":"2026-05-18T03:12:46.732235+00:00","updated_at":"2026-05-18T03:12:46.732235+00:00"}