{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E63VMWQYKUKOATQEFYEZA4IIXG","short_pith_number":"pith:E63VMWQY","canonical_record":{"source":{"id":"1101.4824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-25T14:35:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"52751a872d962e15f7c5e58b3a95975ffb3467ff139be259843a5220a7d0ff2f","abstract_canon_sha256":"205d67cc2bc32f62ef6fe438f9a43bc1221584420a9c684b732f849f64626a05"},"schema_version":"1.0"},"canonical_sha256":"27b7565a185514e04e042e09907108b9a65f715a9934b3b92fe3db230e580e97","source":{"kind":"arxiv","id":"1101.4824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4824","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4824v1","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4824","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"pith_short_12","alias_value":"E63VMWQYKUKO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E63VMWQYKUKOATQE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E63VMWQY","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E63VMWQYKUKOATQEFYEZA4IIXG","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-25T14:35:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"52751a872d962e15f7c5e58b3a95975ffb3467ff139be259843a5220a7d0ff2f","abstract_canon_sha256":"205d67cc2bc32f62ef6fe438f9a43bc1221584420a9c684b732f849f64626a05"},"schema_version":"1.0"},"canonical_sha256":"27b7565a185514e04e042e09907108b9a65f715a9934b3b92fe3db230e580e97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:58.940096Z","signature_b64":"aWifgQGdqzTNHaNZtQIZAGbhshyAN9OPBMwHOLE6ulkgdT1XqfXPOlK1oiUU5qMUHBYh0Rl6ZYnxFN3wb6IvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b7565a185514e04e042e09907108b9a65f715a9934b3b92fe3db230e580e97","last_reissued_at":"2026-05-18T04:30:58.939341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:58.939341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4824","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:30:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJlGsq6+eHGOKLPW78IQkmXlsXMc1HBMosnriSezFUvoa6F6oLzxpvFLNWSRxaUoGMR8eS9ReyQe8KVm7zhdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:11:14.970550Z"},"content_sha256":"5ea2c6c0e95cfb31f844cabad75d0086be713bb949b5e8681b4713e5b663783c","schema_version":"1.0","event_id":"sha256:5ea2c6c0e95cfb31f844cabad75d0086be713bb949b5e8681b4713e5b663783c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E63VMWQYKUKOATQEFYEZA4IIXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Steffen Kopecki, Volker Diekert","submitted_at":"2011-01-25T14:35:12Z","abstract_excerpt":"The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It has been known that the hairpin completion of a regular language is linear context-free, but not regular, in general. However, for some time it is was open whether the regularity of the hairpin completion of a regular language is is decidable. In 2009 this decidability problem has been solved positively by providing a polynomial time algorithm. In this paper we improve the complexity bound by showing that the decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4824","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:30:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMDYxpawof7IwowYpUduwek0UqkjYAR1qmjj7TlSw8Lwq98WfDqb8+iIC1Nn6BUof30cugzrc0kWYzjjKaAwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:11:14.970895Z"},"content_sha256":"9a608f23c7a778d226eafc15e69901a3c3502143ab180d03d137a8cec699470b","schema_version":"1.0","event_id":"sha256:9a608f23c7a778d226eafc15e69901a3c3502143ab180d03d137a8cec699470b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E63VMWQYKUKOATQEFYEZA4IIXG/bundle.json","state_url":"https://pith.science/pith/E63VMWQYKUKOATQEFYEZA4IIXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E63VMWQYKUKOATQEFYEZA4IIXG/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:11:14Z","links":{"resolver":"https://pith.science/pith/E63VMWQYKUKOATQEFYEZA4IIXG","bundle":"https://pith.science/pith/E63VMWQYKUKOATQEFYEZA4IIXG/bundle.json","state":"https://pith.science/pith/E63VMWQYKUKOATQEFYEZA4IIXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E63VMWQYKUKOATQEFYEZA4IIXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E63VMWQYKUKOATQEFYEZA4IIXG","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":"205d67cc2bc32f62ef6fe438f9a43bc1221584420a9c684b732f849f64626a05","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-25T14:35:12Z","title_canon_sha256":"52751a872d962e15f7c5e58b3a95975ffb3467ff139be259843a5220a7d0ff2f"},"schema_version":"1.0","source":{"id":"1101.4824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4824","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4824v1","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4824","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"pith_short_12","alias_value":"E63VMWQYKUKO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E63VMWQYKUKOATQE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E63VMWQY","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:9a608f23c7a778d226eafc15e69901a3c3502143ab180d03d137a8cec699470b","target":"graph","created_at":"2026-05-18T04:30:58Z","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 which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It has been known that the hairpin completion of a regular language is linear context-free, but not regular, in general. However, for some time it is was open whether the regularity of the hairpin completion of a regular language is is decidable. In 2009 this decidability problem has been solved positively by providing a polynomial time algorithm. In this paper we improve the complexity bound by showing that the decision","authors_text":"Steffen Kopecki, Volker Diekert","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-25T14:35:12Z","title":"It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4824","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:5ea2c6c0e95cfb31f844cabad75d0086be713bb949b5e8681b4713e5b663783c","target":"record","created_at":"2026-05-18T04:30:58Z","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":"205d67cc2bc32f62ef6fe438f9a43bc1221584420a9c684b732f849f64626a05","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-25T14:35:12Z","title_canon_sha256":"52751a872d962e15f7c5e58b3a95975ffb3467ff139be259843a5220a7d0ff2f"},"schema_version":"1.0","source":{"id":"1101.4824","kind":"arxiv","version":1}},"canonical_sha256":"27b7565a185514e04e042e09907108b9a65f715a9934b3b92fe3db230e580e97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27b7565a185514e04e042e09907108b9a65f715a9934b3b92fe3db230e580e97","first_computed_at":"2026-05-18T04:30:58.939341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:58.939341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWifgQGdqzTNHaNZtQIZAGbhshyAN9OPBMwHOLE6ulkgdT1XqfXPOlK1oiUU5qMUHBYh0Rl6ZYnxFN3wb6IvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:58.940096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ea2c6c0e95cfb31f844cabad75d0086be713bb949b5e8681b4713e5b663783c","sha256:9a608f23c7a778d226eafc15e69901a3c3502143ab180d03d137a8cec699470b"],"state_sha256":"c78fccbe040520c16cfb7b196d918d528b6eb19a54f412371bb05d6e2aefefb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+F5fKIaXF0n/E5LQvI9Ucrhku7yZL4x8h6VHkw4hbFc/m/A48mLL7MgOWTgk8qBj+b1uPjfKcsLfpJw4XRiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:11:14.972893Z","bundle_sha256":"a102b6cc08e7ce1b6bec8e8be2e28180cf4fe6ac226e6512d805e089593136ee"}}