{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YWEFYGP7QJVBAFETRNF2FINWIS","short_pith_number":"pith:YWEFYGP7","schema_version":"1.0","canonical_sha256":"c5885c19ff826a1014938b4ba2a1b644a398c3f79cfbc2db412d84f7d0d68890","source":{"kind":"arxiv","id":"0901.4261","version":1},"attestation_state":"computed","paper":{"title":"Palindromes in infinite ternary words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edita Pelantova, Lubomira Balkova, Stepan Starosta","submitted_at":"2009-01-27T15:10:41Z","abstract_excerpt":"We study infinite words u over an alphabet A satisfying the property\n  P : P(n)+ P(n+1) = 1+ #A for any n in N, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words satisfying a stronger property PE: every palindrome of u has exactly one palindromic extension in u. For binary words, the properties P and PE coincide and these properties characterize Sturmian words, i.e., words with the complexity C(n)=n+1 for any n in N. In this paper, we focus on ternary infinite words with the language closed under reversal. For such wor"},"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":"0901.4261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-27T15:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"0a6cdb46e874aae212df72c11f0afcf3d23c221ec4159e8a2d5367145952d8a4","abstract_canon_sha256":"d07ea1cfeb5be2c23d8fb4450127e6bfad6383978cc9770fcc1f01a5ad540e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:12.499825Z","signature_b64":"RAn/dFcF+3b5NfD5ioBQcHFS4Oy98CT6XSKIG6OhTC2hI2ZspNs8gA0sXMZd0xDWOgjgQOwLJ5aGlx/tPQUhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5885c19ff826a1014938b4ba2a1b644a398c3f79cfbc2db412d84f7d0d68890","last_reissued_at":"2026-05-18T03:34:12.499348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:12.499348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palindromes in infinite ternary words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edita Pelantova, Lubomira Balkova, Stepan Starosta","submitted_at":"2009-01-27T15:10:41Z","abstract_excerpt":"We study infinite words u over an alphabet A satisfying the property\n  P : P(n)+ P(n+1) = 1+ #A for any n in N, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words satisfying a stronger property PE: every palindrome of u has exactly one palindromic extension in u. For binary words, the properties P and PE coincide and these properties characterize Sturmian words, i.e., words with the complexity C(n)=n+1 for any n in N. In this paper, we focus on ternary infinite words with the language closed under reversal. For such wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4261","kind":"arxiv","version":1},"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":"0901.4261","created_at":"2026-05-18T03:34:12.499423+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.4261v1","created_at":"2026-05-18T03:34:12.499423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4261","created_at":"2026-05-18T03:34:12.499423+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWEFYGP7QJVB","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWEFYGP7QJVBAFET","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWEFYGP7","created_at":"2026-05-18T12:26:02.257875+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/YWEFYGP7QJVBAFETRNF2FINWIS","json":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS.json","graph_json":"https://pith.science/api/pith-number/YWEFYGP7QJVBAFETRNF2FINWIS/graph.json","events_json":"https://pith.science/api/pith-number/YWEFYGP7QJVBAFETRNF2FINWIS/events.json","paper":"https://pith.science/paper/YWEFYGP7"},"agent_actions":{"view_html":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS","download_json":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS.json","view_paper":"https://pith.science/paper/YWEFYGP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.4261&json=true","fetch_graph":"https://pith.science/api/pith-number/YWEFYGP7QJVBAFETRNF2FINWIS/graph.json","fetch_events":"https://pith.science/api/pith-number/YWEFYGP7QJVBAFETRNF2FINWIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/action/storage_attestation","attest_author":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/action/author_attestation","sign_citation":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/action/citation_signature","submit_replication":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/action/replication_record"}},"created_at":"2026-05-18T03:34:12.499423+00:00","updated_at":"2026-05-18T03:34:12.499423+00:00"}