{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DX3PZMYGN5KA3SL7X24Y3CD22","short_pith_number":"pith:4DX3PZMY","canonical_record":{"source":{"id":"1410.3770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-13T06:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"0ba6a3c5d211fef58a68ceae9a30649c1de8331061b4f1a799d499ba23d1e945","abstract_canon_sha256":"ce942c2d2e1d2aa5eb40753f8602121240112a6e5778c4af66edecf4f340ff61"},"schema_version":"1.0"},"canonical_sha256":"e0efb7e598337aa06e4bfdf5cc6c43d69446ba002fb2f5a60c990785fb97f9a0","source":{"kind":"arxiv","id":"1410.3770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3770","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3770v1","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3770","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"4DX3PZMYGN5K","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DX3PZMYGN5KA3SL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DX3PZMY","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DX3PZMYGN5KA3SL7X24Y3CD22","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-13T06:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"0ba6a3c5d211fef58a68ceae9a30649c1de8331061b4f1a799d499ba23d1e945","abstract_canon_sha256":"ce942c2d2e1d2aa5eb40753f8602121240112a6e5778c4af66edecf4f340ff61"},"schema_version":"1.0"},"canonical_sha256":"e0efb7e598337aa06e4bfdf5cc6c43d69446ba002fb2f5a60c990785fb97f9a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:04.284362Z","signature_b64":"L8ODPq2TY6Fipnqf3FMpy47/EVVYGIsYaihX7Cqd43ZD37hWYWpRMmRZYc062q2s6yEGlOb3nGV5OtYfSFp1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0efb7e598337aa06e4bfdf5cc6c43d69446ba002fb2f5a60c990785fb97f9a0","last_reissued_at":"2026-05-18T02:40:04.283845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:04.283845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3770","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-18T02:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10h21MplF6gEyWhADo9K+NW7SR2jvhHXPxbc/E6H6Fcz/h37r1MgfDs6JXB/gJTKDsCEdT3lG2jeNPWhobqVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:06:05.595113Z"},"content_sha256":"51ec5ecc47c57a261a1e63881ff78955cde47ff95e7a59d15c125e8f72a29f7c","schema_version":"1.0","event_id":"sha256:51ec5ecc47c57a261a1e63881ff78955cde47ff95e7a59d15c125e8f72a29f7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DX3PZMYGN5KA3SL7X24Y3CD22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What is known about the Value 1 Problem for Probabilistic Automata?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Nathana\\\"el Fijalkow (LIAFA)","submitted_at":"2014-10-13T06:40:22Z","abstract_excerpt":"The value 1 problem is a decision problem for probabilistic automata over finite words: are there words accepted by the automaton with arbitrarily high probability? Although undecidable, this problem attracted a lot of attention over the last few years. The aim of this paper is to review and relate the results pertaining to the value 1 problem. In particular, several algorithms have been proposed to partially solve this problem. We show the relations between them, leading to the following conclusion: the Markov Monoid Algorithm is the most correct algorithm known to (partially) solve the value"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3770","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-18T02:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbVAN+w8Wr5qmQ8FbP2RLKKg9JqYMBn1YoHExxDlNbzfdinEQw4nde9N3s+2BvqYWqWXm8mhvSpaAYORVLPBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:06:05.595735Z"},"content_sha256":"d9321f8c0c9a8e01123c6ab00f2b05d0b13bca169aa5e8930f940b855fd7cb40","schema_version":"1.0","event_id":"sha256:d9321f8c0c9a8e01123c6ab00f2b05d0b13bca169aa5e8930f940b855fd7cb40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DX3PZMYGN5KA3SL7X24Y3CD22/bundle.json","state_url":"https://pith.science/pith/4DX3PZMYGN5KA3SL7X24Y3CD22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DX3PZMYGN5KA3SL7X24Y3CD22/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-07-02T00:06:05Z","links":{"resolver":"https://pith.science/pith/4DX3PZMYGN5KA3SL7X24Y3CD22","bundle":"https://pith.science/pith/4DX3PZMYGN5KA3SL7X24Y3CD22/bundle.json","state":"https://pith.science/pith/4DX3PZMYGN5KA3SL7X24Y3CD22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DX3PZMYGN5KA3SL7X24Y3CD22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DX3PZMYGN5KA3SL7X24Y3CD22","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":"ce942c2d2e1d2aa5eb40753f8602121240112a6e5778c4af66edecf4f340ff61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-13T06:40:22Z","title_canon_sha256":"0ba6a3c5d211fef58a68ceae9a30649c1de8331061b4f1a799d499ba23d1e945"},"schema_version":"1.0","source":{"id":"1410.3770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3770","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3770v1","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3770","created_at":"2026-05-18T02:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"4DX3PZMYGN5K","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DX3PZMYGN5KA3SL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DX3PZMY","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:d9321f8c0c9a8e01123c6ab00f2b05d0b13bca169aa5e8930f940b855fd7cb40","target":"graph","created_at":"2026-05-18T02:40:04Z","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":"The value 1 problem is a decision problem for probabilistic automata over finite words: are there words accepted by the automaton with arbitrarily high probability? Although undecidable, this problem attracted a lot of attention over the last few years. The aim of this paper is to review and relate the results pertaining to the value 1 problem. In particular, several algorithms have been proposed to partially solve this problem. We show the relations between them, leading to the following conclusion: the Markov Monoid Algorithm is the most correct algorithm known to (partially) solve the value","authors_text":"Nathana\\\"el Fijalkow (LIAFA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-13T06:40:22Z","title":"What is known about the Value 1 Problem for Probabilistic Automata?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3770","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:51ec5ecc47c57a261a1e63881ff78955cde47ff95e7a59d15c125e8f72a29f7c","target":"record","created_at":"2026-05-18T02:40:04Z","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":"ce942c2d2e1d2aa5eb40753f8602121240112a6e5778c4af66edecf4f340ff61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-13T06:40:22Z","title_canon_sha256":"0ba6a3c5d211fef58a68ceae9a30649c1de8331061b4f1a799d499ba23d1e945"},"schema_version":"1.0","source":{"id":"1410.3770","kind":"arxiv","version":1}},"canonical_sha256":"e0efb7e598337aa06e4bfdf5cc6c43d69446ba002fb2f5a60c990785fb97f9a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0efb7e598337aa06e4bfdf5cc6c43d69446ba002fb2f5a60c990785fb97f9a0","first_computed_at":"2026-05-18T02:40:04.283845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:04.283845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L8ODPq2TY6Fipnqf3FMpy47/EVVYGIsYaihX7Cqd43ZD37hWYWpRMmRZYc062q2s6yEGlOb3nGV5OtYfSFp1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:04.284362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51ec5ecc47c57a261a1e63881ff78955cde47ff95e7a59d15c125e8f72a29f7c","sha256:d9321f8c0c9a8e01123c6ab00f2b05d0b13bca169aa5e8930f940b855fd7cb40"],"state_sha256":"d0dfa3f0259e0e5fd5939b2de9a1b9d879d16cd34a4262829a65239eae7a148c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTCpOTt4i2X13KJMGGuGLI+jjoBLpQU2M1JHSGth28wweyVlD85j8aa77M9vBz8D/+0uZ/ShS1tATQqXW+wGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T00:06:05.598902Z","bundle_sha256":"c6339162a720e458b92b4083fc38c54ca7732c0ed711b4f60cbe71f285894212"}}