{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6MANEKGLJOUOTYNV5U4CSSVLWX","short_pith_number":"pith:6MANEKGL","canonical_record":{"source":{"id":"1302.3605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"f99de955dcd6b518af503c98e8b1fca1c2d6c98f43c3e1822ef625f667e0c72e","abstract_canon_sha256":"6989d2b84f86a4d027c077650dd0c50c3a5f2dabe81a44b43ed5e7b34c9d32e1"},"schema_version":"1.0"},"canonical_sha256":"f300d228cb4ba8e9e1b5ed38294aabb5f076147be2311696393891215704fb68","source":{"kind":"arxiv","id":"1302.3605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3605","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3605v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3605","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"6MANEKGLJOUO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6MANEKGLJOUOTYNV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6MANEKGL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6MANEKGLJOUOTYNV5U4CSSVLWX","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"f99de955dcd6b518af503c98e8b1fca1c2d6c98f43c3e1822ef625f667e0c72e","abstract_canon_sha256":"6989d2b84f86a4d027c077650dd0c50c3a5f2dabe81a44b43ed5e7b34c9d32e1"},"schema_version":"1.0"},"canonical_sha256":"f300d228cb4ba8e9e1b5ed38294aabb5f076147be2311696393891215704fb68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.479570Z","signature_b64":"oLKo0qThdGB2fBP6qjZEKbMUouTKb+MuENB1t9uSDfps7OfO+hDKTdub56t/6/MQ4wCnOAB+eUWXS8aMbimJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f300d228cb4ba8e9e1b5ed38294aabb5f076147be2311696393891215704fb68","last_reissued_at":"2026-05-18T03:33:36.478850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.478850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3605","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rm+5Jmt/mjzfJMeoqYm193uhtVUEH002QCalKDSZITaRRn5JRSAkrpoCoka+MStzPQxDL6L6OQJ+MxjqSoIMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:41:52.900641Z"},"content_sha256":"e6dc5bed58cbc83bb9de3552d96c282b6a8afbed7bad3e6d2b03b90afb9bfce0","schema_version":"1.0","event_id":"sha256:e6dc5bed58cbc83bb9de3552d96c282b6a8afbed7bad3e6d2b03b90afb9bfce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6MANEKGLJOUOTYNV5U4CSSVLWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Enumeration of Instantiations in Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pandurang Nayak, Sampath Srinivas","submitted_at":"2013-02-13T14:16:47Z","abstract_excerpt":"Over the past several years Bayesian networks have been applied to a wide variety of problems.  A central problem in applying Bayesian networks is that of finding one or more of the most probable instantiations of a network.  In this paper we develop an efficient algorithm that incrementally enumerates the instantiations of a Bayesian network in decreasing order of probability.  Such enumeration algorithms are applicable in a variety of applications ranging from medical expert systems to model-based diagnosis.  Fundamentally, our algorithm is simply performing a lazy enumeration of the sorted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3605","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMQ7ipuyPTlO4ioxFVPeaJIaxLY3QH2vE5eMUfOwMuL11dsc7JysNVENJFoLnTVZHngM5eAGKw+vYjU3wuWLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:41:52.900981Z"},"content_sha256":"37a8d72e82531989ced2d76388d5d9343e3084926e0a04d90d80a5fbffd38fd5","schema_version":"1.0","event_id":"sha256:37a8d72e82531989ced2d76388d5d9343e3084926e0a04d90d80a5fbffd38fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MANEKGLJOUOTYNV5U4CSSVLWX/bundle.json","state_url":"https://pith.science/pith/6MANEKGLJOUOTYNV5U4CSSVLWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MANEKGLJOUOTYNV5U4CSSVLWX/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-02T14:41:52Z","links":{"resolver":"https://pith.science/pith/6MANEKGLJOUOTYNV5U4CSSVLWX","bundle":"https://pith.science/pith/6MANEKGLJOUOTYNV5U4CSSVLWX/bundle.json","state":"https://pith.science/pith/6MANEKGLJOUOTYNV5U4CSSVLWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MANEKGLJOUOTYNV5U4CSSVLWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6MANEKGLJOUOTYNV5U4CSSVLWX","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":"6989d2b84f86a4d027c077650dd0c50c3a5f2dabe81a44b43ed5e7b34c9d32e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:47Z","title_canon_sha256":"f99de955dcd6b518af503c98e8b1fca1c2d6c98f43c3e1822ef625f667e0c72e"},"schema_version":"1.0","source":{"id":"1302.3605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3605","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3605v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3605","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"6MANEKGLJOUO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6MANEKGLJOUOTYNV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6MANEKGL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:37a8d72e82531989ced2d76388d5d9343e3084926e0a04d90d80a5fbffd38fd5","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"Over the past several years Bayesian networks have been applied to a wide variety of problems.  A central problem in applying Bayesian networks is that of finding one or more of the most probable instantiations of a network.  In this paper we develop an efficient algorithm that incrementally enumerates the instantiations of a Bayesian network in decreasing order of probability.  Such enumeration algorithms are applicable in a variety of applications ranging from medical expert systems to model-based diagnosis.  Fundamentally, our algorithm is simply performing a lazy enumeration of the sorted ","authors_text":"Pandurang Nayak, Sampath Srinivas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:47Z","title":"Efficient Enumeration of Instantiations in Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3605","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:e6dc5bed58cbc83bb9de3552d96c282b6a8afbed7bad3e6d2b03b90afb9bfce0","target":"record","created_at":"2026-05-18T03:33:36Z","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":"6989d2b84f86a4d027c077650dd0c50c3a5f2dabe81a44b43ed5e7b34c9d32e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:47Z","title_canon_sha256":"f99de955dcd6b518af503c98e8b1fca1c2d6c98f43c3e1822ef625f667e0c72e"},"schema_version":"1.0","source":{"id":"1302.3605","kind":"arxiv","version":1}},"canonical_sha256":"f300d228cb4ba8e9e1b5ed38294aabb5f076147be2311696393891215704fb68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f300d228cb4ba8e9e1b5ed38294aabb5f076147be2311696393891215704fb68","first_computed_at":"2026-05-18T03:33:36.478850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.478850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oLKo0qThdGB2fBP6qjZEKbMUouTKb+MuENB1t9uSDfps7OfO+hDKTdub56t/6/MQ4wCnOAB+eUWXS8aMbimJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.479570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6dc5bed58cbc83bb9de3552d96c282b6a8afbed7bad3e6d2b03b90afb9bfce0","sha256:37a8d72e82531989ced2d76388d5d9343e3084926e0a04d90d80a5fbffd38fd5"],"state_sha256":"89661be97f20157baed358f23dd9bb3964e5c27aecd96334fe7abf8239e5c912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6CgVfX/BXyL78vlfPumgUQi4Qc3itgVYeu+JQd+QhrzQdapTVm16GJSZ0tQIpn43IbcYuty+eMsVyzU5ZGgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:41:52.902905Z","bundle_sha256":"6cdb5b6495b4a28d4a0e0b5c2d6d07c9f6ff9eafb1fdca7f339bcfe50e661273"}}