{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4IH3VZQMYI4MZJTGYU5SIT3XIR","short_pith_number":"pith:4IH3VZQM","canonical_record":{"source":{"id":"1210.6624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-24T18:43:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5e1b8751bffae36cba205a3e64379904a6173927d324c2992e83ce1894a17adc","abstract_canon_sha256":"562b7528744169ffd64c06ec8a6482c184fa6699c1e7e03afe80f17a2f993362"},"schema_version":"1.0"},"canonical_sha256":"e20fbae60cc238cca666c53b244f77447928fd9d568854be25e7ec671d9d9424","source":{"kind":"arxiv","id":"1210.6624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6624","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6624v1","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6624","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"4IH3VZQMYI4M","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4IH3VZQMYI4MZJTG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4IH3VZQM","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4IH3VZQMYI4MZJTGYU5SIT3XIR","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-24T18:43:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5e1b8751bffae36cba205a3e64379904a6173927d324c2992e83ce1894a17adc","abstract_canon_sha256":"562b7528744169ffd64c06ec8a6482c184fa6699c1e7e03afe80f17a2f993362"},"schema_version":"1.0"},"canonical_sha256":"e20fbae60cc238cca666c53b244f77447928fd9d568854be25e7ec671d9d9424","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:24.397810Z","signature_b64":"7mvPWbDnnCOBFLvUf1268ur3AklzEF0q23cxug4rbLBYODlnpZDlgVUi2Jta6+50riZm5+4Xnt3gXx46EPR/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e20fbae60cc238cca666c53b244f77447928fd9d568854be25e7ec671d9d9424","last_reissued_at":"2026-05-18T03:42:24.397302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:24.397302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6624","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:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"679sQyBipgij2pg9m9n1y66/zCJM2ZYJm9rQZxBBLh/pF/M52oSV6xyIGc4+e0mO8N3VfzGyI7lyn7gUmCzHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:00:37.106356Z"},"content_sha256":"81c87b98ffb40d56090319477dcca0eca0d38b144178b0c186a66df57b2dfd20","schema_version":"1.0","event_id":"sha256:81c87b98ffb40d56090319477dcca0eca0d38b144178b0c186a66df57b2dfd20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4IH3VZQMYI4MZJTGYU5SIT3XIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Advanced Automata Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente, Richard Mayr","submitted_at":"2012-10-24T18:43:12Z","abstract_excerpt":"We present an efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-complete automata problems like universality, equivalence and inclusion for much larger instances (1-3 orders of magnitude) than before. This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithm is based on new transition pruning techniques. These use criteria based on combinations of backward and forward trace inclusions. Since these re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6624","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:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXJ8DYfGxKeTeD0JvqQJEtv7Y+rw3j4dGLq4s2GIdJWYVk398l6zn4VvKRIPq2IcW0db8/clDkwWf0Sc5xuaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:00:37.106719Z"},"content_sha256":"f5cd0753a8df0471e7e8a7f70ff2b85c97c9b7a76299dfaa166f7d469a8b644b","schema_version":"1.0","event_id":"sha256:f5cd0753a8df0471e7e8a7f70ff2b85c97c9b7a76299dfaa166f7d469a8b644b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR/bundle.json","state_url":"https://pith.science/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR/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-21T22:00:37Z","links":{"resolver":"https://pith.science/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR","bundle":"https://pith.science/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR/bundle.json","state":"https://pith.science/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IH3VZQMYI4MZJTGYU5SIT3XIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4IH3VZQMYI4MZJTGYU5SIT3XIR","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":"562b7528744169ffd64c06ec8a6482c184fa6699c1e7e03afe80f17a2f993362","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-24T18:43:12Z","title_canon_sha256":"5e1b8751bffae36cba205a3e64379904a6173927d324c2992e83ce1894a17adc"},"schema_version":"1.0","source":{"id":"1210.6624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6624","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6624v1","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6624","created_at":"2026-05-18T03:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"4IH3VZQMYI4M","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4IH3VZQMYI4MZJTG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4IH3VZQM","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:f5cd0753a8df0471e7e8a7f70ff2b85c97c9b7a76299dfaa166f7d469a8b644b","target":"graph","created_at":"2026-05-18T03:42:24Z","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 Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-complete automata problems like universality, equivalence and inclusion for much larger instances (1-3 orders of magnitude) than before. This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithm is based on new transition pruning techniques. These use criteria based on combinations of backward and forward trace inclusions. Since these re","authors_text":"Lorenzo Clemente, Richard Mayr","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-24T18:43:12Z","title":"Advanced Automata Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6624","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:81c87b98ffb40d56090319477dcca0eca0d38b144178b0c186a66df57b2dfd20","target":"record","created_at":"2026-05-18T03:42:24Z","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":"562b7528744169ffd64c06ec8a6482c184fa6699c1e7e03afe80f17a2f993362","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-24T18:43:12Z","title_canon_sha256":"5e1b8751bffae36cba205a3e64379904a6173927d324c2992e83ce1894a17adc"},"schema_version":"1.0","source":{"id":"1210.6624","kind":"arxiv","version":1}},"canonical_sha256":"e20fbae60cc238cca666c53b244f77447928fd9d568854be25e7ec671d9d9424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e20fbae60cc238cca666c53b244f77447928fd9d568854be25e7ec671d9d9424","first_computed_at":"2026-05-18T03:42:24.397302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:24.397302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7mvPWbDnnCOBFLvUf1268ur3AklzEF0q23cxug4rbLBYODlnpZDlgVUi2Jta6+50riZm5+4Xnt3gXx46EPR/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:24.397810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81c87b98ffb40d56090319477dcca0eca0d38b144178b0c186a66df57b2dfd20","sha256:f5cd0753a8df0471e7e8a7f70ff2b85c97c9b7a76299dfaa166f7d469a8b644b"],"state_sha256":"b0360265b386fdcf93089f5c11105f12dcab51c5d792cd80b672e6ca1cba09ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ij1f2i8cw8+kQ9UIWPa3y3rvjc5s20a73ltJb2i9R2As8LWlU3AU/dY2B/W8WHUqEch9ENwZtIJNKkKqTjKoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:00:37.108690Z","bundle_sha256":"b171d795084a6ee8f1f84c5e3ffdd6337a58bb52696d88aa53509e5ac67d0b70"}}