{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DX5LYLC7T6NYGSJFYZBUL5ZLF3","short_pith_number":"pith:DX5LYLC7","canonical_record":{"source":{"id":"1504.01975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T14:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"ea9ccf92ab212b8ca7096aab0125a6bea71048327494b30ff01b627a731fb019","abstract_canon_sha256":"87fb76a058c36474ad636d3dbe2bc3b96d40d4efffdd014bcd008636662f9d89"},"schema_version":"1.0"},"canonical_sha256":"1dfabc2c5f9f9b834925c64345f72b2ed8ba96fac9ff6ec404136c37b87dcd9e","source":{"kind":"arxiv","id":"1504.01975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01975","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01975v1","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01975","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"pith_short_12","alias_value":"DX5LYLC7T6NY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DX5LYLC7T6NYGSJF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DX5LYLC7","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DX5LYLC7T6NYGSJFYZBUL5ZLF3","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T14:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"ea9ccf92ab212b8ca7096aab0125a6bea71048327494b30ff01b627a731fb019","abstract_canon_sha256":"87fb76a058c36474ad636d3dbe2bc3b96d40d4efffdd014bcd008636662f9d89"},"schema_version":"1.0"},"canonical_sha256":"1dfabc2c5f9f9b834925c64345f72b2ed8ba96fac9ff6ec404136c37b87dcd9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:17.635059Z","signature_b64":"ZU6X9wDgDeIkCzcl+6DMns+8MtxjOz9xzlNXItywBM0JGiA0WiNgfL6k+Q7da/tm60mWNTsrEwUw3UVhYYDXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dfabc2c5f9f9b834925c64345f72b2ed8ba96fac9ff6ec404136c37b87dcd9e","last_reissued_at":"2026-05-18T02:19:17.634559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:17.634559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01975","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-18T02:19:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CzSeLzzUfMB1wRczh7jM8yxPHpGckEXzNWGDqfDcCl9SvDn4I1q1amSo0wPiGUVK6RVYzSgxZb82rQgMJb/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:24:46.130415Z"},"content_sha256":"138b8e3f2a3ebca2c9b0881e212e2ae1d55019de1dbf85d35aac45e97e11ea21","schema_version":"1.0","event_id":"sha256:138b8e3f2a3ebca2c9b0881e212e2ae1d55019de1dbf85d35aac45e97e11ea21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DX5LYLC7T6NYGSJFYZBUL5ZLF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the b-chromatic number of the Cartesian product of two complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artur Mesquita Barbosa, Fr\\'ed\\'eric Maffray","submitted_at":"2015-04-08T14:09:19Z","abstract_excerpt":"A b-coloring of a graph $G$ is a coloring of its vertices such that every color class contains a vertex that has neighbors in all other classes. The b-chromatic number of $G$ is the largest integer $k$ such that $G$ has a b-coloring with $k$ colors. Javadi and Omoomi (\"On b-coloring of cartesian product of graphs\", Ars Combinatoria 107 (2012) 521-536) proved that the b-chromatic number of $K_n \\times K_n$ (the Cartesian product of two complete graphs on $n$ vertices) is in the set $\\{2n-3, 2n-2\\}$ and conjectured that the exact value is $2n-3$ for all $n \\ge 5$. We give counterexamples to this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01975","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-18T02:19:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueZ50eDsyAu9I9KyLtFRG4HJHsSYU0nu9XhR2wL5aOa9eMLtKgibTbQIST89NSprR4i0GA0s2O4YrHGgNO+gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:24:46.130785Z"},"content_sha256":"4f3fcfc669d993a937e22560cd649ea4b4d9ccd8c6e07246aa8ce749f0d60425","schema_version":"1.0","event_id":"sha256:4f3fcfc669d993a937e22560cd649ea4b4d9ccd8c6e07246aa8ce749f0d60425"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3/bundle.json","state_url":"https://pith.science/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3/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-01T03:24:46Z","links":{"resolver":"https://pith.science/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3","bundle":"https://pith.science/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3/bundle.json","state":"https://pith.science/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DX5LYLC7T6NYGSJFYZBUL5ZLF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DX5LYLC7T6NYGSJFYZBUL5ZLF3","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":"87fb76a058c36474ad636d3dbe2bc3b96d40d4efffdd014bcd008636662f9d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T14:09:19Z","title_canon_sha256":"ea9ccf92ab212b8ca7096aab0125a6bea71048327494b30ff01b627a731fb019"},"schema_version":"1.0","source":{"id":"1504.01975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01975","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01975v1","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01975","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"pith_short_12","alias_value":"DX5LYLC7T6NY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DX5LYLC7T6NYGSJF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DX5LYLC7","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:4f3fcfc669d993a937e22560cd649ea4b4d9ccd8c6e07246aa8ce749f0d60425","target":"graph","created_at":"2026-05-18T02:19:17Z","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 $G$ is a coloring of its vertices such that every color class contains a vertex that has neighbors in all other classes. The b-chromatic number of $G$ is the largest integer $k$ such that $G$ has a b-coloring with $k$ colors. Javadi and Omoomi (\"On b-coloring of cartesian product of graphs\", Ars Combinatoria 107 (2012) 521-536) proved that the b-chromatic number of $K_n \\times K_n$ (the Cartesian product of two complete graphs on $n$ vertices) is in the set $\\{2n-3, 2n-2\\}$ and conjectured that the exact value is $2n-3$ for all $n \\ge 5$. We give counterexamples to this","authors_text":"Artur Mesquita Barbosa, Fr\\'ed\\'eric Maffray","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T14:09:19Z","title":"On the b-chromatic number of the Cartesian product of two complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01975","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:138b8e3f2a3ebca2c9b0881e212e2ae1d55019de1dbf85d35aac45e97e11ea21","target":"record","created_at":"2026-05-18T02:19:17Z","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":"87fb76a058c36474ad636d3dbe2bc3b96d40d4efffdd014bcd008636662f9d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T14:09:19Z","title_canon_sha256":"ea9ccf92ab212b8ca7096aab0125a6bea71048327494b30ff01b627a731fb019"},"schema_version":"1.0","source":{"id":"1504.01975","kind":"arxiv","version":1}},"canonical_sha256":"1dfabc2c5f9f9b834925c64345f72b2ed8ba96fac9ff6ec404136c37b87dcd9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dfabc2c5f9f9b834925c64345f72b2ed8ba96fac9ff6ec404136c37b87dcd9e","first_computed_at":"2026-05-18T02:19:17.634559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:17.634559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZU6X9wDgDeIkCzcl+6DMns+8MtxjOz9xzlNXItywBM0JGiA0WiNgfL6k+Q7da/tm60mWNTsrEwUw3UVhYYDXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:17.635059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:138b8e3f2a3ebca2c9b0881e212e2ae1d55019de1dbf85d35aac45e97e11ea21","sha256:4f3fcfc669d993a937e22560cd649ea4b4d9ccd8c6e07246aa8ce749f0d60425"],"state_sha256":"77a126150f62025bc4b4805c080cc21cae7503c5ee6236a63801e07158afa34d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfdAWYjFJYASV3cceYoD4i7o/nceMJCxwLq9WEjZIViGlPOv54iX3lgJFZVhiQ8cm96MSVmBFXaO6r8AaUvODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:24:46.132894Z","bundle_sha256":"cd1cf9790fd094c85237b36b38452d747731dd2f46202ceb0baf1304be253280"}}