{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ESOFAY7OGPGZL2CRAQVRRKS7LK","short_pith_number":"pith:ESOFAY7O","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"},"canonical_sha256":"249c5063ee33cd95e851042b18aa5f5aab9034e588003a0e3b5c5d35235cb9fe","source":{"kind":"arxiv","id":"1904.01600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01600","created_at":"2026-05-17T23:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01600v1","created_at":"2026-05-17T23:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01600","created_at":"2026-05-17T23:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"ESOFAY7OGPGZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ESOFAY7OGPGZL2CR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ESOFAY7O","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ESOFAY7OGPGZL2CRAQVRRKS7LK","target":"record","payload":{"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"},"canonical_sha256":"249c5063ee33cd95e851042b18aa5f5aab9034e588003a0e3b5c5d35235cb9fe","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"},"source_kind":"arxiv","source_id":"1904.01600","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmpszo7ZD7QFfJmx+erNuFGJ6PwtENvirr402UL1LO7e5ITzB6B+jtyEFxVpyURSCYD3ooApbwVoXX2vD4tmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:17:51.671614Z"},"content_sha256":"042c63a9c42ea628e78f313a68e986823751ad0c3f537ea22431ad73cd2c1130","schema_version":"1.0","event_id":"sha256:042c63a9c42ea628e78f313a68e986823751ad0c3f537ea22431ad73cd2c1130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ESOFAY7OGPGZL2CRAQVRRKS7LK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJQPqoykaWBOVTOhtNQiTg9cKNtJNHDQwQpTCBZbFUbq5O4TgXrq4wxxScK4sH39pNZZVxgD350p8Z5Ed+7aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:17:51.672117Z"},"content_sha256":"470a58395c89c6181273395eead55e4c8ba2a7bc4725739de939fc19cbd78647","schema_version":"1.0","event_id":"sha256:470a58395c89c6181273395eead55e4c8ba2a7bc4725739de939fc19cbd78647"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/bundle.json","state_url":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T11:17:51Z","links":{"resolver":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK","bundle":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/bundle.json","state":"https://pith.science/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESOFAY7OGPGZL2CRAQVRRKS7LK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ESOFAY7OGPGZL2CRAQVRRKS7LK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ebc74c8c386d91c93c6a54bb2554c862af94fa1964ae5ff37dd8edd59a8b3e55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-02T18:04:36Z","title_canon_sha256":"05ace94c0c1656b884dc0c761579fb087726d7ba4adc893c2a1ec15b88319b84"},"schema_version":"1.0","source":{"id":"1904.01600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01600","created_at":"2026-05-17T23:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01600v1","created_at":"2026-05-17T23:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01600","created_at":"2026-05-17T23:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"ESOFAY7OGPGZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ESOFAY7OGPGZL2CR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ESOFAY7O","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:470a58395c89c6181273395eead55e4c8ba2a7bc4725739de939fc19cbd78647","target":"graph","created_at":"2026-05-17T23:49:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Mekkia Kouider, Renata Del-Vecchio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-02T18:04:36Z","title":"New bounds for the b-chromatic number of vertex deleted graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01600","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:042c63a9c42ea628e78f313a68e986823751ad0c3f537ea22431ad73cd2c1130","target":"record","created_at":"2026-05-17T23:49:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ebc74c8c386d91c93c6a54bb2554c862af94fa1964ae5ff37dd8edd59a8b3e55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-02T18:04:36Z","title_canon_sha256":"05ace94c0c1656b884dc0c761579fb087726d7ba4adc893c2a1ec15b88319b84"},"schema_version":"1.0","source":{"id":"1904.01600","kind":"arxiv","version":1}},"canonical_sha256":"249c5063ee33cd95e851042b18aa5f5aab9034e588003a0e3b5c5d35235cb9fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"249c5063ee33cd95e851042b18aa5f5aab9034e588003a0e3b5c5d35235cb9fe","first_computed_at":"2026-05-17T23:49:32.501904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:32.501904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCAja4qzv6tlyHgDa9gI2WmU+zDRi87ovZWHvnDaEjcS9dQobq82Y8J/9dP3YHdxUnv7NIAZU9T2WI5G780mBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:32.502471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:042c63a9c42ea628e78f313a68e986823751ad0c3f537ea22431ad73cd2c1130","sha256:470a58395c89c6181273395eead55e4c8ba2a7bc4725739de939fc19cbd78647"],"state_sha256":"a06ed7afb4860f9cb146a8f9533e4d34cebede3424807ef9fb0dee34f3555ec4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FD4ynrbui3Wme0WQxLfP5DLv5x24D6QoN54xC1f5yJADEoZ4Z8VpeJY/xxZUKhm77H1WoGd6GuzcLAzvmxSHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:17:51.674010Z","bundle_sha256":"bf5df5d836834246127055959c39dc500380a4fe4437c0bedf35ac11f083ff63"}}