{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4SQ27DXI4B7M24DM4Q5XCQRHIX","short_pith_number":"pith:4SQ27DXI","schema_version":"1.0","canonical_sha256":"e4a1af8ee8e07ecd706ce43b71422745dd2881aa5e18e26ba7130625db5d8895","source":{"kind":"arxiv","id":"1301.7406","version":1},"attestation_state":"computed","paper":{"title":"Logarithmic Time Parallel Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David M. Pennock","submitted_at":"2013-01-30T15:06:20Z","abstract_excerpt":"I present a parallel algorithm for exact probabilistic inference in Bayesian networks.  For polytree networks with n variables, the worst-case time complexity is O(log n) on a CREW PRAM (concurrent-read, exclusive-write parallel random-access machine) with n processors, for any constant number of evidence variables. For arbitrary networks, the time complexity is O(r^{3w}*log n) for n processors, or O(w*log n) for r^{3w}*n processors, where r is the maximum range of any variable, and w is the induced width (the maximum clique size), after moralizing and triangulating the network."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1301.7406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"e051ee2a9e3104e0cb1011d55e26ef51a4aac875ba6dc375beca53200b03103c","abstract_canon_sha256":"897dfe8396a3182addeaab89471c25a0441d9d437a570d9aa37f8874a87e4db6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:59.925689Z","signature_b64":"EHFuKb0vjFE+mnc4M8hnZf51+PRimKPjK4fOOydgVzRcKhXK5BXP/eiiEMBYE/i8VSp7/K/7tkWykqoa2rj/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a1af8ee8e07ecd706ce43b71422745dd2881aa5e18e26ba7130625db5d8895","last_reissued_at":"2026-05-18T03:34:59.924885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:59.924885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmic Time Parallel Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David M. Pennock","submitted_at":"2013-01-30T15:06:20Z","abstract_excerpt":"I present a parallel algorithm for exact probabilistic inference in Bayesian networks.  For polytree networks with n variables, the worst-case time complexity is O(log n) on a CREW PRAM (concurrent-read, exclusive-write parallel random-access machine) with n processors, for any constant number of evidence variables. For arbitrary networks, the time complexity is O(r^{3w}*log n) for n processors, or O(w*log n) for r^{3w}*n processors, where r is the maximum range of any variable, and w is the induced width (the maximum clique size), after moralizing and triangulating the network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7406","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.7406","created_at":"2026-05-18T03:34:59.925020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7406v1","created_at":"2026-05-18T03:34:59.925020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7406","created_at":"2026-05-18T03:34:59.925020+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SQ27DXI4B7M","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SQ27DXI4B7M24DM","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SQ27DXI","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX","json":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX.json","graph_json":"https://pith.science/api/pith-number/4SQ27DXI4B7M24DM4Q5XCQRHIX/graph.json","events_json":"https://pith.science/api/pith-number/4SQ27DXI4B7M24DM4Q5XCQRHIX/events.json","paper":"https://pith.science/paper/4SQ27DXI"},"agent_actions":{"view_html":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX","download_json":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX.json","view_paper":"https://pith.science/paper/4SQ27DXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7406&json=true","fetch_graph":"https://pith.science/api/pith-number/4SQ27DXI4B7M24DM4Q5XCQRHIX/graph.json","fetch_events":"https://pith.science/api/pith-number/4SQ27DXI4B7M24DM4Q5XCQRHIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX/action/storage_attestation","attest_author":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX/action/author_attestation","sign_citation":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX/action/citation_signature","submit_replication":"https://pith.science/pith/4SQ27DXI4B7M24DM4Q5XCQRHIX/action/replication_record"}},"created_at":"2026-05-18T03:34:59.925020+00:00","updated_at":"2026-05-18T03:34:59.925020+00:00"}