{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4JJ4VPUBZLPWGXQI7X7BP4IJAR","short_pith_number":"pith:4JJ4VPUB","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"},"canonical_sha256":"e253cabe81cadf635e08fdfe17f1090445d2403ca831a41114719cbaca08953d","source":{"kind":"arxiv","id":"1210.6179","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6179","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6179v2","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6179","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"4JJ4VPUBZLPW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JJ4VPUBZLPWGXQI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JJ4VPUB","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4JJ4VPUBZLPWGXQI7X7BP4IJAR","target":"record","payload":{"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"},"canonical_sha256":"e253cabe81cadf635e08fdfe17f1090445d2403ca831a41114719cbaca08953d","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"},"source_kind":"arxiv","source_id":"1210.6179","source_version":2,"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:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHLMFx+W44+96syTSXeRa8k92Wa+DyofKDOFNS7uKY7BFZORmEVE25B9gHC227jejgVFSMUpEOEZ2plDwjAADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:21:53.489050Z"},"content_sha256":"957309984a664be3fa8d6c304785c63ab45c82cdb5c245afdc4332e6db0256c5","schema_version":"1.0","event_id":"sha256:957309984a664be3fa8d6c304785c63ab45c82cdb5c245afdc4332e6db0256c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4JJ4VPUBZLPWGXQI7X7BP4IJAR","target":"graph","payload":{"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"},"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:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+K0wKlowXpy9gsx1o3L7kmRtOW3T982PpWdOPuPB5YE0oSlUiOH8xEFKjI4xJ+sgkch/Qsl9zIcIIKYNtzXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:21:53.489523Z"},"content_sha256":"97f63a3dbcba238e57d1935880a4e9494bb9f4e690212661d9fb8d5f9faaed07","schema_version":"1.0","event_id":"sha256:97f63a3dbcba238e57d1935880a4e9494bb9f4e690212661d9fb8d5f9faaed07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/bundle.json","state_url":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/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-06-24T06:21:53Z","links":{"resolver":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR","bundle":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/bundle.json","state":"https://pith.science/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JJ4VPUBZLPWGXQI7X7BP4IJAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4JJ4VPUBZLPWGXQI7X7BP4IJAR","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":"0d49543651453632c6bd5bc30b2b0b7cfa099705095da011aee5645632644eba","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T10:03:31Z","title_canon_sha256":"e6e7cb03fbcf9ff52503b205ae201d70d1f5d49653e81ff1a6b1ba910536229c"},"schema_version":"1.0","source":{"id":"1210.6179","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6179","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6179v2","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6179","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"4JJ4VPUBZLPW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4JJ4VPUBZLPWGXQI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4JJ4VPUB","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:97f63a3dbcba238e57d1935880a4e9494bb9f4e690212661d9fb8d5f9faaed07","target":"graph","created_at":"2026-05-18T03:42:25Z","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":"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-","authors_text":"Anna E. Frid, Luca Zamboni, Svetlana Puzynina","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T10:03:31Z","title":"On minimal factorizations of words as products of palindromes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6179","kind":"arxiv","version":2},"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:957309984a664be3fa8d6c304785c63ab45c82cdb5c245afdc4332e6db0256c5","target":"record","created_at":"2026-05-18T03:42:25Z","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":"0d49543651453632c6bd5bc30b2b0b7cfa099705095da011aee5645632644eba","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T10:03:31Z","title_canon_sha256":"e6e7cb03fbcf9ff52503b205ae201d70d1f5d49653e81ff1a6b1ba910536229c"},"schema_version":"1.0","source":{"id":"1210.6179","kind":"arxiv","version":2}},"canonical_sha256":"e253cabe81cadf635e08fdfe17f1090445d2403ca831a41114719cbaca08953d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e253cabe81cadf635e08fdfe17f1090445d2403ca831a41114719cbaca08953d","first_computed_at":"2026-05-18T03:42:25.073380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:25.073380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k92SVuFxK/rPtibptcv3xAmHwfySMW5OBUt3LMwUnMAhfWoef+sA4VAlKuX6T4pt2jYi8YMB5MFp/ac3xrFOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:25.073844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6179","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:957309984a664be3fa8d6c304785c63ab45c82cdb5c245afdc4332e6db0256c5","sha256:97f63a3dbcba238e57d1935880a4e9494bb9f4e690212661d9fb8d5f9faaed07"],"state_sha256":"e75a5cb039f7e6e51f2d47962a6c7955098bf8664d6cf5eb8ce489a779025d90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWXiO4I+qV2Xnvt0lrhJsU4xBussymY3VPh77HpfJHZwJjvRaTs0MHz8NerR1/PC0uEDBzSvVUDKrN3jTQfpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:21:53.491966Z","bundle_sha256":"fe3c6aa23d7ea1d05ba3a6d944010e6a0686de74105551f63c7c510f19085dd6"}}