{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QE22S2PKVM7QX37H2T3YIBRVDG","short_pith_number":"pith:QE22S2PK","canonical_record":{"source":{"id":"1406.0690","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-03T12:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"1cdba3d810c5d00844c5b289b108140529cb8cd449c9a50247446bdb10ae4f3d","abstract_canon_sha256":"9ad9dc113443d9fd24c7ecbb9a669502910569fe0d594f0f752b484c899bb6ce"},"schema_version":"1.0"},"canonical_sha256":"8135a969eaab3f0befe7d4f784063519be6a92c132d357aaa6bf8fb9a163d026","source":{"kind":"arxiv","id":"1406.0690","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0690","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0690v4","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0690","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"QE22S2PKVM7Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QE22S2PKVM7QX37H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QE22S2PK","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QE22S2PKVM7QX37H2T3YIBRVDG","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0690","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-03T12:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"1cdba3d810c5d00844c5b289b108140529cb8cd449c9a50247446bdb10ae4f3d","abstract_canon_sha256":"9ad9dc113443d9fd24c7ecbb9a669502910569fe0d594f0f752b484c899bb6ce"},"schema_version":"1.0"},"canonical_sha256":"8135a969eaab3f0befe7d4f784063519be6a92c132d357aaa6bf8fb9a163d026","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:39.840835Z","signature_b64":"4LBdrZIAeD5NVOQum6vOS3/EKzjJooeO4oNoCHCXiMPtOipvqgBhBo7kBngWawpwOS6ezfe9XiWkt9Ykd8UrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8135a969eaab3f0befe7d4f784063519be6a92c132d357aaa6bf8fb9a163d026","last_reissued_at":"2026-05-18T01:25:39.840190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:39.840190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0690","source_version":4,"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:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6cMyAcbjAOtAbeRtLLqUcbftA5dFZljo35hKiGhDPh/GGSY178O+XVLc5r+spcAq8BQs12MOVXBvbZY+IMSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:28.450332Z"},"content_sha256":"38442237d6e900d2f6a77236e2b373ce80c770efac31fe3c0cd612d17fa2141f","schema_version":"1.0","event_id":"sha256:38442237d6e900d2f6a77236e2b373ce80c770efac31fe3c0cd612d17fa2141f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QE22S2PKVM7QX37H2T3YIBRVDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the state complexity of closures and interiors of regular languages with subwords and superwords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Matthias Niewerth, Philippe Schnoebelen, Prateek Karandikar","submitted_at":"2014-06-03T12:42:47Z","abstract_excerpt":"The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all their subwords and superwords in $L$, respectively. We provide lower and upper bounds on the size of the smallest automata recognizing these closures and interiors. We also consider the computational complexity of decision problems for closures of regular languages."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0690","kind":"arxiv","version":4},"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:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4f7Hy6q7KnWkFKYJ5mTpm9Jm7QqMKkL2yDrtBl/s5khIUe3vruQFiZYaDnjex269Xr2brCc4LlIjDSedYJGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:28.450686Z"},"content_sha256":"f2e06efcb1e749dc473dd0c9dc90444e8ce37185cdb0867d8507b20e7c7fc7d4","schema_version":"1.0","event_id":"sha256:f2e06efcb1e749dc473dd0c9dc90444e8ce37185cdb0867d8507b20e7c7fc7d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QE22S2PKVM7QX37H2T3YIBRVDG/bundle.json","state_url":"https://pith.science/pith/QE22S2PKVM7QX37H2T3YIBRVDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QE22S2PKVM7QX37H2T3YIBRVDG/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-02T04:42:28Z","links":{"resolver":"https://pith.science/pith/QE22S2PKVM7QX37H2T3YIBRVDG","bundle":"https://pith.science/pith/QE22S2PKVM7QX37H2T3YIBRVDG/bundle.json","state":"https://pith.science/pith/QE22S2PKVM7QX37H2T3YIBRVDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QE22S2PKVM7QX37H2T3YIBRVDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QE22S2PKVM7QX37H2T3YIBRVDG","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":"9ad9dc113443d9fd24c7ecbb9a669502910569fe0d594f0f752b484c899bb6ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-03T12:42:47Z","title_canon_sha256":"1cdba3d810c5d00844c5b289b108140529cb8cd449c9a50247446bdb10ae4f3d"},"schema_version":"1.0","source":{"id":"1406.0690","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0690","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0690v4","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0690","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"QE22S2PKVM7Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QE22S2PKVM7QX37H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QE22S2PK","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:f2e06efcb1e749dc473dd0c9dc90444e8ce37185cdb0867d8507b20e7c7fc7d4","target":"graph","created_at":"2026-05-18T01:25:39Z","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 and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all their subwords and superwords in $L$, respectively. We provide lower and upper bounds on the size of the smallest automata recognizing these closures and interiors. We also consider the computational complexity of decision problems for closures of regular languages.","authors_text":"Matthias Niewerth, Philippe Schnoebelen, Prateek Karandikar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-03T12:42:47Z","title":"On the state complexity of closures and interiors of regular languages with subwords and superwords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0690","kind":"arxiv","version":4},"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:38442237d6e900d2f6a77236e2b373ce80c770efac31fe3c0cd612d17fa2141f","target":"record","created_at":"2026-05-18T01:25:39Z","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":"9ad9dc113443d9fd24c7ecbb9a669502910569fe0d594f0f752b484c899bb6ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-03T12:42:47Z","title_canon_sha256":"1cdba3d810c5d00844c5b289b108140529cb8cd449c9a50247446bdb10ae4f3d"},"schema_version":"1.0","source":{"id":"1406.0690","kind":"arxiv","version":4}},"canonical_sha256":"8135a969eaab3f0befe7d4f784063519be6a92c132d357aaa6bf8fb9a163d026","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8135a969eaab3f0befe7d4f784063519be6a92c132d357aaa6bf8fb9a163d026","first_computed_at":"2026-05-18T01:25:39.840190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:39.840190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4LBdrZIAeD5NVOQum6vOS3/EKzjJooeO4oNoCHCXiMPtOipvqgBhBo7kBngWawpwOS6ezfe9XiWkt9Ykd8UrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:39.840835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0690","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38442237d6e900d2f6a77236e2b373ce80c770efac31fe3c0cd612d17fa2141f","sha256:f2e06efcb1e749dc473dd0c9dc90444e8ce37185cdb0867d8507b20e7c7fc7d4"],"state_sha256":"89a97e0db040506ddcfafb3d8beb8db0c4ffe31348f1835bdc66359a9cc289b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqjIWyUPwIKA+BpQhoocsNLpO1RbrDM55KL17sUiT1Uvk5CgBZmDigGzpcUAOMOwjgS9emXDd+VoYk18c1cdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:42:28.452642Z","bundle_sha256":"b4b6e6caf82a982a898e7511ca4f202e2ae5a5090e6e26d72fdaede3d1576272"}}