{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4JJ4VPUBZLPWGXQI7X7BP4IJAR","short_pith_number":"pith:4JJ4VPUB","schema_version":"1.0","canonical_sha256":"e253cabe81cadf635e08fdfe17f1090445d2403ca831a41114719cbaca08953d","source":{"kind":"arxiv","id":"1210.6179","version":2},"attestation_state":"computed","paper":{"title":"On minimal factorizations of words as products of palindromes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna E. Frid, Luca Zamboni, Svetlana Puzynina","submitted_at":"2012-10-23T10:03:31Z","abstract_excerpt":"Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic word w and a positive integer P such that |u|_{pal}<P for each factor u of w? We give a partial answer to this question by proving that if an infinite word w satisfies the so-called (k,l)-condition for some k and l, then for each positive integer P there exists a factor u of w whose palindromic length |u|_{pal}>P. In particular, the result holds for all the k-"},"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":"1210.6179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T10:03:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e6e7cb03fbcf9ff52503b205ae201d70d1f5d49653e81ff1a6b1ba910536229c","abstract_canon_sha256":"0d49543651453632c6bd5bc30b2b0b7cfa099705095da011aee5645632644eba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:25.073844Z","signature_b64":"k92SVuFxK/rPtibptcv3xAmHwfySMW5OBUt3LMwUnMAhfWoef+sA4VAlKuX6T4pt2jYi8YMB5MFp/ac3xrFOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e253cabe81cadf635e08fdfe17f1090445d2403ca831a41114719cbaca08953d","last_reissued_at":"2026-05-18T03:42:25.073380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:25.073380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On minimal factorizations of words as products of palindromes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna E. Frid, Luca Zamboni, Svetlana Puzynina","submitted_at":"2012-10-23T10:03:31Z","abstract_excerpt":"Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic word w and a positive integer P such that |u|_{pal}<P for each factor u of w? We give a partial answer to this question by proving that if an infinite word w satisfies the so-called (k,l)-condition for some k and l, then for each positive integer P there exists a factor u of w whose palindromic length |u|_{pal}>P. In particular, the result holds for all the k-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6179","kind":"arxiv","version":2},"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":"1210.6179","created_at":"2026-05-18T03:42:25.073455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6179v2","created_at":"2026-05-18T03:42:25.073455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6179","created_at":"2026-05-18T03:42:25.073455+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JJ4VPUBZLPW","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JJ4VPUBZLPWGXQI","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JJ4VPUB","created_at":"2026-05-18T12:26:53.410803+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/4JJ4VPUBZLPWGXQI7X7BP4IJAR","json":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR.json","graph_json":"https://pith.science/api/pith-number/4JJ4VPUBZLPWGXQI7X7BP4IJAR/graph.json","events_json":"https://pith.science/api/pith-number/4JJ4VPUBZLPWGXQI7X7BP4IJAR/events.json","paper":"https://pith.science/paper/4JJ4VPUB"},"agent_actions":{"view_html":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR","download_json":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR.json","view_paper":"https://pith.science/paper/4JJ4VPUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6179&json=true","fetch_graph":"https://pith.science/api/pith-number/4JJ4VPUBZLPWGXQI7X7BP4IJAR/graph.json","fetch_events":"https://pith.science/api/pith-number/4JJ4VPUBZLPWGXQI7X7BP4IJAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/action/storage_attestation","attest_author":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/action/author_attestation","sign_citation":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/action/citation_signature","submit_replication":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/action/replication_record"}},"created_at":"2026-05-18T03:42:25.073455+00:00","updated_at":"2026-05-18T03:42:25.073455+00:00"}