{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CG6BAR6HZI6NPB5VB3TZNFMDYU","short_pith_number":"pith:CG6BAR6H","schema_version":"1.0","canonical_sha256":"11bc1047c7ca3cd787b50ee7969583c52c8b65b4c44a602516e28db515d79c69","source":{"kind":"arxiv","id":"1503.06365","version":1},"attestation_state":"computed","paper":{"title":"Factorization in Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Daniel Reidenbach, Jeffrey Shallit, Paul Bell","submitted_at":"2015-03-21T23:15:37Z","abstract_excerpt":"We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L). We observe that uf(L) need not be context-free if L is context-free.\n  Next, we consider variations on unique factorization. We define a notion of \"semi-unique\" factorization, where every factorization has the same number of terms, and show that, if L is regular or even finite, the s"},"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":"1503.06365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-21T23:15:37Z","cross_cats_sorted":[],"title_canon_sha256":"6f5a03204499c8c6038cd358af7775fdcf532e212cef178c438cd98548fba350","abstract_canon_sha256":"2bbe5eff59c836160d24275c64c6939dd60fc89025de8493bfcd1fc7f8d3cbb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.610688Z","signature_b64":"fXvfRTfIgX+5tfCXCHqk5/vXzsFvIOv/4AjZugqXF75TzF6t7NA9KpaqTkVURjyelPOhLoOCZGPMSNZoLnmAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11bc1047c7ca3cd787b50ee7969583c52c8b65b4c44a602516e28db515d79c69","last_reissued_at":"2026-05-18T02:20:38.610005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.610005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorization in Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Daniel Reidenbach, Jeffrey Shallit, Paul Bell","submitted_at":"2015-03-21T23:15:37Z","abstract_excerpt":"We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L). We observe that uf(L) need not be context-free if L is context-free.\n  Next, we consider variations on unique factorization. We define a notion of \"semi-unique\" factorization, where every factorization has the same number of terms, and show that, if L is regular or even finite, the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06365","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.06365","created_at":"2026-05-18T02:20:38.610098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06365v1","created_at":"2026-05-18T02:20:38.610098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06365","created_at":"2026-05-18T02:20:38.610098+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG6BAR6HZI6N","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG6BAR6HZI6NPB5V","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG6BAR6H","created_at":"2026-05-18T12:29:14.074870+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/CG6BAR6HZI6NPB5VB3TZNFMDYU","json":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU.json","graph_json":"https://pith.science/api/pith-number/CG6BAR6HZI6NPB5VB3TZNFMDYU/graph.json","events_json":"https://pith.science/api/pith-number/CG6BAR6HZI6NPB5VB3TZNFMDYU/events.json","paper":"https://pith.science/paper/CG6BAR6H"},"agent_actions":{"view_html":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU","download_json":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU.json","view_paper":"https://pith.science/paper/CG6BAR6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06365&json=true","fetch_graph":"https://pith.science/api/pith-number/CG6BAR6HZI6NPB5VB3TZNFMDYU/graph.json","fetch_events":"https://pith.science/api/pith-number/CG6BAR6HZI6NPB5VB3TZNFMDYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/action/storage_attestation","attest_author":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/action/author_attestation","sign_citation":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/action/citation_signature","submit_replication":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/action/replication_record"}},"created_at":"2026-05-18T02:20:38.610098+00:00","updated_at":"2026-05-18T02:20:38.610098+00:00"}