{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LO6ZAIV4WM7VFTNNZHBMF4WAYM","short_pith_number":"pith:LO6ZAIV4","schema_version":"1.0","canonical_sha256":"5bbd9022bcb33f52cdadc9c2c2f2c0c31152bf820804a476686fb885280bd630","source":{"kind":"arxiv","id":"1302.4214","version":1},"attestation_state":"computed","paper":{"title":"The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Miadoun Mortada","submitted_at":"2013-02-18T10:25:28Z","abstract_excerpt":"The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the largest positive integer $k$ such that there exists a proper coloring for G with $k$ colors in which every color class contains at least one vertex adjacent to some vertex in each of the other color classes, such a vertex is called a dominant vertex. The $f$-chromatic vertex number of a $d$-regular graph $G$, denoted by $f(G)$, is the maximum number of dominant vertices of distinct colors in a proper coloring with $d+1$ colors. El Sahili and Kouider conjectured that $b(G)=d+1$ for any $d$-regular graph $G$ of girth 5. We study "},"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.4214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T10:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"ec84dcaeed2e0855e2d1d00f8eb660ddd02a52e8e5d9052d71d4c33c36306356","abstract_canon_sha256":"90ba9ce5cabd0c8537ef3eaae12b3fa3e00f54405778cb3578342a5b25260e09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.701613Z","signature_b64":"gOV3lTOKOx+zV8ApSHFTNf0Q6VWUD4DZUQR0N1cGaUe1LdBs1wXoodZU3MzJJh2UbFZEymSavIeYE29nA+J4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bbd9022bcb33f52cdadc9c2c2f2c0c31152bf820804a476686fb885280bd630","last_reissued_at":"2026-05-18T03:33:23.700869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.700869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Miadoun Mortada","submitted_at":"2013-02-18T10:25:28Z","abstract_excerpt":"The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the largest positive integer $k$ such that there exists a proper coloring for G with $k$ colors in which every color class contains at least one vertex adjacent to some vertex in each of the other color classes, such a vertex is called a dominant vertex. The $f$-chromatic vertex number of a $d$-regular graph $G$, denoted by $f(G)$, is the maximum number of dominant vertices of distinct colors in a proper coloring with $d+1$ colors. El Sahili and Kouider conjectured that $b(G)=d+1$ for any $d$-regular graph $G$ of girth 5. We study "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4214","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.4214","created_at":"2026-05-18T03:33:23.700996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4214v1","created_at":"2026-05-18T03:33:23.700996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4214","created_at":"2026-05-18T03:33:23.700996+00:00"},{"alias_kind":"pith_short_12","alias_value":"LO6ZAIV4WM7V","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LO6ZAIV4WM7VFTNN","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LO6ZAIV4","created_at":"2026-05-18T12:27:51.066281+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/LO6ZAIV4WM7VFTNNZHBMF4WAYM","json":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM.json","graph_json":"https://pith.science/api/pith-number/LO6ZAIV4WM7VFTNNZHBMF4WAYM/graph.json","events_json":"https://pith.science/api/pith-number/LO6ZAIV4WM7VFTNNZHBMF4WAYM/events.json","paper":"https://pith.science/paper/LO6ZAIV4"},"agent_actions":{"view_html":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM","download_json":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM.json","view_paper":"https://pith.science/paper/LO6ZAIV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4214&json=true","fetch_graph":"https://pith.science/api/pith-number/LO6ZAIV4WM7VFTNNZHBMF4WAYM/graph.json","fetch_events":"https://pith.science/api/pith-number/LO6ZAIV4WM7VFTNNZHBMF4WAYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/action/storage_attestation","attest_author":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/action/author_attestation","sign_citation":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/action/citation_signature","submit_replication":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/action/replication_record"}},"created_at":"2026-05-18T03:33:23.700996+00:00","updated_at":"2026-05-18T03:33:23.700996+00:00"}