{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:YWEFYGP7QJVBAFETRNF2FINWIS","short_pith_number":"pith:YWEFYGP7","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"},"canonical_sha256":"c5885c19ff826a1014938b4ba2a1b644a398c3f79cfbc2db412d84f7d0d68890","source":{"kind":"arxiv","id":"0901.4261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4261","created_at":"2026-05-18T03:34:12Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4261v1","created_at":"2026-05-18T03:34:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4261","created_at":"2026-05-18T03:34:12Z"},{"alias_kind":"pith_short_12","alias_value":"YWEFYGP7QJVB","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"YWEFYGP7QJVBAFET","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"YWEFYGP7","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:YWEFYGP7QJVBAFETRNF2FINWIS","target":"record","payload":{"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"},"canonical_sha256":"c5885c19ff826a1014938b4ba2a1b644a398c3f79cfbc2db412d84f7d0d68890","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"},"source_kind":"arxiv","source_id":"0901.4261","source_version":1,"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-18T03:34:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnhpxBO/uEzLQm5ejirjz32Ii/NVDoyoImoq7L1awt00wFVXuWlSMhQ1mvqr07+hgibQGaETzJUyBfWNMdt2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:35:22.491222Z"},"content_sha256":"10c78693b7952615afaf8ec8fbfff05d8dd2f57a0caa322a5a7a2ddc79d52a8b","schema_version":"1.0","event_id":"sha256:10c78693b7952615afaf8ec8fbfff05d8dd2f57a0caa322a5a7a2ddc79d52a8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:YWEFYGP7QJVBAFETRNF2FINWIS","target":"graph","payload":{"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"},"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-18T03:34:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzVaAgA8CKtpDJZJe2qBrXu1/+mC30t5Nvi/xo6LidTQ1pdcHlq73W1pt1rhI78g7UuFw6KmklQ54FlNsYPmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:35:22.491582Z"},"content_sha256":"5ff8df2e0f41cc2a14645291262b28999d6723b4b70bedbfcc53bfb3eb34c274","schema_version":"1.0","event_id":"sha256:5ff8df2e0f41cc2a14645291262b28999d6723b4b70bedbfcc53bfb3eb34c274"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/bundle.json","state_url":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWEFYGP7QJVBAFETRNF2FINWIS/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-07-01T18:35:22Z","links":{"resolver":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS","bundle":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/bundle.json","state":"https://pith.science/pith/YWEFYGP7QJVBAFETRNF2FINWIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWEFYGP7QJVBAFETRNF2FINWIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:YWEFYGP7QJVBAFETRNF2FINWIS","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":"d07ea1cfeb5be2c23d8fb4450127e6bfad6383978cc9770fcc1f01a5ad540e00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-27T15:10:41Z","title_canon_sha256":"0a6cdb46e874aae212df72c11f0afcf3d23c221ec4159e8a2d5367145952d8a4"},"schema_version":"1.0","source":{"id":"0901.4261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4261","created_at":"2026-05-18T03:34:12Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4261v1","created_at":"2026-05-18T03:34:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4261","created_at":"2026-05-18T03:34:12Z"},{"alias_kind":"pith_short_12","alias_value":"YWEFYGP7QJVB","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"YWEFYGP7QJVBAFET","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"YWEFYGP7","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:5ff8df2e0f41cc2a14645291262b28999d6723b4b70bedbfcc53bfb3eb34c274","target":"graph","created_at":"2026-05-18T03:34:12Z","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":"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","authors_text":"Edita Pelantova, Lubomira Balkova, Stepan Starosta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-27T15:10:41Z","title":"Palindromes in infinite ternary words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4261","kind":"arxiv","version":1},"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:10c78693b7952615afaf8ec8fbfff05d8dd2f57a0caa322a5a7a2ddc79d52a8b","target":"record","created_at":"2026-05-18T03:34:12Z","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":"d07ea1cfeb5be2c23d8fb4450127e6bfad6383978cc9770fcc1f01a5ad540e00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-27T15:10:41Z","title_canon_sha256":"0a6cdb46e874aae212df72c11f0afcf3d23c221ec4159e8a2d5367145952d8a4"},"schema_version":"1.0","source":{"id":"0901.4261","kind":"arxiv","version":1}},"canonical_sha256":"c5885c19ff826a1014938b4ba2a1b644a398c3f79cfbc2db412d84f7d0d68890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5885c19ff826a1014938b4ba2a1b644a398c3f79cfbc2db412d84f7d0d68890","first_computed_at":"2026-05-18T03:34:12.499348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:12.499348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RAn/dFcF+3b5NfD5ioBQcHFS4Oy98CT6XSKIG6OhTC2hI2ZspNs8gA0sXMZd0xDWOgjgQOwLJ5aGlx/tPQUhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:12.499825Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.4261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c78693b7952615afaf8ec8fbfff05d8dd2f57a0caa322a5a7a2ddc79d52a8b","sha256:5ff8df2e0f41cc2a14645291262b28999d6723b4b70bedbfcc53bfb3eb34c274"],"state_sha256":"a10620bf9927ec84b1a919663a0c59213ebacb8ce4e12335f75c32d5b26f9c25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXOZulPgv7qSJAuHKtJZxngIz3uBY8dstar4IcBBtVlIfn9FuxOdHwUaqUiGTm2QPTvHN6dmtZ6imRSCQzARAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:35:22.493446Z","bundle_sha256":"2e7876d3af043f29bc5e9d27f9677e7d21c2d7146309e0f6e8b96c7862e973b0"}}