{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7I4JP2HNH2GG6S2MLBSPO77VVO","short_pith_number":"pith:7I4JP2HN","canonical_record":{"source":{"id":"1302.3592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"464f7ecb7d7ffb48069527153d8851a6f8cf3cd5ad9f9ad34b91feb1b020100d","abstract_canon_sha256":"6a4a68203620f881521856b73e052c9044bbbf21b31fc4813681e55b2c759a6f"},"schema_version":"1.0"},"canonical_sha256":"fa3897e8ed3e8c6f4b4c5864f77ff5abba2b95765895abc3d0db1006118ce6c9","source":{"kind":"arxiv","id":"1302.3592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3592","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3592v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3592","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"7I4JP2HNH2GG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7I4JP2HNH2GG6S2M","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7I4JP2HN","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7I4JP2HNH2GG6S2MLBSPO77VVO","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"464f7ecb7d7ffb48069527153d8851a6f8cf3cd5ad9f9ad34b91feb1b020100d","abstract_canon_sha256":"6a4a68203620f881521856b73e052c9044bbbf21b31fc4813681e55b2c759a6f"},"schema_version":"1.0"},"canonical_sha256":"fa3897e8ed3e8c6f4b4c5864f77ff5abba2b95765895abc3d0db1006118ce6c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.590767Z","signature_b64":"bNqzkkTgDFZZroMrxG2rZHu9ygq7dghbfEcyG+MRB7ehrZvZ8PKYQZ97tuGPhH62LvcTfBLbvKOn3guP8NEgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3897e8ed3e8c6f4b4c5864f77ff5abba2b95765895abc3d0db1006118ce6c9","last_reissued_at":"2026-05-18T03:33:36.590159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.590159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3592","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYxrxcTFNN6bijUB4dpX66yGQx+U0GMfEupPRsdI45b+7Xso7pwFqzT2bthazhi1KHc4V2lUGdP/dzeZAT27AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:44:21.220492Z"},"content_sha256":"260c983a33b54bf3364eee7cd56d7797142b845e6db71aea4a1ffb2133ad2411","schema_version":"1.0","event_id":"sha256:260c983a33b54bf3364eee7cd56d7797142b845e6db71aea4a1ffb2133ad2411"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7I4JP2HNH2GG6S2MLBSPO77VVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Disjunctive Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Liem Ngo","submitted_at":"2013-02-13T14:15:32Z","abstract_excerpt":"In this paper we propose a framework for combining Disjunctive Logic Programming and Poole's Probabilistic Horn Abduction.  We use the concept of hypothesis to specify the probability structure.  We consider the case in which probabilistic information is not available.  Instead of using probability intervals, we allow for the specification of the probabilities of disjunctions.  Because minimal models are used as characteristic models in disjunctive logic programming, we apply the principle of indifference on the set of minimal models to derive default probability values.  We define the concept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3592","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3iKU88sYhyFPuyg30YsBpj/kCv+2tIz/6wERLNU/oEBS34wO0ycYVqPJEWIn5coWIDu9DrGPS8oRpPfaGhGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:44:21.220842Z"},"content_sha256":"0eff30599430ac4e7b1e8351b137f673af884a2401eca522f9137568cbe6312d","schema_version":"1.0","event_id":"sha256:0eff30599430ac4e7b1e8351b137f673af884a2401eca522f9137568cbe6312d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I4JP2HNH2GG6S2MLBSPO77VVO/bundle.json","state_url":"https://pith.science/pith/7I4JP2HNH2GG6S2MLBSPO77VVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I4JP2HNH2GG6S2MLBSPO77VVO/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-28T13:44:21Z","links":{"resolver":"https://pith.science/pith/7I4JP2HNH2GG6S2MLBSPO77VVO","bundle":"https://pith.science/pith/7I4JP2HNH2GG6S2MLBSPO77VVO/bundle.json","state":"https://pith.science/pith/7I4JP2HNH2GG6S2MLBSPO77VVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I4JP2HNH2GG6S2MLBSPO77VVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7I4JP2HNH2GG6S2MLBSPO77VVO","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":"6a4a68203620f881521856b73e052c9044bbbf21b31fc4813681e55b2c759a6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:32Z","title_canon_sha256":"464f7ecb7d7ffb48069527153d8851a6f8cf3cd5ad9f9ad34b91feb1b020100d"},"schema_version":"1.0","source":{"id":"1302.3592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3592","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3592v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3592","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"7I4JP2HNH2GG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7I4JP2HNH2GG6S2M","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7I4JP2HN","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:0eff30599430ac4e7b1e8351b137f673af884a2401eca522f9137568cbe6312d","target":"graph","created_at":"2026-05-18T03:33:36Z","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 propose a framework for combining Disjunctive Logic Programming and Poole's Probabilistic Horn Abduction.  We use the concept of hypothesis to specify the probability structure.  We consider the case in which probabilistic information is not available.  Instead of using probability intervals, we allow for the specification of the probabilities of disjunctions.  Because minimal models are used as characteristic models in disjunctive logic programming, we apply the principle of indifference on the set of minimal models to derive default probability values.  We define the concept","authors_text":"Liem Ngo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:32Z","title":"Probabilistic Disjunctive Logic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3592","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:260c983a33b54bf3364eee7cd56d7797142b845e6db71aea4a1ffb2133ad2411","target":"record","created_at":"2026-05-18T03:33:36Z","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":"6a4a68203620f881521856b73e052c9044bbbf21b31fc4813681e55b2c759a6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:32Z","title_canon_sha256":"464f7ecb7d7ffb48069527153d8851a6f8cf3cd5ad9f9ad34b91feb1b020100d"},"schema_version":"1.0","source":{"id":"1302.3592","kind":"arxiv","version":1}},"canonical_sha256":"fa3897e8ed3e8c6f4b4c5864f77ff5abba2b95765895abc3d0db1006118ce6c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3897e8ed3e8c6f4b4c5864f77ff5abba2b95765895abc3d0db1006118ce6c9","first_computed_at":"2026-05-18T03:33:36.590159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.590159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bNqzkkTgDFZZroMrxG2rZHu9ygq7dghbfEcyG+MRB7ehrZvZ8PKYQZ97tuGPhH62LvcTfBLbvKOn3guP8NEgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.590767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:260c983a33b54bf3364eee7cd56d7797142b845e6db71aea4a1ffb2133ad2411","sha256:0eff30599430ac4e7b1e8351b137f673af884a2401eca522f9137568cbe6312d"],"state_sha256":"044b51a891091ccd92e0726542113bac096a07e65ae660526a2c3cb2ef68d1c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jV21iYfGObtbKCZYnx9YGBE9vUWT9Ze5JxP/bGyHHk+PuKqfbPeQDXWma6+isb3Ay2teqH4uOutZ1MPq4pacAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:44:21.222810Z","bundle_sha256":"9e414ae2cdf5e147ffc87015b61032b0f8466f366ecdc73a76cbfab4a66b3f7c"}}