{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B5TWYZJ2EAQPCWBY24ZHJWF72Y","short_pith_number":"pith:B5TWYZJ2","canonical_record":{"source":{"id":"1709.00261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-09-01T11:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"c4d964ad6514a4214b6e79ea5592111c49b2b27b59c74ba2c0a34879540e22dc","abstract_canon_sha256":"99a1b1d60dc6734ae2261809b777bc25985523f91781277f895e3f426ad3b373"},"schema_version":"1.0"},"canonical_sha256":"0f676c653a2020f15838d73274d8bfd600753406103d72d28ea19295bc513614","source":{"kind":"arxiv","id":"1709.00261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00261","created_at":"2026-05-18T00:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00261v1","created_at":"2026-05-18T00:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00261","created_at":"2026-05-18T00:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"B5TWYZJ2EAQP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5TWYZJ2EAQPCWBY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5TWYZJ2","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B5TWYZJ2EAQPCWBY24ZHJWF72Y","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-09-01T11:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"c4d964ad6514a4214b6e79ea5592111c49b2b27b59c74ba2c0a34879540e22dc","abstract_canon_sha256":"99a1b1d60dc6734ae2261809b777bc25985523f91781277f895e3f426ad3b373"},"schema_version":"1.0"},"canonical_sha256":"0f676c653a2020f15838d73274d8bfd600753406103d72d28ea19295bc513614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:12.958678Z","signature_b64":"5PFrA7ScGmZRwsN5lVz3SJmOL2jb+XQ5GJsPdIXD7Ff6ELc7AWCiMYgemD8sro4XZMfOY69MVvYJwKJ91Z7FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f676c653a2020f15838d73274d8bfd600753406103d72d28ea19295bc513614","last_reissued_at":"2026-05-18T00:36:12.958031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:12.958031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00261","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:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sm2VbET28CNXVSIm8EjGb+9IyfkTLSXejQTFnRIeKm3JRdnkoiNUoNisRC3R/zHRrX9MbwNvIoYPXadCX2XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:30.555283Z"},"content_sha256":"b2a51f11e2a9d609384b14ee1bc3a60e9f30a2890c165e92a111eff19d3e2650","schema_version":"1.0","event_id":"sha256:b2a51f11e2a9d609384b14ee1bc3a60e9f30a2890c165e92a111eff19d3e2650"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B5TWYZJ2EAQPCWBY24ZHJWF72Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Neighbourhood Equate Number of Graphs","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-09-01T11:56:24Z","abstract_excerpt":"In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number of a graph $G$ denoted by $ren(G)$ is introduced. It is defined to be the minimum number of vertices whose removal results in a subgraph that admits a $J$-colouring. The new notions of chromatic degree of a vertex $d_\\chi(v)$, the maximum and minimum chromatic degrees of $G$ denoted, $\\Delta_\\chi(G)$ and $\\delta_\\chi(G)$ respectively, are also introduced. The chromatic diameter of $G$ denoted, $d(G,\\chi)$ is introduced as well. The study of $ren(G)$ appears to be very complex for graphs in general so for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00261","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:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ku+gXgR4E/gBIQ0m+cK7Jr5lY9cI3nZ21DEu/qBf2vv95wSpUUXkBlX0wlMdxo3XIYYL3p5e9GdWv52A3LrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:30.555643Z"},"content_sha256":"770a4b14e39fb901d31848378c661811ec04b0c36f29c6ec1608cedcc822b5fd","schema_version":"1.0","event_id":"sha256:770a4b14e39fb901d31848378c661811ec04b0c36f29c6ec1608cedcc822b5fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y/bundle.json","state_url":"https://pith.science/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y/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:50:30Z","links":{"resolver":"https://pith.science/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y","bundle":"https://pith.science/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y/bundle.json","state":"https://pith.science/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5TWYZJ2EAQPCWBY24ZHJWF72Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B5TWYZJ2EAQPCWBY24ZHJWF72Y","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":"99a1b1d60dc6734ae2261809b777bc25985523f91781277f895e3f426ad3b373","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-09-01T11:56:24Z","title_canon_sha256":"c4d964ad6514a4214b6e79ea5592111c49b2b27b59c74ba2c0a34879540e22dc"},"schema_version":"1.0","source":{"id":"1709.00261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00261","created_at":"2026-05-18T00:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00261v1","created_at":"2026-05-18T00:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00261","created_at":"2026-05-18T00:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"B5TWYZJ2EAQP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5TWYZJ2EAQPCWBY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5TWYZJ2","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:770a4b14e39fb901d31848378c661811ec04b0c36f29c6ec1608cedcc822b5fd","target":"graph","created_at":"2026-05-18T00:36:12Z","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":"In this paper, a new invariant of a graph namely, the rainbow neighbourhood equate number of a graph $G$ denoted by $ren(G)$ is introduced. It is defined to be the minimum number of vertices whose removal results in a subgraph that admits a $J$-colouring. The new notions of chromatic degree of a vertex $d_\\chi(v)$, the maximum and minimum chromatic degrees of $G$ denoted, $\\Delta_\\chi(G)$ and $\\delta_\\chi(G)$ respectively, are also introduced. The chromatic diameter of $G$ denoted, $d(G,\\chi)$ is introduced as well. The study of $ren(G)$ appears to be very complex for graphs in general so for ","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-09-01T11:56:24Z","title":"Rainbow Neighbourhood Equate Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00261","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:b2a51f11e2a9d609384b14ee1bc3a60e9f30a2890c165e92a111eff19d3e2650","target":"record","created_at":"2026-05-18T00:36:12Z","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":"99a1b1d60dc6734ae2261809b777bc25985523f91781277f895e3f426ad3b373","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-09-01T11:56:24Z","title_canon_sha256":"c4d964ad6514a4214b6e79ea5592111c49b2b27b59c74ba2c0a34879540e22dc"},"schema_version":"1.0","source":{"id":"1709.00261","kind":"arxiv","version":1}},"canonical_sha256":"0f676c653a2020f15838d73274d8bfd600753406103d72d28ea19295bc513614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f676c653a2020f15838d73274d8bfd600753406103d72d28ea19295bc513614","first_computed_at":"2026-05-18T00:36:12.958031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:12.958031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5PFrA7ScGmZRwsN5lVz3SJmOL2jb+XQ5GJsPdIXD7Ff6ELc7AWCiMYgemD8sro4XZMfOY69MVvYJwKJ91Z7FDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:12.958678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2a51f11e2a9d609384b14ee1bc3a60e9f30a2890c165e92a111eff19d3e2650","sha256:770a4b14e39fb901d31848378c661811ec04b0c36f29c6ec1608cedcc822b5fd"],"state_sha256":"d9d0386b64cb2394737243c8dbc6033b4f641aa03044428e7d5d2ce7e937eaa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jx7HT3zKH76m55P2q5BdjN7bPcQsK7WU19KBxIAICG1xMdGCKeEotugfP/1xJ7xGYLLpsks/nfqad+yVByPbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:50:30.557655Z","bundle_sha256":"639c4314b9a54e0ad8bd5d5c53d68f15f0920469b2c6b0da4633be147029c7b5"}}