{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YA3L7LOJPANPRHOVDHKBJHHV5B","short_pith_number":"pith:YA3L7LOJ","schema_version":"1.0","canonical_sha256":"c036bfadc9781af89dd519d4149cf5e860a46b4946ce3a03413a86335a8e10e0","source":{"kind":"arxiv","id":"1302.4209","version":1},"attestation_state":"computed","paper":{"title":"On The b-Chromatic Number of Regular Bounded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amine El Sahili, Maidoun Mortada, Mekkia Kouider","submitted_at":"2013-02-18T10:17:29Z","abstract_excerpt":"A $b$-coloring of a graph is a proper coloring such that every color class contains a vertex adjacent to at least one vertex in each of the other color classes. The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the maximum integer $k$ such that $G$ admits a $b$-coloring with $k$ colors. El Sahili and Kouider conjectured that $b(G)=d+1$ for $d$-regular graph with girth 5, $d\\geq4$. In this paper, we prove that this conjecture holds for $d$-regular graph with at least $d^3+d$ vertices. More precisely we show that $b(G)=d+$1 for $d$-regular graph with at least $d^3+d$ vertices and co"},"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":"1302.4209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T10:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"7f18a4657971f4ccd734a7976293f9ae48a425b4733203a6377bf39f516666af","abstract_canon_sha256":"40d8146f033e41aa0348f4487128e15d1a7d1b42c0956bb30d9e7c02d85c8550"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.727765Z","signature_b64":"A5wNiBnAPAYN1KlL/jO16TpD8jOi7AHP7F1lVoH3TSlIqYkm3IlGuDr+oU8VZa4oe4AcRbBnVSB3D1ImFS3CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c036bfadc9781af89dd519d4149cf5e860a46b4946ce3a03413a86335a8e10e0","last_reissued_at":"2026-05-18T03:33:23.727035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.727035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The b-Chromatic Number of Regular Bounded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amine El Sahili, Maidoun Mortada, Mekkia Kouider","submitted_at":"2013-02-18T10:17:29Z","abstract_excerpt":"A $b$-coloring of a graph is a proper coloring such that every color class contains a vertex adjacent to at least one vertex in each of the other color classes. The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the maximum integer $k$ such that $G$ admits a $b$-coloring with $k$ colors. El Sahili and Kouider conjectured that $b(G)=d+1$ for $d$-regular graph with girth 5, $d\\geq4$. In this paper, we prove that this conjecture holds for $d$-regular graph with at least $d^3+d$ vertices. More precisely we show that $b(G)=d+$1 for $d$-regular graph with at least $d^3+d$ vertices and co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4209","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":"1302.4209","created_at":"2026-05-18T03:33:23.727150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4209v1","created_at":"2026-05-18T03:33:23.727150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4209","created_at":"2026-05-18T03:33:23.727150+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA3L7LOJPANP","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA3L7LOJPANPRHOV","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA3L7LOJ","created_at":"2026-05-18T12:28:06.772260+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/YA3L7LOJPANPRHOVDHKBJHHV5B","json":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B.json","graph_json":"https://pith.science/api/pith-number/YA3L7LOJPANPRHOVDHKBJHHV5B/graph.json","events_json":"https://pith.science/api/pith-number/YA3L7LOJPANPRHOVDHKBJHHV5B/events.json","paper":"https://pith.science/paper/YA3L7LOJ"},"agent_actions":{"view_html":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B","download_json":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B.json","view_paper":"https://pith.science/paper/YA3L7LOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4209&json=true","fetch_graph":"https://pith.science/api/pith-number/YA3L7LOJPANPRHOVDHKBJHHV5B/graph.json","fetch_events":"https://pith.science/api/pith-number/YA3L7LOJPANPRHOVDHKBJHHV5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B/action/storage_attestation","attest_author":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B/action/author_attestation","sign_citation":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B/action/citation_signature","submit_replication":"https://pith.science/pith/YA3L7LOJPANPRHOVDHKBJHHV5B/action/replication_record"}},"created_at":"2026-05-18T03:33:23.727150+00:00","updated_at":"2026-05-18T03:33:23.727150+00:00"}