{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:G3LPKMOOJS4YRFDOEE7PF3TFZX","short_pith_number":"pith:G3LPKMOO","schema_version":"1.0","canonical_sha256":"36d6f531ce4cb988946e213ef2ee65cdd621f210d0e39b75e399381b9074a9c7","source":{"kind":"arxiv","id":"1011.0222","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.0222","created_at":"2026-05-18T04:37:30.321992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0222v1","created_at":"2026-05-18T04:37:30.321992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0222","created_at":"2026-05-18T04:37:30.321992+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3LPKMOOJS4Y","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3LPKMOOJS4YRFDO","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3LPKMOO","created_at":"2026-05-18T12:26:07.630475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX","json":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX.json","graph_json":"https://pith.science/api/pith-number/G3LPKMOOJS4YRFDOEE7PF3TFZX/graph.json","events_json":"https://pith.science/api/pith-number/G3LPKMOOJS4YRFDOEE7PF3TFZX/events.json","paper":"https://pith.science/paper/G3LPKMOO"},"agent_actions":{"view_html":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX","download_json":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX.json","view_paper":"https://pith.science/paper/G3LPKMOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0222&json=true","fetch_graph":"https://pith.science/api/pith-number/G3LPKMOOJS4YRFDOEE7PF3TFZX/graph.json","fetch_events":"https://pith.science/api/pith-number/G3LPKMOOJS4YRFDOEE7PF3TFZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/action/storage_attestation","attest_author":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/action/author_attestation","sign_citation":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/action/citation_signature","submit_replication":"https://pith.science/pith/G3LPKMOOJS4YRFDOEE7PF3TFZX/action/replication_record"}},"created_at":"2026-05-18T04:37:30.321992+00:00","updated_at":"2026-05-18T04:37:30.321992+00:00"}