{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GCSW452W7WEWOUDWVI3GVNFLJE","short_pith_number":"pith:GCSW452W","schema_version":"1.0","canonical_sha256":"30a56e7756fd89675076aa366ab4ab491599115e9b30fdc31cb5197077f0e74e","source":{"kind":"arxiv","id":"1612.04194","version":2},"attestation_state":"computed","paper":{"title":"On Certain $J$-Colouring Parameters of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Sudev Naduvath","submitted_at":"2016-12-11T04:18:35Z","abstract_excerpt":"In this paper, a new type of colouring called Johan colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring opposed to minimum colouring. An upper bound for a connected graph is presented and a number of explicit results are presented for cycles, complete graphs, wheel graphs and for a complete $l$-partite graph."},"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":"1612.04194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-12-11T04:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"66c48d106e0d9d1ed23c411e10be261decb4c177bba4cbb513ed1115d75bc742","abstract_canon_sha256":"81f1f732ab5686d8bbc49e6852374385e4b7e202236d659dd2bed33035988a86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:19.759595Z","signature_b64":"NTpq7xebY0ulVX7DRXPRRITosXf54/5u+7xC7zL97AcWM7SGhNW4tyfD2yE9vsMBKJysSgzbp7Fzyq1/pIMqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a56e7756fd89675076aa366ab4ab491599115e9b30fdc31cb5197077f0e74e","last_reissued_at":"2026-05-18T00:45:19.758820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:19.758820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Certain $J$-Colouring Parameters of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Sudev Naduvath","submitted_at":"2016-12-11T04:18:35Z","abstract_excerpt":"In this paper, a new type of colouring called Johan colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring opposed to minimum colouring. An upper bound for a connected graph is presented and a number of explicit results are presented for cycles, complete graphs, wheel graphs and for a complete $l$-partite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04194","kind":"arxiv","version":2},"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":"1612.04194","created_at":"2026-05-18T00:45:19.758926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04194v2","created_at":"2026-05-18T00:45:19.758926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04194","created_at":"2026-05-18T00:45:19.758926+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCSW452W7WEW","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCSW452W7WEWOUDW","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCSW452W","created_at":"2026-05-18T12:30:19.053100+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/GCSW452W7WEWOUDWVI3GVNFLJE","json":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE.json","graph_json":"https://pith.science/api/pith-number/GCSW452W7WEWOUDWVI3GVNFLJE/graph.json","events_json":"https://pith.science/api/pith-number/GCSW452W7WEWOUDWVI3GVNFLJE/events.json","paper":"https://pith.science/paper/GCSW452W"},"agent_actions":{"view_html":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE","download_json":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE.json","view_paper":"https://pith.science/paper/GCSW452W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04194&json=true","fetch_graph":"https://pith.science/api/pith-number/GCSW452W7WEWOUDWVI3GVNFLJE/graph.json","fetch_events":"https://pith.science/api/pith-number/GCSW452W7WEWOUDWVI3GVNFLJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE/action/storage_attestation","attest_author":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE/action/author_attestation","sign_citation":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE/action/citation_signature","submit_replication":"https://pith.science/pith/GCSW452W7WEWOUDWVI3GVNFLJE/action/replication_record"}},"created_at":"2026-05-18T00:45:19.758926+00:00","updated_at":"2026-05-18T00:45:19.758926+00:00"}