{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O3E635ZRPJ5HPEO27VCUARVYQE","short_pith_number":"pith:O3E635ZR","canonical_record":{"source":{"id":"1709.03122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-10T15:59:59Z","cross_cats_sorted":[],"title_canon_sha256":"55d48f7fb054bfe95bf57092079e31a12d2abae514a7ba5109e4d1b11938f060","abstract_canon_sha256":"2d0851023e22ca85e792865bb0f2ccf15399e2ec8ab6b7d7ebbfd466672b04e8"},"schema_version":"1.0"},"canonical_sha256":"76c9edf7317a7a7791dafd454046b8812a8810559e599a82e0931b5746d98e4c","source":{"kind":"arxiv","id":"1709.03122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03122","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03122v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03122","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"O3E635ZRPJ5H","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O3E635ZRPJ5HPEO2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O3E635ZR","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O3E635ZRPJ5HPEO27VCUARVYQE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-10T15:59:59Z","cross_cats_sorted":[],"title_canon_sha256":"55d48f7fb054bfe95bf57092079e31a12d2abae514a7ba5109e4d1b11938f060","abstract_canon_sha256":"2d0851023e22ca85e792865bb0f2ccf15399e2ec8ab6b7d7ebbfd466672b04e8"},"schema_version":"1.0"},"canonical_sha256":"76c9edf7317a7a7791dafd454046b8812a8810559e599a82e0931b5746d98e4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.310153Z","signature_b64":"reluzmGXvFZVbL3/htdeABwaj18i0pbq151wBAQJv4c+PD+EFB107WaLIT7fNqlgIFNj1klYihCA/Rkneq1IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76c9edf7317a7a7791dafd454046b8812a8810559e599a82e0931b5746d98e4c","last_reissued_at":"2026-05-18T00:35:39.309495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.309495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03122","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-18T00:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/sgsS+eph5ZgAPHc+jaQyUIm6XgMiVlS2zKL1s1g7ywc06JGfuUwpGcLMBowHcRRFeUj2lTt+DyejLF42+VDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:18:27.924164Z"},"content_sha256":"33f2f236d0f1bb7c57bb360c17eb28d9e756e62a9a3455fd89512c6dfcba44b5","schema_version":"1.0","event_id":"sha256:33f2f236d0f1bb7c57bb360c17eb28d9e756e62a9a3455fd89512c6dfcba44b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O3E635ZRPJ5HPEO27VCUARVYQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two Recursively Inseparable Problems for Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Florian Horn, Hugo Gimbert, Nathana\\\"el Fijalkow, Youssouf Oualhadj","submitted_at":"2017-09-10T15:59:59Z","abstract_excerpt":"This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transitions.\n  We show that the two following properties of numberless probabilistic automata are recursively inseparable: - all instances of the numberless automaton have value 1, - no instance of the numberle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03122","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-18T00:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTcqEmoR1H3rqnmH+YpRgiBCQr4jVX20hTdXp7cwReH27rWJN+i1Ba0ECleub0ImU2lvjuyDajOBfAPY4esRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:18:27.924851Z"},"content_sha256":"0a634e248f923b1e013f6e32bc6fc5c2498cfe0c2068cb427287498978ecddac","schema_version":"1.0","event_id":"sha256:0a634e248f923b1e013f6e32bc6fc5c2498cfe0c2068cb427287498978ecddac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3E635ZRPJ5HPEO27VCUARVYQE/bundle.json","state_url":"https://pith.science/pith/O3E635ZRPJ5HPEO27VCUARVYQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3E635ZRPJ5HPEO27VCUARVYQE/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-28T19:18:27Z","links":{"resolver":"https://pith.science/pith/O3E635ZRPJ5HPEO27VCUARVYQE","bundle":"https://pith.science/pith/O3E635ZRPJ5HPEO27VCUARVYQE/bundle.json","state":"https://pith.science/pith/O3E635ZRPJ5HPEO27VCUARVYQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3E635ZRPJ5HPEO27VCUARVYQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O3E635ZRPJ5HPEO27VCUARVYQE","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":"2d0851023e22ca85e792865bb0f2ccf15399e2ec8ab6b7d7ebbfd466672b04e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-10T15:59:59Z","title_canon_sha256":"55d48f7fb054bfe95bf57092079e31a12d2abae514a7ba5109e4d1b11938f060"},"schema_version":"1.0","source":{"id":"1709.03122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03122","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03122v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03122","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"O3E635ZRPJ5H","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O3E635ZRPJ5HPEO2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O3E635ZR","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:0a634e248f923b1e013f6e32bc6fc5c2498cfe0c2068cb427287498978ecddac","target":"graph","created_at":"2026-05-18T00:35:39Z","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":"This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transitions.\n  We show that the two following properties of numberless probabilistic automata are recursively inseparable: - all instances of the numberless automaton have value 1, - no instance of the numberle","authors_text":"Florian Horn, Hugo Gimbert, Nathana\\\"el Fijalkow, Youssouf Oualhadj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-10T15:59:59Z","title":"Two Recursively Inseparable Problems for Probabilistic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03122","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:33f2f236d0f1bb7c57bb360c17eb28d9e756e62a9a3455fd89512c6dfcba44b5","target":"record","created_at":"2026-05-18T00:35:39Z","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":"2d0851023e22ca85e792865bb0f2ccf15399e2ec8ab6b7d7ebbfd466672b04e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-10T15:59:59Z","title_canon_sha256":"55d48f7fb054bfe95bf57092079e31a12d2abae514a7ba5109e4d1b11938f060"},"schema_version":"1.0","source":{"id":"1709.03122","kind":"arxiv","version":1}},"canonical_sha256":"76c9edf7317a7a7791dafd454046b8812a8810559e599a82e0931b5746d98e4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76c9edf7317a7a7791dafd454046b8812a8810559e599a82e0931b5746d98e4c","first_computed_at":"2026-05-18T00:35:39.309495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:39.309495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"reluzmGXvFZVbL3/htdeABwaj18i0pbq151wBAQJv4c+PD+EFB107WaLIT7fNqlgIFNj1klYihCA/Rkneq1IDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:39.310153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33f2f236d0f1bb7c57bb360c17eb28d9e756e62a9a3455fd89512c6dfcba44b5","sha256:0a634e248f923b1e013f6e32bc6fc5c2498cfe0c2068cb427287498978ecddac"],"state_sha256":"b479153509ffd3ca3435504384af0318a301ea035ac838df41ea6839a596cc9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1fT/bVpiB4gYivCzKQboHXqd0PvG21ZgwH2o1dQlgQ4rPlIBTLPbalL1RmfqS0sC467a46ZRP2YVqda6RazAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:18:27.928503Z","bundle_sha256":"938c70e6942987ee700c1aa765603f6efd63af2c5f2e58521236a00db8df42eb"}}