{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6K2HKZGYSKNKN237GJFTISWGKS","short_pith_number":"pith:6K2HKZGY","schema_version":"1.0","canonical_sha256":"f2b47564d8929aa6eb7f324b344ac654a7a5f89bd2f278b524075167110b90f5","source":{"kind":"arxiv","id":"1805.01948","version":1},"attestation_state":"computed","paper":{"title":"Coloring even-hole-free graphs with no star cutset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ngoc Khang Le","submitted_at":"2018-05-04T22:15:03Z","abstract_excerpt":"A \\emph{hole} is a chordless cycle of length at least $4$. A graph is \\emph{even-hole-free} if it does not contain any hole of even length as an induced subgraph. In this paper, we study the class of even-hole-free graphs with no star cutset. We give the optimal upper bound for its chromatic number in terms of clique number and a polynomial-time algorithm to color any graph in this class. The latter is, in fact, a direct consequence of our proof that this class has bounded rank-width."},"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":"1805.01948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-04T22:15:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1023118823cbcf15189fd2cc2afc86b808e957df807fdeb9e42b7454c07976b8","abstract_canon_sha256":"975b9efd217b025aca21f17506311b586ee1f7047dbaca203727cc7938f57ad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:59.839746Z","signature_b64":"ZZWfgRlcMTGGsMEysYKQnvEAVrLtfTvC6IpRVRHUVcY35tVqYobTBgz1uoIH5oEJjf+9ibO11OBQkjsuAgXnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2b47564d8929aa6eb7f324b344ac654a7a5f89bd2f278b524075167110b90f5","last_reissued_at":"2026-05-18T00:13:59.839036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:59.839036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring even-hole-free graphs with no star cutset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ngoc Khang Le","submitted_at":"2018-05-04T22:15:03Z","abstract_excerpt":"A \\emph{hole} is a chordless cycle of length at least $4$. A graph is \\emph{even-hole-free} if it does not contain any hole of even length as an induced subgraph. In this paper, we study the class of even-hole-free graphs with no star cutset. We give the optimal upper bound for its chromatic number in terms of clique number and a polynomial-time algorithm to color any graph in this class. The latter is, in fact, a direct consequence of our proof that this class has bounded rank-width."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01948","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":"1805.01948","created_at":"2026-05-18T00:13:59.839132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01948v1","created_at":"2026-05-18T00:13:59.839132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01948","created_at":"2026-05-18T00:13:59.839132+00:00"},{"alias_kind":"pith_short_12","alias_value":"6K2HKZGYSKNK","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6K2HKZGYSKNKN237","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6K2HKZGY","created_at":"2026-05-18T12:32:08.215937+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/6K2HKZGYSKNKN237GJFTISWGKS","json":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS.json","graph_json":"https://pith.science/api/pith-number/6K2HKZGYSKNKN237GJFTISWGKS/graph.json","events_json":"https://pith.science/api/pith-number/6K2HKZGYSKNKN237GJFTISWGKS/events.json","paper":"https://pith.science/paper/6K2HKZGY"},"agent_actions":{"view_html":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS","download_json":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS.json","view_paper":"https://pith.science/paper/6K2HKZGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01948&json=true","fetch_graph":"https://pith.science/api/pith-number/6K2HKZGYSKNKN237GJFTISWGKS/graph.json","fetch_events":"https://pith.science/api/pith-number/6K2HKZGYSKNKN237GJFTISWGKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS/action/storage_attestation","attest_author":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS/action/author_attestation","sign_citation":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS/action/citation_signature","submit_replication":"https://pith.science/pith/6K2HKZGYSKNKN237GJFTISWGKS/action/replication_record"}},"created_at":"2026-05-18T00:13:59.839132+00:00","updated_at":"2026-05-18T00:13:59.839132+00:00"}