{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AFJTLKPKQZTEZ3HRQZFIFKEBCU","short_pith_number":"pith:AFJTLKPK","canonical_record":{"source":{"id":"1303.5406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"d0dd5d3ba5e8cb769b99fb63e0e9df49980482d329d24f66449e58d77fdc6a44","abstract_canon_sha256":"38836b2df1323df014c625a9aafd4a64366e79346401fa4ec3983b240e104fa9"},"schema_version":"1.0"},"canonical_sha256":"015335a9ea86664cecf1864a82a881151969243efcf561b1a7234d0daece93d9","source":{"kind":"arxiv","id":"1303.5406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5406","created_at":"2026-05-18T03:30:11Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5406v1","created_at":"2026-05-18T03:30:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5406","created_at":"2026-05-18T03:30:11Z"},{"alias_kind":"pith_short_12","alias_value":"AFJTLKPKQZTE","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AFJTLKPKQZTEZ3HR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AFJTLKPK","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AFJTLKPKQZTEZ3HRQZFIFKEBCU","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"d0dd5d3ba5e8cb769b99fb63e0e9df49980482d329d24f66449e58d77fdc6a44","abstract_canon_sha256":"38836b2df1323df014c625a9aafd4a64366e79346401fa4ec3983b240e104fa9"},"schema_version":"1.0"},"canonical_sha256":"015335a9ea86664cecf1864a82a881151969243efcf561b1a7234d0daece93d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:11.804067Z","signature_b64":"KQf8cpOhPqVwp7m7dD5mB07uaAmjFq1jzNYZTSKnsi9wKibB7Wd47/jHQlaFTzPfYjwSvioEO8rAekMqCuctBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"015335a9ea86664cecf1864a82a881151969243efcf561b1a7234d0daece93d9","last_reissued_at":"2026-05-18T03:30:11.803378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:11.803378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5406","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:30:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YktFT8j9QZenQrJsXqLn8f1Gtt0FrqHz72J9cdlZsIB5Bj0Xv9no7iKAvbrv8nuUiOM4SyV33fjBQZ31b0ExBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:28:26.625881Z"},"content_sha256":"e465923f72a03d82f6643a0124a45b9edb94029c82acca7f38b8655d283eef6b","schema_version":"1.0","event_id":"sha256:e465923f72a03d82f6643a0124a45b9edb94029c82acca7f38b8655d283eef6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AFJTLKPKQZTEZ3HRQZFIFKEBCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reasoning With Qualitative Probabilities Can Be Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Judea Pearl, Moises Goldszmidt","submitted_at":"2013-03-13T12:52:54Z","abstract_excerpt":"We recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18].  The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude of disbelief, which impose constraints over possible rankings of worlds.  It was shown that, once we compute a priority function Z+ on the rules, the degree to which a given query is confirmed or denied can be computed in O(log n`) propositional satisfiability tests, where n is the number of rules in the knowledge base.  In this paper, we show that computin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5406","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:30:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQ5EXHVvQRyAWtDqqe9MGRyIanfiD0znbs7WZdYMJnI9vAb9c5Y6JLtZ13s1bbZ+66Lt4jb3fM2Uxy75TST0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:28:26.626584Z"},"content_sha256":"e7ed1cbc6e74947e197c1f7cdf98aede55a05c0fa454a9b9294ea298eba802fe","schema_version":"1.0","event_id":"sha256:e7ed1cbc6e74947e197c1f7cdf98aede55a05c0fa454a9b9294ea298eba802fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU/bundle.json","state_url":"https://pith.science/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU/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-07T16:28:26Z","links":{"resolver":"https://pith.science/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU","bundle":"https://pith.science/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU/bundle.json","state":"https://pith.science/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFJTLKPKQZTEZ3HRQZFIFKEBCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AFJTLKPKQZTEZ3HRQZFIFKEBCU","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":"38836b2df1323df014c625a9aafd4a64366e79346401fa4ec3983b240e104fa9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:52:54Z","title_canon_sha256":"d0dd5d3ba5e8cb769b99fb63e0e9df49980482d329d24f66449e58d77fdc6a44"},"schema_version":"1.0","source":{"id":"1303.5406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5406","created_at":"2026-05-18T03:30:11Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5406v1","created_at":"2026-05-18T03:30:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5406","created_at":"2026-05-18T03:30:11Z"},{"alias_kind":"pith_short_12","alias_value":"AFJTLKPKQZTE","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AFJTLKPKQZTEZ3HR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AFJTLKPK","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:e7ed1cbc6e74947e197c1f7cdf98aede55a05c0fa454a9b9294ea298eba802fe","target":"graph","created_at":"2026-05-18T03:30:11Z","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 recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18].  The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude of disbelief, which impose constraints over possible rankings of worlds.  It was shown that, once we compute a priority function Z+ on the rules, the degree to which a given query is confirmed or denied can be computed in O(log n`) propositional satisfiability tests, where n is the number of rules in the knowledge base.  In this paper, we show that computin","authors_text":"Judea Pearl, Moises Goldszmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:52:54Z","title":"Reasoning With Qualitative Probabilities Can Be Tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5406","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:e465923f72a03d82f6643a0124a45b9edb94029c82acca7f38b8655d283eef6b","target":"record","created_at":"2026-05-18T03:30:11Z","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":"38836b2df1323df014c625a9aafd4a64366e79346401fa4ec3983b240e104fa9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:52:54Z","title_canon_sha256":"d0dd5d3ba5e8cb769b99fb63e0e9df49980482d329d24f66449e58d77fdc6a44"},"schema_version":"1.0","source":{"id":"1303.5406","kind":"arxiv","version":1}},"canonical_sha256":"015335a9ea86664cecf1864a82a881151969243efcf561b1a7234d0daece93d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"015335a9ea86664cecf1864a82a881151969243efcf561b1a7234d0daece93d9","first_computed_at":"2026-05-18T03:30:11.803378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:11.803378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQf8cpOhPqVwp7m7dD5mB07uaAmjFq1jzNYZTSKnsi9wKibB7Wd47/jHQlaFTzPfYjwSvioEO8rAekMqCuctBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:11.804067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e465923f72a03d82f6643a0124a45b9edb94029c82acca7f38b8655d283eef6b","sha256:e7ed1cbc6e74947e197c1f7cdf98aede55a05c0fa454a9b9294ea298eba802fe"],"state_sha256":"3af035e39d5605927a7d1aac1934fd6054a913fb177075fd772de9b2b9df292e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq6DmcgTsglzFJah/jyb0L9ZSgcoff4FATEZmqp4UGOL6E7t+Ip+XXah7H9+PSFNzVo5SQ29tDsKl6PfXDqYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:28:26.630345Z","bundle_sha256":"e367f24201f08843e7a6cc5cdd4884ae7ecd7bbaa8b15e2baa7bdd7fb454819e"}}