{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H4H5AWLZZ5RTS5USXW6XS7XV73","short_pith_number":"pith:H4H5AWLZ","canonical_record":{"source":{"id":"1505.02309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T20:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"fc835a788929536f6af50f40774cf03f5710f8789c0220a292fed4e6748e92f1","abstract_canon_sha256":"da0e0b479a55a47cdba4519f670e4f3301ab23e64e1699ee06db6e471948e470"},"schema_version":"1.0"},"canonical_sha256":"3f0fd05979cf63397692bdbd797ef5feff780679f29e65685da6f9d7b610512a","source":{"kind":"arxiv","id":"1505.02309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02309","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02309v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02309","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"H4H5AWLZZ5RT","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H4H5AWLZZ5RTS5US","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H4H5AWLZ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H4H5AWLZZ5RTS5USXW6XS7XV73","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T20:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"fc835a788929536f6af50f40774cf03f5710f8789c0220a292fed4e6748e92f1","abstract_canon_sha256":"da0e0b479a55a47cdba4519f670e4f3301ab23e64e1699ee06db6e471948e470"},"schema_version":"1.0"},"canonical_sha256":"3f0fd05979cf63397692bdbd797ef5feff780679f29e65685da6f9d7b610512a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.240876Z","signature_b64":"ZI2lRdoqc+7sqxjarnhjweQUZIFzZe/qpoFp9tzWdJ9qcIi5Md0VvCH60eLyGMWChkKtBHWBOpwSCTXPerQfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f0fd05979cf63397692bdbd797ef5feff780679f29e65685da6f9d7b610512a","last_reissued_at":"2026-05-18T02:16:19.240238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.240238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02309","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8YhXURTeNo+04SgmTvgiheerHfwq8gUszFFLVKGbRMvuh6m9xfJM7qX4aFJeS1s2pP+2mjDbnhN/jlclmcFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:40:33.854536Z"},"content_sha256":"0d8a433cf84da013d63b3fd7ccb71d25541587f88c8a970ab03df656edc9a0e3","schema_version":"1.0","event_id":"sha256:0d8a433cf84da013d63b3fd7ccb71d25541587f88c8a970ab03df656edc9a0e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H4H5AWLZZ5RTS5USXW6XS7XV73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On prefixal factorizations of words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo de Luca, Luca Q. Zamboni","submitted_at":"2015-05-09T20:00:16Z","abstract_excerpt":"We consider the class ${\\cal P}_1$ of all infinite words $x\\in A^\\omega$ over a finite alphabet $A$ admitting a prefixal factorization, i.e., a factorization $x= U_0 U_1U_2 \\cdots $ where each $U_i$ is a non-empty prefix of $x.$ With each $x\\in {\\cal P}_1$ one naturally associates a \"derived\" infinite word $\\delta(x)$ which may or may not admit a prefixal factorization. We are interested in the class ${\\cal P}_{\\infty}$ of all words $x$ of ${\\cal P}_1$ such that $\\delta^n(x) \\in {\\cal P}_1$ for all $n\\geq 1$. Our primary motivation for studying the class ${\\cal P}_{\\infty}$ stems from its conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02309","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhQuZymIaJUtiFLLYqFg0ZCO/AIsBrCnERCo6hJs3uVEMtowo08QFBHImZ5gvNQzhBDNtZYDuCGus+vANkyYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:40:33.854875Z"},"content_sha256":"dee58f4177523e5b90eb5073f72e0fb138a108cd2125890f8aca1e1062d6f07f","schema_version":"1.0","event_id":"sha256:dee58f4177523e5b90eb5073f72e0fb138a108cd2125890f8aca1e1062d6f07f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4H5AWLZZ5RTS5USXW6XS7XV73/bundle.json","state_url":"https://pith.science/pith/H4H5AWLZZ5RTS5USXW6XS7XV73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4H5AWLZZ5RTS5USXW6XS7XV73/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-05T04:40:33Z","links":{"resolver":"https://pith.science/pith/H4H5AWLZZ5RTS5USXW6XS7XV73","bundle":"https://pith.science/pith/H4H5AWLZZ5RTS5USXW6XS7XV73/bundle.json","state":"https://pith.science/pith/H4H5AWLZZ5RTS5USXW6XS7XV73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4H5AWLZZ5RTS5USXW6XS7XV73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H4H5AWLZZ5RTS5USXW6XS7XV73","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":"da0e0b479a55a47cdba4519f670e4f3301ab23e64e1699ee06db6e471948e470","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T20:00:16Z","title_canon_sha256":"fc835a788929536f6af50f40774cf03f5710f8789c0220a292fed4e6748e92f1"},"schema_version":"1.0","source":{"id":"1505.02309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02309","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02309v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02309","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"H4H5AWLZZ5RT","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H4H5AWLZZ5RTS5US","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H4H5AWLZ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:dee58f4177523e5b90eb5073f72e0fb138a108cd2125890f8aca1e1062d6f07f","target":"graph","created_at":"2026-05-18T02:16:19Z","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 consider the class ${\\cal P}_1$ of all infinite words $x\\in A^\\omega$ over a finite alphabet $A$ admitting a prefixal factorization, i.e., a factorization $x= U_0 U_1U_2 \\cdots $ where each $U_i$ is a non-empty prefix of $x.$ With each $x\\in {\\cal P}_1$ one naturally associates a \"derived\" infinite word $\\delta(x)$ which may or may not admit a prefixal factorization. We are interested in the class ${\\cal P}_{\\infty}$ of all words $x$ of ${\\cal P}_1$ such that $\\delta^n(x) \\in {\\cal P}_1$ for all $n\\geq 1$. Our primary motivation for studying the class ${\\cal P}_{\\infty}$ stems from its conn","authors_text":"Aldo de Luca, Luca Q. Zamboni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T20:00:16Z","title":"On prefixal factorizations of words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02309","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:0d8a433cf84da013d63b3fd7ccb71d25541587f88c8a970ab03df656edc9a0e3","target":"record","created_at":"2026-05-18T02:16:19Z","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":"da0e0b479a55a47cdba4519f670e4f3301ab23e64e1699ee06db6e471948e470","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T20:00:16Z","title_canon_sha256":"fc835a788929536f6af50f40774cf03f5710f8789c0220a292fed4e6748e92f1"},"schema_version":"1.0","source":{"id":"1505.02309","kind":"arxiv","version":1}},"canonical_sha256":"3f0fd05979cf63397692bdbd797ef5feff780679f29e65685da6f9d7b610512a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f0fd05979cf63397692bdbd797ef5feff780679f29e65685da6f9d7b610512a","first_computed_at":"2026-05-18T02:16:19.240238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.240238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZI2lRdoqc+7sqxjarnhjweQUZIFzZe/qpoFp9tzWdJ9qcIi5Md0VvCH60eLyGMWChkKtBHWBOpwSCTXPerQfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.240876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d8a433cf84da013d63b3fd7ccb71d25541587f88c8a970ab03df656edc9a0e3","sha256:dee58f4177523e5b90eb5073f72e0fb138a108cd2125890f8aca1e1062d6f07f"],"state_sha256":"11461bb675b8e77f4474e3c030ee0434bc7a6305bdf1033a79ea018098adf2cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Z/bbsPkWjs5W0nnLxXergfJVgnRKk6iOJjRIkbZeFtP19KdP6tpY+Dm7qmMhVKv/DHU1ab0kP2T15TEzLEbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T04:40:33.856767Z","bundle_sha256":"17b5e8d8b9c862d8817ffc1de3080a58ec366e7c82fa050bdf7dcda9e279f11c"}}