{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AL4OPMFIPSOHML64KBYGIEUOTH","short_pith_number":"pith:AL4OPMFI","schema_version":"1.0","canonical_sha256":"02f8e7b0a87c9c762fdc507064128e99fbf38935c2c4547ddf489d5b4164ed17","source":{"kind":"arxiv","id":"1804.01860","version":1},"attestation_state":"computed","paper":{"title":"On Chromatic Curling Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"C. Susanth, N.K. Sudev, S.J. Kalayathankal","submitted_at":"2018-04-04T17:48:34Z","abstract_excerpt":"The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring $\\mathcal{C}$ of colours $c_1,c_2,\\ldots,c_l$ is said to be a minimum parameter colouring if C consists of a minimum number of colours with smallest subscripts. In this paper, we study colouring version of curling number of certain graphs, with respect to their minimum parameter colourings."},"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":"1804.01860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-04-04T17:48:34Z","cross_cats_sorted":[],"title_canon_sha256":"fdcad4c75f508a001660dc5f04e480af28cfc3863ada652059c812a2cceb85a9","abstract_canon_sha256":"7d53327528ff5a67469ee8e90f0fe5159bff4fb1a428b66a381e31fd66a9af96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.696135Z","signature_b64":"gwEOi+lZOU35ypqVhGzMl9CayRsQj0J6rvy/wi+dq3R0+Asx3m3LYPIiC64t4SY+fdSIVUo7yK2e0YGyKpEQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f8e7b0a87c9c762fdc507064128e99fbf38935c2c4547ddf489d5b4164ed17","last_reissued_at":"2026-05-18T00:19:09.695491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.695491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Chromatic Curling Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"C. Susanth, N.K. Sudev, S.J. Kalayathankal","submitted_at":"2018-04-04T17:48:34Z","abstract_excerpt":"The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring $\\mathcal{C}$ of colours $c_1,c_2,\\ldots,c_l$ is said to be a minimum parameter colouring if C consists of a minimum number of colours with smallest subscripts. In this paper, we study colouring version of curling number of certain graphs, with respect to their minimum parameter colourings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01860","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":"1804.01860","created_at":"2026-05-18T00:19:09.695585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01860v1","created_at":"2026-05-18T00:19:09.695585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01860","created_at":"2026-05-18T00:19:09.695585+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL4OPMFIPSOH","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL4OPMFIPSOHML64","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL4OPMFI","created_at":"2026-05-18T12:32:13.499390+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/AL4OPMFIPSOHML64KBYGIEUOTH","json":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH.json","graph_json":"https://pith.science/api/pith-number/AL4OPMFIPSOHML64KBYGIEUOTH/graph.json","events_json":"https://pith.science/api/pith-number/AL4OPMFIPSOHML64KBYGIEUOTH/events.json","paper":"https://pith.science/paper/AL4OPMFI"},"agent_actions":{"view_html":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH","download_json":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH.json","view_paper":"https://pith.science/paper/AL4OPMFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01860&json=true","fetch_graph":"https://pith.science/api/pith-number/AL4OPMFIPSOHML64KBYGIEUOTH/graph.json","fetch_events":"https://pith.science/api/pith-number/AL4OPMFIPSOHML64KBYGIEUOTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/action/storage_attestation","attest_author":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/action/author_attestation","sign_citation":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/action/citation_signature","submit_replication":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/action/replication_record"}},"created_at":"2026-05-18T00:19:09.695585+00:00","updated_at":"2026-05-18T00:19:09.695585+00:00"}