{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4Q5LRDNHJ2OHOCA47WBYLSF3KK","short_pith_number":"pith:4Q5LRDNH","schema_version":"1.0","canonical_sha256":"e43ab88da74e9c77081cfd8385c8bb529f728e0e6d84185382d7e4e279f09dcb","source":{"kind":"arxiv","id":"1807.01915","version":1},"attestation_state":"computed","paper":{"title":"$\\delta^{(k)}$-Colouring of Cycle Related 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":"2018-07-05T09:32:09Z","abstract_excerpt":"With respect to a proper colouring of a graph $G$, we know that $\\delta(G) \\leq \\chi(G) \\leq \\Delta(G)+1$. If distinct colours represent distinct technology types to be located at vertices the question arises on how to place at least one of each of $k$, $1\\leq k < \\chi(G)$ technology types together with the minimum adjacency between similar technology types. In an improper colouring an edge $uv$ such that $c(u)=c(v)$ is called a bad edge. In this paper, we introduce the notion of $\\delta^{(k)}$-colouring which is a near proper colouring of $G$ with exactly $1\\leq k < \\chi(G)$ distinct colours "},"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":"1807.01915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-07-05T09:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"08d2cdd48b73062843007fa63fb88fde00e1f60c07a456a2612d6099790becbb","abstract_canon_sha256":"522c76faa593b59f094883de9f9ca956b4f4a71fe1e8ca76aad0e2764eabcebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:24.712455Z","signature_b64":"5oRINEAm/SIGbArmBNEGEh0h3qlQnVUKZ5zqKOkbGMB+BKF97+B2YKNbKglRA5qWceFIzBleJLoaJvppBwNNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e43ab88da74e9c77081cfd8385c8bb529f728e0e6d84185382d7e4e279f09dcb","last_reissued_at":"2026-05-18T00:11:24.712030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:24.712030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\delta^{(k)}$-Colouring of Cycle Related 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":"2018-07-05T09:32:09Z","abstract_excerpt":"With respect to a proper colouring of a graph $G$, we know that $\\delta(G) \\leq \\chi(G) \\leq \\Delta(G)+1$. If distinct colours represent distinct technology types to be located at vertices the question arises on how to place at least one of each of $k$, $1\\leq k < \\chi(G)$ technology types together with the minimum adjacency between similar technology types. In an improper colouring an edge $uv$ such that $c(u)=c(v)$ is called a bad edge. In this paper, we introduce the notion of $\\delta^{(k)}$-colouring which is a near proper colouring of $G$ with exactly $1\\leq k < \\chi(G)$ distinct colours "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01915","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":"1807.01915","created_at":"2026-05-18T00:11:24.712091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01915v1","created_at":"2026-05-18T00:11:24.712091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01915","created_at":"2026-05-18T00:11:24.712091+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Q5LRDNHJ2OH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Q5LRDNHJ2OHOCA4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Q5LRDNH","created_at":"2026-05-18T12:32:05.422762+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/4Q5LRDNHJ2OHOCA47WBYLSF3KK","json":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK.json","graph_json":"https://pith.science/api/pith-number/4Q5LRDNHJ2OHOCA47WBYLSF3KK/graph.json","events_json":"https://pith.science/api/pith-number/4Q5LRDNHJ2OHOCA47WBYLSF3KK/events.json","paper":"https://pith.science/paper/4Q5LRDNH"},"agent_actions":{"view_html":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK","download_json":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK.json","view_paper":"https://pith.science/paper/4Q5LRDNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01915&json=true","fetch_graph":"https://pith.science/api/pith-number/4Q5LRDNHJ2OHOCA47WBYLSF3KK/graph.json","fetch_events":"https://pith.science/api/pith-number/4Q5LRDNHJ2OHOCA47WBYLSF3KK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK/action/storage_attestation","attest_author":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK/action/author_attestation","sign_citation":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK/action/citation_signature","submit_replication":"https://pith.science/pith/4Q5LRDNHJ2OHOCA47WBYLSF3KK/action/replication_record"}},"created_at":"2026-05-18T00:11:24.712091+00:00","updated_at":"2026-05-18T00:11:24.712091+00:00"}