{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NA6GG6TDZNP5W7NFNMXWK5BDPG","short_pith_number":"pith:NA6GG6TD","schema_version":"1.0","canonical_sha256":"683c637a63cb5fdb7da56b2f6574237997718b247bbe5f705c1493a433269bb5","source":{"kind":"arxiv","id":"1204.4736","version":1},"attestation_state":"computed","paper":{"title":"Model Checking with Probabilistic Tabled Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrey Gorlin, C.R. Ramakrishnan, Scott A. Smolka","submitted_at":"2012-04-20T20:12:36Z","abstract_excerpt":"We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for queries with a finite number of explanations. This restriction prohibits the encoding of probabilistic model checkers, where explanations correspond to executions of the system being model checked. To over"},"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":"1204.4736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-20T20:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"d77a659c3e741af4a3a6c1d76fc91fd53e5383c51974fa33bf99a38a17b9400b","abstract_canon_sha256":"802996ae0b349165737c023b02afe61b7dd6184b3fbb8751506a18bc36f9115d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:15.444009Z","signature_b64":"Ty0ISuOMivFeyb/1ch+AJ8PfiOjD1uTJsd3Ohd20JXPoEDJvSKaHr8VkTQKsAmr9IMFsJy2/W+ZQCDfEo82ZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683c637a63cb5fdb7da56b2f6574237997718b247bbe5f705c1493a433269bb5","last_reissued_at":"2026-05-18T03:57:15.443518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:15.443518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking with Probabilistic Tabled Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrey Gorlin, C.R. Ramakrishnan, Scott A. Smolka","submitted_at":"2012-04-20T20:12:36Z","abstract_excerpt":"We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for queries with a finite number of explanations. This restriction prohibits the encoding of probabilistic model checkers, where explanations correspond to executions of the system being model checked. To over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4736","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":"1204.4736","created_at":"2026-05-18T03:57:15.443599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4736v1","created_at":"2026-05-18T03:57:15.443599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4736","created_at":"2026-05-18T03:57:15.443599+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA6GG6TDZNP5","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA6GG6TDZNP5W7NF","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA6GG6TD","created_at":"2026-05-18T12:27:16.716162+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/NA6GG6TDZNP5W7NFNMXWK5BDPG","json":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG.json","graph_json":"https://pith.science/api/pith-number/NA6GG6TDZNP5W7NFNMXWK5BDPG/graph.json","events_json":"https://pith.science/api/pith-number/NA6GG6TDZNP5W7NFNMXWK5BDPG/events.json","paper":"https://pith.science/paper/NA6GG6TD"},"agent_actions":{"view_html":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG","download_json":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG.json","view_paper":"https://pith.science/paper/NA6GG6TD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4736&json=true","fetch_graph":"https://pith.science/api/pith-number/NA6GG6TDZNP5W7NFNMXWK5BDPG/graph.json","fetch_events":"https://pith.science/api/pith-number/NA6GG6TDZNP5W7NFNMXWK5BDPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG/action/storage_attestation","attest_author":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG/action/author_attestation","sign_citation":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG/action/citation_signature","submit_replication":"https://pith.science/pith/NA6GG6TDZNP5W7NFNMXWK5BDPG/action/replication_record"}},"created_at":"2026-05-18T03:57:15.443599+00:00","updated_at":"2026-05-18T03:57:15.443599+00:00"}