{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VB77KDC6NJZJASWJHIHQALBLZL","short_pith_number":"pith:VB77KDC6","schema_version":"1.0","canonical_sha256":"a87ff50c5e6a72904ac93a0f002c2bcac1bde10ad81abf162bbf96fdf6da9e1c","source":{"kind":"arxiv","id":"1812.01279","version":1},"attestation_state":"computed","paper":{"title":"Characterization of forbidden subgraphs for bounded star chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Ilkyoo Choi, Ringi Kim","submitted_at":"2018-12-04T08:49:38Z","abstract_excerpt":"The chromatic number of a graph is the minimum $k$ such that the graph has a proper $k$-coloring. There are many coloring parameters in the literature that are proper colorings that also forbid bicolored subgraphs. Some examples are $2$-distance coloring, acyclic coloring, and star coloring, which forbid a bicolored path on three vertices, bicolored cycles, and a bicolored path on four vertices, respectively. This notion was first suggested by Gr\\\"unbaum in 1973, but no specific name was given. We revive this notion by defining an $H$-avoiding $k$-coloring to be a proper $k$-coloring that forb"},"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":"1812.01279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T08:49:38Z","cross_cats_sorted":[],"title_canon_sha256":"2b153253c5e922b40c1577e2ef90e0f0b8c7ad98f5b50df80bc59a320b9561ba","abstract_canon_sha256":"c53e071449fb326ccd13248473b17d97c1bd3b5e5a7c15f574e33ba7cf2a4b04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:12.894525Z","signature_b64":"qtnwS2teqxYv8htK46l2Y2vZsdiULRBzgA3R+jkXIr63zpekzbnMKkeuelnRVGaavQQmuy63hQbYpwJ5s79rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a87ff50c5e6a72904ac93a0f002c2bcac1bde10ad81abf162bbf96fdf6da9e1c","last_reissued_at":"2026-05-17T23:59:12.894064Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.894064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization of forbidden subgraphs for bounded star chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Ilkyoo Choi, Ringi Kim","submitted_at":"2018-12-04T08:49:38Z","abstract_excerpt":"The chromatic number of a graph is the minimum $k$ such that the graph has a proper $k$-coloring. There are many coloring parameters in the literature that are proper colorings that also forbid bicolored subgraphs. Some examples are $2$-distance coloring, acyclic coloring, and star coloring, which forbid a bicolored path on three vertices, bicolored cycles, and a bicolored path on four vertices, respectively. This notion was first suggested by Gr\\\"unbaum in 1973, but no specific name was given. We revive this notion by defining an $H$-avoiding $k$-coloring to be a proper $k$-coloring that forb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01279","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":"1812.01279","created_at":"2026-05-17T23:59:12.894129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01279v1","created_at":"2026-05-17T23:59:12.894129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01279","created_at":"2026-05-17T23:59:12.894129+00:00"},{"alias_kind":"pith_short_12","alias_value":"VB77KDC6NJZJ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VB77KDC6NJZJASWJ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VB77KDC6","created_at":"2026-05-18T12:32:59.047623+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/VB77KDC6NJZJASWJHIHQALBLZL","json":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL.json","graph_json":"https://pith.science/api/pith-number/VB77KDC6NJZJASWJHIHQALBLZL/graph.json","events_json":"https://pith.science/api/pith-number/VB77KDC6NJZJASWJHIHQALBLZL/events.json","paper":"https://pith.science/paper/VB77KDC6"},"agent_actions":{"view_html":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL","download_json":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL.json","view_paper":"https://pith.science/paper/VB77KDC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01279&json=true","fetch_graph":"https://pith.science/api/pith-number/VB77KDC6NJZJASWJHIHQALBLZL/graph.json","fetch_events":"https://pith.science/api/pith-number/VB77KDC6NJZJASWJHIHQALBLZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL/action/storage_attestation","attest_author":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL/action/author_attestation","sign_citation":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL/action/citation_signature","submit_replication":"https://pith.science/pith/VB77KDC6NJZJASWJHIHQALBLZL/action/replication_record"}},"created_at":"2026-05-17T23:59:12.894129+00:00","updated_at":"2026-05-17T23:59:12.894129+00:00"}