{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LD3IRQXD4TLUK2C7CMG2SVG4NF","short_pith_number":"pith:LD3IRQXD","schema_version":"1.0","canonical_sha256":"58f688c2e3e4d745685f130da954dc6944c9ddafcbcce638912efa566886df17","source":{"kind":"arxiv","id":"1702.00103","version":1},"attestation_state":"computed","paper":{"title":"A note on chromatic blending of colour clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Muhammad Kamran Jamil, Naduvath Sudev","submitted_at":"2017-02-01T01:57:25Z","abstract_excerpt":"For a colour cluster $\\C =(\\mathcal{C}_1,\\mathcal{C}_2, \\mathcal{C}_3,\\dots,\\mathcal{C}_\\ell)$, $\\mathcal{C}_i$ is a colour class, and $|\\mathcal{C}_i|=r_i \\geq 1$, we investigate a simple connected graph structure $G^{\\C}$, which represents a graphical embodiment of the colour cluster such that the chromatic number $\\chi(G^{\\C})= \\ell,$ and the number of edges is a maximum, denoted $\\varepsilon^+(G^{\\C})$. We also extend the study by inducing new colour clusters recursively by blending the colours of all pairs of adjacent vertices. Recursion repeats until a maximal homogeneous blend between a"},"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":"1702.00103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-02-01T01:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"89aef8e1010826b04be156761631ebb30c0d91da89ddf2ef8bea20ae211f67cc","abstract_canon_sha256":"39b81a6f1f216e953d93cc5c8368263d8ac9b8f0a3f090ab892844c4451cd4e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:22.349875Z","signature_b64":"OxNYwDsOUntMvyA6/vaRbyQ9XHn1JXgDfSGyFllDKBpFiqRvf38tztZAIFM9+czUi1fTPtDcWiz4KYcrTtouBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58f688c2e3e4d745685f130da954dc6944c9ddafcbcce638912efa566886df17","last_reissued_at":"2026-05-18T00:51:22.349084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:22.349084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on chromatic blending of colour clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Muhammad Kamran Jamil, Naduvath Sudev","submitted_at":"2017-02-01T01:57:25Z","abstract_excerpt":"For a colour cluster $\\C =(\\mathcal{C}_1,\\mathcal{C}_2, \\mathcal{C}_3,\\dots,\\mathcal{C}_\\ell)$, $\\mathcal{C}_i$ is a colour class, and $|\\mathcal{C}_i|=r_i \\geq 1$, we investigate a simple connected graph structure $G^{\\C}$, which represents a graphical embodiment of the colour cluster such that the chromatic number $\\chi(G^{\\C})= \\ell,$ and the number of edges is a maximum, denoted $\\varepsilon^+(G^{\\C})$. We also extend the study by inducing new colour clusters recursively by blending the colours of all pairs of adjacent vertices. Recursion repeats until a maximal homogeneous blend between a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00103","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":"1702.00103","created_at":"2026-05-18T00:51:22.349209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00103v1","created_at":"2026-05-18T00:51:22.349209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00103","created_at":"2026-05-18T00:51:22.349209+00:00"},{"alias_kind":"pith_short_12","alias_value":"LD3IRQXD4TLU","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LD3IRQXD4TLUK2C7","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LD3IRQXD","created_at":"2026-05-18T12:31:28.150371+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/LD3IRQXD4TLUK2C7CMG2SVG4NF","json":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF.json","graph_json":"https://pith.science/api/pith-number/LD3IRQXD4TLUK2C7CMG2SVG4NF/graph.json","events_json":"https://pith.science/api/pith-number/LD3IRQXD4TLUK2C7CMG2SVG4NF/events.json","paper":"https://pith.science/paper/LD3IRQXD"},"agent_actions":{"view_html":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF","download_json":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF.json","view_paper":"https://pith.science/paper/LD3IRQXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00103&json=true","fetch_graph":"https://pith.science/api/pith-number/LD3IRQXD4TLUK2C7CMG2SVG4NF/graph.json","fetch_events":"https://pith.science/api/pith-number/LD3IRQXD4TLUK2C7CMG2SVG4NF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF/action/storage_attestation","attest_author":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF/action/author_attestation","sign_citation":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF/action/citation_signature","submit_replication":"https://pith.science/pith/LD3IRQXD4TLUK2C7CMG2SVG4NF/action/replication_record"}},"created_at":"2026-05-18T00:51:22.349209+00:00","updated_at":"2026-05-18T00:51:22.349209+00:00"}