{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:REIHRMLRHTPTKJGZ66GKF3XLKC","short_pith_number":"pith:REIHRMLR","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"},"canonical_sha256":"891078b1713cdf3524d9f78ca2eeeb508aa8f1af951cad11b6edee90a33a85e6","source":{"kind":"arxiv","id":"1711.03549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03549","created_at":"2026-05-18T00:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03549v1","created_at":"2026-05-18T00:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03549","created_at":"2026-05-18T00:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"REIHRMLRHTPT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"REIHRMLRHTPTKJGZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"REIHRMLR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:REIHRMLRHTPTKJGZ66GKF3XLKC","target":"record","payload":{"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"},"canonical_sha256":"891078b1713cdf3524d9f78ca2eeeb508aa8f1af951cad11b6edee90a33a85e6","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"},"source_kind":"arxiv","source_id":"1711.03549","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:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJkOc7PSmwIdEUMFWaeaA4avF7d/aXTuDCUEYfMuCwol9KM3tb7OVeXM5oCRGTXXYL8UNnpoYIPIg8z8of12Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:15:47.932790Z"},"content_sha256":"7aa10cf26d401bec5ea23881581430f1e740fb619a686f77fa52e54aebd11edd","schema_version":"1.0","event_id":"sha256:7aa10cf26d401bec5ea23881581430f1e740fb619a686f77fa52e54aebd11edd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:REIHRMLRHTPTKJGZ66GKF3XLKC","target":"graph","payload":{"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"},"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:30:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bReXGeU0LlV/Hx9QkAI8xPGXBjWKiJYDhPTc1CSIlJHqiVLWb5a14wMD8/GCtqeWHAovgeRwJsJd9YOy5USDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:15:47.933347Z"},"content_sha256":"9261ad13dcdeacf25bfe72fd8276eddb1870ddf46ead457197e863072d07c340","schema_version":"1.0","event_id":"sha256:9261ad13dcdeacf25bfe72fd8276eddb1870ddf46ead457197e863072d07c340"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/bundle.json","state_url":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/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-03T22:15:47Z","links":{"resolver":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC","bundle":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/bundle.json","state":"https://pith.science/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REIHRMLRHTPTKJGZ66GKF3XLKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:REIHRMLRHTPTKJGZ66GKF3XLKC","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":"2c92629e11ccc5b871cc071c40a52585b42a6745945105672d836e001c1caaad","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2017-11-09T18:08:14Z","title_canon_sha256":"08e03fc9ddaf27265cfb550eb5d3ad66b6c56c4a0e409003eac1d1d9edd0dd75"},"schema_version":"1.0","source":{"id":"1711.03549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03549","created_at":"2026-05-18T00:30:52Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03549v1","created_at":"2026-05-18T00:30:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03549","created_at":"2026-05-18T00:30:52Z"},{"alias_kind":"pith_short_12","alias_value":"REIHRMLRHTPT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"REIHRMLRHTPTKJGZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"REIHRMLR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:9261ad13dcdeacf25bfe72fd8276eddb1870ddf46ead457197e863072d07c340","target":"graph","created_at":"2026-05-18T00:30:52Z","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":"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","authors_text":"Eunice Gogo Mphako-Banda, Johan Kok, Sudev Naduvath","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2017-11-09T18:08:14Z","title":"On the Fading Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03549","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:7aa10cf26d401bec5ea23881581430f1e740fb619a686f77fa52e54aebd11edd","target":"record","created_at":"2026-05-18T00:30:52Z","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":"2c92629e11ccc5b871cc071c40a52585b42a6745945105672d836e001c1caaad","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2017-11-09T18:08:14Z","title_canon_sha256":"08e03fc9ddaf27265cfb550eb5d3ad66b6c56c4a0e409003eac1d1d9edd0dd75"},"schema_version":"1.0","source":{"id":"1711.03549","kind":"arxiv","version":1}},"canonical_sha256":"891078b1713cdf3524d9f78ca2eeeb508aa8f1af951cad11b6edee90a33a85e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"891078b1713cdf3524d9f78ca2eeeb508aa8f1af951cad11b6edee90a33a85e6","first_computed_at":"2026-05-18T00:30:52.111189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:52.111189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbpa6Eu3P9Ek/K5G8bj57LwDBHAGznH+j6XnhMTVduOURLC+Ymo012Lx1tz/wP0pc2nS6/yXn7bC8fuvCwnICw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:52.111656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aa10cf26d401bec5ea23881581430f1e740fb619a686f77fa52e54aebd11edd","sha256:9261ad13dcdeacf25bfe72fd8276eddb1870ddf46ead457197e863072d07c340"],"state_sha256":"6bc1abb0676a4671f8cfa7c1c4a43473eaa3a63bb0219ffca813c32a7d95064a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aGrNZRnXn6kRXrWtp7EStMqzQqGbrf06nAPOXUrGsDpGGMaJMRZCrIRubA42WulMMwld0gReiDuLn5K6fzRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:15:47.936043Z","bundle_sha256":"bea62d0ed088f4451c04862a9fd737efc4da39a91a30e391c9c8ccef83940aa5"}}