{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Y7AN3HPAKXZLZXAJ3C4RUROBIX","short_pith_number":"pith:Y7AN3HPA","schema_version":"1.0","canonical_sha256":"c7c0dd9de055f2bcdc09d8b91a45c145f5849e308a10d92ab6e4f67e7be9bb35","source":{"kind":"arxiv","id":"1103.4341","version":1},"attestation_state":"computed","paper":{"title":"Holes and a chordal cut in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2011-03-22T18:30:14Z","abstract_excerpt":"A set $X$ of vertices of a graph $G$ is called a {\\em clique cut} of $G$ if the subgraph of $G$ induced by $X$ is a complete graph and the number of connected components of $G-X$ is greater than that of $G$. A clique cut $X$ of $G$ is called a {\\em chordal cut} of $G$ if there exists a union $U$ of connected components of $G-X$ such that $G[U \\cup X]$ is a chordal graph.\n  In this paper, we consider the following problem: Given a graph $G$, does the graph have a chordal cut? We show that $K_{2,2,2}$-free hole-edge-disjoint graphs have chordal cuts if they satisfy a certain condition."},"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":"1103.4341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-22T18:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"4c26feb39c75c227e8b3343408ecb1e9dcebfd0f943600724e6c046faf420a50","abstract_canon_sha256":"69518610d1f4581defd483e448aaedcf4a6b1d8943d6572903a3ee5a0ffd4da8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:12.517279Z","signature_b64":"2IOBl0lyU5FiN3pfJ7XIbjy0+nsGNltD2LU+4nw8sB7HKy0r91aJn/RlqlaHDrGUMSADTkBLthGVYS8aJsx3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7c0dd9de055f2bcdc09d8b91a45c145f5849e308a10d92ab6e4f67e7be9bb35","last_reissued_at":"2026-05-18T04:26:12.516584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:12.516584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Holes and a chordal cut in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2011-03-22T18:30:14Z","abstract_excerpt":"A set $X$ of vertices of a graph $G$ is called a {\\em clique cut} of $G$ if the subgraph of $G$ induced by $X$ is a complete graph and the number of connected components of $G-X$ is greater than that of $G$. A clique cut $X$ of $G$ is called a {\\em chordal cut} of $G$ if there exists a union $U$ of connected components of $G-X$ such that $G[U \\cup X]$ is a chordal graph.\n  In this paper, we consider the following problem: Given a graph $G$, does the graph have a chordal cut? We show that $K_{2,2,2}$-free hole-edge-disjoint graphs have chordal cuts if they satisfy a certain condition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4341","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":"1103.4341","created_at":"2026-05-18T04:26:12.516699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4341v1","created_at":"2026-05-18T04:26:12.516699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4341","created_at":"2026-05-18T04:26:12.516699+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7AN3HPAKXZL","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7AN3HPAKXZLZXAJ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7AN3HPA","created_at":"2026-05-18T12:26:47.523578+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/Y7AN3HPAKXZLZXAJ3C4RUROBIX","json":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX.json","graph_json":"https://pith.science/api/pith-number/Y7AN3HPAKXZLZXAJ3C4RUROBIX/graph.json","events_json":"https://pith.science/api/pith-number/Y7AN3HPAKXZLZXAJ3C4RUROBIX/events.json","paper":"https://pith.science/paper/Y7AN3HPA"},"agent_actions":{"view_html":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX","download_json":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX.json","view_paper":"https://pith.science/paper/Y7AN3HPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4341&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7AN3HPAKXZLZXAJ3C4RUROBIX/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7AN3HPAKXZLZXAJ3C4RUROBIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/action/storage_attestation","attest_author":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/action/author_attestation","sign_citation":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/action/citation_signature","submit_replication":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/action/replication_record"}},"created_at":"2026-05-18T04:26:12.516699+00:00","updated_at":"2026-05-18T04:26:12.516699+00:00"}