{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:24K6AWU3A32WRGBAYTUEJWMFUA","short_pith_number":"pith:24K6AWU3","schema_version":"1.0","canonical_sha256":"d715e05a9b06f5689820c4e844d985a02bc270f0c574d2c88bb6484dfcf020ff","source":{"kind":"arxiv","id":"1207.5124","version":3},"attestation_state":"computed","paper":{"title":"Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Daniel Goc, Jeffrey Shallit, Kalle Saari","submitted_at":"2012-07-21T11:55:09Z","abstract_excerpt":"We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-automatic sequence is itself k-automatic. We also show that the function counting the number of primitive factors (resp., Lyndon factors) of length n in a k-automatic sequence is k-regular. Finally, we show that the number of Lyndon factors of a linearly recurrent sequence is bounded."},"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":"1207.5124","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-07-21T11:55:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f39910e685e58b2dfca1bac6f5dc3e6a701885a9b6061268c3de64dc836321f","abstract_canon_sha256":"156c923faf5d89258c2dea90b3e0e0c01aa41ace063193b071ce7a6d94fe081e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:21.273398Z","signature_b64":"BPZqe6vjCdPn5WuAKuCMxuINac+KSU67UScIowoMRiZyKYEwQzV+iq/O5VTrQ8ki4oLHiVSNFMSfA/EMLaW6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d715e05a9b06f5689820c4e844d985a02bc270f0c574d2c88bb6484dfcf020ff","last_reissued_at":"2026-05-18T03:41:21.272648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:21.272648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Daniel Goc, Jeffrey Shallit, Kalle Saari","submitted_at":"2012-07-21T11:55:09Z","abstract_excerpt":"We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-automatic sequence is itself k-automatic. We also show that the function counting the number of primitive factors (resp., Lyndon factors) of length n in a k-automatic sequence is k-regular. Finally, we show that the number of Lyndon factors of a linearly recurrent sequence is bounded."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5124","kind":"arxiv","version":3},"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":"1207.5124","created_at":"2026-05-18T03:41:21.272773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5124v3","created_at":"2026-05-18T03:41:21.272773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5124","created_at":"2026-05-18T03:41:21.272773+00:00"},{"alias_kind":"pith_short_12","alias_value":"24K6AWU3A32W","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"24K6AWU3A32WRGBA","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"24K6AWU3","created_at":"2026-05-18T12:26:50.516681+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/24K6AWU3A32WRGBAYTUEJWMFUA","json":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA.json","graph_json":"https://pith.science/api/pith-number/24K6AWU3A32WRGBAYTUEJWMFUA/graph.json","events_json":"https://pith.science/api/pith-number/24K6AWU3A32WRGBAYTUEJWMFUA/events.json","paper":"https://pith.science/paper/24K6AWU3"},"agent_actions":{"view_html":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA","download_json":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA.json","view_paper":"https://pith.science/paper/24K6AWU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5124&json=true","fetch_graph":"https://pith.science/api/pith-number/24K6AWU3A32WRGBAYTUEJWMFUA/graph.json","fetch_events":"https://pith.science/api/pith-number/24K6AWU3A32WRGBAYTUEJWMFUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA/action/storage_attestation","attest_author":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA/action/author_attestation","sign_citation":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA/action/citation_signature","submit_replication":"https://pith.science/pith/24K6AWU3A32WRGBAYTUEJWMFUA/action/replication_record"}},"created_at":"2026-05-18T03:41:21.272773+00:00","updated_at":"2026-05-18T03:41:21.272773+00:00"}