{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ESOFAY7OGPGZL2CRAQVRRKS7LK","short_pith_number":"pith:ESOFAY7O","schema_version":"1.0","canonical_sha256":"249c5063ee33cd95e851042b18aa5f5aab9034e588003a0e3b5c5d35235cb9fe","source":{"kind":"arxiv","id":"1904.01600","version":1},"attestation_state":"computed","paper":{"title":"New bounds for the b-chromatic number of vertex deleted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mekkia Kouider, Renata Del-Vecchio","submitted_at":"2019-04-02T18:04:36Z","abstract_excerpt":"A b-coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex adjacent to at least one vertex of every other color class. The b-chromatic number of a graph is the largest integer k such that the graph has a b-coloring with k colors. In this work we present lower bounds for the b-chromatic number of a vertex-deleted subgraph of a graph, particularly regarding two important classes, quasi-line and chordal graphs. We also get bounds for the b-chromatic number of G -{x}, when G is a graph with large girth."},"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":"1904.01600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-02T18:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"05ace94c0c1656b884dc0c761579fb087726d7ba4adc893c2a1ec15b88319b84","abstract_canon_sha256":"ebc74c8c386d91c93c6a54bb2554c862af94fa1964ae5ff37dd8edd59a8b3e55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:32.502471Z","signature_b64":"VCAja4qzv6tlyHgDa9gI2WmU+zDRi87ovZWHvnDaEjcS9dQobq82Y8J/9dP3YHdxUnv7NIAZU9T2WI5G780mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249c5063ee33cd95e851042b18aa5f5aab9034e588003a0e3b5c5d35235cb9fe","last_reissued_at":"2026-05-17T23:49:32.501904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:32.501904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for the b-chromatic number of vertex deleted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mekkia Kouider, Renata Del-Vecchio","submitted_at":"2019-04-02T18:04:36Z","abstract_excerpt":"A b-coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex adjacent to at least one vertex of every other color class. The b-chromatic number of a graph is the largest integer k such that the graph has a b-coloring with k colors. In this work we present lower bounds for the b-chromatic number of a vertex-deleted subgraph of a graph, particularly regarding two important classes, quasi-line and chordal graphs. We also get bounds for the b-chromatic number of G -{x}, when G is a graph with large girth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01600","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":"1904.01600","created_at":"2026-05-17T23:49:32.501982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01600v1","created_at":"2026-05-17T23:49:32.501982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01600","created_at":"2026-05-17T23:49:32.501982+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESOFAY7OGPGZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESOFAY7OGPGZL2CR","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESOFAY7O","created_at":"2026-05-18T12:33:15.570797+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/ESOFAY7OGPGZL2CRAQVRRKS7LK","json":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK.json","graph_json":"https://pith.science/api/pith-number/ESOFAY7OGPGZL2CRAQVRRKS7LK/graph.json","events_json":"https://pith.science/api/pith-number/ESOFAY7OGPGZL2CRAQVRRKS7LK/events.json","paper":"https://pith.science/paper/ESOFAY7O"},"agent_actions":{"view_html":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK","download_json":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK.json","view_paper":"https://pith.science/paper/ESOFAY7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01600&json=true","fetch_graph":"https://pith.science/api/pith-number/ESOFAY7OGPGZL2CRAQVRRKS7LK/graph.json","fetch_events":"https://pith.science/api/pith-number/ESOFAY7OGPGZL2CRAQVRRKS7LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/action/storage_attestation","attest_author":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/action/author_attestation","sign_citation":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/action/citation_signature","submit_replication":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/action/replication_record"}},"created_at":"2026-05-17T23:49:32.501982+00:00","updated_at":"2026-05-17T23:49:32.501982+00:00"}