{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ETLGLCCZE6G5LBXOXBFYUCHTOY","short_pith_number":"pith:ETLGLCCZ","schema_version":"1.0","canonical_sha256":"24d6658859278dd586eeb84b8a08f376122e9111d3e73574129f334db913b904","source":{"kind":"arxiv","id":"1703.01089","version":1},"attestation_state":"computed","paper":{"title":"Rainbow Neighbourhoods of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Muhammad Kamran Jamil, Naduvath Sudev","submitted_at":"2017-03-03T09:35:27Z","abstract_excerpt":"In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph $G$. We report on preliminary results thereof. We also establish a necessary and sufficient condition for the existence of a rainbow neighbourhood in the line graph of a graph $G$."},"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":"1703.01089","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2017-03-03T09:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"c1cef63fcb6b46ad8c25c4459e087da81d3123f4090912ce954af83be3769aeb","abstract_canon_sha256":"2784f6624b43b63c394bf9de737e082e5cd570d4fc184c45265fa4ded23b713f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:36.040364Z","signature_b64":"Izu/f96h91a2PwHx2OHKupw+InirjsV9qHZKz0ifgQGFttxGrwNDROoF0AYrq6SPYlh2nVzfoexqiAZJhT/FBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d6658859278dd586eeb84b8a08f376122e9111d3e73574129f334db913b904","last_reissued_at":"2026-05-18T00:49:36.039671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:36.039671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Neighbourhoods of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Muhammad Kamran Jamil, Naduvath Sudev","submitted_at":"2017-03-03T09:35:27Z","abstract_excerpt":"In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph $G$. We report on preliminary results thereof. We also establish a necessary and sufficient condition for the existence of a rainbow neighbourhood in the line graph of a graph $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01089","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":"1703.01089","created_at":"2026-05-18T00:49:36.039782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01089v1","created_at":"2026-05-18T00:49:36.039782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01089","created_at":"2026-05-18T00:49:36.039782+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETLGLCCZE6G5","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETLGLCCZE6G5LBXO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETLGLCCZ","created_at":"2026-05-18T12:31:12.930513+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/ETLGLCCZE6G5LBXOXBFYUCHTOY","json":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY.json","graph_json":"https://pith.science/api/pith-number/ETLGLCCZE6G5LBXOXBFYUCHTOY/graph.json","events_json":"https://pith.science/api/pith-number/ETLGLCCZE6G5LBXOXBFYUCHTOY/events.json","paper":"https://pith.science/paper/ETLGLCCZ"},"agent_actions":{"view_html":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY","download_json":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY.json","view_paper":"https://pith.science/paper/ETLGLCCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01089&json=true","fetch_graph":"https://pith.science/api/pith-number/ETLGLCCZE6G5LBXOXBFYUCHTOY/graph.json","fetch_events":"https://pith.science/api/pith-number/ETLGLCCZE6G5LBXOXBFYUCHTOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY/action/storage_attestation","attest_author":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY/action/author_attestation","sign_citation":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY/action/citation_signature","submit_replication":"https://pith.science/pith/ETLGLCCZE6G5LBXOXBFYUCHTOY/action/replication_record"}},"created_at":"2026-05-18T00:49:36.039782+00:00","updated_at":"2026-05-18T00:49:36.039782+00:00"}