{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IAL7XRNVIXD4U4EII3WYORD7J3","short_pith_number":"pith:IAL7XRNV","canonical_record":{"source":{"id":"1401.5951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-23T12:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"960f5314beb09fc4727e0782188b3bd701edac93d789f8f16997e916f8fee830","abstract_canon_sha256":"19e2435c91d516b6d1cc67d937574317bc20acefc2ca23b8e67e1adb70f65247"},"schema_version":"1.0"},"canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","source":{"kind":"arxiv","id":"1401.5951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5951","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5951v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5951","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"IAL7XRNVIXD4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IAL7XRNVIXD4U4EI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IAL7XRNV","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IAL7XRNVIXD4U4EII3WYORD7J3","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-23T12:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"960f5314beb09fc4727e0782188b3bd701edac93d789f8f16997e916f8fee830","abstract_canon_sha256":"19e2435c91d516b6d1cc67d937574317bc20acefc2ca23b8e67e1adb70f65247"},"schema_version":"1.0"},"canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.315045Z","signature_b64":"E066+ONW/WnzQqZo8ffwVBgLwWAek7kmbneVL9UWMMlUmB5L2SDUQGax/QvPqZOCceZMlM7OpeukQkTprGQWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","last_reissued_at":"2026-05-18T03:01:23.314284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.314284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5951","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RlGPa19s4I4jsPFa5amYQsmrbt1MCxxHb+uCqFYgPAyqYL+mbEbh/19pNQbgHMgMSkJZiRIVlf2y2tjCt2qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:14:14.534673Z"},"content_sha256":"e85a981041ec4376de83dd99cc91838c54f793283c59345a7286ca0e23816bab","schema_version":"1.0","event_id":"sha256:e85a981041ec4376de83dd99cc91838c54f793283c59345a7286ca0e23816bab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IAL7XRNVIXD4U4EII3WYORD7J3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for the Equation Tree Automaton via the $k$-C-Continuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Ludovic Mignot, Nadia Ouali Sebti","submitted_at":"2014-01-23T12:11:52Z","abstract_excerpt":"Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression $E$ via the $k$-C-Continuations.\n  Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression $E$ over a ranked alphabet $\\Sigma$ and produce a $O(R\\cdot|E|^2)$ time and space complexity algorithm, where $R$ is the maximal rank of a symbol occurring in $\\Sigma$ and $|E|$ is the size of $E$. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an $O(|Q|\\cdot|E|)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5951","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnJ5SPj1uV3PiFNnfKkWDP2+gLnUbQDuZxd6lq0fu0ytV+UTBwYXvahbggwEGSXRQuHLIYAXmhPaumMawnTVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:14:14.535019Z"},"content_sha256":"32f8b9b98a958105b192b6e3fc352e6f33b161b8061a08c601622a5662649f18","schema_version":"1.0","event_id":"sha256:32f8b9b98a958105b192b6e3fc352e6f33b161b8061a08c601622a5662649f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/bundle.json","state_url":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAL7XRNVIXD4U4EII3WYORD7J3/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-28T01:14:14Z","links":{"resolver":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3","bundle":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/bundle.json","state":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAL7XRNVIXD4U4EII3WYORD7J3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IAL7XRNVIXD4U4EII3WYORD7J3","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":"19e2435c91d516b6d1cc67d937574317bc20acefc2ca23b8e67e1adb70f65247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-23T12:11:52Z","title_canon_sha256":"960f5314beb09fc4727e0782188b3bd701edac93d789f8f16997e916f8fee830"},"schema_version":"1.0","source":{"id":"1401.5951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5951","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5951v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5951","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"IAL7XRNVIXD4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IAL7XRNVIXD4U4EI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IAL7XRNV","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:32f8b9b98a958105b192b6e3fc352e6f33b161b8061a08c601622a5662649f18","target":"graph","created_at":"2026-05-18T03:01:23Z","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":"Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression $E$ via the $k$-C-Continuations.\n  Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression $E$ over a ranked alphabet $\\Sigma$ and produce a $O(R\\cdot|E|^2)$ time and space complexity algorithm, where $R$ is the maximal rank of a symbol occurring in $\\Sigma$ and $|E|$ is the size of $E$. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an $O(|Q|\\cdot|E|)$","authors_text":"Djelloul Ziadi, Ludovic Mignot, Nadia Ouali Sebti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-23T12:11:52Z","title":"An Efficient Algorithm for the Equation Tree Automaton via the $k$-C-Continuations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5951","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:e85a981041ec4376de83dd99cc91838c54f793283c59345a7286ca0e23816bab","target":"record","created_at":"2026-05-18T03:01:23Z","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":"19e2435c91d516b6d1cc67d937574317bc20acefc2ca23b8e67e1adb70f65247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-23T12:11:52Z","title_canon_sha256":"960f5314beb09fc4727e0782188b3bd701edac93d789f8f16997e916f8fee830"},"schema_version":"1.0","source":{"id":"1401.5951","kind":"arxiv","version":1}},"canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","first_computed_at":"2026-05-18T03:01:23.314284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.314284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E066+ONW/WnzQqZo8ffwVBgLwWAek7kmbneVL9UWMMlUmB5L2SDUQGax/QvPqZOCceZMlM7OpeukQkTprGQWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.315045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e85a981041ec4376de83dd99cc91838c54f793283c59345a7286ca0e23816bab","sha256:32f8b9b98a958105b192b6e3fc352e6f33b161b8061a08c601622a5662649f18"],"state_sha256":"ea5eaec98788203af3f0a0ec3847f6f77df09689270ac326308b928aae0c9caf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1HrlxxOQfOqO9Ah4t4bKmKtJtsC93lc8rs1s6aFZig5xQDJiCSOW+qY+fraf2KzkeS1HwYwbm82L/ccOYvLpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:14:14.537237Z","bundle_sha256":"38c73c4e23b7d8155fe2d77e7faa8d23c2d6b8b71356c2bb46d401337e92669e"}}