{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X4T4C6VFH2FA64ULGW5XHXRCPF","short_pith_number":"pith:X4T4C6VF","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"},"canonical_sha256":"bf27c17aa53e8a0f728b35bb73de227962fc67eac861e7918f79009804e23e73","source":{"kind":"arxiv","id":"1106.6061","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.6061","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1106.6061v2","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6061","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"X4T4C6VFH2FA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X4T4C6VFH2FA64UL","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X4T4C6VF","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X4T4C6VFH2FA64ULGW5XHXRCPF","target":"record","payload":{"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"},"canonical_sha256":"bf27c17aa53e8a0f728b35bb73de227962fc67eac861e7918f79009804e23e73","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"},"source_kind":"arxiv","source_id":"1106.6061","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-05-18T03:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yx03qxkVoSUrNqAIMjL6jBxuXLykIK7auXiQK/sUEuy4KfqvkGUEfqLmVWFi1QKRfBF+Vwy+lFJyj6CTDqLuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:47:33.722758Z"},"content_sha256":"823e69c653f8faa604e2f1b31126e1b60117547d7bd9182bfff04a50ef6dbe95","schema_version":"1.0","event_id":"sha256:823e69c653f8faa604e2f1b31126e1b60117547d7bd9182bfff04a50ef6dbe95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X4T4C6VFH2FA64ULGW5XHXRCPF","target":"graph","payload":{"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"},"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-18T03:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reA0cLH02XptUm5m59or+y6XV4H2/Cg+B9gw2JjqY7ugAAlsNV5n4yvWz0qSZkoJehacIgqDLeqWjCVybdrKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:47:33.723477Z"},"content_sha256":"bc33113b0beca7bc2fc4f8dd6d1657ad8f27568b9a75a748e20a8c3abb43d6a3","schema_version":"1.0","event_id":"sha256:bc33113b0beca7bc2fc4f8dd6d1657ad8f27568b9a75a748e20a8c3abb43d6a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/bundle.json","state_url":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/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-07T01:47:33Z","links":{"resolver":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF","bundle":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/bundle.json","state":"https://pith.science/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4T4C6VFH2FA64ULGW5XHXRCPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X4T4C6VFH2FA64ULGW5XHXRCPF","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":"98be4c0f49aa84c705e547cece301d49e7231cd1496c646dd3a56c0d18880b0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-29T20:37:24Z","title_canon_sha256":"057cf65bd5f3033ca805e8ae5c0bf073d2f56828b8abba5b3c46182a5bea9d93"},"schema_version":"1.0","source":{"id":"1106.6061","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.6061","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1106.6061v2","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6061","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"X4T4C6VFH2FA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X4T4C6VFH2FA64UL","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X4T4C6VF","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:bc33113b0beca7bc2fc4f8dd6d1657ad8f27568b9a75a748e20a8c3abb43d6a3","target":"graph","created_at":"2026-05-18T03:12:46Z","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":"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","authors_text":"Elaine M. Eschen, Xiaoqiang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-29T20:37:24Z","title":"Algorithms for Unipolar and Generalized Split Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6061","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:823e69c653f8faa604e2f1b31126e1b60117547d7bd9182bfff04a50ef6dbe95","target":"record","created_at":"2026-05-18T03:12:46Z","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":"98be4c0f49aa84c705e547cece301d49e7231cd1496c646dd3a56c0d18880b0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-29T20:37:24Z","title_canon_sha256":"057cf65bd5f3033ca805e8ae5c0bf073d2f56828b8abba5b3c46182a5bea9d93"},"schema_version":"1.0","source":{"id":"1106.6061","kind":"arxiv","version":2}},"canonical_sha256":"bf27c17aa53e8a0f728b35bb73de227962fc67eac861e7918f79009804e23e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf27c17aa53e8a0f728b35bb73de227962fc67eac861e7918f79009804e23e73","first_computed_at":"2026-05-18T03:12:46.732115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:46.732115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IncSTOeydcsZwl8SGNJj/UFh/glut2Vmt3saUe+8UFs9xjdRBb/CtolQVn5Yrobe4iqaucfzbYC8cLBkWVICg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:46.732855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.6061","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:823e69c653f8faa604e2f1b31126e1b60117547d7bd9182bfff04a50ef6dbe95","sha256:bc33113b0beca7bc2fc4f8dd6d1657ad8f27568b9a75a748e20a8c3abb43d6a3"],"state_sha256":"cd7c7c533651a9a2176c1b8aa79bdfd441f1292c493a3874b19e921ae8592704"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FM+mgyHls1sPc7wBs0v0BD556udd5/NLOlwkOIzSWdd/GPYnxdqHNoWpJnVVLMtmgaaC2129P22Sy9IuKhyzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:47:33.727706Z","bundle_sha256":"a453ae9a710da4ee51fe418923b2ed9390d169b756d714d071a7f5a696086f1b"}}