{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FQBU5WOSEOEAQTS35NHFG6MJBI","short_pith_number":"pith:FQBU5WOS","schema_version":"1.0","canonical_sha256":"2c034ed9d22388084e5beb4e5379890a35c2af1574349ed6a00b2b7b1b0c14e9","source":{"kind":"arxiv","id":"1710.00383","version":1},"attestation_state":"computed","paper":{"title":"Reflection on rainbow neighbourhood numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Orville Buelban, Sudev Naduvath","submitted_at":"2017-10-01T18:03:30Z","abstract_excerpt":"A rainbow neighbourhood of a graph $G$ with respect to a proper colouring $\\C$ of $G$ is the closed neighbourhood $N[v]$ of a vertex $v$ in $G$ such that $N[v]$ consists of vertices from all colour classes in $G$ with respect to $\\C$. The number of vertices in $G$ which yield a rainbow neighbourhood of $G$ is called its rainbow neighbourhood number. In this paper, we show that all results known so far about the rainbow neighbourhood number of a graph $G$ implicitly refer to a minimum number of vertices which yield rainbow neighbourhoods in respect of the minimum proper colouring where the colo"},"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":"1710.00383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-10-01T18:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"65202f68b72e707f50bc9bdde5550d33261db9fb0a32402c74eb9f273cdb63fc","abstract_canon_sha256":"377665d14f56940f9ae6bb8a584db89a5524697021bac52f4ada98ca316f72da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:54.935855Z","signature_b64":"59FtW93GJsO+0ZcTKTHErqxOkJrzkRjnjc/QnQU2unQw6XglQpD/eRzMbBKUcAKATLtwAxCFTGga8dFmePEdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c034ed9d22388084e5beb4e5379890a35c2af1574349ed6a00b2b7b1b0c14e9","last_reissued_at":"2026-05-18T00:33:54.935133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:54.935133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reflection on rainbow neighbourhood numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Orville Buelban, Sudev Naduvath","submitted_at":"2017-10-01T18:03:30Z","abstract_excerpt":"A rainbow neighbourhood of a graph $G$ with respect to a proper colouring $\\C$ of $G$ is the closed neighbourhood $N[v]$ of a vertex $v$ in $G$ such that $N[v]$ consists of vertices from all colour classes in $G$ with respect to $\\C$. The number of vertices in $G$ which yield a rainbow neighbourhood of $G$ is called its rainbow neighbourhood number. In this paper, we show that all results known so far about the rainbow neighbourhood number of a graph $G$ implicitly refer to a minimum number of vertices which yield rainbow neighbourhoods in respect of the minimum proper colouring where the colo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00383","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":"1710.00383","created_at":"2026-05-18T00:33:54.935249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00383v1","created_at":"2026-05-18T00:33:54.935249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00383","created_at":"2026-05-18T00:33:54.935249+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQBU5WOSEOEA","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQBU5WOSEOEAQTS3","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQBU5WOS","created_at":"2026-05-18T12:31:15.632608+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/FQBU5WOSEOEAQTS35NHFG6MJBI","json":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI.json","graph_json":"https://pith.science/api/pith-number/FQBU5WOSEOEAQTS35NHFG6MJBI/graph.json","events_json":"https://pith.science/api/pith-number/FQBU5WOSEOEAQTS35NHFG6MJBI/events.json","paper":"https://pith.science/paper/FQBU5WOS"},"agent_actions":{"view_html":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI","download_json":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI.json","view_paper":"https://pith.science/paper/FQBU5WOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00383&json=true","fetch_graph":"https://pith.science/api/pith-number/FQBU5WOSEOEAQTS35NHFG6MJBI/graph.json","fetch_events":"https://pith.science/api/pith-number/FQBU5WOSEOEAQTS35NHFG6MJBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/action/storage_attestation","attest_author":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/action/author_attestation","sign_citation":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/action/citation_signature","submit_replication":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/action/replication_record"}},"created_at":"2026-05-18T00:33:54.935249+00:00","updated_at":"2026-05-18T00:33:54.935249+00:00"}