{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SXDZOOZTNO6VRB2USNPMK7SY7S","short_pith_number":"pith:SXDZOOZT","canonical_record":{"source":{"id":"1804.10237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-26T18:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"09858ee1eb604be59f40ec35b32b0179b21154c97ce84e0cbc14584151c15565","abstract_canon_sha256":"527cd9f5151bbd390c37b941538862d9ff39b602d38b83d3c7973643759fa79b"},"schema_version":"1.0"},"canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","source":{"kind":"arxiv","id":"1804.10237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10237","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10237v1","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10237","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"SXDZOOZTNO6V","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SXDZOOZTNO6VRB2U","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SXDZOOZT","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SXDZOOZTNO6VRB2USNPMK7SY7S","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-26T18:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"09858ee1eb604be59f40ec35b32b0179b21154c97ce84e0cbc14584151c15565","abstract_canon_sha256":"527cd9f5151bbd390c37b941538862d9ff39b602d38b83d3c7973643759fa79b"},"schema_version":"1.0"},"canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:21.389105Z","signature_b64":"yRSxTADoNznbFvAbr3lh9ZPN6FX+6G88z+K+sEllpd1U2FLgjOK7i1HvGfYNI34+tdT4cpvx7ZAc63LUTy/nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","last_reissued_at":"2026-05-18T00:17:21.388313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:21.388313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10237","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:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+uJbkyPOnYKt15qcdMoQ8QlIbM/hdrszXtDyJxOfUcPJ2a/70PebTB9+NsUkxZ67VQ9nbjLi18thzVp2PwjsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:43:42.929643Z"},"content_sha256":"30fa3a25b972fd95439b3305ad5c9349e058cd1905941fd063e3658478b9f4b4","schema_version":"1.0","event_id":"sha256:30fa3a25b972fd95439b3305ad5c9349e058cd1905941fd063e3658478b9f4b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SXDZOOZTNO6VRB2USNPMK7SY7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint-Based Inference in Probabilistic Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arun Nampally, C. R. Ramakrishnan, Timothy Zhang","submitted_at":"2018-04-26T18:34:24Z","abstract_excerpt":"Probabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is performed by summarizing the possible worlds which entail the query in a suitable data structure, and using it to compute the answer probability. Systems such as ProbLog, PITA, etc., use propositional data structures like explanation graphs, BDDs, SDDs, etc., to represent the possible worlds. While this approach saves inference time due to substructure sharing, there are a number of problems where a more compact data struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10237","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:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgd0Xi+LuCZYFfALxgEmVUY94qwlrPXcTgOTt2n9NFaA6usb70ZiZOgvIBtL2B0cQYXbkrv8GQV1eS9LiPhcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:43:42.929983Z"},"content_sha256":"f9a9406b2887130c08c59e80e9999ad5b311d283c4d8128fb11e0b4e27adaeb4","schema_version":"1.0","event_id":"sha256:f9a9406b2887130c08c59e80e9999ad5b311d283c4d8128fb11e0b4e27adaeb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/bundle.json","state_url":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/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-29T22:43:42Z","links":{"resolver":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S","bundle":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/bundle.json","state":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SXDZOOZTNO6VRB2USNPMK7SY7S","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":"527cd9f5151bbd390c37b941538862d9ff39b602d38b83d3c7973643759fa79b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-26T18:34:24Z","title_canon_sha256":"09858ee1eb604be59f40ec35b32b0179b21154c97ce84e0cbc14584151c15565"},"schema_version":"1.0","source":{"id":"1804.10237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10237","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10237v1","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10237","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"SXDZOOZTNO6V","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SXDZOOZTNO6VRB2U","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SXDZOOZT","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:f9a9406b2887130c08c59e80e9999ad5b311d283c4d8128fb11e0b4e27adaeb4","target":"graph","created_at":"2026-05-18T00:17:21Z","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":"Probabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is performed by summarizing the possible worlds which entail the query in a suitable data structure, and using it to compute the answer probability. Systems such as ProbLog, PITA, etc., use propositional data structures like explanation graphs, BDDs, SDDs, etc., to represent the possible worlds. While this approach saves inference time due to substructure sharing, there are a number of problems where a more compact data struct","authors_text":"Arun Nampally, C. R. Ramakrishnan, Timothy Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-26T18:34:24Z","title":"Constraint-Based Inference in Probabilistic Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10237","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:30fa3a25b972fd95439b3305ad5c9349e058cd1905941fd063e3658478b9f4b4","target":"record","created_at":"2026-05-18T00:17:21Z","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":"527cd9f5151bbd390c37b941538862d9ff39b602d38b83d3c7973643759fa79b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-26T18:34:24Z","title_canon_sha256":"09858ee1eb604be59f40ec35b32b0179b21154c97ce84e0cbc14584151c15565"},"schema_version":"1.0","source":{"id":"1804.10237","kind":"arxiv","version":1}},"canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","first_computed_at":"2026-05-18T00:17:21.388313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:21.388313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yRSxTADoNznbFvAbr3lh9ZPN6FX+6G88z+K+sEllpd1U2FLgjOK7i1HvGfYNI34+tdT4cpvx7ZAc63LUTy/nDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:21.389105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30fa3a25b972fd95439b3305ad5c9349e058cd1905941fd063e3658478b9f4b4","sha256:f9a9406b2887130c08c59e80e9999ad5b311d283c4d8128fb11e0b4e27adaeb4"],"state_sha256":"f4b03d224142eb224f518ff7f0a3b79df9f3290a4d92dbdf35da7ece72a82d92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0/D8KQBnXH9OINb77mYjHHNpw107qJdyIZflI7qB5TwWfu7QMInwl9bOTDNYrz8REWq2sJmp0sQMkeYywA4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:43:42.932024Z","bundle_sha256":"c1ba34803e6ced56a0f478910b0b74d4485201e6da2fef8ae453da3f9fd0c591"}}