{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VKCMGOS6ZB55TEJN4CJ7FJNBDF","short_pith_number":"pith:VKCMGOS6","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"},"canonical_sha256":"aa84c33a5ec87bd9912de093f2a5a11943dbe4cb7f371724536d139ba6f26b8b","source":{"kind":"arxiv","id":"1506.00813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00813","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00813v2","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00813","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"VKCMGOS6ZB55","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKCMGOS6ZB55TEJN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKCMGOS6","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VKCMGOS6ZB55TEJN4CJ7FJNBDF","target":"record","payload":{"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"},"canonical_sha256":"aa84c33a5ec87bd9912de093f2a5a11943dbe4cb7f371724536d139ba6f26b8b","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"},"source_kind":"arxiv","source_id":"1506.00813","source_version":2,"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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skY440T8wkpS8y38iGCA/YZWoIR3fG1MXsoNf1WyHI2BrUnFqLtmuPllHORhxdSIF2fDNpDxG7z6zRk0Ge24Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:30:53.246243Z"},"content_sha256":"dd7acc3d2008265d431731f20550f9ae4fbd045c844c7bd21acab03a9754b688","schema_version":"1.0","event_id":"sha256:dd7acc3d2008265d431731f20550f9ae4fbd045c844c7bd21acab03a9754b688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VKCMGOS6ZB55TEJN4CJ7FJNBDF","target":"graph","payload":{"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"},"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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjXBlqlGYXq5mCZQj5EF1fM/kJGuPk4AX9EXsmTuaYSQ6eNm+EAfI1QVyYFf6J5VaQFyI1ctIb6Kq9WOEWHsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:30:53.246599Z"},"content_sha256":"f444a1c7333f1b7f26b9508e6a420aa9141e0c0f897f564a4e49c66c9a316ba2","schema_version":"1.0","event_id":"sha256:f444a1c7333f1b7f26b9508e6a420aa9141e0c0f897f564a4e49c66c9a316ba2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/bundle.json","state_url":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/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-03T21:30:53Z","links":{"resolver":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF","bundle":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/bundle.json","state":"https://pith.science/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKCMGOS6ZB55TEJN4CJ7FJNBDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VKCMGOS6ZB55TEJN4CJ7FJNBDF","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":"093d5d515f0ea9f09e90cdb50383f1498771e2d9a1816de920072233432e8e6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-06-02T09:44:49Z","title_canon_sha256":"80c9d2f15c763fce37a15b547f69995200639b0b72883a25b5e79d67c650ae7c"},"schema_version":"1.0","source":{"id":"1506.00813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00813","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00813v2","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00813","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"VKCMGOS6ZB55","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKCMGOS6ZB55TEJN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKCMGOS6","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f444a1c7333f1b7f26b9508e6a420aa9141e0c0f897f564a4e49c66c9a316ba2","target":"graph","created_at":"2026-05-18T01:37:11Z","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":"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 ","authors_text":"Chithra Sudev, Johan Kok, Naduvath Sudev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-06-02T09:44:49Z","title":"On the Curling Number of Certain Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00813","kind":"arxiv","version":2},"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:dd7acc3d2008265d431731f20550f9ae4fbd045c844c7bd21acab03a9754b688","target":"record","created_at":"2026-05-18T01:37:11Z","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":"093d5d515f0ea9f09e90cdb50383f1498771e2d9a1816de920072233432e8e6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-06-02T09:44:49Z","title_canon_sha256":"80c9d2f15c763fce37a15b547f69995200639b0b72883a25b5e79d67c650ae7c"},"schema_version":"1.0","source":{"id":"1506.00813","kind":"arxiv","version":2}},"canonical_sha256":"aa84c33a5ec87bd9912de093f2a5a11943dbe4cb7f371724536d139ba6f26b8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa84c33a5ec87bd9912de093f2a5a11943dbe4cb7f371724536d139ba6f26b8b","first_computed_at":"2026-05-18T01:37:11.819144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:11.819144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nlYRnutDnrBTMmpGfxPRJWqBN/j7RuNAHA9WkkUNLVR/Auq9eO9bC+uJfuqWEpDLzTWmHYAXj/SQXIvGu1WyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:11.819839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd7acc3d2008265d431731f20550f9ae4fbd045c844c7bd21acab03a9754b688","sha256:f444a1c7333f1b7f26b9508e6a420aa9141e0c0f897f564a4e49c66c9a316ba2"],"state_sha256":"240fd1d5b851e61b321f446f1d9e64108518dc09e181e15fbabeaf867ce75411"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mqdbi1vHgm+ZoaFbT3LpZHE43g4iv0JNoeon2NUun23ma/D0eY+bdqG5RdHoUyWNbXH++wQWewkwGLZjgz82AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:30:53.248532Z","bundle_sha256":"338e1960180ad697bdec1281c9ea412b6dd5069b33f19b7e58f2d8d875eb23ad"}}