{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OVAZGDPQO4P33NPXTV3HHETULB","short_pith_number":"pith:OVAZGDPQ","schema_version":"1.0","canonical_sha256":"7541930df0771fbdb5f79d76739274587efc5bd397360c086edf6fb5b9f23125","source":{"kind":"arxiv","id":"1704.02869","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.02869","created_at":"2026-05-18T00:46:43.827071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02869v1","created_at":"2026-05-18T00:46:43.827071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02869","created_at":"2026-05-18T00:46:43.827071+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVAZGDPQO4P3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVAZGDPQO4P33NPX","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVAZGDPQ","created_at":"2026-05-18T12:31:34.259226+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/OVAZGDPQO4P33NPXTV3HHETULB","json":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB.json","graph_json":"https://pith.science/api/pith-number/OVAZGDPQO4P33NPXTV3HHETULB/graph.json","events_json":"https://pith.science/api/pith-number/OVAZGDPQO4P33NPXTV3HHETULB/events.json","paper":"https://pith.science/paper/OVAZGDPQ"},"agent_actions":{"view_html":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB","download_json":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB.json","view_paper":"https://pith.science/paper/OVAZGDPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02869&json=true","fetch_graph":"https://pith.science/api/pith-number/OVAZGDPQO4P33NPXTV3HHETULB/graph.json","fetch_events":"https://pith.science/api/pith-number/OVAZGDPQO4P33NPXTV3HHETULB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/action/storage_attestation","attest_author":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/action/author_attestation","sign_citation":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/action/citation_signature","submit_replication":"https://pith.science/pith/OVAZGDPQO4P33NPXTV3HHETULB/action/replication_record"}},"created_at":"2026-05-18T00:46:43.827071+00:00","updated_at":"2026-05-18T00:46:43.827071+00:00"}