{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LBIC5QHSPLQ4HLQIO4T3J7TORE","short_pith_number":"pith:LBIC5QHS","canonical_record":{"source":{"id":"1705.07226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-19T23:58:26Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f598c9b110435302c2235a82e62649e10c2cb48bf6bbe9e61a103d1bb030869c","abstract_canon_sha256":"7ac0b8efce6ade61ec292cd830885bdd2319b004aaa6524d3c0949701973c3ac"},"schema_version":"1.0"},"canonical_sha256":"58502ec0f27ae1c3ae087727b4fe6e892b40134f1c32ae3732fcd795ec24e36c","source":{"kind":"arxiv","id":"1705.07226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07226","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07226v1","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07226","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"LBIC5QHSPLQ4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LBIC5QHSPLQ4HLQI","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LBIC5QHS","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LBIC5QHSPLQ4HLQIO4T3J7TORE","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-19T23:58:26Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f598c9b110435302c2235a82e62649e10c2cb48bf6bbe9e61a103d1bb030869c","abstract_canon_sha256":"7ac0b8efce6ade61ec292cd830885bdd2319b004aaa6524d3c0949701973c3ac"},"schema_version":"1.0"},"canonical_sha256":"58502ec0f27ae1c3ae087727b4fe6e892b40134f1c32ae3732fcd795ec24e36c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.281247Z","signature_b64":"iHRLomwODiVPYJ0wjsZ1GpGP6JLzyA7aey2BBnbU5vcJ/M42Svt+DKZ6oKRy0wTmspx5nbbB34Un5tkOx3y1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58502ec0f27ae1c3ae087727b4fe6e892b40134f1c32ae3732fcd795ec24e36c","last_reissued_at":"2026-05-18T00:44:06.280611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.280611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07226","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:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kg7MJkZfJQXagYLQRahiG6RxSaE3fcpRGqOH44n4bW6CgYmK2LWXvaF+RgpNM7troRu6+CB9oARq8rwE1vTPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:14:09.781644Z"},"content_sha256":"bd5416b6ab84c55d873281e65dd7a6d3284a389ee1bacfac5695fb296399ca49","schema_version":"1.0","event_id":"sha256:bd5416b6ab84c55d873281e65dd7a6d3284a389ee1bacfac5695fb296399ca49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LBIC5QHSPLQ4HLQIO4T3J7TORE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RankPL: A Qualitative Probabilistic Programming Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Tjitze Rienstra","submitted_at":"2017-05-19T23:58:26Z","abstract_excerpt":"In this paper we introduce RankPL, a modeling language that can be thought of as a qualitative variant of a probabilistic programming language with a semantics based on Spohn's ranking theory. Broadly speaking, RankPL can be used to represent and reason about processes that exhibit uncertainty expressible by distinguishing \"normal\" from\" surprising\" events. RankPL allows (iterated) revision of rankings over alternative program states and supports various types of reasoning, including abduction and causal inference. We present the language, its denotational semantics, and a number of practical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07226","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:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZZeHM8Al8K0hjC57Q4yVvrIOZtUJ1vvRJeJEA0UZZhVUJzRcUUEmrck3uwNY4/CkI/K5AL1GXy3CvC/AMnaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:14:09.782306Z"},"content_sha256":"4470ef303fdba3460aa3a81b6c342d436a4acfa19a0cf7bfaf4edf600a187bcf","schema_version":"1.0","event_id":"sha256:4470ef303fdba3460aa3a81b6c342d436a4acfa19a0cf7bfaf4edf600a187bcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE/bundle.json","state_url":"https://pith.science/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE/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-07T11:14:09Z","links":{"resolver":"https://pith.science/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE","bundle":"https://pith.science/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE/bundle.json","state":"https://pith.science/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBIC5QHSPLQ4HLQIO4T3J7TORE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LBIC5QHSPLQ4HLQIO4T3J7TORE","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":"7ac0b8efce6ade61ec292cd830885bdd2319b004aaa6524d3c0949701973c3ac","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-19T23:58:26Z","title_canon_sha256":"f598c9b110435302c2235a82e62649e10c2cb48bf6bbe9e61a103d1bb030869c"},"schema_version":"1.0","source":{"id":"1705.07226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07226","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07226v1","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07226","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"LBIC5QHSPLQ4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LBIC5QHSPLQ4HLQI","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LBIC5QHS","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:4470ef303fdba3460aa3a81b6c342d436a4acfa19a0cf7bfaf4edf600a187bcf","target":"graph","created_at":"2026-05-18T00:44:06Z","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":"In this paper we introduce RankPL, a modeling language that can be thought of as a qualitative variant of a probabilistic programming language with a semantics based on Spohn's ranking theory. Broadly speaking, RankPL can be used to represent and reason about processes that exhibit uncertainty expressible by distinguishing \"normal\" from\" surprising\" events. RankPL allows (iterated) revision of rankings over alternative program states and supports various types of reasoning, including abduction and causal inference. We present the language, its denotational semantics, and a number of practical ","authors_text":"Tjitze Rienstra","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-19T23:58:26Z","title":"RankPL: A Qualitative Probabilistic Programming Language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07226","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:bd5416b6ab84c55d873281e65dd7a6d3284a389ee1bacfac5695fb296399ca49","target":"record","created_at":"2026-05-18T00:44:06Z","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":"7ac0b8efce6ade61ec292cd830885bdd2319b004aaa6524d3c0949701973c3ac","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-19T23:58:26Z","title_canon_sha256":"f598c9b110435302c2235a82e62649e10c2cb48bf6bbe9e61a103d1bb030869c"},"schema_version":"1.0","source":{"id":"1705.07226","kind":"arxiv","version":1}},"canonical_sha256":"58502ec0f27ae1c3ae087727b4fe6e892b40134f1c32ae3732fcd795ec24e36c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58502ec0f27ae1c3ae087727b4fe6e892b40134f1c32ae3732fcd795ec24e36c","first_computed_at":"2026-05-18T00:44:06.280611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:06.280611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHRLomwODiVPYJ0wjsZ1GpGP6JLzyA7aey2BBnbU5vcJ/M42Svt+DKZ6oKRy0wTmspx5nbbB34Un5tkOx3y1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:06.281247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd5416b6ab84c55d873281e65dd7a6d3284a389ee1bacfac5695fb296399ca49","sha256:4470ef303fdba3460aa3a81b6c342d436a4acfa19a0cf7bfaf4edf600a187bcf"],"state_sha256":"70c13346a0bd340302c1d5f1f4d80e626364d42ef254c12ca91c8077eba8823d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knguMYB+9pGPQR6Ib2F4+JVznriZ9IAknZV8MEp99zF40EJEeaLHZD0dnM1NHo+2pJBoRECDoLqJ7D3FsL/SAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:14:09.785630Z","bundle_sha256":"51e68aeba46311ec6a5c115483b67c638e0e8ca7dfa8147c2d8aedc0615b0a38"}}