{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZYHOOCZHCZCODEFFWKBFVIPCLU","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":"059c9eb64467de32a7069b3d86a1b5258eafa2fc46cb3b5a42b382541a8039aa","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T08:59:11Z","title_canon_sha256":"5b2012e932cf20e1862927c37f2410d67687db02061987f65e17db2fcd32ef6d"},"schema_version":"1.0","source":{"id":"1807.08487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08487","created_at":"2026-05-18T00:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08487v2","created_at":"2026-05-18T00:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08487","created_at":"2026-05-18T00:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZYHOOCZHCZCO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZYHOOCZHCZCODEFF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZYHOOCZH","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:66ca750fe29b41f42dd096e075c550b4cef1a6ecd566fe7d78e831a499088fb1","target":"graph","created_at":"2026-05-18T00:09:41Z","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":"We investigate means of efficient computation of the simulation relation over symbolic finite automata (SFAs), i.e., finite automata with transitions labeled by predicates over alphabet symbols. In one approach, we build on the algorithm by Ilie, Navaro, and Yu proposed originally for classical finite automata, modifying it using the so-called mintermisation of the transition predicates. This solution, however, generates all Boolean combinations of the predicates, which easily causes an exponential blowup in the number of transitions. Therefore, we propose two more advanced solutions. The firs","authors_text":"Juraj S\\'i\\v{c}, Luk\\'a\\v{s} Hol\\'ik, Margus Veanes, Ond\\v{r}ej Leng\\'al, Tom\\'a\\v{s} Vojnar","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T08:59:11Z","title":"Simulation Algorithms for Symbolic Automata (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08487","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:cdee7e312b18ceff401c02bbc26987a5d845c9057e2c9148b299c9a90a5e17ca","target":"record","created_at":"2026-05-18T00:09:41Z","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":"059c9eb64467de32a7069b3d86a1b5258eafa2fc46cb3b5a42b382541a8039aa","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T08:59:11Z","title_canon_sha256":"5b2012e932cf20e1862927c37f2410d67687db02061987f65e17db2fcd32ef6d"},"schema_version":"1.0","source":{"id":"1807.08487","kind":"arxiv","version":2}},"canonical_sha256":"ce0ee70b271644e190a5b2825aa1e25d3e08546eda136dc59121afe51d6800ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce0ee70b271644e190a5b2825aa1e25d3e08546eda136dc59121afe51d6800ce","first_computed_at":"2026-05-18T00:09:41.185983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:41.185983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LPhMs86Ix3NZBKsIgYLntMfTb5/P7x7ZKNr/3NcIW6u5UI9lj0vUZut4dhgoTyoqErYRrBx4mueQ0Cu00STLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:41.186730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdee7e312b18ceff401c02bbc26987a5d845c9057e2c9148b299c9a90a5e17ca","sha256:66ca750fe29b41f42dd096e075c550b4cef1a6ecd566fe7d78e831a499088fb1"],"state_sha256":"d2df89b0a7e8e19bbe6f2298c72c748c12fcc1fb996fb67e4fe7fd7714e5074b"}