{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VKCMGOS6ZB55TEJN4CJ7FJNBDF","short_pith_number":"pith:VKCMGOS6","schema_version":"1.0","canonical_sha256":"aa84c33a5ec87bd9912de093f2a5a11943dbe4cb7f371724536d139ba6f26b8b","source":{"kind":"arxiv","id":"1506.00813","version":2},"attestation_state":"computed","paper":{"title":"On the Curling Number of Certain Graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chithra Sudev, Johan Kok, Naduvath Sudev","submitted_at":"2015-06-02T09:44:49Z","abstract_excerpt":"In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence $C$ of the degree sequence of a simple connected graph $G$ for which the curling number $cn(G)$ corresponds to the curling number of the degree sequence per se and hence we call it the curling number of the graph $G$. A maximal degree subsequence with equal entries is called an identity subsequence. The number of identity curling subsequences in a simple connected graph $G$ is denoted $ic(G).$ We show that the curling number conjecture holds for "},"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":"1506.00813","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-06-02T09:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"80c9d2f15c763fce37a15b547f69995200639b0b72883a25b5e79d67c650ae7c","abstract_canon_sha256":"093d5d515f0ea9f09e90cdb50383f1498771e2d9a1816de920072233432e8e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:11.819839Z","signature_b64":"nlYRnutDnrBTMmpGfxPRJWqBN/j7RuNAHA9WkkUNLVR/Auq9eO9bC+uJfuqWEpDLzTWmHYAXj/SQXIvGu1WyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa84c33a5ec87bd9912de093f2a5a11943dbe4cb7f371724536d139ba6f26b8b","last_reissued_at":"2026-05-18T01:37:11.819144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:11.819144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Curling Number of Certain Graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chithra Sudev, Johan Kok, Naduvath Sudev","submitted_at":"2015-06-02T09:44:49Z","abstract_excerpt":"In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence $C$ of the degree sequence of a simple connected graph $G$ for which the curling number $cn(G)$ corresponds to the curling number of the degree sequence per se and hence we call it the curling number of the graph $G$. A maximal degree subsequence with equal entries is called an identity subsequence. The number of identity curling subsequences in a simple connected graph $G$ is denoted $ic(G).$ We show that the curling number conjecture holds for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00813","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":"1506.00813","created_at":"2026-05-18T01:37:11.819254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00813v2","created_at":"2026-05-18T01:37:11.819254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00813","created_at":"2026-05-18T01:37:11.819254+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKCMGOS6ZB55","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKCMGOS6ZB55TEJN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKCMGOS6","created_at":"2026-05-18T12:29:44.643036+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/VKCMGOS6ZB55TEJN4CJ7FJNBDF","json":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF.json","graph_json":"https://pith.science/api/pith-number/VKCMGOS6ZB55TEJN4CJ7FJNBDF/graph.json","events_json":"https://pith.science/api/pith-number/VKCMGOS6ZB55TEJN4CJ7FJNBDF/events.json","paper":"https://pith.science/paper/VKCMGOS6"},"agent_actions":{"view_html":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF","download_json":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF.json","view_paper":"https://pith.science/paper/VKCMGOS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00813&json=true","fetch_graph":"https://pith.science/api/pith-number/VKCMGOS6ZB55TEJN4CJ7FJNBDF/graph.json","fetch_events":"https://pith.science/api/pith-number/VKCMGOS6ZB55TEJN4CJ7FJNBDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/action/storage_attestation","attest_author":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/action/author_attestation","sign_citation":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/action/citation_signature","submit_replication":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/action/replication_record"}},"created_at":"2026-05-18T01:37:11.819254+00:00","updated_at":"2026-05-18T01:37:11.819254+00:00"}