{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NJEBDGQU3BXZT4APDNE67IDBWB","short_pith_number":"pith:NJEBDGQU","canonical_record":{"source":{"id":"1504.06848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-26T17:23:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"aa13ad3a0033af38c89fa214a72943ee266102301e5e2508df96a0d629fad34a","abstract_canon_sha256":"199048bb986839b7dbc4f3d5956a14bb9649bf9984d86d78c17c0d1bee4c5cb6"},"schema_version":"1.0"},"canonical_sha256":"6a48119a14d86f99f00f1b49efa061b0719c7a973937ff14508e2c5f746359af","source":{"kind":"arxiv","id":"1504.06848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06848","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06848v1","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06848","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"NJEBDGQU3BXZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NJEBDGQU3BXZT4AP","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NJEBDGQU","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NJEBDGQU3BXZT4APDNE67IDBWB","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-26T17:23:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"aa13ad3a0033af38c89fa214a72943ee266102301e5e2508df96a0d629fad34a","abstract_canon_sha256":"199048bb986839b7dbc4f3d5956a14bb9649bf9984d86d78c17c0d1bee4c5cb6"},"schema_version":"1.0"},"canonical_sha256":"6a48119a14d86f99f00f1b49efa061b0719c7a973937ff14508e2c5f746359af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:44.248609Z","signature_b64":"HsCPHIXSH8SbU5WeTE/sU8QPg1V0caR7RZDR/P6JZaxC2qciztUkOm6n6ODc+vfctpezo7AoK0vrTEFUufGxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a48119a14d86f99f00f1b49efa061b0719c7a973937ff14508e2c5f746359af","last_reissued_at":"2026-05-18T02:17:44.247982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:44.247982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06848","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-18T02:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+G7BvRzAd6vW2345BhoOkEsH0WIOnJoZ6HOO+tZajzPZ7wKdxfXw0k5jMsRqM136VkjxKtYwqKNj059/iUBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:12:31.601561Z"},"content_sha256":"fb5ed9823e62fa82532e452543783980b1a6bc0b512764615fd41849d4e92564","schema_version":"1.0","event_id":"sha256:fb5ed9823e62fa82532e452543783980b1a6bc0b512764615fd41849d4e92564"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NJEBDGQU3BXZT4APDNE67IDBWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum a Posteriori Estimation by Search in Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.AI","authors_text":"David Tolpin, Frank Wood","submitted_at":"2015-04-26T17:23:06Z","abstract_excerpt":"We introduce an approximate search algorithm for fast maximum a posteriori probability estimation in probabilistic programs, which we call Bayesian ascent Monte Carlo (BaMC). Probabilistic programs represent probabilistic models with varying number of mutually dependent finite, countable, and continuous random variables. BaMC is an anytime MAP search algorithm applicable to any combination of random variables and dependencies. We compare BaMC to other MAP estimation algorithms and show that BaMC is faster and more robust on a range of probabilistic models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06848","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-18T02:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RRURHnNcnfAtALCkg6FDmYYX/SKqYemtzgPI42beWrKLBrkUEoFMrejhEr06EtkLbgTjgWKAbLFvYBOJna4GAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:12:31.602228Z"},"content_sha256":"159e3849196abbdd42c4053b3f2e9d1f4f529f9e19c3fc0c87fd64d1cd0f34f4","schema_version":"1.0","event_id":"sha256:159e3849196abbdd42c4053b3f2e9d1f4f529f9e19c3fc0c87fd64d1cd0f34f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJEBDGQU3BXZT4APDNE67IDBWB/bundle.json","state_url":"https://pith.science/pith/NJEBDGQU3BXZT4APDNE67IDBWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJEBDGQU3BXZT4APDNE67IDBWB/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-27T21:12:31Z","links":{"resolver":"https://pith.science/pith/NJEBDGQU3BXZT4APDNE67IDBWB","bundle":"https://pith.science/pith/NJEBDGQU3BXZT4APDNE67IDBWB/bundle.json","state":"https://pith.science/pith/NJEBDGQU3BXZT4APDNE67IDBWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJEBDGQU3BXZT4APDNE67IDBWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NJEBDGQU3BXZT4APDNE67IDBWB","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":"199048bb986839b7dbc4f3d5956a14bb9649bf9984d86d78c17c0d1bee4c5cb6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-26T17:23:06Z","title_canon_sha256":"aa13ad3a0033af38c89fa214a72943ee266102301e5e2508df96a0d629fad34a"},"schema_version":"1.0","source":{"id":"1504.06848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06848","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06848v1","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06848","created_at":"2026-05-18T02:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"NJEBDGQU3BXZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NJEBDGQU3BXZT4AP","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NJEBDGQU","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:159e3849196abbdd42c4053b3f2e9d1f4f529f9e19c3fc0c87fd64d1cd0f34f4","target":"graph","created_at":"2026-05-18T02:17:44Z","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":"We introduce an approximate search algorithm for fast maximum a posteriori probability estimation in probabilistic programs, which we call Bayesian ascent Monte Carlo (BaMC). Probabilistic programs represent probabilistic models with varying number of mutually dependent finite, countable, and continuous random variables. BaMC is an anytime MAP search algorithm applicable to any combination of random variables and dependencies. We compare BaMC to other MAP estimation algorithms and show that BaMC is faster and more robust on a range of probabilistic models.","authors_text":"David Tolpin, Frank Wood","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-26T17:23:06Z","title":"Maximum a Posteriori Estimation by Search in Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06848","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:fb5ed9823e62fa82532e452543783980b1a6bc0b512764615fd41849d4e92564","target":"record","created_at":"2026-05-18T02:17:44Z","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":"199048bb986839b7dbc4f3d5956a14bb9649bf9984d86d78c17c0d1bee4c5cb6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-26T17:23:06Z","title_canon_sha256":"aa13ad3a0033af38c89fa214a72943ee266102301e5e2508df96a0d629fad34a"},"schema_version":"1.0","source":{"id":"1504.06848","kind":"arxiv","version":1}},"canonical_sha256":"6a48119a14d86f99f00f1b49efa061b0719c7a973937ff14508e2c5f746359af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a48119a14d86f99f00f1b49efa061b0719c7a973937ff14508e2c5f746359af","first_computed_at":"2026-05-18T02:17:44.247982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:44.247982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsCPHIXSH8SbU5WeTE/sU8QPg1V0caR7RZDR/P6JZaxC2qciztUkOm6n6ODc+vfctpezo7AoK0vrTEFUufGxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:44.248609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb5ed9823e62fa82532e452543783980b1a6bc0b512764615fd41849d4e92564","sha256:159e3849196abbdd42c4053b3f2e9d1f4f529f9e19c3fc0c87fd64d1cd0f34f4"],"state_sha256":"1c799d2a279623a769eac46f1d18eb98a60e6250cddac76adbc22840c807b97e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wfl6iZUmOuhfAe0VM9urU5fl5Bpd3xpy7cfIAzEUeGK5eY30Z/oWAUKMY0/QCAjvWTOjnEXV0TTWeXkOprBKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:12:31.605638Z","bundle_sha256":"382031241b19c561c49e8d56bc31bdddc7f9ccf1566e96f2cc0548c5d549995c"}}