{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FQBU5WOSEOEAQTS35NHFG6MJBI","short_pith_number":"pith:FQBU5WOS","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"},"canonical_sha256":"2c034ed9d22388084e5beb4e5379890a35c2af1574349ed6a00b2b7b1b0c14e9","source":{"kind":"arxiv","id":"1710.00383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00383","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00383v1","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00383","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"FQBU5WOSEOEA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQBU5WOSEOEAQTS3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQBU5WOS","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FQBU5WOSEOEAQTS35NHFG6MJBI","target":"record","payload":{"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"},"canonical_sha256":"2c034ed9d22388084e5beb4e5379890a35c2af1574349ed6a00b2b7b1b0c14e9","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"},"source_kind":"arxiv","source_id":"1710.00383","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:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doYiwtZ4RUb7cz29m3vGMvgbgsMwXFAN2G8lxx6FNGoASuycmxQBAhKO4v3A8FdA2pOdwt/lIFXI77+07DlJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:15:16.308839Z"},"content_sha256":"ed4947c496176258bcd2acf2c7f73adb6d8d58ac8446ad20299ddfcf81d218c9","schema_version":"1.0","event_id":"sha256:ed4947c496176258bcd2acf2c7f73adb6d8d58ac8446ad20299ddfcf81d218c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FQBU5WOSEOEAQTS35NHFG6MJBI","target":"graph","payload":{"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"},"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:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/cb/kJv/a0UWqYICJyN1GLbKuNUvr2WH0/KoR58cM3LoJ7Gbu/VhR1J/yA7s8sJFcIyKX03m76alWaP3A6SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:15:16.309182Z"},"content_sha256":"44bd4ab4614a4b0c71ef4c9cba628e739ed90aa728e8efa0b8346e45633dbba4","schema_version":"1.0","event_id":"sha256:44bd4ab4614a4b0c71ef4c9cba628e739ed90aa728e8efa0b8346e45633dbba4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/bundle.json","state_url":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/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-04T05:15:16Z","links":{"resolver":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI","bundle":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/bundle.json","state":"https://pith.science/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQBU5WOSEOEAQTS35NHFG6MJBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FQBU5WOSEOEAQTS35NHFG6MJBI","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":"377665d14f56940f9ae6bb8a584db89a5524697021bac52f4ada98ca316f72da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-10-01T18:03:30Z","title_canon_sha256":"65202f68b72e707f50bc9bdde5550d33261db9fb0a32402c74eb9f273cdb63fc"},"schema_version":"1.0","source":{"id":"1710.00383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00383","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00383v1","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00383","created_at":"2026-05-18T00:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"FQBU5WOSEOEA","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQBU5WOSEOEAQTS3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQBU5WOS","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:44bd4ab4614a4b0c71ef4c9cba628e739ed90aa728e8efa0b8346e45633dbba4","target":"graph","created_at":"2026-05-18T00:33:54Z","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 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","authors_text":"Johan Kok, Orville Buelban, Sudev Naduvath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-10-01T18:03:30Z","title":"Reflection on rainbow neighbourhood numbers of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00383","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:ed4947c496176258bcd2acf2c7f73adb6d8d58ac8446ad20299ddfcf81d218c9","target":"record","created_at":"2026-05-18T00:33:54Z","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":"377665d14f56940f9ae6bb8a584db89a5524697021bac52f4ada98ca316f72da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-10-01T18:03:30Z","title_canon_sha256":"65202f68b72e707f50bc9bdde5550d33261db9fb0a32402c74eb9f273cdb63fc"},"schema_version":"1.0","source":{"id":"1710.00383","kind":"arxiv","version":1}},"canonical_sha256":"2c034ed9d22388084e5beb4e5379890a35c2af1574349ed6a00b2b7b1b0c14e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c034ed9d22388084e5beb4e5379890a35c2af1574349ed6a00b2b7b1b0c14e9","first_computed_at":"2026-05-18T00:33:54.935133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:54.935133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"59FtW93GJsO+0ZcTKTHErqxOkJrzkRjnjc/QnQU2unQw6XglQpD/eRzMbBKUcAKATLtwAxCFTGga8dFmePEdCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:54.935855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed4947c496176258bcd2acf2c7f73adb6d8d58ac8446ad20299ddfcf81d218c9","sha256:44bd4ab4614a4b0c71ef4c9cba628e739ed90aa728e8efa0b8346e45633dbba4"],"state_sha256":"0788ac0f264d4372bfe360b6f25bc7ea72f27816b5f5c8fcad069398c96326ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRj4YQ8csuFTChjEhBGeqbtA6MrNHA6DjEdJ7neE93phSsidoGkgTrMwPsd2LGhyMOTTzzaJuJ6zR2LewrGHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:15:16.311200Z","bundle_sha256":"7fbba815c4991286c7b2fe23cdb6bccfdbbe0d2893b220735c86304917d218f4"}}