{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EEXRAX4JMZ7ZMMZIYNA2X265JR","short_pith_number":"pith:EEXRAX4J","canonical_record":{"source":{"id":"1907.08837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-20T16:54:11Z","cross_cats_sorted":[],"title_canon_sha256":"fa647454534b1da9056bce159cb1366cec2459259bd472a40bffcf2f09381521","abstract_canon_sha256":"114d2ee0f4ee22853f30db30f7387dc763cdf72531ae60d95f87842aaf1d6f01"},"schema_version":"1.0"},"canonical_sha256":"212f105f89667f963328c341abebdd4c4a195dc234d376b05be2c5cc792951fe","source":{"kind":"arxiv","id":"1907.08837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08837","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08837v1","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08837","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"EEXRAX4JMZ7Z","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EEXRAX4JMZ7ZMMZI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EEXRAX4J","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EEXRAX4JMZ7ZMMZIYNA2X265JR","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-20T16:54:11Z","cross_cats_sorted":[],"title_canon_sha256":"fa647454534b1da9056bce159cb1366cec2459259bd472a40bffcf2f09381521","abstract_canon_sha256":"114d2ee0f4ee22853f30db30f7387dc763cdf72531ae60d95f87842aaf1d6f01"},"schema_version":"1.0"},"canonical_sha256":"212f105f89667f963328c341abebdd4c4a195dc234d376b05be2c5cc792951fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:05.183887Z","signature_b64":"SDTv3bxw56gIEo5Rn8gsAa2bPVoVduIFZ6s2ETTuo2AhBfIxDe6D98bpe5fWlB0jNQvPTq+C3ncd/pJAX3aRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"212f105f89667f963328c341abebdd4c4a195dc234d376b05be2c5cc792951fe","last_reissued_at":"2026-05-17T23:40:05.183229Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:05.183229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08837","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-17T23:40:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6MJwPPmrLmNpObtvgpm3/RRSekmCPgIyAKXiqrMWHXcnuJ6sW4WzySId5Rl2wc3aCzki3cI9v2PmKGQbL57DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:22:10.686887Z"},"content_sha256":"a08a5e34eddcc47abd6ebf8d13610d87e5b6c856d1fffec261bb2b5a92c448fe","schema_version":"1.0","event_id":"sha256:a08a5e34eddcc47abd6ebf8d13610d87e5b6c856d1fffec261bb2b5a92c448fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EEXRAX4JMZ7ZMMZIYNA2X265JR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tagged Deterministic Finite Automata with Lookahead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Ulya Trofimovich","submitted_at":"2019-07-20T16:54:11Z","abstract_excerpt":"This paper extends the work of Laurikari and Kuklewicz on tagged deterministic finite automata (TDFA) in the context of submatch extraction in regular expressions. The main goal of this work is application of TDFA to lexer generators that optimize for speed of the generated code. I suggest a number of practical improvements to Laurikari algorithm; notably, the use of one-symbol lookahead, which results in significant reduction of tag variables and operations on them. Experimental results confirm that lookahead-aware TDFA are considerably faster and usually smaller than baseline TDFA; and they "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08837","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-17T23:40:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJ5uGUx40X2IRquqoWrKdnKdFC4BBHGfijdFAZgl7LTxiJuxcdF5zIhZrx0iWR8d616ETICLNKsjZR9dKS8ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:22:10.687227Z"},"content_sha256":"4702e6a20bd71c1a0ebfd3b7945696ccc4a654c332f92613f8e0950b1517dac7","schema_version":"1.0","event_id":"sha256:4702e6a20bd71c1a0ebfd3b7945696ccc4a654c332f92613f8e0950b1517dac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR/bundle.json","state_url":"https://pith.science/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR/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-28T13:22:10Z","links":{"resolver":"https://pith.science/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR","bundle":"https://pith.science/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR/bundle.json","state":"https://pith.science/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEXRAX4JMZ7ZMMZIYNA2X265JR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EEXRAX4JMZ7ZMMZIYNA2X265JR","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":"114d2ee0f4ee22853f30db30f7387dc763cdf72531ae60d95f87842aaf1d6f01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-20T16:54:11Z","title_canon_sha256":"fa647454534b1da9056bce159cb1366cec2459259bd472a40bffcf2f09381521"},"schema_version":"1.0","source":{"id":"1907.08837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08837","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08837v1","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08837","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"EEXRAX4JMZ7Z","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EEXRAX4JMZ7ZMMZI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EEXRAX4J","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4702e6a20bd71c1a0ebfd3b7945696ccc4a654c332f92613f8e0950b1517dac7","target":"graph","created_at":"2026-05-17T23:40:05Z","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":"This paper extends the work of Laurikari and Kuklewicz on tagged deterministic finite automata (TDFA) in the context of submatch extraction in regular expressions. The main goal of this work is application of TDFA to lexer generators that optimize for speed of the generated code. I suggest a number of practical improvements to Laurikari algorithm; notably, the use of one-symbol lookahead, which results in significant reduction of tag variables and operations on them. Experimental results confirm that lookahead-aware TDFA are considerably faster and usually smaller than baseline TDFA; and they ","authors_text":"Ulya Trofimovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-20T16:54:11Z","title":"Tagged Deterministic Finite Automata with Lookahead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08837","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:a08a5e34eddcc47abd6ebf8d13610d87e5b6c856d1fffec261bb2b5a92c448fe","target":"record","created_at":"2026-05-17T23:40:05Z","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":"114d2ee0f4ee22853f30db30f7387dc763cdf72531ae60d95f87842aaf1d6f01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-20T16:54:11Z","title_canon_sha256":"fa647454534b1da9056bce159cb1366cec2459259bd472a40bffcf2f09381521"},"schema_version":"1.0","source":{"id":"1907.08837","kind":"arxiv","version":1}},"canonical_sha256":"212f105f89667f963328c341abebdd4c4a195dc234d376b05be2c5cc792951fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"212f105f89667f963328c341abebdd4c4a195dc234d376b05be2c5cc792951fe","first_computed_at":"2026-05-17T23:40:05.183229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:05.183229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDTv3bxw56gIEo5Rn8gsAa2bPVoVduIFZ6s2ETTuo2AhBfIxDe6D98bpe5fWlB0jNQvPTq+C3ncd/pJAX3aRDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:05.183887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a08a5e34eddcc47abd6ebf8d13610d87e5b6c856d1fffec261bb2b5a92c448fe","sha256:4702e6a20bd71c1a0ebfd3b7945696ccc4a654c332f92613f8e0950b1517dac7"],"state_sha256":"1404e5182227e2a3a67799326d2a42e8cc5e50db744fffb084ec6eaee09496d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEhI390bg/XVZqXkST98Qz8qcUwIz64ru7nLMNtIUezJ5azB0pGRuk+jpxoCBV9l/HoM24M8hWb6T4SLw/SnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:22:10.689101Z","bundle_sha256":"df7013119683a9c2bfd0d3eadfa2758543301f631e4a9069f6a4e0e1efe153c0"}}