{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AL4OPMFIPSOHML64KBYGIEUOTH","short_pith_number":"pith:AL4OPMFI","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"},"canonical_sha256":"02f8e7b0a87c9c762fdc507064128e99fbf38935c2c4547ddf489d5b4164ed17","source":{"kind":"arxiv","id":"1804.01860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01860","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01860v1","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01860","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"AL4OPMFIPSOH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AL4OPMFIPSOHML64","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AL4OPMFI","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AL4OPMFIPSOHML64KBYGIEUOTH","target":"record","payload":{"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"},"canonical_sha256":"02f8e7b0a87c9c762fdc507064128e99fbf38935c2c4547ddf489d5b4164ed17","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"},"source_kind":"arxiv","source_id":"1804.01860","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trlBGTNq6D1Henz+mP8ZlyjRBqE/hwUlPow6iY9QLJJBolwqPZ65nm4/tjG8tJtpxbsgUblq4QqEXmkApIJZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:06:11.997191Z"},"content_sha256":"c49c01431ce16f10253bedaa6be26e4ab6c3395186dfa3965d0de0f07505dbd3","schema_version":"1.0","event_id":"sha256:c49c01431ce16f10253bedaa6be26e4ab6c3395186dfa3965d0de0f07505dbd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AL4OPMFIPSOHML64KBYGIEUOTH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3vsQX1jrK+2I8a5UbD7Z+5+sswsgG6xEnqIWHDd/jR/MoDFd1DXGcqzRK6IVHQylr41wjPO/pL9y3RTEsCoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:06:11.997561Z"},"content_sha256":"6d6a21b6cbf278e1ab136a9716923555fe5a9028661a732fe4079a000b42ff55","schema_version":"1.0","event_id":"sha256:6d6a21b6cbf278e1ab136a9716923555fe5a9028661a732fe4079a000b42ff55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/bundle.json","state_url":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AL4OPMFIPSOHML64KBYGIEUOTH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T05:06:11Z","links":{"resolver":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH","bundle":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/bundle.json","state":"https://pith.science/pith/AL4OPMFIPSOHML64KBYGIEUOTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AL4OPMFIPSOHML64KBYGIEUOTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AL4OPMFIPSOHML64KBYGIEUOTH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d53327528ff5a67469ee8e90f0fe5159bff4fb1a428b66a381e31fd66a9af96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-04-04T17:48:34Z","title_canon_sha256":"fdcad4c75f508a001660dc5f04e480af28cfc3863ada652059c812a2cceb85a9"},"schema_version":"1.0","source":{"id":"1804.01860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01860","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01860v1","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01860","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"AL4OPMFIPSOH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AL4OPMFIPSOHML64","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AL4OPMFI","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:6d6a21b6cbf278e1ab136a9716923555fe5a9028661a732fe4079a000b42ff55","target":"graph","created_at":"2026-05-18T00:19:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"C. Susanth, N.K. Sudev, S.J. Kalayathankal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-04-04T17:48:34Z","title":"On Chromatic Curling Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01860","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c49c01431ce16f10253bedaa6be26e4ab6c3395186dfa3965d0de0f07505dbd3","target":"record","created_at":"2026-05-18T00:19:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d53327528ff5a67469ee8e90f0fe5159bff4fb1a428b66a381e31fd66a9af96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-04-04T17:48:34Z","title_canon_sha256":"fdcad4c75f508a001660dc5f04e480af28cfc3863ada652059c812a2cceb85a9"},"schema_version":"1.0","source":{"id":"1804.01860","kind":"arxiv","version":1}},"canonical_sha256":"02f8e7b0a87c9c762fdc507064128e99fbf38935c2c4547ddf489d5b4164ed17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02f8e7b0a87c9c762fdc507064128e99fbf38935c2c4547ddf489d5b4164ed17","first_computed_at":"2026-05-18T00:19:09.695491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:09.695491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gwEOi+lZOU35ypqVhGzMl9CayRsQj0J6rvy/wi+dq3R0+Asx3m3LYPIiC64t4SY+fdSIVUo7yK2e0YGyKpEQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:09.696135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c49c01431ce16f10253bedaa6be26e4ab6c3395186dfa3965d0de0f07505dbd3","sha256:6d6a21b6cbf278e1ab136a9716923555fe5a9028661a732fe4079a000b42ff55"],"state_sha256":"519bef34e965bec4619f51630026d88d76b55d36cbb8abe1608960665389ec70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JN1bnroNnVDb6uoZjFumarL777nVGZ7QjpF6AiI8waz0x/qymKOt6lWHsXIg3cScfGiWt5tu9nRDPmNPpbMgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:06:11.999627Z","bundle_sha256":"be199a747977fab6e2a337d00b337731aac71d87702f7dd201ae16d4a453dab9"}}