{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LO6ZAIV4WM7VFTNNZHBMF4WAYM","short_pith_number":"pith:LO6ZAIV4","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"},"canonical_sha256":"5bbd9022bcb33f52cdadc9c2c2f2c0c31152bf820804a476686fb885280bd630","source":{"kind":"arxiv","id":"1302.4214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4214","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4214v1","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4214","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"LO6ZAIV4WM7V","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LO6ZAIV4WM7VFTNN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LO6ZAIV4","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LO6ZAIV4WM7VFTNNZHBMF4WAYM","target":"record","payload":{"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"},"canonical_sha256":"5bbd9022bcb33f52cdadc9c2c2f2c0c31152bf820804a476686fb885280bd630","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"},"source_kind":"arxiv","source_id":"1302.4214","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-18T03:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RM5v/pBBx1SvAdUNucIUe1/zEYhXTucacUGt3j3TaTwt3VqqWwnMQq1LI1qgq2/wj2Y6R688yQD0lpdbr7W2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:47.761460Z"},"content_sha256":"515f58c501dcdb3f41c3f01650c66436c0c468ec305fa885f86f30aabb31dea4","schema_version":"1.0","event_id":"sha256:515f58c501dcdb3f41c3f01650c66436c0c468ec305fa885f86f30aabb31dea4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LO6ZAIV4WM7VFTNNZHBMF4WAYM","target":"graph","payload":{"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"},"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-18T03:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WSWdDuQcyr0LtLKmyPrzvNQ/NSJeX5oX979bxe7ztCB7TtfLiFdvoocFNLM4Tl7sNkzvjBzz77Zq5q/IbHTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:47.761794Z"},"content_sha256":"54de9b4ffa06715721c3f4ff975231c29c6f818675066cad7c12837d113132d6","schema_version":"1.0","event_id":"sha256:54de9b4ffa06715721c3f4ff975231c29c6f818675066cad7c12837d113132d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/bundle.json","state_url":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/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-08T22:33:47Z","links":{"resolver":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM","bundle":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/bundle.json","state":"https://pith.science/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LO6ZAIV4WM7VFTNNZHBMF4WAYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LO6ZAIV4WM7VFTNNZHBMF4WAYM","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":"90ba9ce5cabd0c8537ef3eaae12b3fa3e00f54405778cb3578342a5b25260e09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T10:25:28Z","title_canon_sha256":"ec84dcaeed2e0855e2d1d00f8eb660ddd02a52e8e5d9052d71d4c33c36306356"},"schema_version":"1.0","source":{"id":"1302.4214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4214","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4214v1","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4214","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"LO6ZAIV4WM7V","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LO6ZAIV4WM7VFTNN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LO6ZAIV4","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:54de9b4ffa06715721c3f4ff975231c29c6f818675066cad7c12837d113132d6","target":"graph","created_at":"2026-05-18T03:33:23Z","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":"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 ","authors_text":"Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Miadoun Mortada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T10:25:28Z","title":"The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4214","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:515f58c501dcdb3f41c3f01650c66436c0c468ec305fa885f86f30aabb31dea4","target":"record","created_at":"2026-05-18T03:33:23Z","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":"90ba9ce5cabd0c8537ef3eaae12b3fa3e00f54405778cb3578342a5b25260e09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T10:25:28Z","title_canon_sha256":"ec84dcaeed2e0855e2d1d00f8eb660ddd02a52e8e5d9052d71d4c33c36306356"},"schema_version":"1.0","source":{"id":"1302.4214","kind":"arxiv","version":1}},"canonical_sha256":"5bbd9022bcb33f52cdadc9c2c2f2c0c31152bf820804a476686fb885280bd630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bbd9022bcb33f52cdadc9c2c2f2c0c31152bf820804a476686fb885280bd630","first_computed_at":"2026-05-18T03:33:23.700869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:23.700869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOV3lTOKOx+zV8ApSHFTNf0Q6VWUD4DZUQR0N1cGaUe1LdBs1wXoodZU3MzJJh2UbFZEymSavIeYE29nA+J4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:23.701613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:515f58c501dcdb3f41c3f01650c66436c0c468ec305fa885f86f30aabb31dea4","sha256:54de9b4ffa06715721c3f4ff975231c29c6f818675066cad7c12837d113132d6"],"state_sha256":"771ad1558fb549f3531429c1bcd3de13422ae84a4d41e7e934e54360ad73e8ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gFrLTAX8p4mi9WnU9qVWk7UOOz69EDCseWtTP74izPO9zbWPeomxPniGsD/UZWfUaya77+X17FS2vCNF8APBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:33:47.763637Z","bundle_sha256":"b72ab49cedcb37ef2f0c04b503b035d52d85d87a6f50fe3d0612f8cf39e03d81"}}