{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:EYMMNXOGEHEQQU463WFO4LIG4O","short_pith_number":"pith:EYMMNXOG","schema_version":"1.0","canonical_sha256":"2618c6ddc621c908539edd8aee2d06e3a4442966ede00abcd7cc7dc0bf356252","source":{"kind":"arxiv","id":"0911.4199","version":5},"attestation_state":"computed","paper":{"title":"Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi","submitted_at":"2009-11-21T20:09:24Z","abstract_excerpt":"A 2-hued coloring of a graph $G$ (also known as conditional $(k, 2)$-coloring and dynamic coloring) is a coloring such that for every vertex $v\\in V(G)$ of degree at least $2$, the neighbors of $v$ receive at least $2$ colors. The smallest integer $k$ such that $G$ has a 2-hued coloring with $ k $ colors, is called the {\\it 2-hued chromatic number} of $G$ and denoted by $\\chi_2(G)$. In this paper, we will show that if $G$ is a regular graph, then $ \\chi_{2}(G)- \\chi(G) \\leq 2 \\log _{2}(\\alpha(G)) +\\mathcal{O}(1) $ and if $G$ is a graph and $\\delta(G)\\geq 2$, then $ \\chi_{2}(G)- \\chi(G) \\leq 1+"},"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":"0911.4199","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T20:09:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bfadfbb036a33c986e7d99f1cdaa5200c1b766ff51c0789cc9de30d41390f1e5","abstract_canon_sha256":"6001f59729ed1dc3a3023c4ff1ba499a9330e90dcc13cfcb7a9763bd25e799b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:30.812071Z","signature_b64":"su+c4zXHUFiMAisFFfZfYZUlJ5GbkOzKYlEP12h8EbghTPc3H6G6t1lpx/xVUSrYPmxiGysE7wUOTI835cLMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2618c6ddc621c908539edd8aee2d06e3a4442966ede00abcd7cc7dc0bf356252","last_reissued_at":"2026-05-18T00:51:30.811561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:30.811561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ali Dehghan, Arash Ahadi","submitted_at":"2009-11-21T20:09:24Z","abstract_excerpt":"A 2-hued coloring of a graph $G$ (also known as conditional $(k, 2)$-coloring and dynamic coloring) is a coloring such that for every vertex $v\\in V(G)$ of degree at least $2$, the neighbors of $v$ receive at least $2$ colors. The smallest integer $k$ such that $G$ has a 2-hued coloring with $ k $ colors, is called the {\\it 2-hued chromatic number} of $G$ and denoted by $\\chi_2(G)$. In this paper, we will show that if $G$ is a regular graph, then $ \\chi_{2}(G)- \\chi(G) \\leq 2 \\log _{2}(\\alpha(G)) +\\mathcal{O}(1) $ and if $G$ is a graph and $\\delta(G)\\geq 2$, then $ \\chi_{2}(G)- \\chi(G) \\leq 1+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4199","kind":"arxiv","version":5},"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":"0911.4199","created_at":"2026-05-18T00:51:30.811643+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4199v5","created_at":"2026-05-18T00:51:30.811643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4199","created_at":"2026-05-18T00:51:30.811643+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYMMNXOGEHEQ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYMMNXOGEHEQQU46","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYMMNXOG","created_at":"2026-05-18T12:25:59.703012+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/EYMMNXOGEHEQQU463WFO4LIG4O","json":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O.json","graph_json":"https://pith.science/api/pith-number/EYMMNXOGEHEQQU463WFO4LIG4O/graph.json","events_json":"https://pith.science/api/pith-number/EYMMNXOGEHEQQU463WFO4LIG4O/events.json","paper":"https://pith.science/paper/EYMMNXOG"},"agent_actions":{"view_html":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O","download_json":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O.json","view_paper":"https://pith.science/paper/EYMMNXOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4199&json=true","fetch_graph":"https://pith.science/api/pith-number/EYMMNXOGEHEQQU463WFO4LIG4O/graph.json","fetch_events":"https://pith.science/api/pith-number/EYMMNXOGEHEQQU463WFO4LIG4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O/action/storage_attestation","attest_author":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O/action/author_attestation","sign_citation":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O/action/citation_signature","submit_replication":"https://pith.science/pith/EYMMNXOGEHEQQU463WFO4LIG4O/action/replication_record"}},"created_at":"2026-05-18T00:51:30.811643+00:00","updated_at":"2026-05-18T00:51:30.811643+00:00"}