{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3MSVX74BZ5JVQVWRRYQPC73UXK","short_pith_number":"pith:3MSVX74B","canonical_record":{"source":{"id":"1404.6673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T19:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"b840ccb9b9aba5e5bf7436aacb4d26b95d73f8a88679f3e9566923fc9246d289","abstract_canon_sha256":"459888396328d17ede964608fbbebe9c4eb23af5735a146ac8d32d6d3b2a4a53"},"schema_version":"1.0"},"canonical_sha256":"db255bff81cf535856d18e20f17f74ba8ff57fdbfe6f40b6936c6c0b45d340f0","source":{"kind":"arxiv","id":"1404.6673","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6673","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6673v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6673","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"3MSVX74BZ5JV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3MSVX74BZ5JVQVWR","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3MSVX74B","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3MSVX74BZ5JVQVWRRYQPC73UXK","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T19:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"b840ccb9b9aba5e5bf7436aacb4d26b95d73f8a88679f3e9566923fc9246d289","abstract_canon_sha256":"459888396328d17ede964608fbbebe9c4eb23af5735a146ac8d32d6d3b2a4a53"},"schema_version":"1.0"},"canonical_sha256":"db255bff81cf535856d18e20f17f74ba8ff57fdbfe6f40b6936c6c0b45d340f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.196748Z","signature_b64":"GpFl4C7HioJtlhjvPJA7qLt4G5/YIJGkh+ih0z/JJOmDHV3o0SSMn3rZGw11eZiw11CD2EfcOOYhHSGJcB1tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db255bff81cf535856d18e20f17f74ba8ff57fdbfe6f40b6936c6c0b45d340f0","last_reissued_at":"2026-05-18T02:52:49.196244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.196244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6673","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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QE9eGmSg3o/OjgXOt1YkxVAad5cziuAYhXgEdJ8Ir8zTHNA2xPoAbBciQ7imjv7Kj5Pr3WB7yz9kn0tANXBuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:53:40.558956Z"},"content_sha256":"34a2a6bd6acf70a19390005203f23c0d4912b73746839b600b1c2a9e8c5b0c9f","schema_version":"1.0","event_id":"sha256:34a2a6bd6acf70a19390005203f23c0d4912b73746839b600b1c2a9e8c5b0c9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3MSVX74BZ5JVQVWRRYQPC73UXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability and Complexity of Minimising Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bj\\\"orn Wachter, Stefan Kiefer","submitted_at":"2014-04-26T19:16:15Z","abstract_excerpt":"We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with floating-point arithmetic. Our algorithm can also be used for \"lossy\" minimisation with bounded error. We show an application in image compression. In the second part of the paper we study the complexity of the minimisation problem for probabilistic automata. We prove that the problem is NP-hard and in PSPACE, improving a recent EXPTIME-result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6673","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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cM9qornPqy9AEtxCyd/O8Jkb7VzcE60Cy6ja42r8uu5cwqJ4lnugECNODHAAOlL/kZYu5vUM21f17hdT70w2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:53:40.559630Z"},"content_sha256":"3df71a274f1d458d786012dcc09e7d941a49a954f0de85e6bb35a486fe85ded0","schema_version":"1.0","event_id":"sha256:3df71a274f1d458d786012dcc09e7d941a49a954f0de85e6bb35a486fe85ded0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MSVX74BZ5JVQVWRRYQPC73UXK/bundle.json","state_url":"https://pith.science/pith/3MSVX74BZ5JVQVWRRYQPC73UXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MSVX74BZ5JVQVWRRYQPC73UXK/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-23T17:53:40Z","links":{"resolver":"https://pith.science/pith/3MSVX74BZ5JVQVWRRYQPC73UXK","bundle":"https://pith.science/pith/3MSVX74BZ5JVQVWRRYQPC73UXK/bundle.json","state":"https://pith.science/pith/3MSVX74BZ5JVQVWRRYQPC73UXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MSVX74BZ5JVQVWRRYQPC73UXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3MSVX74BZ5JVQVWRRYQPC73UXK","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":"459888396328d17ede964608fbbebe9c4eb23af5735a146ac8d32d6d3b2a4a53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T19:16:15Z","title_canon_sha256":"b840ccb9b9aba5e5bf7436aacb4d26b95d73f8a88679f3e9566923fc9246d289"},"schema_version":"1.0","source":{"id":"1404.6673","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6673","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6673v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6673","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"3MSVX74BZ5JV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3MSVX74BZ5JVQVWR","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3MSVX74B","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:3df71a274f1d458d786012dcc09e7d941a49a954f0de85e6bb35a486fe85ded0","target":"graph","created_at":"2026-05-18T02:52:49Z","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 consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with floating-point arithmetic. Our algorithm can also be used for \"lossy\" minimisation with bounded error. We show an application in image compression. In the second part of the paper we study the complexity of the minimisation problem for probabilistic automata. We prove that the problem is NP-hard and in PSPACE, improving a recent EXPTIME-result.","authors_text":"Bj\\\"orn Wachter, Stefan Kiefer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T19:16:15Z","title":"Stability and Complexity of Minimising Probabilistic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6673","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:34a2a6bd6acf70a19390005203f23c0d4912b73746839b600b1c2a9e8c5b0c9f","target":"record","created_at":"2026-05-18T02:52:49Z","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":"459888396328d17ede964608fbbebe9c4eb23af5735a146ac8d32d6d3b2a4a53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T19:16:15Z","title_canon_sha256":"b840ccb9b9aba5e5bf7436aacb4d26b95d73f8a88679f3e9566923fc9246d289"},"schema_version":"1.0","source":{"id":"1404.6673","kind":"arxiv","version":2}},"canonical_sha256":"db255bff81cf535856d18e20f17f74ba8ff57fdbfe6f40b6936c6c0b45d340f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db255bff81cf535856d18e20f17f74ba8ff57fdbfe6f40b6936c6c0b45d340f0","first_computed_at":"2026-05-18T02:52:49.196244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:49.196244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GpFl4C7HioJtlhjvPJA7qLt4G5/YIJGkh+ih0z/JJOmDHV3o0SSMn3rZGw11eZiw11CD2EfcOOYhHSGJcB1tBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:49.196748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6673","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34a2a6bd6acf70a19390005203f23c0d4912b73746839b600b1c2a9e8c5b0c9f","sha256:3df71a274f1d458d786012dcc09e7d941a49a954f0de85e6bb35a486fe85ded0"],"state_sha256":"2babd6cf6ed05bf561c18505c8c3c01b0a1d622d58cd3b7b8e2cfb42d9e62f8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj93cs+Drn3rKC/w3PV86mDWNuhVZoVh0M6W5MtssyRM2WiKJ+7WNqn6Pbk6DAu+zm9HCSt40c6cdXrXDXU+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:53:40.562804Z","bundle_sha256":"1b5c61b93ca9db0bb465c7b42b8d96736f662cf53e2a66775ba18f4500c9dcf3"}}