{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FOCHBYSAAK5XTYZA4PI7MWUKKA","short_pith_number":"pith:FOCHBYSA","canonical_record":{"source":{"id":"1612.01120","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-04T13:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"33ce711ab6e3948f7560091dd305fd6ae15b5ea696e6f333613c60fafc3ba544","abstract_canon_sha256":"5aae579643cf5706968f4faed97fab466863e8c51f896b7f37d248efe0e43ad1"},"schema_version":"1.0"},"canonical_sha256":"2b8470e24002bb79e320e3d1f65a8a5027a71a8aa99fc0058ad287e6c6f9ab96","source":{"kind":"arxiv","id":"1612.01120","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01120","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01120v3","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01120","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"FOCHBYSAAK5X","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOCHBYSAAK5XTYZA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOCHBYSA","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FOCHBYSAAK5XTYZA4PI7MWUKKA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01120","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-04T13:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"33ce711ab6e3948f7560091dd305fd6ae15b5ea696e6f333613c60fafc3ba544","abstract_canon_sha256":"5aae579643cf5706968f4faed97fab466863e8c51f896b7f37d248efe0e43ad1"},"schema_version":"1.0"},"canonical_sha256":"2b8470e24002bb79e320e3d1f65a8a5027a71a8aa99fc0058ad287e6c6f9ab96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.029973Z","signature_b64":"LmKbIsfZeX7fwS9HeOU/y2NnqkTo858cfPlALyrxSX7bzXmlb+csoc8bIOWKo8oVANxnmNvLMsZEenMJgdU5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8470e24002bb79e320e3d1f65a8a5027a71a8aa99fc0058ad287e6c6f9ab96","last_reissued_at":"2026-05-18T00:53:17.029374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.029374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01120","source_version":3,"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:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mTW/mV2wfu/8sAsZeW/wb7DPEZe9IRkX0GYny/R2iHZ7DQaZQTqFK1LT+HQEbnqUWTOrzL/EPtAr0U0iTdeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:37:14.206749Z"},"content_sha256":"abb2d1fd2c3f67012ea7619f42aeebc5394e1307626b16c7d6f967123a8511bb","schema_version":"1.0","event_id":"sha256:abb2d1fd2c3f67012ea7619f42aeebc5394e1307626b16c7d6f967123a8511bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FOCHBYSAAK5XTYZA4PI7MWUKKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Bayesian Networks Specified by Propositional and Relational Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Denis Deratani Mau\\'a, Fabio Gagliardi Cozman","submitted_at":"2016-12-04T13:51:55Z","abstract_excerpt":"We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover a variety of plate models and of probabilistic relational models. We study the complexity of inferences when network, query and domain are the input (the inferential and the combined complexity), when the network is fixed and query and domain are the input (the query/data complexity), and when the network and query are fixed and the domain is the input (the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01120","kind":"arxiv","version":3},"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:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SaPiaULVXYX8JUsPIEOPXhxVSE3OmLPSTrG7dGd6nKVcWI8Qji2FoyjX2kRXJGZXkq9Ueq/Ci/24ey7TT+72Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:37:14.207105Z"},"content_sha256":"3aee541ee3ee94ac1694b7b8a6fee79c536684c110ec012173a2e0bb69d56e33","schema_version":"1.0","event_id":"sha256:3aee541ee3ee94ac1694b7b8a6fee79c536684c110ec012173a2e0bb69d56e33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA/bundle.json","state_url":"https://pith.science/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA/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-22T10:37:14Z","links":{"resolver":"https://pith.science/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA","bundle":"https://pith.science/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA/bundle.json","state":"https://pith.science/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOCHBYSAAK5XTYZA4PI7MWUKKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FOCHBYSAAK5XTYZA4PI7MWUKKA","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":"5aae579643cf5706968f4faed97fab466863e8c51f896b7f37d248efe0e43ad1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-04T13:51:55Z","title_canon_sha256":"33ce711ab6e3948f7560091dd305fd6ae15b5ea696e6f333613c60fafc3ba544"},"schema_version":"1.0","source":{"id":"1612.01120","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01120","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01120v3","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01120","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"FOCHBYSAAK5X","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOCHBYSAAK5XTYZA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOCHBYSA","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:3aee541ee3ee94ac1694b7b8a6fee79c536684c110ec012173a2e0bb69d56e33","target":"graph","created_at":"2026-05-18T00:53:17Z","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 examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover a variety of plate models and of probabilistic relational models. We study the complexity of inferences when network, query and domain are the input (the inferential and the combined complexity), when the network is fixed and query and domain are the input (the query/data complexity), and when the network and query are fixed and the domain is the input (the ","authors_text":"Denis Deratani Mau\\'a, Fabio Gagliardi Cozman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-04T13:51:55Z","title":"The Complexity of Bayesian Networks Specified by Propositional and Relational Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01120","kind":"arxiv","version":3},"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:abb2d1fd2c3f67012ea7619f42aeebc5394e1307626b16c7d6f967123a8511bb","target":"record","created_at":"2026-05-18T00:53:17Z","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":"5aae579643cf5706968f4faed97fab466863e8c51f896b7f37d248efe0e43ad1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-04T13:51:55Z","title_canon_sha256":"33ce711ab6e3948f7560091dd305fd6ae15b5ea696e6f333613c60fafc3ba544"},"schema_version":"1.0","source":{"id":"1612.01120","kind":"arxiv","version":3}},"canonical_sha256":"2b8470e24002bb79e320e3d1f65a8a5027a71a8aa99fc0058ad287e6c6f9ab96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b8470e24002bb79e320e3d1f65a8a5027a71a8aa99fc0058ad287e6c6f9ab96","first_computed_at":"2026-05-18T00:53:17.029374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:17.029374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LmKbIsfZeX7fwS9HeOU/y2NnqkTo858cfPlALyrxSX7bzXmlb+csoc8bIOWKo8oVANxnmNvLMsZEenMJgdU5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:17.029973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01120","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb2d1fd2c3f67012ea7619f42aeebc5394e1307626b16c7d6f967123a8511bb","sha256:3aee541ee3ee94ac1694b7b8a6fee79c536684c110ec012173a2e0bb69d56e33"],"state_sha256":"9f9987b0ca550a77b19a0c91364aa982a1b066b036954e2e6d66fe1e01953283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pqCz2HIn+bBuGOFIvr4lpxrzrvGyvJfqYbzHTTHyoBufn2CJbNn4WiKGI8Wa4eh9/7nvo9hIBxA1OLnim1QCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:37:14.209079Z","bundle_sha256":"2d7b9c21f0d07f1e62eeedd687858ccda5582d6d6c95dd233a95c77a381c80e9"}}