{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JGAB4TKRV7JXQ3765SVYKGPPF4","short_pith_number":"pith:JGAB4TKR","canonical_record":{"source":{"id":"1401.6840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-27T13:11:14Z","cross_cats_sorted":[],"title_canon_sha256":"ebaa1fb1f37ee883767dd0c1f90a773b83c8abc17527228d16adad4e5a530da8","abstract_canon_sha256":"f4da8cc7b45e22c9296a86f8d57657864e0614575d952e4677951156c59d7713"},"schema_version":"1.0"},"canonical_sha256":"49801e4d51afd3786ffeecab8519ef2f3750d5a8953aa8d195334aa37503894b","source":{"kind":"arxiv","id":"1401.6840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6840","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6840v1","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6840","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"JGAB4TKRV7JX","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGAB4TKRV7JXQ376","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGAB4TKR","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JGAB4TKRV7JXQ3765SVYKGPPF4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-27T13:11:14Z","cross_cats_sorted":[],"title_canon_sha256":"ebaa1fb1f37ee883767dd0c1f90a773b83c8abc17527228d16adad4e5a530da8","abstract_canon_sha256":"f4da8cc7b45e22c9296a86f8d57657864e0614575d952e4677951156c59d7713"},"schema_version":"1.0"},"canonical_sha256":"49801e4d51afd3786ffeecab8519ef2f3750d5a8953aa8d195334aa37503894b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:00.483579Z","signature_b64":"UlCXM/xfZZo0CXfnd9ndTJFbOkAgTzLhWetWdzyxLRfk8xBTth741Ei6DVsZ5suIs/UZ86Rz1COi0l+CQiwYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49801e4d51afd3786ffeecab8519ef2f3750d5a8953aa8d195334aa37503894b","last_reissued_at":"2026-05-18T03:01:00.482777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:00.482777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6840","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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKGZzJglqwgAuuIW4nzLCM0pnF9d8QWA0TIhXl1qu4wxvgHDKOmRsRUbhEVCv97X3pIoZFAO1OY7Y2gJagi0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:22:23.281598Z"},"content_sha256":"b147505b6ec91d7e963d4f31ec87d7997877b324358914326de2254e4dab47be","schema_version":"1.0","event_id":"sha256:b147505b6ec91d7e963d4f31ec87d7997877b324358914326de2254e4dab47be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JGAB4TKRV7JXQ3765SVYKGPPF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zero-Reachability in Probabilistic Multi-Counter Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Anton\\'in Ku\\v{c}era, Joost-Pieter Katoen, Petr Novotn\\'y, Stefan Kiefer, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2014-01-27T13:11:14Z","abstract_excerpt":"We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we are interested in the probability of all runs that visit zero in some counter, we show that the qualitative zero-reachability is decidable in time which is polynomial in the size of a given pMC and doubly exponential in the number of counters. Further, we show that the probability of all zero-reaching runs can be effectively approximated up to an arbitraril"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6840","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:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sIgH7NziKa3EcWBD8dA//fmYzbHPKyWKBy9DI/VPvuvp/tPB1R6tib6EReiuANsNdVqMfHx7lR379W/4rlTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:22:23.281942Z"},"content_sha256":"29ff453409753e30fd65f5a71e706177e524df60450061b05e8948267c38829b","schema_version":"1.0","event_id":"sha256:29ff453409753e30fd65f5a71e706177e524df60450061b05e8948267c38829b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGAB4TKRV7JXQ3765SVYKGPPF4/bundle.json","state_url":"https://pith.science/pith/JGAB4TKRV7JXQ3765SVYKGPPF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGAB4TKRV7JXQ3765SVYKGPPF4/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-04T09:22:23Z","links":{"resolver":"https://pith.science/pith/JGAB4TKRV7JXQ3765SVYKGPPF4","bundle":"https://pith.science/pith/JGAB4TKRV7JXQ3765SVYKGPPF4/bundle.json","state":"https://pith.science/pith/JGAB4TKRV7JXQ3765SVYKGPPF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGAB4TKRV7JXQ3765SVYKGPPF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JGAB4TKRV7JXQ3765SVYKGPPF4","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":"f4da8cc7b45e22c9296a86f8d57657864e0614575d952e4677951156c59d7713","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-27T13:11:14Z","title_canon_sha256":"ebaa1fb1f37ee883767dd0c1f90a773b83c8abc17527228d16adad4e5a530da8"},"schema_version":"1.0","source":{"id":"1401.6840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6840","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6840v1","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6840","created_at":"2026-05-18T03:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"JGAB4TKRV7JX","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGAB4TKRV7JXQ376","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGAB4TKR","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:29ff453409753e30fd65f5a71e706177e524df60450061b05e8948267c38829b","target":"graph","created_at":"2026-05-18T03:01:00Z","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 study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we are interested in the probability of all runs that visit zero in some counter, we show that the qualitative zero-reachability is decidable in time which is polynomial in the size of a given pMC and doubly exponential in the number of counters. Further, we show that the probability of all zero-reaching runs can be effectively approximated up to an arbitraril","authors_text":"Anton\\'in Ku\\v{c}era, Joost-Pieter Katoen, Petr Novotn\\'y, Stefan Kiefer, Tom\\'a\\v{s} Br\\'azdil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-27T13:11:14Z","title":"Zero-Reachability in Probabilistic Multi-Counter Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6840","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:b147505b6ec91d7e963d4f31ec87d7997877b324358914326de2254e4dab47be","target":"record","created_at":"2026-05-18T03:01:00Z","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":"f4da8cc7b45e22c9296a86f8d57657864e0614575d952e4677951156c59d7713","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-27T13:11:14Z","title_canon_sha256":"ebaa1fb1f37ee883767dd0c1f90a773b83c8abc17527228d16adad4e5a530da8"},"schema_version":"1.0","source":{"id":"1401.6840","kind":"arxiv","version":1}},"canonical_sha256":"49801e4d51afd3786ffeecab8519ef2f3750d5a8953aa8d195334aa37503894b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49801e4d51afd3786ffeecab8519ef2f3750d5a8953aa8d195334aa37503894b","first_computed_at":"2026-05-18T03:01:00.482777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:00.482777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlCXM/xfZZo0CXfnd9ndTJFbOkAgTzLhWetWdzyxLRfk8xBTth741Ei6DVsZ5suIs/UZ86Rz1COi0l+CQiwYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:00.483579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b147505b6ec91d7e963d4f31ec87d7997877b324358914326de2254e4dab47be","sha256:29ff453409753e30fd65f5a71e706177e524df60450061b05e8948267c38829b"],"state_sha256":"799fcedd42c993af09efcdd5f7ad1a6b1f71bf26e4b06481341ce1229f030d7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1CPyX2oXUjxXty6k9KQZ1cDTyo6VvfE2/Yf2Us/8hlcCE8xigMlumSFPfoJ5rp3VDTr55JnsPn1EUjHBDqdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:22:23.283887Z","bundle_sha256":"e66ca2641a7f503a1ff2c064d7a0614a8fecd9c3a776493893f06ca761b80da7"}}