{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M2K4SI7IESC3ECULQGR5HZW3RZ","short_pith_number":"pith:M2K4SI7I","canonical_record":{"source":{"id":"1512.08823","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2015-12-30T01:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"e9a4146b6b96557edc6c5532a387da560ee6f8b69ced692246e41741c89f386a","abstract_canon_sha256":"fc2a2b00cef205e01eda50aebe6ffdb0d8c3bb86cee7380eb79d5efd57a38c65"},"schema_version":"1.0"},"canonical_sha256":"6695c923e82485b20a8b81a3d3e6db8e6feaf5ab7565f31087eef9ae3bc99fe4","source":{"kind":"arxiv","id":"1512.08823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08823","created_at":"2026-05-18T01:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08823v2","created_at":"2026-05-18T01:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08823","created_at":"2026-05-18T01:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"M2K4SI7IESC3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M2K4SI7IESC3ECUL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M2K4SI7I","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M2K4SI7IESC3ECULQGR5HZW3RZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.08823","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2015-12-30T01:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"e9a4146b6b96557edc6c5532a387da560ee6f8b69ced692246e41741c89f386a","abstract_canon_sha256":"fc2a2b00cef205e01eda50aebe6ffdb0d8c3bb86cee7380eb79d5efd57a38c65"},"schema_version":"1.0"},"canonical_sha256":"6695c923e82485b20a8b81a3d3e6db8e6feaf5ab7565f31087eef9ae3bc99fe4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:18.367649Z","signature_b64":"HxE5v6topbkFwCUaRZZ/gDAI/aYW6f+lpvV0kyS0Ww7Mu/Wm3o64R0aPjbP0Fzg5EmQjZyokpbsJ1eBhbGFZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6695c923e82485b20a8b81a3d3e6db8e6feaf5ab7565f31087eef9ae3bc99fe4","last_reissued_at":"2026-05-18T01:23:18.367005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:18.367005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.08823","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-18T01:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzYwFGKEAqL+jDStLBNqnqP7MJ8dlodAWdXRmMLa+iTEFiYyWwn6SV3vNWYXQXHVd2U4LxSZthAfsuo6tA8NCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:25:42.700527Z"},"content_sha256":"8d923a3ad95b43d010ad3d7d1d1fb4e0a63508482f41977fc293ec2860c9eabd","schema_version":"1.0","event_id":"sha256:8d923a3ad95b43d010ad3d7d1d1fb4e0a63508482f41977fc293ec2860c9eabd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M2K4SI7IESC3ECULQGR5HZW3RZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduction of Nondeterministic Tree Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Ricardo Almeida, Richard Mayr","submitted_at":"2015-12-30T01:16:49Z","abstract_excerpt":"We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tree-language inclusion is EXPTIME-complete, we describe methods to compute good approximations in polynomial time. We implemented our algorithm as a module of the well-known libvata tree automata library,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08823","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-18T01:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vB8cHHm90pOr9S3geXhoH28dV/WZCGjbXl4uzQoHtQd6ZlIO+KaGnMtEl39j/wRtKBq4PHxVrPuHiBjiV1FEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:25:42.700877Z"},"content_sha256":"68548d004c0e5f374b052b1fb11f8b7556f038bf7b6f6fe2a61540102d49b2a1","schema_version":"1.0","event_id":"sha256:68548d004c0e5f374b052b1fb11f8b7556f038bf7b6f6fe2a61540102d49b2a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2K4SI7IESC3ECULQGR5HZW3RZ/bundle.json","state_url":"https://pith.science/pith/M2K4SI7IESC3ECULQGR5HZW3RZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2K4SI7IESC3ECULQGR5HZW3RZ/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-02T18:25:42Z","links":{"resolver":"https://pith.science/pith/M2K4SI7IESC3ECULQGR5HZW3RZ","bundle":"https://pith.science/pith/M2K4SI7IESC3ECULQGR5HZW3RZ/bundle.json","state":"https://pith.science/pith/M2K4SI7IESC3ECULQGR5HZW3RZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2K4SI7IESC3ECULQGR5HZW3RZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M2K4SI7IESC3ECULQGR5HZW3RZ","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":"fc2a2b00cef205e01eda50aebe6ffdb0d8c3bb86cee7380eb79d5efd57a38c65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2015-12-30T01:16:49Z","title_canon_sha256":"e9a4146b6b96557edc6c5532a387da560ee6f8b69ced692246e41741c89f386a"},"schema_version":"1.0","source":{"id":"1512.08823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08823","created_at":"2026-05-18T01:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08823v2","created_at":"2026-05-18T01:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08823","created_at":"2026-05-18T01:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"M2K4SI7IESC3","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M2K4SI7IESC3ECUL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M2K4SI7I","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:68548d004c0e5f374b052b1fb11f8b7556f038bf7b6f6fe2a61540102d49b2a1","target":"graph","created_at":"2026-05-18T01:23:18Z","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 present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tree-language inclusion is EXPTIME-complete, we describe methods to compute good approximations in polynomial time. We implemented our algorithm as a module of the well-known libvata tree automata library,","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Ricardo Almeida, Richard Mayr","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2015-12-30T01:16:49Z","title":"Reduction of Nondeterministic Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08823","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:8d923a3ad95b43d010ad3d7d1d1fb4e0a63508482f41977fc293ec2860c9eabd","target":"record","created_at":"2026-05-18T01:23:18Z","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":"fc2a2b00cef205e01eda50aebe6ffdb0d8c3bb86cee7380eb79d5efd57a38c65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2015-12-30T01:16:49Z","title_canon_sha256":"e9a4146b6b96557edc6c5532a387da560ee6f8b69ced692246e41741c89f386a"},"schema_version":"1.0","source":{"id":"1512.08823","kind":"arxiv","version":2}},"canonical_sha256":"6695c923e82485b20a8b81a3d3e6db8e6feaf5ab7565f31087eef9ae3bc99fe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6695c923e82485b20a8b81a3d3e6db8e6feaf5ab7565f31087eef9ae3bc99fe4","first_computed_at":"2026-05-18T01:23:18.367005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:18.367005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HxE5v6topbkFwCUaRZZ/gDAI/aYW6f+lpvV0kyS0Ww7Mu/Wm3o64R0aPjbP0Fzg5EmQjZyokpbsJ1eBhbGFZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:18.367649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d923a3ad95b43d010ad3d7d1d1fb4e0a63508482f41977fc293ec2860c9eabd","sha256:68548d004c0e5f374b052b1fb11f8b7556f038bf7b6f6fe2a61540102d49b2a1"],"state_sha256":"908b34b4f22f5dba8cb104d87fff3476830d10043c326f97812f21c1096c6c9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NZJc3SlW42fmK+n47UMyPtlhq2neSxxFM7rBsMRGYbAPmWBEx/IEQxxEHZQdjI7R8VICHq+fgwVZ76PWLSBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:25:42.702877Z","bundle_sha256":"b6eb3c736a45208c4f81bd52c046a2aa664a8b3cb5e46cc58b705a9880aec8fd"}}