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