{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OVAZGDPQO4P33NPXTV3HHETULB","short_pith_number":"pith:OVAZGDPQ","canonical_record":{"source":{"id":"1704.02869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-04-03T01:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"b64ad9db3bb01fe25d3598f75f23f29304e59c41cd7b43efa4e753381c7a3359","abstract_canon_sha256":"ec8ef91dd8160e09dda6c2abc2e3fdbb164496d99e34d38e1d43525e3833a5b2"},"schema_version":"1.0"},"canonical_sha256":"7541930df0771fbdb5f79d76739274587efc5bd397360c086edf6fb5b9f23125","source":{"kind":"arxiv","id":"1704.02869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02869","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02869v1","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02869","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"OVAZGDPQO4P3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OVAZGDPQO4P33NPX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OVAZGDPQ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OVAZGDPQO4P33NPXTV3HHETULB","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-04-03T01:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"b64ad9db3bb01fe25d3598f75f23f29304e59c41cd7b43efa4e753381c7a3359","abstract_canon_sha256":"ec8ef91dd8160e09dda6c2abc2e3fdbb164496d99e34d38e1d43525e3833a5b2"},"schema_version":"1.0"},"canonical_sha256":"7541930df0771fbdb5f79d76739274587efc5bd397360c086edf6fb5b9f23125","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:43.827684Z","signature_b64":"CFhJiKofXCsWFeN9u+hCBwF2MBK26jXtGuYw3PCrM85Vai6y6TwG54DLPSZiJrcaCb7ZXEInWtYKqY3igeozDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7541930df0771fbdb5f79d76739274587efc5bd397360c086edf6fb5b9f23125","last_reissued_at":"2026-05-18T00:46:43.826943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:43.826943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02869","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-18T00:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1CeeBtGxMBLSp5meDCVsBz8zSSYuZ+phkWxwKcw7lfeYfhT8Sqzj4JJDySWkVR4CfV/KHBtT/VObRBg4u1UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:19:17.073021Z"},"content_sha256":"b9dc580ec1c8e029ce2d81fa4b3126254c8b1a16eb8e93ee3abf3ba48dfe678b","schema_version":"1.0","event_id":"sha256:b9dc580ec1c8e029ce2d81fa4b3126254c8b1a16eb8e93ee3abf3ba48dfe678b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OVAZGDPQO4P33NPXTV3HHETULB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Johan Colouring of Graph Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Sudev Naduvath","submitted_at":"2017-04-03T01:52:49Z","abstract_excerpt":"A vertex $v$ of a given graph is said to be in a rainbow neighbourhood of $G$ if every colour class of $G$ consists of at least one vertex from the closed neighbourhood $N[v]$. A maximal proper colouring of a graph $G$ is a Johan colouring if and only if every vertex of $G$ belongs to a rainbow neighbourhood of $G$. In general all graphs need not have a Johan colouring, even though they admit a chromatic colouring. In this paper, we characterise graphs which admit a Johan colouring. We also discuss some preliminary results in respect of certain graph operations which admit a Johan colouring un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02869","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-18T00:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xl4uYxr0EKMwbZN1Cu4LPVbcTpCCJWnRR2cLXOvIBiyXZiRKFbIJwFC/yBXNxC+m/6BIvH25S9NzTenfJQZmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:19:17.073374Z"},"content_sha256":"a714f743804b2ece0ce4ca9f105f3e7e4dc1c8aafb31e6351ace967c04acaf5b","schema_version":"1.0","event_id":"sha256:a714f743804b2ece0ce4ca9f105f3e7e4dc1c8aafb31e6351ace967c04acaf5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/bundle.json","state_url":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVAZGDPQO4P33NPXTV3HHETULB/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-03T21:19:17Z","links":{"resolver":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB","bundle":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/bundle.json","state":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVAZGDPQO4P33NPXTV3HHETULB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OVAZGDPQO4P33NPXTV3HHETULB","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":"ec8ef91dd8160e09dda6c2abc2e3fdbb164496d99e34d38e1d43525e3833a5b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-04-03T01:52:49Z","title_canon_sha256":"b64ad9db3bb01fe25d3598f75f23f29304e59c41cd7b43efa4e753381c7a3359"},"schema_version":"1.0","source":{"id":"1704.02869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02869","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02869v1","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02869","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"OVAZGDPQO4P3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OVAZGDPQO4P33NPX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OVAZGDPQ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:a714f743804b2ece0ce4ca9f105f3e7e4dc1c8aafb31e6351ace967c04acaf5b","target":"graph","created_at":"2026-05-18T00:46:43Z","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 vertex $v$ of a given graph is said to be in a rainbow neighbourhood of $G$ if every colour class of $G$ consists of at least one vertex from the closed neighbourhood $N[v]$. A maximal proper colouring of a graph $G$ is a Johan colouring if and only if every vertex of $G$ belongs to a rainbow neighbourhood of $G$. In general all graphs need not have a Johan colouring, even though they admit a chromatic colouring. In this paper, we characterise graphs which admit a Johan colouring. We also discuss some preliminary results in respect of certain graph operations which admit a Johan colouring un","authors_text":"Johan Kok, Sudev Naduvath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-04-03T01:52:49Z","title":"Johan Colouring of Graph Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02869","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:b9dc580ec1c8e029ce2d81fa4b3126254c8b1a16eb8e93ee3abf3ba48dfe678b","target":"record","created_at":"2026-05-18T00:46:43Z","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":"ec8ef91dd8160e09dda6c2abc2e3fdbb164496d99e34d38e1d43525e3833a5b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-04-03T01:52:49Z","title_canon_sha256":"b64ad9db3bb01fe25d3598f75f23f29304e59c41cd7b43efa4e753381c7a3359"},"schema_version":"1.0","source":{"id":"1704.02869","kind":"arxiv","version":1}},"canonical_sha256":"7541930df0771fbdb5f79d76739274587efc5bd397360c086edf6fb5b9f23125","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7541930df0771fbdb5f79d76739274587efc5bd397360c086edf6fb5b9f23125","first_computed_at":"2026-05-18T00:46:43.826943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:43.826943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CFhJiKofXCsWFeN9u+hCBwF2MBK26jXtGuYw3PCrM85Vai6y6TwG54DLPSZiJrcaCb7ZXEInWtYKqY3igeozDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:43.827684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9dc580ec1c8e029ce2d81fa4b3126254c8b1a16eb8e93ee3abf3ba48dfe678b","sha256:a714f743804b2ece0ce4ca9f105f3e7e4dc1c8aafb31e6351ace967c04acaf5b"],"state_sha256":"8f48346e5a81fd79b7a2a1d4948380c3fd2d6774aa69e9f3e232cabf811c9a3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIAHP7fO0BoPxIEnl0rbcolhER7710HrgyLmQFvhvHMm2tf6fEluoF8k/OtotqcLxEW6MZfNhCnSTGVgfN97Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:19:17.075368Z","bundle_sha256":"02e32c4a808154bcabb402cef8f620247465cafb9e97fae35a829d8d2d72c2ae"}}