{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DWCXVRLPL2NOJGZNSUWRENDH64","short_pith_number":"pith:DWCXVRLP","canonical_record":{"source":{"id":"1210.5128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-18T14:02:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5d6fdd696f50a59cdc8d0dd959b9cac6488a9353a3f4e2074f8870a10a31379e","abstract_canon_sha256":"e3bd98c9a39ba41c81e5f05d4d88a156d575528fdafb45e0b72909fdfe9a8646"},"schema_version":"1.0"},"canonical_sha256":"1d857ac56f5e9ae49b2d952d123467f7054ac8874799895e6a68ccb27f7de262","source":{"kind":"arxiv","id":"1210.5128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5128","created_at":"2026-05-18T03:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5128v1","created_at":"2026-05-18T03:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5128","created_at":"2026-05-18T03:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"DWCXVRLPL2NO","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DWCXVRLPL2NOJGZN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DWCXVRLP","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DWCXVRLPL2NOJGZNSUWRENDH64","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-18T14:02:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5d6fdd696f50a59cdc8d0dd959b9cac6488a9353a3f4e2074f8870a10a31379e","abstract_canon_sha256":"e3bd98c9a39ba41c81e5f05d4d88a156d575528fdafb45e0b72909fdfe9a8646"},"schema_version":"1.0"},"canonical_sha256":"1d857ac56f5e9ae49b2d952d123467f7054ac8874799895e6a68ccb27f7de262","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:53.800171Z","signature_b64":"y7SoxbY0RspoOXeJs7S5tfu+/m99k5AcmrDhceECAp/Ynpb0E3Daobbvfl71si2hQPCVjzdEJh/XU/GBCjYXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d857ac56f5e9ae49b2d952d123467f7054ac8874799895e6a68ccb27f7de262","last_reissued_at":"2026-05-18T03:42:53.799461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:53.799461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5128","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:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H63r5ujrfVMfgFf1UmNobmBoyXDaPQ1Qo7uvi5oYQWvUUCEEiOJvNbaQooG8yWcwyEinE+zmclqthjJFY8C9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:40:14.531909Z"},"content_sha256":"40989b0704d9d814645de09ca800b992e1c5288e893adbe7ba35a2c8656e0f71","schema_version":"1.0","event_id":"sha256:40989b0704d9d814645de09ca800b992e1c5288e893adbe7ba35a2c8656e0f71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DWCXVRLPL2NOJGZNSUWRENDH64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Learning Algorithm for Bayesian Network and Its Efficient Implementation on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Bo Yuan, Shuchang Zhang, Weikang Qian, Yu Wang","submitted_at":"2012-10-18T14:02:12Z","abstract_excerpt":"Computational inference of causal relationships underlying complex networks, such as gene-regulatory pathways, is NP-complete due to its combinatorial nature when permuting all possible interactions. Markov chain Monte Carlo (MCMC) has been introduced to sample only part of the combinations while still guaranteeing convergence and traversability, which therefore becomes widely used. However, MCMC is not able to perform efficiently enough for networks that have more than 15~20 nodes because of the computational complexity. In this paper, we use general purpose processor (GPP) and general purpos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5128","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:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmbccxFGNcDX3/oUR1/0vDk26ho68neXq498wyODNkLr/JC0uj0Q+NSQm1NergTRNSfJq3fciGXs2y13FLatBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:40:14.532578Z"},"content_sha256":"68ce613302e4ee1dfab9d64ca6155c6e0625d1485a68be9b191bc84d754921ea","schema_version":"1.0","event_id":"sha256:68ce613302e4ee1dfab9d64ca6155c6e0625d1485a68be9b191bc84d754921ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWCXVRLPL2NOJGZNSUWRENDH64/bundle.json","state_url":"https://pith.science/pith/DWCXVRLPL2NOJGZNSUWRENDH64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWCXVRLPL2NOJGZNSUWRENDH64/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-05-30T15:40:14Z","links":{"resolver":"https://pith.science/pith/DWCXVRLPL2NOJGZNSUWRENDH64","bundle":"https://pith.science/pith/DWCXVRLPL2NOJGZNSUWRENDH64/bundle.json","state":"https://pith.science/pith/DWCXVRLPL2NOJGZNSUWRENDH64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWCXVRLPL2NOJGZNSUWRENDH64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DWCXVRLPL2NOJGZNSUWRENDH64","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":"e3bd98c9a39ba41c81e5f05d4d88a156d575528fdafb45e0b72909fdfe9a8646","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-18T14:02:12Z","title_canon_sha256":"5d6fdd696f50a59cdc8d0dd959b9cac6488a9353a3f4e2074f8870a10a31379e"},"schema_version":"1.0","source":{"id":"1210.5128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5128","created_at":"2026-05-18T03:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5128v1","created_at":"2026-05-18T03:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5128","created_at":"2026-05-18T03:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"DWCXVRLPL2NO","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DWCXVRLPL2NOJGZN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DWCXVRLP","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:68ce613302e4ee1dfab9d64ca6155c6e0625d1485a68be9b191bc84d754921ea","target":"graph","created_at":"2026-05-18T03:42:53Z","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":"Computational inference of causal relationships underlying complex networks, such as gene-regulatory pathways, is NP-complete due to its combinatorial nature when permuting all possible interactions. Markov chain Monte Carlo (MCMC) has been introduced to sample only part of the combinations while still guaranteeing convergence and traversability, which therefore becomes widely used. However, MCMC is not able to perform efficiently enough for networks that have more than 15~20 nodes because of the computational complexity. In this paper, we use general purpose processor (GPP) and general purpos","authors_text":"Bo Yuan, Shuchang Zhang, Weikang Qian, Yu Wang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-18T14:02:12Z","title":"A Novel Learning Algorithm for Bayesian Network and Its Efficient Implementation on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5128","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:40989b0704d9d814645de09ca800b992e1c5288e893adbe7ba35a2c8656e0f71","target":"record","created_at":"2026-05-18T03:42:53Z","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":"e3bd98c9a39ba41c81e5f05d4d88a156d575528fdafb45e0b72909fdfe9a8646","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-18T14:02:12Z","title_canon_sha256":"5d6fdd696f50a59cdc8d0dd959b9cac6488a9353a3f4e2074f8870a10a31379e"},"schema_version":"1.0","source":{"id":"1210.5128","kind":"arxiv","version":1}},"canonical_sha256":"1d857ac56f5e9ae49b2d952d123467f7054ac8874799895e6a68ccb27f7de262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d857ac56f5e9ae49b2d952d123467f7054ac8874799895e6a68ccb27f7de262","first_computed_at":"2026-05-18T03:42:53.799461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:53.799461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y7SoxbY0RspoOXeJs7S5tfu+/m99k5AcmrDhceECAp/Ynpb0E3Daobbvfl71si2hQPCVjzdEJh/XU/GBCjYXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:53.800171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40989b0704d9d814645de09ca800b992e1c5288e893adbe7ba35a2c8656e0f71","sha256:68ce613302e4ee1dfab9d64ca6155c6e0625d1485a68be9b191bc84d754921ea"],"state_sha256":"cc933e1e1041bf67b245492427640f0a111f12ce598e41410bad3babe8235ce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic6hpSjd1ASGvQUuZmxxeok6/6C3EJY8j6DSeSRDnpt2LWpiobtAeU41DJYlcoAugHcu4O2ivSLKvlURn0u6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:40:14.536193Z","bundle_sha256":"3ed96ed5c8e507b6c6a8152aa10552333a55e1aac0bfbd952895caa49d9f0c0c"}}