{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D2TEC4D7YJGIDFINDZVOIAM27Z","short_pith_number":"pith:D2TEC4D7","schema_version":"1.0","canonical_sha256":"1ea641707fc24c81950d1e6ae4019afe5eaf59143ab914b6cdc3eccd65416fbb","source":{"kind":"arxiv","id":"1512.01096","version":2},"attestation_state":"computed","paper":{"title":"A study on the curling number of graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, K.P. Chithra, N.K. Sudev, Sunny Joseph Kalayathankal, Susanth C","submitted_at":"2015-12-03T14:43:27Z","abstract_excerpt":"Given a finite nonempty sequence $S$ of integers, write it as $XY^k$, consisting of a prefix $X$ (which may possibly be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest such integer $k$ is called the curling number of $S$ and is denoted by $cn(S)$. The concept of curling number of sequences has already been extended to the degree sequences of graphs to define the curling number of a graph. In this paper we study the curling number of graph powers, graph products and certain other graph operations."},"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":"1512.01096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-12-03T14:43:27Z","cross_cats_sorted":[],"title_canon_sha256":"8694a1a830e8f2a69eff144d49552de41115d651a7cf036b53713d51a85f2640","abstract_canon_sha256":"8303c0062ff08f9e0b6c26ad8dd3aec05e80f730f0afd34163dd8c3f449e0f91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:12.775389Z","signature_b64":"6LTfaRqnSLRZZ3Ijr2I7pUtVf6Yfn8FATXJHnLV+a6qHZP1bZwzSkPba+CW7k5r8P/n4h2RWny3ucPR2mne+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea641707fc24c81950d1e6ae4019afe5eaf59143ab914b6cdc3eccd65416fbb","last_reissued_at":"2026-05-18T01:12:12.774945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:12.774945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study on the curling number of graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, K.P. Chithra, N.K. Sudev, Sunny Joseph Kalayathankal, Susanth C","submitted_at":"2015-12-03T14:43:27Z","abstract_excerpt":"Given a finite nonempty sequence $S$ of integers, write it as $XY^k$, consisting of a prefix $X$ (which may possibly be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest such integer $k$ is called the curling number of $S$ and is denoted by $cn(S)$. The concept of curling number of sequences has already been extended to the degree sequences of graphs to define the curling number of a graph. In this paper we study the curling number of graph powers, graph products and certain other graph operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01096","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":"1512.01096","created_at":"2026-05-18T01:12:12.775034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01096v2","created_at":"2026-05-18T01:12:12.775034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01096","created_at":"2026-05-18T01:12:12.775034+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2TEC4D7YJGI","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2TEC4D7YJGIDFIN","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2TEC4D7","created_at":"2026-05-18T12:29:17.054201+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/D2TEC4D7YJGIDFINDZVOIAM27Z","json":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z.json","graph_json":"https://pith.science/api/pith-number/D2TEC4D7YJGIDFINDZVOIAM27Z/graph.json","events_json":"https://pith.science/api/pith-number/D2TEC4D7YJGIDFINDZVOIAM27Z/events.json","paper":"https://pith.science/paper/D2TEC4D7"},"agent_actions":{"view_html":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z","download_json":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z.json","view_paper":"https://pith.science/paper/D2TEC4D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01096&json=true","fetch_graph":"https://pith.science/api/pith-number/D2TEC4D7YJGIDFINDZVOIAM27Z/graph.json","fetch_events":"https://pith.science/api/pith-number/D2TEC4D7YJGIDFINDZVOIAM27Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z/action/storage_attestation","attest_author":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z/action/author_attestation","sign_citation":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z/action/citation_signature","submit_replication":"https://pith.science/pith/D2TEC4D7YJGIDFINDZVOIAM27Z/action/replication_record"}},"created_at":"2026-05-18T01:12:12.775034+00:00","updated_at":"2026-05-18T01:12:12.775034+00:00"}