{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:J2T3SMZ5ASW56B22JNU3YRB66N","short_pith_number":"pith:J2T3SMZ5","canonical_record":{"source":{"id":"1301.6691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"af11d154cd716cf8c2113336ead5440e14d2dff9ea073c9dbac694e015c7e77c","abstract_canon_sha256":"00670c7b08f7c0490b8742b70bb459bcda325192d42eb600917746a39797a3c9"},"schema_version":"1.0"},"canonical_sha256":"4ea7b9333d04addf075a4b69bc443ef369585e91349f392a770e2e9a24ea8c39","source":{"kind":"arxiv","id":"1301.6691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6691","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6691v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6691","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"J2T3SMZ5ASW5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J2T3SMZ5ASW56B22","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J2T3SMZ5","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:J2T3SMZ5ASW56B22JNU3YRB66N","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"af11d154cd716cf8c2113336ead5440e14d2dff9ea073c9dbac694e015c7e77c","abstract_canon_sha256":"00670c7b08f7c0490b8742b70bb459bcda325192d42eb600917746a39797a3c9"},"schema_version":"1.0"},"canonical_sha256":"4ea7b9333d04addf075a4b69bc443ef369585e91349f392a770e2e9a24ea8c39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.983097Z","signature_b64":"Y3F8jBvU38kgx/URUvQPKUwogtl4/VfWI3nPlez3nnMt8n+AFfCah3WdhbpgfKRmTLYy/oyNWYX0Jztsu0eeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ea7b9333d04addf075a4b69bc443ef369585e91349f392a770e2e9a24ea8c39","last_reissued_at":"2026-05-18T03:35:12.982385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.982385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6691","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MC9HidJ6QpS6dsg05+POvF8Ttsz7kBEPqtu9qwue892E0JATlZtUa0Bbaav8eK07/K8CznxBopzkJ0xp/7uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:19:05.604995Z"},"content_sha256":"491832dc83d9a931ef5d18e5dfdc8aa51f292f3aea1ed53361a7c551a1c291a8","schema_version":"1.0","event_id":"sha256:491832dc83d9a931ef5d18e5dfdc8aa51f292f3aea1ed53361a7c551a1c291a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:J2T3SMZ5ASW56B22JNU3YRB66N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Probabilistic Programs: Algorithms and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alex Dekhtyar, Michael I. Dekhtyar, V. S. Subrahmanian","submitted_at":"2013-01-23T15:57:43Z","abstract_excerpt":"Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the program.   In this paper, we classify HPPs into three classes called HPP_1,HPP_2 and HPP_r,r>= 3. For these classes, we provide three types of results for HPPs.  First, we develop algorithms to compute the set of all ground consequences of an HPP. Then we provide algorithms and complexity results for the problems of entailment (\"Given an HPP P and a query Q as input, is Q a logical consequence of P?\") and consistency (\"Gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6691","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXxqKUlLgfRUlFTwIf+DmMquLxOQPtqaOZ1Phh8jecaO9BR/CFAqgQvtvRwdjaBhrvbNhXiWwiWIS7zYflJ/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:19:05.605346Z"},"content_sha256":"eb72cf570a4a3406ae5336ed034937aca2a02d551850a08f4928397ba8500ca7","schema_version":"1.0","event_id":"sha256:eb72cf570a4a3406ae5336ed034937aca2a02d551850a08f4928397ba8500ca7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2T3SMZ5ASW56B22JNU3YRB66N/bundle.json","state_url":"https://pith.science/pith/J2T3SMZ5ASW56B22JNU3YRB66N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2T3SMZ5ASW56B22JNU3YRB66N/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-27T07:19:05Z","links":{"resolver":"https://pith.science/pith/J2T3SMZ5ASW56B22JNU3YRB66N","bundle":"https://pith.science/pith/J2T3SMZ5ASW56B22JNU3YRB66N/bundle.json","state":"https://pith.science/pith/J2T3SMZ5ASW56B22JNU3YRB66N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2T3SMZ5ASW56B22JNU3YRB66N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:J2T3SMZ5ASW56B22JNU3YRB66N","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":"00670c7b08f7c0490b8742b70bb459bcda325192d42eb600917746a39797a3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:43Z","title_canon_sha256":"af11d154cd716cf8c2113336ead5440e14d2dff9ea073c9dbac694e015c7e77c"},"schema_version":"1.0","source":{"id":"1301.6691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6691","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6691v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6691","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"J2T3SMZ5ASW5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J2T3SMZ5ASW56B22","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J2T3SMZ5","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:eb72cf570a4a3406ae5336ed034937aca2a02d551850a08f4928397ba8500ca7","target":"graph","created_at":"2026-05-18T03:35:12Z","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":"Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the program.   In this paper, we classify HPPs into three classes called HPP_1,HPP_2 and HPP_r,r>= 3. For these classes, we provide three types of results for HPPs.  First, we develop algorithms to compute the set of all ground consequences of an HPP. Then we provide algorithms and complexity results for the problems of entailment (\"Given an HPP P and a query Q as input, is Q a logical consequence of P?\") and consistency (\"Gi","authors_text":"Alex Dekhtyar, Michael I. Dekhtyar, V. S. Subrahmanian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:43Z","title":"Hybrid Probabilistic Programs: Algorithms and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6691","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:491832dc83d9a931ef5d18e5dfdc8aa51f292f3aea1ed53361a7c551a1c291a8","target":"record","created_at":"2026-05-18T03:35:12Z","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":"00670c7b08f7c0490b8742b70bb459bcda325192d42eb600917746a39797a3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:43Z","title_canon_sha256":"af11d154cd716cf8c2113336ead5440e14d2dff9ea073c9dbac694e015c7e77c"},"schema_version":"1.0","source":{"id":"1301.6691","kind":"arxiv","version":1}},"canonical_sha256":"4ea7b9333d04addf075a4b69bc443ef369585e91349f392a770e2e9a24ea8c39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ea7b9333d04addf075a4b69bc443ef369585e91349f392a770e2e9a24ea8c39","first_computed_at":"2026-05-18T03:35:12.982385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.982385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y3F8jBvU38kgx/URUvQPKUwogtl4/VfWI3nPlez3nnMt8n+AFfCah3WdhbpgfKRmTLYy/oyNWYX0Jztsu0eeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.983097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:491832dc83d9a931ef5d18e5dfdc8aa51f292f3aea1ed53361a7c551a1c291a8","sha256:eb72cf570a4a3406ae5336ed034937aca2a02d551850a08f4928397ba8500ca7"],"state_sha256":"ccbcbf65ba0cb4a9031d5aa453029797063a042884f4a58b4085bd5e770e465a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRKEcfAMhU1hr68I3FnYyZ8IjOXoDb2VWywA1H7FcvOOVHZCiD0pBVLJhtCxgutRxLzfWqTvkta4+5X8bq6qAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T07:19:05.607226Z","bundle_sha256":"7a3309e932ee4463a155e8603d7e9643709cbb9cdc0a973323fa3bdeb439845e"}}