{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZYHOOCZHCZCODEFFWKBFVIPCLU","short_pith_number":"pith:ZYHOOCZH","canonical_record":{"source":{"id":"1807.08487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T08:59:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"5b2012e932cf20e1862927c37f2410d67687db02061987f65e17db2fcd32ef6d","abstract_canon_sha256":"059c9eb64467de32a7069b3d86a1b5258eafa2fc46cb3b5a42b382541a8039aa"},"schema_version":"1.0"},"canonical_sha256":"ce0ee70b271644e190a5b2825aa1e25d3e08546eda136dc59121afe51d6800ce","source":{"kind":"arxiv","id":"1807.08487","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZYHOOCZHCZCODEFFWKBFVIPCLU","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T08:59:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"5b2012e932cf20e1862927c37f2410d67687db02061987f65e17db2fcd32ef6d","abstract_canon_sha256":"059c9eb64467de32a7069b3d86a1b5258eafa2fc46cb3b5a42b382541a8039aa"},"schema_version":"1.0"},"canonical_sha256":"ce0ee70b271644e190a5b2825aa1e25d3e08546eda136dc59121afe51d6800ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:41.186730Z","signature_b64":"LPhMs86Ix3NZBKsIgYLntMfTb5/P7x7ZKNr/3NcIW6u5UI9lj0vUZut4dhgoTyoqErYRrBx4mueQ0Cu00STLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0ee70b271644e190a5b2825aa1e25d3e08546eda136dc59121afe51d6800ce","last_reissued_at":"2026-05-18T00:09:41.185983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:41.185983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08487","source_version":2,"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-18T00:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+a3R4H5tCBSowX9RICFGnz/x2kFj/+9UE+NJygECYAFttYkW34CozEXDMDunmuX4JnzlTkDVFN6IYI+6qJGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:27:34.124660Z"},"content_sha256":"cdee7e312b18ceff401c02bbc26987a5d845c9057e2c9148b299c9a90a5e17ca","schema_version":"1.0","event_id":"sha256:cdee7e312b18ceff401c02bbc26987a5d845c9057e2c9148b299c9a90a5e17ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZYHOOCZHCZCODEFFWKBFVIPCLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulation Algorithms for Symbolic Automata (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","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","submitted_at":"2018-07-23T08:59:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08487","kind":"arxiv","version":2},"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-18T00:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPXt7FV398ppyakzdj5HswlK+A04rVXn+6LKK+ydwfm5z/7Km8zom/IeGM5xqBzIzmuoNMb9XyqmolTHGTW8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:27:34.125037Z"},"content_sha256":"66ca750fe29b41f42dd096e075c550b4cef1a6ecd566fe7d78e831a499088fb1","schema_version":"1.0","event_id":"sha256:66ca750fe29b41f42dd096e075c550b4cef1a6ecd566fe7d78e831a499088fb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU/bundle.json","state_url":"https://pith.science/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU/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-29T03:27:34Z","links":{"resolver":"https://pith.science/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU","bundle":"https://pith.science/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU/bundle.json","state":"https://pith.science/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYHOOCZHCZCODEFFWKBFVIPCLU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgmegqE6bfn3HdTObSgh+qyNqMzri6NITSV7VpSi22R8M5cW1wSztVXvtq9Um/SPki8+NTYfZ4d0/s1j7g1CCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:27:34.127244Z","bundle_sha256":"94bd8e45a503befee0aeb1d406ef19e1757cf74a5aa557dd6be0dcdcad2bc88d"}}