{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:G3LPKMOOJS4YRFDOEE7PF3TFZX","short_pith_number":"pith:G3LPKMOO","canonical_record":{"source":{"id":"1011.0222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-01T00:19:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6d8511c9c411ab05719c0b98df094199d59cbe42e735366c3059774353c22833","abstract_canon_sha256":"7cf098630f2beeb978646b556b3fbba41197ef1f01c17c3c022501249b999108"},"schema_version":"1.0"},"canonical_sha256":"36d6f531ce4cb988946e213ef2ee65cdd621f210d0e39b75e399381b9074a9c7","source":{"kind":"arxiv","id":"1011.0222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0222","created_at":"2026-05-18T04:37:30Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0222v1","created_at":"2026-05-18T04:37:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0222","created_at":"2026-05-18T04:37:30Z"},{"alias_kind":"pith_short_12","alias_value":"G3LPKMOOJS4Y","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G3LPKMOOJS4YRFDO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G3LPKMOO","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:G3LPKMOOJS4YRFDOEE7PF3TFZX","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-01T00:19:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6d8511c9c411ab05719c0b98df094199d59cbe42e735366c3059774353c22833","abstract_canon_sha256":"7cf098630f2beeb978646b556b3fbba41197ef1f01c17c3c022501249b999108"},"schema_version":"1.0"},"canonical_sha256":"36d6f531ce4cb988946e213ef2ee65cdd621f210d0e39b75e399381b9074a9c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:30.322524Z","signature_b64":"6jysOcBl5zASz/RHHgDUgFnZEsC9Y0e7Ne2CmglJUBMiINrvpcmU9m1zBVjfuClJvE/Ly5xbKAKgkVP29XhJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36d6f531ce4cb988946e213ef2ee65cdd621f210d0e39b75e399381b9074a9c7","last_reissued_at":"2026-05-18T04:37:30.321891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:30.321891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0222","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-18T04:37:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aoiFh3k0SGMS28Liw5rCm6qrV+if09SEDy0KATcCO73BoDlrbLTZcv2nMrODrV7iA4U+uyNgrw6BvXdl7nFcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:20:48.801484Z"},"content_sha256":"d501960f6011aabe58f9cae89c38e0ca6da1c43d922334d7611063ca818bcf36","schema_version":"1.0","event_id":"sha256:d501960f6011aabe58f9cae89c38e0ca6da1c43d922334d7611063ca818bcf36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:G3LPKMOOJS4YRFDOEE7PF3TFZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Christophe Morvan (Universit\\'e Paris-Est, INRIA Rennes Bretagne Atlantique), Nathalie Bertrand (INRIA Rennes Bretagne Atlantique)","submitted_at":"2010-11-01T00:19:12Z","abstract_excerpt":"Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0222","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-18T04:37:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wh51SpYmSGahAEKTjuWEHYVUszIWbFZ8tjrZmtF4BDrz0jL0j9oqGYFPI6o+zFm5VgA3n60LUgDR184r2EqaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:20:48.801830Z"},"content_sha256":"db3054d453ea613615c7780806239380d0a3a8bb1147d021e08b3ef32b30b66a","schema_version":"1.0","event_id":"sha256:db3054d453ea613615c7780806239380d0a3a8bb1147d021e08b3ef32b30b66a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/bundle.json","state_url":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/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-01T23:20:48Z","links":{"resolver":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX","bundle":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/bundle.json","state":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:G3LPKMOOJS4YRFDOEE7PF3TFZX","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":"7cf098630f2beeb978646b556b3fbba41197ef1f01c17c3c022501249b999108","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-01T00:19:12Z","title_canon_sha256":"6d8511c9c411ab05719c0b98df094199d59cbe42e735366c3059774353c22833"},"schema_version":"1.0","source":{"id":"1011.0222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0222","created_at":"2026-05-18T04:37:30Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0222v1","created_at":"2026-05-18T04:37:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0222","created_at":"2026-05-18T04:37:30Z"},{"alias_kind":"pith_short_12","alias_value":"G3LPKMOOJS4Y","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G3LPKMOOJS4YRFDO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G3LPKMOO","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:db3054d453ea613615c7780806239380d0a3a8bb1147d021e08b3ef32b30b66a","target":"graph","created_at":"2026-05-18T04:37:30Z","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":"Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless","authors_text":"Christophe Morvan (Universit\\'e Paris-Est, INRIA Rennes Bretagne Atlantique), Nathalie Bertrand (INRIA Rennes Bretagne Atlantique)","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-01T00:19:12Z","title":"Probabilistic regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0222","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:d501960f6011aabe58f9cae89c38e0ca6da1c43d922334d7611063ca818bcf36","target":"record","created_at":"2026-05-18T04:37:30Z","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":"7cf098630f2beeb978646b556b3fbba41197ef1f01c17c3c022501249b999108","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-01T00:19:12Z","title_canon_sha256":"6d8511c9c411ab05719c0b98df094199d59cbe42e735366c3059774353c22833"},"schema_version":"1.0","source":{"id":"1011.0222","kind":"arxiv","version":1}},"canonical_sha256":"36d6f531ce4cb988946e213ef2ee65cdd621f210d0e39b75e399381b9074a9c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36d6f531ce4cb988946e213ef2ee65cdd621f210d0e39b75e399381b9074a9c7","first_computed_at":"2026-05-18T04:37:30.321891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:30.321891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6jysOcBl5zASz/RHHgDUgFnZEsC9Y0e7Ne2CmglJUBMiINrvpcmU9m1zBVjfuClJvE/Ly5xbKAKgkVP29XhJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:30.322524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d501960f6011aabe58f9cae89c38e0ca6da1c43d922334d7611063ca818bcf36","sha256:db3054d453ea613615c7780806239380d0a3a8bb1147d021e08b3ef32b30b66a"],"state_sha256":"e1b40e263219ebc1ea9f4480a1c11ba17fa1998759f7675f22e500fd3c21b8d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHytW71UHxL/7owGmruA76g1TbJ7/q4vc6blT6ZBcDJ4k9nSY9H4/UvwvzOvnkTOazkCO/jZEbL/IHun//6WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:20:48.804191Z","bundle_sha256":"65876f40171733020eace5b0645f144312b7a3f2f6e51d0404f86c6d49458957"}}