{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S5PRSKLRUN7NI3C6Y57SE56K5E","short_pith_number":"pith:S5PRSKLR","canonical_record":{"source":{"id":"1502.06194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-22T08:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"658dc49397224b217d1e93982f8f0b3d5cdfaa315980eea31b48c4235c16473f","abstract_canon_sha256":"db48d07992033f6c86bef7e265ff009270627603ebade8dac5d0b392c55353c7"},"schema_version":"1.0"},"canonical_sha256":"975f192971a37ed46c5ec77f2277cae905d747b1a3c31034a0f18b0d244da2d4","source":{"kind":"arxiv","id":"1502.06194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06194","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06194v1","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06194","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"S5PRSKLRUN7N","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S5PRSKLRUN7NI3C6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S5PRSKLR","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S5PRSKLRUN7NI3C6Y57SE56K5E","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-22T08:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"658dc49397224b217d1e93982f8f0b3d5cdfaa315980eea31b48c4235c16473f","abstract_canon_sha256":"db48d07992033f6c86bef7e265ff009270627603ebade8dac5d0b392c55353c7"},"schema_version":"1.0"},"canonical_sha256":"975f192971a37ed46c5ec77f2277cae905d747b1a3c31034a0f18b0d244da2d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:37.822009Z","signature_b64":"EkHgWln1It96doKy8JJSJO0HjZyanXh8wkGB+RRSnMlC8X/YmzS/AhyV06ECjQJsYKFMGd6iZByZ6tz1BFMGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975f192971a37ed46c5ec77f2277cae905d747b1a3c31034a0f18b0d244da2d4","last_reissued_at":"2026-05-18T02:26:37.821423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:37.821423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06194","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-18T02:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XOTm0+t3dFsgtvMt9+CyBG/IH6EQEeORJ0NtQYG1DxXzOP6ReEVAS2f3QgIKXb9+m27f50jNlBOQYc6WsDPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:43:32.467346Z"},"content_sha256":"56eeaa7ad104f335b22138e82cb40b4d3c38858eca2c156246495f551403f652","schema_version":"1.0","event_id":"sha256:56eeaa7ad104f335b22138e82cb40b4d3c38858eca2c156246495f551403f652"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S5PRSKLRUN7NI3C6Y57SE56K5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithm for the k-Position Tree Automaton Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Nadia Ouali Sebti","submitted_at":"2015-02-22T08:57:42Z","abstract_excerpt":"The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||\\E||+1) states for a word expression of alphabetic width ||\\E||. This kind of automata is extended to regular tree expressions.\n  In this paper, we give an efficient algorithm that computes the \\Follow sets, which are used in different algorithms of conversion of a regular expression into tree automata. In the following, we consider the k-position tree automaton construction. We prove that for a regular expression \\E of a size |\\E| and alphabetic width ||\\E||, the \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06194","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-18T02:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGsyIDDjUHanW5VcK7eNXSvbC31dCk4P33TYnB2lbxb2Goyoq58D/W/QsVQ6YKT4x30tf+y1ne3tQ0/1PFlRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:43:32.467698Z"},"content_sha256":"1c89b54fa88e98c3644c411203acafbe704bf772b4814714e39c08903555a759","schema_version":"1.0","event_id":"sha256:1c89b54fa88e98c3644c411203acafbe704bf772b4814714e39c08903555a759"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5PRSKLRUN7NI3C6Y57SE56K5E/bundle.json","state_url":"https://pith.science/pith/S5PRSKLRUN7NI3C6Y57SE56K5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5PRSKLRUN7NI3C6Y57SE56K5E/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-21T23:43:32Z","links":{"resolver":"https://pith.science/pith/S5PRSKLRUN7NI3C6Y57SE56K5E","bundle":"https://pith.science/pith/S5PRSKLRUN7NI3C6Y57SE56K5E/bundle.json","state":"https://pith.science/pith/S5PRSKLRUN7NI3C6Y57SE56K5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5PRSKLRUN7NI3C6Y57SE56K5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S5PRSKLRUN7NI3C6Y57SE56K5E","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":"db48d07992033f6c86bef7e265ff009270627603ebade8dac5d0b392c55353c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-22T08:57:42Z","title_canon_sha256":"658dc49397224b217d1e93982f8f0b3d5cdfaa315980eea31b48c4235c16473f"},"schema_version":"1.0","source":{"id":"1502.06194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06194","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06194v1","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06194","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"S5PRSKLRUN7N","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S5PRSKLRUN7NI3C6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S5PRSKLR","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:1c89b54fa88e98c3644c411203acafbe704bf772b4814714e39c08903555a759","target":"graph","created_at":"2026-05-18T02:26: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 word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||\\E||+1) states for a word expression of alphabetic width ||\\E||. This kind of automata is extended to regular tree expressions.\n  In this paper, we give an efficient algorithm that computes the \\Follow sets, which are used in different algorithms of conversion of a regular expression into tree automata. In the following, we consider the k-position tree automaton construction. We prove that for a regular expression \\E of a size |\\E| and alphabetic width ||\\E||, the \\","authors_text":"Djelloul Ziadi, Nadia Ouali Sebti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-22T08:57:42Z","title":"Algorithm for the k-Position Tree Automaton Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06194","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:56eeaa7ad104f335b22138e82cb40b4d3c38858eca2c156246495f551403f652","target":"record","created_at":"2026-05-18T02:26: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":"db48d07992033f6c86bef7e265ff009270627603ebade8dac5d0b392c55353c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-02-22T08:57:42Z","title_canon_sha256":"658dc49397224b217d1e93982f8f0b3d5cdfaa315980eea31b48c4235c16473f"},"schema_version":"1.0","source":{"id":"1502.06194","kind":"arxiv","version":1}},"canonical_sha256":"975f192971a37ed46c5ec77f2277cae905d747b1a3c31034a0f18b0d244da2d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"975f192971a37ed46c5ec77f2277cae905d747b1a3c31034a0f18b0d244da2d4","first_computed_at":"2026-05-18T02:26:37.821423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:37.821423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkHgWln1It96doKy8JJSJO0HjZyanXh8wkGB+RRSnMlC8X/YmzS/AhyV06ECjQJsYKFMGd6iZByZ6tz1BFMGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:37.822009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56eeaa7ad104f335b22138e82cb40b4d3c38858eca2c156246495f551403f652","sha256:1c89b54fa88e98c3644c411203acafbe704bf772b4814714e39c08903555a759"],"state_sha256":"1c34e2276b058f90b74ea42029c9e011c1a3709dc21051e21349ffb713b1c846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcmHTyF718pynawsm7LysuQ0k3+Ht0IAp7wBeTdavaCADRoVnXlVk6ROWD33XJWLuYd+vlRcMzVJXjttDdMUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:43:32.469575Z","bundle_sha256":"9298ff30bca7a13135cb454783a75c99d587ca374beafccbcf36d0f0e7ef0f91"}}