{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DYM544IDUDX2TNDH6F6IE7Y2LB","short_pith_number":"pith:DYM544ID","canonical_record":{"source":{"id":"2402.15075","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-23T03:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"929440b9d1825a1f0e242a405b26adf01e70f6d63a0a1d3684405112577ec5ac","abstract_canon_sha256":"03444a44299f170e53b8747c97d559bbf871ca7dc0f339e2d4ee08c14b3e834f"},"schema_version":"1.0"},"canonical_sha256":"1e19de7103a0efa9b467f17c827f1a586a1333572f07cbf5078c127b39bb1b6d","source":{"kind":"arxiv","id":"2402.15075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.15075","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"2402.15075v1","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15075","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"DYM544IDUDX2","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"pith_short_16","alias_value":"DYM544IDUDX2TNDH","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"pith_short_8","alias_value":"DYM544ID","created_at":"2026-07-05T07:48:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DYM544IDUDX2TNDH6F6IE7Y2LB","target":"record","payload":{"canonical_record":{"source":{"id":"2402.15075","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-23T03:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"929440b9d1825a1f0e242a405b26adf01e70f6d63a0a1d3684405112577ec5ac","abstract_canon_sha256":"03444a44299f170e53b8747c97d559bbf871ca7dc0f339e2d4ee08c14b3e834f"},"schema_version":"1.0"},"canonical_sha256":"1e19de7103a0efa9b467f17c827f1a586a1333572f07cbf5078c127b39bb1b6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:35.780563Z","signature_b64":"L4k/YrCssd/i2R9W26t+P8y3XwWu84f61nYLOffA0BUuKSU4mY/SiCdoWiIv4n/9c8FLiaoo9/wgTiOdQ8fTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e19de7103a0efa9b467f17c827f1a586a1333572f07cbf5078c127b39bb1b6d","last_reissued_at":"2026-07-05T07:48:35.780000Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:35.780000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.15075","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-07-05T07:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsw53gHP2amLShqNvXriibuQg0isxQPt2O6BqgTXfin4442vuuR+EH03OMCMF8PHk0fYZO5mkvZ6efveSzd6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:50:07.114332Z"},"content_sha256":"cfa63a410bb772beff4d8a47a2e6420c4dbb8f0bd58caea52c1e5538644867e1","schema_version":"1.0","event_id":"sha256:cfa63a410bb772beff4d8a47a2e6420c4dbb8f0bd58caea52c1e5538644867e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DYM544IDUDX2TNDH6F6IE7Y2LB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stacking Factorizing Partitioned Expressions in Hybrid Bayesian Network Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Martin Neil, Norman Fenton, Peng Lin","submitted_at":"2024-02-23T03:33:06Z","abstract_excerpt":"Hybrid Bayesian networks (HBN) contain complex conditional probabilistic distributions (CPD) specified as partitioned expressions over discrete and continuous variables. The size of these CPDs grows exponentially with the number of parent nodes when using discrete inference, resulting in significant inefficiency. Normally, an effective way to reduce the CPD size is to use a binary factorization (BF) algorithm to decompose the statistical or arithmetic functions in the CPD by factorizing the number of connected parent nodes to sets of size two. However, the BF algorithm was not designed to hand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15075","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.15075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/AJtvLEIg2fXeEaDMLFWUcpu9F6H3rQgkrAAve0u/lJHEBDjS97phAAOZg1hr0tcYem9+i2xNsORXyFEkn+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:50:07.114998Z"},"content_sha256":"3dc43c1a12e2fb091e34e801fa1842e718b62c59514b09bc03d4e33204155882","schema_version":"1.0","event_id":"sha256:3dc43c1a12e2fb091e34e801fa1842e718b62c59514b09bc03d4e33204155882"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYM544IDUDX2TNDH6F6IE7Y2LB/bundle.json","state_url":"https://pith.science/pith/DYM544IDUDX2TNDH6F6IE7Y2LB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYM544IDUDX2TNDH6F6IE7Y2LB/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-07-07T07:50:07Z","links":{"resolver":"https://pith.science/pith/DYM544IDUDX2TNDH6F6IE7Y2LB","bundle":"https://pith.science/pith/DYM544IDUDX2TNDH6F6IE7Y2LB/bundle.json","state":"https://pith.science/pith/DYM544IDUDX2TNDH6F6IE7Y2LB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYM544IDUDX2TNDH6F6IE7Y2LB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DYM544IDUDX2TNDH6F6IE7Y2LB","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":"03444a44299f170e53b8747c97d559bbf871ca7dc0f339e2d4ee08c14b3e834f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-23T03:33:06Z","title_canon_sha256":"929440b9d1825a1f0e242a405b26adf01e70f6d63a0a1d3684405112577ec5ac"},"schema_version":"1.0","source":{"id":"2402.15075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.15075","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"2402.15075v1","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15075","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"DYM544IDUDX2","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"pith_short_16","alias_value":"DYM544IDUDX2TNDH","created_at":"2026-07-05T07:48:35Z"},{"alias_kind":"pith_short_8","alias_value":"DYM544ID","created_at":"2026-07-05T07:48:35Z"}],"graph_snapshots":[{"event_id":"sha256:3dc43c1a12e2fb091e34e801fa1842e718b62c59514b09bc03d4e33204155882","target":"graph","created_at":"2026-07-05T07:48:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.15075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hybrid Bayesian networks (HBN) contain complex conditional probabilistic distributions (CPD) specified as partitioned expressions over discrete and continuous variables. The size of these CPDs grows exponentially with the number of parent nodes when using discrete inference, resulting in significant inefficiency. Normally, an effective way to reduce the CPD size is to use a binary factorization (BF) algorithm to decompose the statistical or arithmetic functions in the CPD by factorizing the number of connected parent nodes to sets of size two. However, the BF algorithm was not designed to hand","authors_text":"Martin Neil, Norman Fenton, Peng Lin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-23T03:33:06Z","title":"Stacking Factorizing Partitioned Expressions in Hybrid Bayesian Network Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15075","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:cfa63a410bb772beff4d8a47a2e6420c4dbb8f0bd58caea52c1e5538644867e1","target":"record","created_at":"2026-07-05T07:48:35Z","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":"03444a44299f170e53b8747c97d559bbf871ca7dc0f339e2d4ee08c14b3e834f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-23T03:33:06Z","title_canon_sha256":"929440b9d1825a1f0e242a405b26adf01e70f6d63a0a1d3684405112577ec5ac"},"schema_version":"1.0","source":{"id":"2402.15075","kind":"arxiv","version":1}},"canonical_sha256":"1e19de7103a0efa9b467f17c827f1a586a1333572f07cbf5078c127b39bb1b6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e19de7103a0efa9b467f17c827f1a586a1333572f07cbf5078c127b39bb1b6d","first_computed_at":"2026-07-05T07:48:35.780000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:48:35.780000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L4k/YrCssd/i2R9W26t+P8y3XwWu84f61nYLOffA0BUuKSU4mY/SiCdoWiIv4n/9c8FLiaoo9/wgTiOdQ8fTBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:48:35.780563Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.15075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfa63a410bb772beff4d8a47a2e6420c4dbb8f0bd58caea52c1e5538644867e1","sha256:3dc43c1a12e2fb091e34e801fa1842e718b62c59514b09bc03d4e33204155882"],"state_sha256":"41fc5c72fe8bb45f6230f5d0a03b8c4fc48185110e5986b41b0b7988a19479a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTTcDK9J+xU5M06Viewx93n2O3FbC21qsTnXaDcPKUrrdmxK0q7DIAYIigGGTyAhLrZNy2h6OmsUFq7BYyL7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:50:07.118035Z","bundle_sha256":"3ce58bfcac327447ae404c00f53f89088e090cb2eb8390b5e464c6588a827eee"}}