{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RX6NT7U35IMIRHVOEZX5SXVOS4","short_pith_number":"pith:RX6NT7U3","schema_version":"1.0","canonical_sha256":"8dfcd9fe9bea18889eae266fd95eae972ffc0778d6e7f17a25d5fb02a120e72f","source":{"kind":"arxiv","id":"1402.5843","version":5},"attestation_state":"computed","paper":{"title":"Cyclic Complexity of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Gabriele Fici, Julien Cassaigne, Luca Q. Zamboni, Marinella Sciortino","submitted_at":"2014-02-24T14:49:22Z","abstract_excerpt":"We introduce and study a complexity function on words $c_x(n),$ called \\emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity distinguishes between Sturmian words of different slopes. We prove that if $x$ is a Sturmian word and $y$ is a word having the same cyclic complexity of $x,$ then up to renaming "},"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":"1402.5843","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-02-24T14:49:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f069beee27c04a17e81a9e05dcd6ef4943c2cebd6af4e779150eff87814d8963","abstract_canon_sha256":"c1b00786334ed61a11260db9a7492290fc45f69f98c668e45cfdf2645cb2ade9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:51.925141Z","signature_b64":"TwNX8g1oYlZ54KOcD5PQ2j/aJtC7N+BbA7svZX4ieI/w+uYjgSvekIm0DOGevWzFBW6j7/1aJGRirP3Xb632DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dfcd9fe9bea18889eae266fd95eae972ffc0778d6e7f17a25d5fb02a120e72f","last_reissued_at":"2026-05-18T01:11:51.924807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:51.924807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic Complexity of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Gabriele Fici, Julien Cassaigne, Luca Q. Zamboni, Marinella Sciortino","submitted_at":"2014-02-24T14:49:22Z","abstract_excerpt":"We introduce and study a complexity function on words $c_x(n),$ called \\emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity distinguishes between Sturmian words of different slopes. We prove that if $x$ is a Sturmian word and $y$ is a word having the same cyclic complexity of $x,$ then up to renaming "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5843","kind":"arxiv","version":5},"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":"1402.5843","created_at":"2026-05-18T01:11:51.924863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5843v5","created_at":"2026-05-18T01:11:51.924863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5843","created_at":"2026-05-18T01:11:51.924863+00:00"},{"alias_kind":"pith_short_12","alias_value":"RX6NT7U35IMI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RX6NT7U35IMIRHVO","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RX6NT7U3","created_at":"2026-05-18T12:28:46.137349+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/RX6NT7U35IMIRHVOEZX5SXVOS4","json":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4.json","graph_json":"https://pith.science/api/pith-number/RX6NT7U35IMIRHVOEZX5SXVOS4/graph.json","events_json":"https://pith.science/api/pith-number/RX6NT7U35IMIRHVOEZX5SXVOS4/events.json","paper":"https://pith.science/paper/RX6NT7U3"},"agent_actions":{"view_html":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4","download_json":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4.json","view_paper":"https://pith.science/paper/RX6NT7U3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5843&json=true","fetch_graph":"https://pith.science/api/pith-number/RX6NT7U35IMIRHVOEZX5SXVOS4/graph.json","fetch_events":"https://pith.science/api/pith-number/RX6NT7U35IMIRHVOEZX5SXVOS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4/action/storage_attestation","attest_author":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4/action/author_attestation","sign_citation":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4/action/citation_signature","submit_replication":"https://pith.science/pith/RX6NT7U35IMIRHVOEZX5SXVOS4/action/replication_record"}},"created_at":"2026-05-18T01:11:51.924863+00:00","updated_at":"2026-05-18T01:11:51.924863+00:00"}