{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DM3NGBF5DNJGDTZFB2S2HCEKCH","short_pith_number":"pith:DM3NGBF5","canonical_record":{"source":{"id":"1207.4153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"43c773796377c36a943a0366b199bc7cd6ea23e94e9af1ee87a090985bbf12c8","abstract_canon_sha256":"20f1b8b02ea9277c5d617050ed7655dd440cd7a68f2cfb70c3230bed91730f74"},"schema_version":"1.0"},"canonical_sha256":"1b36d304bd1b5261cf250ea5a3888a11d1de1786dac0b45168a51dee7a316928","source":{"kind":"arxiv","id":"1207.4153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4153","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4153v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4153","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"DM3NGBF5DNJG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DM3NGBF5DNJGDTZF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DM3NGBF5","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DM3NGBF5DNJGDTZFB2S2HCEKCH","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"43c773796377c36a943a0366b199bc7cd6ea23e94e9af1ee87a090985bbf12c8","abstract_canon_sha256":"20f1b8b02ea9277c5d617050ed7655dd440cd7a68f2cfb70c3230bed91730f74"},"schema_version":"1.0"},"canonical_sha256":"1b36d304bd1b5261cf250ea5a3888a11d1de1786dac0b45168a51dee7a316928","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.605490Z","signature_b64":"rdtL/Uz/B1gFVq34DgEzOPzHRVXGl61uBKboXcGJvG43RAqIIEC1vPpfQf0FdZEIGZlNDqmwlXUkHv8kluKDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b36d304bd1b5261cf250ea5a3888a11d1de1786dac0b45168a51dee7a316928","last_reissued_at":"2026-05-18T03:50:47.604851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.604851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4153","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsYmxuxE0v7oDdA/hAgrPjaFvMbFkirNduQ6MScVDU/R/SUMat1aKpd/HIc06KI3G/NTKTEsX/vop3n6ogxtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:21:46.523897Z"},"content_sha256":"04f1e57c76fdc84a5670a457c644934ea4373f1a88578ccd67d95000ce24d039","schema_version":"1.0","event_id":"sha256:04f1e57c76fdc84a5670a457c644934ea4373f1a88578ccd67d95000ce24d039"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DM3NGBF5DNJGDTZFB2S2HCEKCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Annealed MAP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Changhe Yuan, Marek J. Druzdzel, Tsai-Ching Lu","submitted_at":"2012-07-11T14:59:29Z","abstract_excerpt":"Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesian network. MAP has been shown to be a NP-hard problem [22], even for constrained networks, such as polytrees [18]. Hence, previous approaches often fail to yield any results for MAP problems in large complex Bayesian networks. To address this problem, we propose AnnealedMAP algorithm, a simulated annealing-based MAP algorithm. The AnnealedMAP algorithm simulates a non-homogeneous Markov chain whose invariant function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4153","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/SO3Gq2gJOB84ap9uCKL5Ks9IvVlpYhGzXH0OvvAvZI4m1ML1kuZ9bJKKfPBM0mCcsMIb0mLBNGkOD1QHv8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:21:46.524577Z"},"content_sha256":"c0a0b6ebabcf5cecbfbca4603ab23f1c86a16843086c4ad9aa0d01c950659684","schema_version":"1.0","event_id":"sha256:c0a0b6ebabcf5cecbfbca4603ab23f1c86a16843086c4ad9aa0d01c950659684"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH/bundle.json","state_url":"https://pith.science/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH/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-31T18:21:46Z","links":{"resolver":"https://pith.science/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH","bundle":"https://pith.science/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH/bundle.json","state":"https://pith.science/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DM3NGBF5DNJGDTZFB2S2HCEKCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DM3NGBF5DNJGDTZFB2S2HCEKCH","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":"20f1b8b02ea9277c5d617050ed7655dd440cd7a68f2cfb70c3230bed91730f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:29Z","title_canon_sha256":"43c773796377c36a943a0366b199bc7cd6ea23e94e9af1ee87a090985bbf12c8"},"schema_version":"1.0","source":{"id":"1207.4153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4153","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4153v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4153","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"DM3NGBF5DNJG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DM3NGBF5DNJGDTZF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DM3NGBF5","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:c0a0b6ebabcf5cecbfbca4603ab23f1c86a16843086c4ad9aa0d01c950659684","target":"graph","created_at":"2026-05-18T03:50:47Z","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":"Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesian network. MAP has been shown to be a NP-hard problem [22], even for constrained networks, such as polytrees [18]. Hence, previous approaches often fail to yield any results for MAP problems in large complex Bayesian networks. To address this problem, we propose AnnealedMAP algorithm, a simulated annealing-based MAP algorithm. The AnnealedMAP algorithm simulates a non-homogeneous Markov chain whose invariant function","authors_text":"Changhe Yuan, Marek J. Druzdzel, Tsai-Ching Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:29Z","title":"Annealed MAP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4153","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:04f1e57c76fdc84a5670a457c644934ea4373f1a88578ccd67d95000ce24d039","target":"record","created_at":"2026-05-18T03:50:47Z","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":"20f1b8b02ea9277c5d617050ed7655dd440cd7a68f2cfb70c3230bed91730f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:59:29Z","title_canon_sha256":"43c773796377c36a943a0366b199bc7cd6ea23e94e9af1ee87a090985bbf12c8"},"schema_version":"1.0","source":{"id":"1207.4153","kind":"arxiv","version":1}},"canonical_sha256":"1b36d304bd1b5261cf250ea5a3888a11d1de1786dac0b45168a51dee7a316928","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b36d304bd1b5261cf250ea5a3888a11d1de1786dac0b45168a51dee7a316928","first_computed_at":"2026-05-18T03:50:47.604851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.604851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rdtL/Uz/B1gFVq34DgEzOPzHRVXGl61uBKboXcGJvG43RAqIIEC1vPpfQf0FdZEIGZlNDqmwlXUkHv8kluKDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.605490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04f1e57c76fdc84a5670a457c644934ea4373f1a88578ccd67d95000ce24d039","sha256:c0a0b6ebabcf5cecbfbca4603ab23f1c86a16843086c4ad9aa0d01c950659684"],"state_sha256":"9df0b001bdca7439fa3a89c4d700c5440de226c5a545eface2092369cbd3fb9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cbnl5Mqbe9h67ri5blN7zrekDJDfPiI5obxo1XBYtRMp4XIaq96FO1h4lNu2BtqsGKC05m5kwcdtkJtPhJGzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:21:46.528434Z","bundle_sha256":"f271c8e5c41bafd1e04b9622373f9bc1b88cba71624216d9192b321b87293adc"}}