{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y7AN3HPAKXZLZXAJ3C4RUROBIX","short_pith_number":"pith:Y7AN3HPA","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"},"canonical_sha256":"c7c0dd9de055f2bcdc09d8b91a45c145f5849e308a10d92ab6e4f67e7be9bb35","source":{"kind":"arxiv","id":"1103.4341","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4341","created_at":"2026-05-18T04:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4341v1","created_at":"2026-05-18T04:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4341","created_at":"2026-05-18T04:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"Y7AN3HPAKXZL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y7AN3HPAKXZLZXAJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y7AN3HPA","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y7AN3HPAKXZLZXAJ3C4RUROBIX","target":"record","payload":{"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"},"canonical_sha256":"c7c0dd9de055f2bcdc09d8b91a45c145f5849e308a10d92ab6e4f67e7be9bb35","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"},"source_kind":"arxiv","source_id":"1103.4341","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-18T04:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnV83lKEHscVR1Zq02f01r4SrAns7B5D6ZqXULSRIDwspkgalVeQFKhaYbtgcYPENEqKmxnYnTDdl+00LU1yBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:27:18.468904Z"},"content_sha256":"ab94307030a0a61b427c682f1258c34ad66bacf23c0df923ddb93a105c208b13","schema_version":"1.0","event_id":"sha256:ab94307030a0a61b427c682f1258c34ad66bacf23c0df923ddb93a105c208b13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y7AN3HPAKXZLZXAJ3C4RUROBIX","target":"graph","payload":{"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"},"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-18T04:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WW5cAFShJkbudzfLbuc5c8RXT9YymFnQDCJ2pxvCd2os8XrpAmZU8knvKV5H5+qklOkE4yy8FyfD+b1VDp6SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:27:18.469246Z"},"content_sha256":"e034055f7ae2b1a0303c1237e8d3ffbd990642b73d85c6604dfe963342ad004a","schema_version":"1.0","event_id":"sha256:e034055f7ae2b1a0303c1237e8d3ffbd990642b73d85c6604dfe963342ad004a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/bundle.json","state_url":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/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-07-04T04:27:18Z","links":{"resolver":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX","bundle":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/bundle.json","state":"https://pith.science/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y7AN3HPAKXZLZXAJ3C4RUROBIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y7AN3HPAKXZLZXAJ3C4RUROBIX","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":"69518610d1f4581defd483e448aaedcf4a6b1d8943d6572903a3ee5a0ffd4da8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-22T18:30:14Z","title_canon_sha256":"4c26feb39c75c227e8b3343408ecb1e9dcebfd0f943600724e6c046faf420a50"},"schema_version":"1.0","source":{"id":"1103.4341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4341","created_at":"2026-05-18T04:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4341v1","created_at":"2026-05-18T04:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4341","created_at":"2026-05-18T04:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"Y7AN3HPAKXZL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y7AN3HPAKXZLZXAJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y7AN3HPA","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:e034055f7ae2b1a0303c1237e8d3ffbd990642b73d85c6604dfe963342ad004a","target":"graph","created_at":"2026-05-18T04:26:12Z","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 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.","authors_text":"Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-22T18:30:14Z","title":"Holes and a chordal cut in a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4341","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:ab94307030a0a61b427c682f1258c34ad66bacf23c0df923ddb93a105c208b13","target":"record","created_at":"2026-05-18T04:26:12Z","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":"69518610d1f4581defd483e448aaedcf4a6b1d8943d6572903a3ee5a0ffd4da8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-22T18:30:14Z","title_canon_sha256":"4c26feb39c75c227e8b3343408ecb1e9dcebfd0f943600724e6c046faf420a50"},"schema_version":"1.0","source":{"id":"1103.4341","kind":"arxiv","version":1}},"canonical_sha256":"c7c0dd9de055f2bcdc09d8b91a45c145f5849e308a10d92ab6e4f67e7be9bb35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7c0dd9de055f2bcdc09d8b91a45c145f5849e308a10d92ab6e4f67e7be9bb35","first_computed_at":"2026-05-18T04:26:12.516584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:12.516584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IOBl0lyU5FiN3pfJ7XIbjy0+nsGNltD2LU+4nw8sB7HKy0r91aJn/RlqlaHDrGUMSADTkBLthGVYS8aJsx3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:12.517279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab94307030a0a61b427c682f1258c34ad66bacf23c0df923ddb93a105c208b13","sha256:e034055f7ae2b1a0303c1237e8d3ffbd990642b73d85c6604dfe963342ad004a"],"state_sha256":"143f0f83945835142456cae13fa3eb2fe9cad907bb17fa476a7bf1f69d22b1ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYwVUrPXIeCU8jgtjUtJIgwWBnB6IcH4CciU2uThtpa2uSzOzT4VyangsZzSemoul1v31fmfh2nOZIfflBA5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T04:27:18.471224Z","bundle_sha256":"05eb1c5ff9548575c74ab73268ba8b735944c4b7232827bf7cd0dd02cadd118a"}}