{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y4SABCAZFDNXGN5AVP6Y7V5HGR","short_pith_number":"pith:Y4SABCAZ","schema_version":"1.0","canonical_sha256":"c72400881928db7337a0abfd8fd7a7347ef0cc333d802770c5d1b255a0cc8376","source":{"kind":"arxiv","id":"2503.00960","version":1},"attestation_state":"computed","paper":{"title":"Mapping words to powers by morphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Aleksi Saarela","submitted_at":"2025-03-02T16:58:38Z","abstract_excerpt":"We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant factor if there is no restriction on the size of the alphabet. We also prove that, for any integer $n \\geq 2$, deciding whether a given word can be mapped to an $n$th power by a nonperiodic morphism is NP-hard and in PSPACE, and so is deciding whether a given word can be mapped to a nonprimitive word by a nonperiodic morphism."},"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":"2503.00960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2025-03-02T16:58:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d6f53e11730a5288095df2ea185c54cac1904c90c201812d22fc0c5799b65c74","abstract_canon_sha256":"331e00cef3a655e891dca34271aa0ef6cc10c753985de582914c63ed8fdbb2d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:33.722661Z","signature_b64":"F7md/H7BqJsiW/xVlx+tIFVRi1J+OUPt0U5OQzW292KXCaEVL+itmnGMF8Ivj8KGLLlzbmiXD9dk8IadBjCmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c72400881928db7337a0abfd8fd7a7347ef0cc333d802770c5d1b255a0cc8376","last_reissued_at":"2026-07-05T10:22:33.722159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:33.722159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mapping words to powers by morphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Aleksi Saarela","submitted_at":"2025-03-02T16:58:38Z","abstract_excerpt":"We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant factor if there is no restriction on the size of the alphabet. We also prove that, for any integer $n \\geq 2$, deciding whether a given word can be mapped to an $n$th power by a nonperiodic morphism is NP-hard and in PSPACE, and so is deciding whether a given word can be mapped to a nonprimitive word by a nonperiodic morphism."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.00960","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.00960/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.00960","created_at":"2026-07-05T10:22:33.722222+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.00960v1","created_at":"2026-07-05T10:22:33.722222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.00960","created_at":"2026-07-05T10:22:33.722222+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4SABCAZFDNX","created_at":"2026-07-05T10:22:33.722222+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4SABCAZFDNXGN5A","created_at":"2026-07-05T10:22:33.722222+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4SABCAZ","created_at":"2026-07-05T10:22:33.722222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04091","citing_title":"Mapped Exponent and Asymptotic Critical Exponent of Words","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR","json":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR.json","graph_json":"https://pith.science/api/pith-number/Y4SABCAZFDNXGN5AVP6Y7V5HGR/graph.json","events_json":"https://pith.science/api/pith-number/Y4SABCAZFDNXGN5AVP6Y7V5HGR/events.json","paper":"https://pith.science/paper/Y4SABCAZ"},"agent_actions":{"view_html":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR","download_json":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR.json","view_paper":"https://pith.science/paper/Y4SABCAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.00960&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4SABCAZFDNXGN5AVP6Y7V5HGR/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4SABCAZFDNXGN5AVP6Y7V5HGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR/action/storage_attestation","attest_author":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR/action/author_attestation","sign_citation":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR/action/citation_signature","submit_replication":"https://pith.science/pith/Y4SABCAZFDNXGN5AVP6Y7V5HGR/action/replication_record"}},"created_at":"2026-07-05T10:22:33.722222+00:00","updated_at":"2026-07-05T10:22:33.722222+00:00"}