{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5OLFQVTYMOLZYM337HTRXMEEKB","short_pith_number":"pith:5OLFQVTY","canonical_record":{"source":{"id":"1108.2427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-11T15:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"b08a3c16d030df7cdcd3c3713c08d493ea99eebf1f772c7df97c5ad51b4599ba","abstract_canon_sha256":"46fa394f4edb80124a6e2be819ee435cdc6b4700df35173720ccf717e28864a1"},"schema_version":"1.0"},"canonical_sha256":"eb9658567863979c337bf9e71bb084506066048293c6e600668640906773459d","source":{"kind":"arxiv","id":"1108.2427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2427","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2427v1","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2427","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"5OLFQVTYMOLZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5OLFQVTYMOLZYM33","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5OLFQVTY","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5OLFQVTYMOLZYM337HTRXMEEKB","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-11T15:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"b08a3c16d030df7cdcd3c3713c08d493ea99eebf1f772c7df97c5ad51b4599ba","abstract_canon_sha256":"46fa394f4edb80124a6e2be819ee435cdc6b4700df35173720ccf717e28864a1"},"schema_version":"1.0"},"canonical_sha256":"eb9658567863979c337bf9e71bb084506066048293c6e600668640906773459d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:37.740740Z","signature_b64":"dUnFHjSkNdNgPNDTFNv3cLm5T7gNFAdcSjQITKHiTkMs9xae5UH6fbQwpx5L4bOGeljczl6LBiisASC88E8fCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb9658567863979c337bf9e71bb084506066048293c6e600668640906773459d","last_reissued_at":"2026-05-18T04:15:37.739857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:37.739857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2427","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-18T04:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4zhJtlxNaklOd2a46i+OdY6As2J1B7NuzsQIxj9sutOB88PdtP+zzLeIUaskljRbK/4SK+9BTp4+6dwgAhaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:17:49.910794Z"},"content_sha256":"8c885974d0b6517a4940742ebbf7b4e476a826ee1a817725444c464eac46903b","schema_version":"1.0","event_id":"sha256:8c885974d0b6517a4940742ebbf7b4e476a826ee1a817725444c464eac46903b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5OLFQVTYMOLZYM337HTRXMEEKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Steffen Kopecki, Victor Mitrana, Volker Diekert","submitted_at":"2011-08-11T15:10:28Z","abstract_excerpt":"The hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate the hairpin completion of regular languages.\n  It is well known that hairpin completions of regular languages are linear context-free and not necessarily regular. As regularity of a (linear) context-free language is not decidable, the question arose whether regularity of a hairpin completion of regular languages is decidable. We prove that this problem is decidable and we provide a polynomial time algorithm.\n  Furtherm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2427","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-18T04:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/6bIAbXHRhUC68O96e2hFWCcgN0/P/a8f9QywXH44N887MIrh+/msD8+/8Skyzy3dkKDljUKtV+pWuERMnHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:17:49.911139Z"},"content_sha256":"4a724383e108c813379538092e18ac484289f5a358c36ae8efbe3c1ac6f03220","schema_version":"1.0","event_id":"sha256:4a724383e108c813379538092e18ac484289f5a358c36ae8efbe3c1ac6f03220"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OLFQVTYMOLZYM337HTRXMEEKB/bundle.json","state_url":"https://pith.science/pith/5OLFQVTYMOLZYM337HTRXMEEKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OLFQVTYMOLZYM337HTRXMEEKB/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-01T10:17:49Z","links":{"resolver":"https://pith.science/pith/5OLFQVTYMOLZYM337HTRXMEEKB","bundle":"https://pith.science/pith/5OLFQVTYMOLZYM337HTRXMEEKB/bundle.json","state":"https://pith.science/pith/5OLFQVTYMOLZYM337HTRXMEEKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OLFQVTYMOLZYM337HTRXMEEKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5OLFQVTYMOLZYM337HTRXMEEKB","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":"46fa394f4edb80124a6e2be819ee435cdc6b4700df35173720ccf717e28864a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-11T15:10:28Z","title_canon_sha256":"b08a3c16d030df7cdcd3c3713c08d493ea99eebf1f772c7df97c5ad51b4599ba"},"schema_version":"1.0","source":{"id":"1108.2427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2427","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2427v1","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2427","created_at":"2026-05-18T04:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"5OLFQVTYMOLZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5OLFQVTYMOLZYM33","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5OLFQVTY","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:4a724383e108c813379538092e18ac484289f5a358c36ae8efbe3c1ac6f03220","target":"graph","created_at":"2026-05-18T04:15:37Z","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 hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate the hairpin completion of regular languages.\n  It is well known that hairpin completions of regular languages are linear context-free and not necessarily regular. As regularity of a (linear) context-free language is not decidable, the question arose whether regularity of a hairpin completion of regular languages is decidable. We prove that this problem is decidable and we provide a polynomial time algorithm.\n  Furtherm","authors_text":"Steffen Kopecki, Victor Mitrana, Volker Diekert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-11T15:10:28Z","title":"Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2427","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:8c885974d0b6517a4940742ebbf7b4e476a826ee1a817725444c464eac46903b","target":"record","created_at":"2026-05-18T04:15:37Z","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":"46fa394f4edb80124a6e2be819ee435cdc6b4700df35173720ccf717e28864a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-11T15:10:28Z","title_canon_sha256":"b08a3c16d030df7cdcd3c3713c08d493ea99eebf1f772c7df97c5ad51b4599ba"},"schema_version":"1.0","source":{"id":"1108.2427","kind":"arxiv","version":1}},"canonical_sha256":"eb9658567863979c337bf9e71bb084506066048293c6e600668640906773459d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb9658567863979c337bf9e71bb084506066048293c6e600668640906773459d","first_computed_at":"2026-05-18T04:15:37.739857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:37.739857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dUnFHjSkNdNgPNDTFNv3cLm5T7gNFAdcSjQITKHiTkMs9xae5UH6fbQwpx5L4bOGeljczl6LBiisASC88E8fCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:37.740740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c885974d0b6517a4940742ebbf7b4e476a826ee1a817725444c464eac46903b","sha256:4a724383e108c813379538092e18ac484289f5a358c36ae8efbe3c1ac6f03220"],"state_sha256":"30c951e2201a16508e911f9fafb9e5eb9d35a87c1633c4bb94f654e2c2ab766c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+IqlDYXKQsRFmoVGX7YJOdMvQVUX3UBqf44HEUB6Bt/+jo4EgN0a1jrKInat8hIJMHiby6Sm7XhdAeT/8+ADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:17:49.913260Z","bundle_sha256":"f3b68c98c0ede05cf6d44c7b043e281ce7b4edb2238aa5e3b7bc000adc6f86ab"}}