{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SBKRWW3BN7AZIHKFCFGTBRIF2Y","short_pith_number":"pith:SBKRWW3B","canonical_record":{"source":{"id":"1306.3507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T20:32:31Z","cross_cats_sorted":[],"title_canon_sha256":"9ba9f02486f9ef1b9d8d22c26fb382ebef3e3fbc5c209a5590be16f2c7dcd248","abstract_canon_sha256":"35c06eb22a01bf185f67f5fdfee4aff5b6c3cb7ccd1a3879c6df0b256381cb8b"},"schema_version":"1.0"},"canonical_sha256":"90551b5b616fc1941d45114d30c505d624f0aa5d62fc20779a501e829df3f744","source":{"kind":"arxiv","id":"1306.3507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3507","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3507v1","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3507","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"SBKRWW3BN7AZ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SBKRWW3BN7AZIHKF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SBKRWW3B","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SBKRWW3BN7AZIHKFCFGTBRIF2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T20:32:31Z","cross_cats_sorted":[],"title_canon_sha256":"9ba9f02486f9ef1b9d8d22c26fb382ebef3e3fbc5c209a5590be16f2c7dcd248","abstract_canon_sha256":"35c06eb22a01bf185f67f5fdfee4aff5b6c3cb7ccd1a3879c6df0b256381cb8b"},"schema_version":"1.0"},"canonical_sha256":"90551b5b616fc1941d45114d30c505d624f0aa5d62fc20779a501e829df3f744","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:47.332187Z","signature_b64":"1JzcQCiIMd0qIQsCZDo2dqcBUyp8qcufd1Zr4HUTaoHQ5q8szY4rKOlAdWCmIv2f4P8D0JOw05z5rd9bD+yXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90551b5b616fc1941d45114d30c505d624f0aa5d62fc20779a501e829df3f744","last_reissued_at":"2026-05-18T03:20:47.331525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:47.331525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3507","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-18T03:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSNukTK/+rG+jlhQf4W6lTflDGYYtCH1wig31w9/+Dsx1XYbavN4G1QC51cmiHmZ1HMWdoLZ2mp5V3L/nBuVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:52:26.422587Z"},"content_sha256":"f822265a5f42b15d6d0aff77c5963bddcf0939f2a8e8741e5498eefa8573ed5e","schema_version":"1.0","event_id":"sha256:f822265a5f42b15d6d0aff77c5963bddcf0939f2a8e8741e5498eefa8573ed5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SBKRWW3BN7AZIHKFCFGTBRIF2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Faissal Ouardi, Jean-Marc Champarnaud","submitted_at":"2013-06-14T20:32:31Z","abstract_excerpt":"Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton and Yamada, is based on the computation of the Null, First, Last and Follow sets (called Glushkov functions) associated with a linearized version of the expression. Recently Mignot considered a family of extended expressions called Extended to multi-tilde-bar Regular Expressions (EmtbREs) and he showed that, under some restrictions, Glushkov functions can be defined for an EmtbRE. In this paper we present an algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3507","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-18T03:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xiwQ4NoPCh/hclnuAUkNrq6+25MLeTmw0li77sYrgKXjP7cpnGifEaTKY7IxK8Iw+uXiYWGTD2zRNPgAvysCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:52:26.423196Z"},"content_sha256":"7a61aa4f27dd3d1560983a4df1cc58cd914377b54700f6ebc91f4a04c0a74d0e","schema_version":"1.0","event_id":"sha256:7a61aa4f27dd3d1560983a4df1cc58cd914377b54700f6ebc91f4a04c0a74d0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y/bundle.json","state_url":"https://pith.science/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y/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-05-27T23:52:26Z","links":{"resolver":"https://pith.science/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y","bundle":"https://pith.science/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y/bundle.json","state":"https://pith.science/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBKRWW3BN7AZIHKFCFGTBRIF2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SBKRWW3BN7AZIHKFCFGTBRIF2Y","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":"35c06eb22a01bf185f67f5fdfee4aff5b6c3cb7ccd1a3879c6df0b256381cb8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T20:32:31Z","title_canon_sha256":"9ba9f02486f9ef1b9d8d22c26fb382ebef3e3fbc5c209a5590be16f2c7dcd248"},"schema_version":"1.0","source":{"id":"1306.3507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3507","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3507v1","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3507","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"SBKRWW3BN7AZ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SBKRWW3BN7AZIHKF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SBKRWW3B","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:7a61aa4f27dd3d1560983a4df1cc58cd914377b54700f6ebc91f4a04c0a74d0e","target":"graph","created_at":"2026-05-18T03:20:47Z","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":"Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton and Yamada, is based on the computation of the Null, First, Last and Follow sets (called Glushkov functions) associated with a linearized version of the expression. Recently Mignot considered a family of extended expressions called Extended to multi-tilde-bar Regular Expressions (EmtbREs) and he showed that, under some restrictions, Glushkov functions can be defined for an EmtbRE. In this paper we present an algorith","authors_text":"Djelloul Ziadi, Faissal Ouardi, Jean-Marc Champarnaud","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T20:32:31Z","title":"Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3507","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:f822265a5f42b15d6d0aff77c5963bddcf0939f2a8e8741e5498eefa8573ed5e","target":"record","created_at":"2026-05-18T03:20:47Z","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":"35c06eb22a01bf185f67f5fdfee4aff5b6c3cb7ccd1a3879c6df0b256381cb8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T20:32:31Z","title_canon_sha256":"9ba9f02486f9ef1b9d8d22c26fb382ebef3e3fbc5c209a5590be16f2c7dcd248"},"schema_version":"1.0","source":{"id":"1306.3507","kind":"arxiv","version":1}},"canonical_sha256":"90551b5b616fc1941d45114d30c505d624f0aa5d62fc20779a501e829df3f744","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90551b5b616fc1941d45114d30c505d624f0aa5d62fc20779a501e829df3f744","first_computed_at":"2026-05-18T03:20:47.331525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:47.331525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1JzcQCiIMd0qIQsCZDo2dqcBUyp8qcufd1Zr4HUTaoHQ5q8szY4rKOlAdWCmIv2f4P8D0JOw05z5rd9bD+yXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:47.332187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f822265a5f42b15d6d0aff77c5963bddcf0939f2a8e8741e5498eefa8573ed5e","sha256:7a61aa4f27dd3d1560983a4df1cc58cd914377b54700f6ebc91f4a04c0a74d0e"],"state_sha256":"329bb8442df13ef560c3527d7f36004494362c5cab59f5c1e69eb1a0430f1842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3VlNew7y8mOjfiiJmb81orXXwqUjbXWT+G5fW1o64yN7qGctDauo9Xo/O1Ej/x69PFKP4n6Y5pFBDXQkRxPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:52:26.426505Z","bundle_sha256":"0782e7a2408412316d30ab6d5c2eea828cd75c14f0d2a10b4208d2106811243a"}}