{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6RITTT4UXQ3AXKKZ2ONR7FXQKS","short_pith_number":"pith:6RITTT4U","schema_version":"1.0","canonical_sha256":"f45139cf94bc360ba959d39b1f96f0549d21927a596cc3bdea53e3a2b0425c2e","source":{"kind":"arxiv","id":"1702.07914","version":3},"attestation_state":"computed","paper":{"title":"On Chordal-$k$-Generalized Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","submitted_at":"2017-02-25T16:08:26Z","abstract_excerpt":"A graph $G$ is a {\\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \\setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are exactly the split graphs.\n  We characterize chordal-$k$-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-$2$-generalized split graphs for which the Efficient Domination problem is \\NP-complete."},"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":"1702.07914","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-25T16:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"a75f7ac76454cdb0acddff09b7e7cc6dccf157f320345c83212217d8f38b274d","abstract_canon_sha256":"41fa7af0527eb3182bff4a3c618db964ea40a343075b108582cacff4d6cd11ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:29.990653Z","signature_b64":"MM9zIaIHp25XyR4WWc8G0TFQrB7pBO2FyiQZjFIRAcErUuRrKnRdy9oB82ARssdnB/GW0xtBXVQy7BSnMrDQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45139cf94bc360ba959d39b1f96f0549d21927a596cc3bdea53e3a2b0425c2e","last_reissued_at":"2026-05-18T00:45:29.990288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:29.990288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Chordal-$k$-Generalized Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","submitted_at":"2017-02-25T16:08:26Z","abstract_excerpt":"A graph $G$ is a {\\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \\setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are exactly the split graphs.\n  We characterize chordal-$k$-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-$2$-generalized split graphs for which the Efficient Domination problem is \\NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07914","kind":"arxiv","version":3},"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":"1702.07914","created_at":"2026-05-18T00:45:29.990352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07914v3","created_at":"2026-05-18T00:45:29.990352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07914","created_at":"2026-05-18T00:45:29.990352+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RITTT4UXQ3A","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RITTT4UXQ3AXKKZ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RITTT4U","created_at":"2026-05-18T12:31:03.183658+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/6RITTT4UXQ3AXKKZ2ONR7FXQKS","json":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS.json","graph_json":"https://pith.science/api/pith-number/6RITTT4UXQ3AXKKZ2ONR7FXQKS/graph.json","events_json":"https://pith.science/api/pith-number/6RITTT4UXQ3AXKKZ2ONR7FXQKS/events.json","paper":"https://pith.science/paper/6RITTT4U"},"agent_actions":{"view_html":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS","download_json":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS.json","view_paper":"https://pith.science/paper/6RITTT4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07914&json=true","fetch_graph":"https://pith.science/api/pith-number/6RITTT4UXQ3AXKKZ2ONR7FXQKS/graph.json","fetch_events":"https://pith.science/api/pith-number/6RITTT4UXQ3AXKKZ2ONR7FXQKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS/action/storage_attestation","attest_author":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS/action/author_attestation","sign_citation":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS/action/citation_signature","submit_replication":"https://pith.science/pith/6RITTT4UXQ3AXKKZ2ONR7FXQKS/action/replication_record"}},"created_at":"2026-05-18T00:45:29.990352+00:00","updated_at":"2026-05-18T00:45:29.990352+00:00"}