{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DG6XAYPT7EZAU2G7CCF56WAVMY","short_pith_number":"pith:DG6XAYPT","canonical_record":{"source":{"id":"1004.1298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-08T10:16:13Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"01028e77e9a5475719057d632cb56d33be436039a0dbe5697ce8646de2d99377","abstract_canon_sha256":"48972658ce94aa97e010b9dbcf34e28af01c97892832f218dc47fb1afd127767"},"schema_version":"1.0"},"canonical_sha256":"19bd7061f3f9320a68df108bdf58156638145868a3f918784dc2f887385e28f3","source":{"kind":"arxiv","id":"1004.1298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1298","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1298v2","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1298","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"DG6XAYPT7EZA","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DG6XAYPT7EZAU2G7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DG6XAYPT","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DG6XAYPT7EZAU2G7CCF56WAVMY","target":"record","payload":{"canonical_record":{"source":{"id":"1004.1298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-08T10:16:13Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"01028e77e9a5475719057d632cb56d33be436039a0dbe5697ce8646de2d99377","abstract_canon_sha256":"48972658ce94aa97e010b9dbcf34e28af01c97892832f218dc47fb1afd127767"},"schema_version":"1.0"},"canonical_sha256":"19bd7061f3f9320a68df108bdf58156638145868a3f918784dc2f887385e28f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:49.746665Z","signature_b64":"izs0jauPNwBmBN2jhtVLwnMoe7h4Bd92Alq0GmQS/u+huTSbjrlPox2RbplMuBSfIZlNel3wwe7edL9ohELYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19bd7061f3f9320a68df108bdf58156638145868a3f918784dc2f887385e28f3","last_reissued_at":"2026-05-18T04:33:49.746075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:49.746075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.1298","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-18T04:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWw+QKnxg5nfT5+OMWFU1RTnyVACxUsm8QgdnwB62HmcD03OGE1a4FScUjRO24fLKP9+pVtLBc6wrs02pYnRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:56:38.314967Z"},"content_sha256":"2a366eea56265ae8a0cad8d1f7cec87dc98291ea51052cc6bcf77e10862a5c6f","schema_version":"1.0","event_id":"sha256:2a366eea56265ae8a0cad8d1f7cec87dc98291ea51052cc6bcf77e10862a5c6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DG6XAYPT7EZAU2G7CCF56WAVMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of minimal DFAs from biological motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.FL","authors_text":"Tobias Marschall","submitted_at":"2010-04-08T10:16:13Z","abstract_excerpt":"Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple non-deterministic finite automata (NFAs) and prove that the standard subset construction transforms NFAs of this type into minimal DFAs. Furthermore, we show how simple NFAs can be constructed from two types of patterns popular in bioinformatics, namely (sets of) generalized strings and (generalized) strings with a Hamming neighborhood."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1298","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-18T04:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meRCaBBr7331SpcxgPXYmkUNkewdU72wDeAP4vzcqM48JNhyVeyQErUo4CfVh3RPhhv1zsyJ7EeOX61xd0TgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:56:38.315305Z"},"content_sha256":"5e284bf82d7429f6f0c1d044c6e2fdbbcdb36e97c5f2bd75394356fd05c2759b","schema_version":"1.0","event_id":"sha256:5e284bf82d7429f6f0c1d044c6e2fdbbcdb36e97c5f2bd75394356fd05c2759b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DG6XAYPT7EZAU2G7CCF56WAVMY/bundle.json","state_url":"https://pith.science/pith/DG6XAYPT7EZAU2G7CCF56WAVMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DG6XAYPT7EZAU2G7CCF56WAVMY/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-09T17:56:38Z","links":{"resolver":"https://pith.science/pith/DG6XAYPT7EZAU2G7CCF56WAVMY","bundle":"https://pith.science/pith/DG6XAYPT7EZAU2G7CCF56WAVMY/bundle.json","state":"https://pith.science/pith/DG6XAYPT7EZAU2G7CCF56WAVMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DG6XAYPT7EZAU2G7CCF56WAVMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DG6XAYPT7EZAU2G7CCF56WAVMY","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":"48972658ce94aa97e010b9dbcf34e28af01c97892832f218dc47fb1afd127767","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-08T10:16:13Z","title_canon_sha256":"01028e77e9a5475719057d632cb56d33be436039a0dbe5697ce8646de2d99377"},"schema_version":"1.0","source":{"id":"1004.1298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1298","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1298v2","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1298","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"DG6XAYPT7EZA","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DG6XAYPT7EZAU2G7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DG6XAYPT","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:5e284bf82d7429f6f0c1d044c6e2fdbbcdb36e97c5f2bd75394356fd05c2759b","target":"graph","created_at":"2026-05-18T04:33:49Z","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":"Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple non-deterministic finite automata (NFAs) and prove that the standard subset construction transforms NFAs of this type into minimal DFAs. Furthermore, we show how simple NFAs can be constructed from two types of patterns popular in bioinformatics, namely (sets of) generalized strings and (generalized) strings with a Hamming neighborhood.","authors_text":"Tobias Marschall","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-08T10:16:13Z","title":"Construction of minimal DFAs from biological motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1298","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:2a366eea56265ae8a0cad8d1f7cec87dc98291ea51052cc6bcf77e10862a5c6f","target":"record","created_at":"2026-05-18T04:33:49Z","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":"48972658ce94aa97e010b9dbcf34e28af01c97892832f218dc47fb1afd127767","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-08T10:16:13Z","title_canon_sha256":"01028e77e9a5475719057d632cb56d33be436039a0dbe5697ce8646de2d99377"},"schema_version":"1.0","source":{"id":"1004.1298","kind":"arxiv","version":2}},"canonical_sha256":"19bd7061f3f9320a68df108bdf58156638145868a3f918784dc2f887385e28f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19bd7061f3f9320a68df108bdf58156638145868a3f918784dc2f887385e28f3","first_computed_at":"2026-05-18T04:33:49.746075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:49.746075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izs0jauPNwBmBN2jhtVLwnMoe7h4Bd92Alq0GmQS/u+huTSbjrlPox2RbplMuBSfIZlNel3wwe7edL9ohELYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:49.746665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.1298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a366eea56265ae8a0cad8d1f7cec87dc98291ea51052cc6bcf77e10862a5c6f","sha256:5e284bf82d7429f6f0c1d044c6e2fdbbcdb36e97c5f2bd75394356fd05c2759b"],"state_sha256":"678220e955cfd550c6c0e7f1d837fae5efb5a9aa86046b3db54a8d3758a074fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch4wPrqwKcdaTsZNPz6KalYO5R3ngsJcFVlJFGhQ6HeY5YCIEYyn5cCT8lojP2akNpJzgqbuHxK6cYg3ZbRYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:56:38.317184Z","bundle_sha256":"5b51d385ada9a73207f805a22f6d9acf19b0b8c5dc6c707395b9b159ac4331c7"}}