{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O5PE3MQJCFBSBLGFQU2TW3TMQ7","short_pith_number":"pith:O5PE3MQJ","canonical_record":{"source":{"id":"1503.01068","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2015-03-03T19:19:56Z","cross_cats_sorted":[],"title_canon_sha256":"27f1327c47676f8bf4163d5ebbc1be582a427a5af1b7d2c3c09e18da13840d40","abstract_canon_sha256":"d3a172124da604c8ae835ee8305daf14ff8f5612ff95e470edbe3b1820908eb4"},"schema_version":"1.0"},"canonical_sha256":"775e4db209114320acc585353b6e6c87da0189d305e82193c276695e721ed21b","source":{"kind":"arxiv","id":"1503.01068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01068","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01068v2","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01068","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"O5PE3MQJCFBS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5PE3MQJCFBSBLGF","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5PE3MQJ","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O5PE3MQJCFBSBLGFQU2TW3TMQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01068","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2015-03-03T19:19:56Z","cross_cats_sorted":[],"title_canon_sha256":"27f1327c47676f8bf4163d5ebbc1be582a427a5af1b7d2c3c09e18da13840d40","abstract_canon_sha256":"d3a172124da604c8ae835ee8305daf14ff8f5612ff95e470edbe3b1820908eb4"},"schema_version":"1.0"},"canonical_sha256":"775e4db209114320acc585353b6e6c87da0189d305e82193c276695e721ed21b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.662880Z","signature_b64":"SXzQYU5eA4b9XTSSjeJ2Nt0Rh+5Asv6j9eD3XEESVcmZA2XDg4G1hMV3I4Xkk/hTqad5uJw253jOyZRRoXizBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"775e4db209114320acc585353b6e6c87da0189d305e82193c276695e721ed21b","last_reissued_at":"2026-05-18T01:59:57.662482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.662482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01068","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNc/95oaN4EAGMyJ0zZIww/xFaWEUnrSHazsKlF0FZlHyLRCyQOxhp5lWUbmymoz5lEtT38o4qCYP0ZpRDc9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:05:06.616757Z"},"content_sha256":"e0c275635cd1a17f2d926889724f2271f059493451e0ff99c464c716db91b6d2","schema_version":"1.0","event_id":"sha256:e0c275635cd1a17f2d926889724f2271f059493451e0ff99c464c716db91b6d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O5PE3MQJCFBSBLGFQU2TW3TMQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An approach to computing downward closures","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2015-03-03T19:19:56Z","abstract_excerpt":"The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful abstraction, algorithms for computing a finite automaton for the downward closure of a given language have been established only for few language classes.\n  This work presents a simple general method for computing downward closures. For language classes that are closed under rational transductions, it is shown that the computation of downward closures can be redu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01068","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3kUvCgDTRWMGrqNuR+0yieZIHfiKVxjJ4EEOMa5mxvSXX+BnxXYHn4Bqoi76egNfEWE+2Z67LIGHMIoEz+oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:05:06.617426Z"},"content_sha256":"5441715b5d6d2ad99a59b4fdc2718de1e2ccbba17af63f8fa425fb36880096dd","schema_version":"1.0","event_id":"sha256:5441715b5d6d2ad99a59b4fdc2718de1e2ccbba17af63f8fa425fb36880096dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7/bundle.json","state_url":"https://pith.science/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7/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-05-26T17:05:06Z","links":{"resolver":"https://pith.science/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7","bundle":"https://pith.science/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7/bundle.json","state":"https://pith.science/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5PE3MQJCFBSBLGFQU2TW3TMQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O5PE3MQJCFBSBLGFQU2TW3TMQ7","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":"d3a172124da604c8ae835ee8305daf14ff8f5612ff95e470edbe3b1820908eb4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2015-03-03T19:19:56Z","title_canon_sha256":"27f1327c47676f8bf4163d5ebbc1be582a427a5af1b7d2c3c09e18da13840d40"},"schema_version":"1.0","source":{"id":"1503.01068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01068","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01068v2","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01068","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"O5PE3MQJCFBS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5PE3MQJCFBSBLGF","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5PE3MQJ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:5441715b5d6d2ad99a59b4fdc2718de1e2ccbba17af63f8fa425fb36880096dd","target":"graph","created_at":"2026-05-18T01:59:57Z","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":"The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful abstraction, algorithms for computing a finite automaton for the downward closure of a given language have been established only for few language classes.\n  This work presents a simple general method for computing downward closures. For language classes that are closed under rational transductions, it is shown that the computation of downward closures can be redu","authors_text":"Georg Zetzsche","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2015-03-03T19:19:56Z","title":"An approach to computing downward closures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01068","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:e0c275635cd1a17f2d926889724f2271f059493451e0ff99c464c716db91b6d2","target":"record","created_at":"2026-05-18T01:59:57Z","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":"d3a172124da604c8ae835ee8305daf14ff8f5612ff95e470edbe3b1820908eb4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2015-03-03T19:19:56Z","title_canon_sha256":"27f1327c47676f8bf4163d5ebbc1be582a427a5af1b7d2c3c09e18da13840d40"},"schema_version":"1.0","source":{"id":"1503.01068","kind":"arxiv","version":2}},"canonical_sha256":"775e4db209114320acc585353b6e6c87da0189d305e82193c276695e721ed21b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"775e4db209114320acc585353b6e6c87da0189d305e82193c276695e721ed21b","first_computed_at":"2026-05-18T01:59:57.662482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:57.662482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SXzQYU5eA4b9XTSSjeJ2Nt0Rh+5Asv6j9eD3XEESVcmZA2XDg4G1hMV3I4Xkk/hTqad5uJw253jOyZRRoXizBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:57.662880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0c275635cd1a17f2d926889724f2271f059493451e0ff99c464c716db91b6d2","sha256:5441715b5d6d2ad99a59b4fdc2718de1e2ccbba17af63f8fa425fb36880096dd"],"state_sha256":"6e44c3ac65d0be23bdc07560eb1c69893b63f505180fd21c7bed97a3188ecc8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPt6CaOB6JqIkmaqRSZmYb4myYz6qBkjwWDpff1tixz/9yr08mPwiJMluoaIym+/t1o0lCWvsh9y7U7mSRSNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:05:06.620772Z","bundle_sha256":"d5169a16ac752707d3e9a2ada51483464a9fab60cd7385f326e7d9a23acfc54b"}}