{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CG6BAR6HZI6NPB5VB3TZNFMDYU","short_pith_number":"pith:CG6BAR6H","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"},"canonical_sha256":"11bc1047c7ca3cd787b50ee7969583c52c8b65b4c44a602516e28db515d79c69","source":{"kind":"arxiv","id":"1503.06365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06365","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06365v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06365","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"CG6BAR6HZI6N","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CG6BAR6HZI6NPB5V","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CG6BAR6H","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CG6BAR6HZI6NPB5VB3TZNFMDYU","target":"record","payload":{"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"},"canonical_sha256":"11bc1047c7ca3cd787b50ee7969583c52c8b65b4c44a602516e28db515d79c69","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"},"source_kind":"arxiv","source_id":"1503.06365","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:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4cvj5Or99UEBrbiUb6pnDznimqm+uMMMNtEhzwQdiN8NTwinu1/c1mXdh78Ir9BZNjIC9VeBkSVCgj5UR7RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:39:05.629053Z"},"content_sha256":"91a6008b31c4bb1cff4ca7c82395caceac8fa3cb8a934287bf00b60037af4f94","schema_version":"1.0","event_id":"sha256:91a6008b31c4bb1cff4ca7c82395caceac8fa3cb8a934287bf00b60037af4f94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CG6BAR6HZI6NPB5VB3TZNFMDYU","target":"graph","payload":{"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"},"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:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0PYvF4X81hwyFDj565DwZjbaL2HihSMD1fC0INYgDyP4f6FEfJDLDlv7AqntasKmhebpYofEhyJQ/TgF4awBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:39:05.629413Z"},"content_sha256":"03af465a3c5c0e545db20efcf9ac453a36630744d45e55036b271c4b176a7c19","schema_version":"1.0","event_id":"sha256:03af465a3c5c0e545db20efcf9ac453a36630744d45e55036b271c4b176a7c19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/bundle.json","state_url":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/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-05T01:39:05Z","links":{"resolver":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU","bundle":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/bundle.json","state":"https://pith.science/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CG6BAR6HZI6NPB5VB3TZNFMDYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CG6BAR6HZI6NPB5VB3TZNFMDYU","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":"2bbe5eff59c836160d24275c64c6939dd60fc89025de8493bfcd1fc7f8d3cbb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-21T23:15:37Z","title_canon_sha256":"6f5a03204499c8c6038cd358af7775fdcf532e212cef178c438cd98548fba350"},"schema_version":"1.0","source":{"id":"1503.06365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06365","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06365v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06365","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"CG6BAR6HZI6N","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CG6BAR6HZI6NPB5V","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CG6BAR6H","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:03af465a3c5c0e545db20efcf9ac453a36630744d45e55036b271c4b176a7c19","target":"graph","created_at":"2026-05-18T02:20:38Z","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 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","authors_text":"Daniel Reidenbach, Jeffrey Shallit, Paul Bell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-21T23:15:37Z","title":"Factorization in Formal Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06365","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:91a6008b31c4bb1cff4ca7c82395caceac8fa3cb8a934287bf00b60037af4f94","target":"record","created_at":"2026-05-18T02:20:38Z","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":"2bbe5eff59c836160d24275c64c6939dd60fc89025de8493bfcd1fc7f8d3cbb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-21T23:15:37Z","title_canon_sha256":"6f5a03204499c8c6038cd358af7775fdcf532e212cef178c438cd98548fba350"},"schema_version":"1.0","source":{"id":"1503.06365","kind":"arxiv","version":1}},"canonical_sha256":"11bc1047c7ca3cd787b50ee7969583c52c8b65b4c44a602516e28db515d79c69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11bc1047c7ca3cd787b50ee7969583c52c8b65b4c44a602516e28db515d79c69","first_computed_at":"2026-05-18T02:20:38.610005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:38.610005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fXvfRTfIgX+5tfCXCHqk5/vXzsFvIOv/4AjZugqXF75TzF6t7NA9KpaqTkVURjyelPOhLoOCZGPMSNZoLnmAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:38.610688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91a6008b31c4bb1cff4ca7c82395caceac8fa3cb8a934287bf00b60037af4f94","sha256:03af465a3c5c0e545db20efcf9ac453a36630744d45e55036b271c4b176a7c19"],"state_sha256":"d736327fd31d66a919ecf5e3603503ea00729e6e50a1e691d1892dc74c713a7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asquB7t+VpYGUqrTB34LEvrBTlzXaXwhKxmQF8CfzCNgFjF29uG0T2L0XpFvC6z3gYIC1ZaSfYZ+aD9FOI3eBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:39:05.631430Z","bundle_sha256":"d75dd2bc85ac08350f83d5189725aa36ffcf80f51d2ca9fb375d924c46975ce4"}}