{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:REIHRMLRHTPTKJGZ66GKF3XLKC","short_pith_number":"pith:REIHRMLR","schema_version":"1.0","canonical_sha256":"891078b1713cdf3524d9f78ca2eeeb508aa8f1af951cad11b6edee90a33a85e6","source":{"kind":"arxiv","id":"1711.03549","version":1},"attestation_state":"computed","paper":{"title":"On the Fading Number of a Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Eunice Gogo Mphako-Banda, Johan Kok, Sudev Naduvath","submitted_at":"2017-11-09T18:08:14Z","abstract_excerpt":"The closed neighbourhood $N[v]$ of a vertex $v$ of a graph $G$, consisting of at least one vertex from all colour classes with respect to a proper colouring of $G$, is called a rainbow neighbourhood in $G$. The minimum number of vertices and the maximum number of vertices which yield rainbow neighbourhoods with respect to a chromatic colouring of $G$ are called the minimum and maximum rainbow neighbourhood numbers, denoted by $r^-_\\chi(G)$, $r^+_\\chi(G)$ respectively. In this paper, by a colour, we mean a solid colour and by a transparent colour, we mean the fading of a solid colour. The fadin"},"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":"1711.03549","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2017-11-09T18:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"08e03fc9ddaf27265cfb550eb5d3ad66b6c56c4a0e409003eac1d1d9edd0dd75","abstract_canon_sha256":"2c92629e11ccc5b871cc071c40a52585b42a6745945105672d836e001c1caaad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:52.111656Z","signature_b64":"wbpa6Eu3P9Ek/K5G8bj57LwDBHAGznH+j6XnhMTVduOURLC+Ymo012Lx1tz/wP0pc2nS6/yXn7bC8fuvCwnICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"891078b1713cdf3524d9f78ca2eeeb508aa8f1af951cad11b6edee90a33a85e6","last_reissued_at":"2026-05-18T00:30:52.111189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:52.111189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Fading Number of a Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Eunice Gogo Mphako-Banda, Johan Kok, Sudev Naduvath","submitted_at":"2017-11-09T18:08:14Z","abstract_excerpt":"The closed neighbourhood $N[v]$ of a vertex $v$ of a graph $G$, consisting of at least one vertex from all colour classes with respect to a proper colouring of $G$, is called a rainbow neighbourhood in $G$. The minimum number of vertices and the maximum number of vertices which yield rainbow neighbourhoods with respect to a chromatic colouring of $G$ are called the minimum and maximum rainbow neighbourhood numbers, denoted by $r^-_\\chi(G)$, $r^+_\\chi(G)$ respectively. In this paper, by a colour, we mean a solid colour and by a transparent colour, we mean the fading of a solid colour. The fadin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03549","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":"1711.03549","created_at":"2026-05-18T00:30:52.111252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03549v1","created_at":"2026-05-18T00:30:52.111252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03549","created_at":"2026-05-18T00:30:52.111252+00:00"},{"alias_kind":"pith_short_12","alias_value":"REIHRMLRHTPT","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"REIHRMLRHTPTKJGZ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"REIHRMLR","created_at":"2026-05-18T12:31:39.905425+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/REIHRMLRHTPTKJGZ66GKF3XLKC","json":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC.json","graph_json":"https://pith.science/api/pith-number/REIHRMLRHTPTKJGZ66GKF3XLKC/graph.json","events_json":"https://pith.science/api/pith-number/REIHRMLRHTPTKJGZ66GKF3XLKC/events.json","paper":"https://pith.science/paper/REIHRMLR"},"agent_actions":{"view_html":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC","download_json":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC.json","view_paper":"https://pith.science/paper/REIHRMLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03549&json=true","fetch_graph":"https://pith.science/api/pith-number/REIHRMLRHTPTKJGZ66GKF3XLKC/graph.json","fetch_events":"https://pith.science/api/pith-number/REIHRMLRHTPTKJGZ66GKF3XLKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/action/storage_attestation","attest_author":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/action/author_attestation","sign_citation":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/action/citation_signature","submit_replication":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/action/replication_record"}},"created_at":"2026-05-18T00:30:52.111252+00:00","updated_at":"2026-05-18T00:30:52.111252+00:00"}