{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ODOG4SC2NZL6CDWAPDHVLGN3AO","short_pith_number":"pith:ODOG4SC2","canonical_record":{"source":{"id":"2312.03857","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-12-06T19:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"a1cc349fa1d77809b29736aab28c0b39724a6c57bfa6482e7b0d5852b2efba5b","abstract_canon_sha256":"468a7d17883f59b0f5b6c9089e70f1f1db4f0130256034e428dcc55dc16a2c39"},"schema_version":"1.0"},"canonical_sha256":"70dc6e485a6e57e10ec078cf5599bb039d17d2b83162eaadb2cba93d74241600","source":{"kind":"arxiv","id":"2312.03857","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.03857","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2312.03857v2","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03857","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"ODOG4SC2NZL6","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"ODOG4SC2NZL6CDWA","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"ODOG4SC2","created_at":"2026-07-05T07:23:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ODOG4SC2NZL6CDWAPDHVLGN3AO","target":"record","payload":{"canonical_record":{"source":{"id":"2312.03857","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-12-06T19:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"a1cc349fa1d77809b29736aab28c0b39724a6c57bfa6482e7b0d5852b2efba5b","abstract_canon_sha256":"468a7d17883f59b0f5b6c9089e70f1f1db4f0130256034e428dcc55dc16a2c39"},"schema_version":"1.0"},"canonical_sha256":"70dc6e485a6e57e10ec078cf5599bb039d17d2b83162eaadb2cba93d74241600","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:10.095650Z","signature_b64":"PTnxMWKiO4himjs6WzVWxCAzjfKi6ahhg1BjbgAE6uv/JyeikKsHtQjliwb5f9uLCNrAD/F7s9PSWKoMfFFLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70dc6e485a6e57e10ec078cf5599bb039d17d2b83162eaadb2cba93d74241600","last_reissued_at":"2026-07-05T07:23:10.095217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:10.095217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.03857","source_version":2,"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:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFL4YxQJ2qo8WAwxzepmfH7rPgC2k797dbRIYmQgL/s6CGC7V90OKfssQ/fIhLhP1Pgrf0BNQERLuuYDjlxCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:36:07.431174Z"},"content_sha256":"3846c2c99878acba3149d59ec5956c9aee6c12357765b3e6339098a6f54faa3d","schema_version":"1.0","event_id":"sha256:3846c2c99878acba3149d59ec5956c9aee6c12357765b3e6339098a6f54faa3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ODOG4SC2NZL6CDWAPDHVLGN3AO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Population Monte Carlo with Normalizing Flow","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Antonios Valkanas, Mark Coates, Soumyasundar Pal","submitted_at":"2023-12-06T19:11:10Z","abstract_excerpt":"Adaptive importance sampling (AIS) methods provide a useful alternative to Markov Chain Monte Carlo (MCMC) algorithms for performing inference of intractable distributions. Population Monte Carlo (PMC) algorithms constitute a family of AIS approaches which adapt the proposal distributions iteratively to improve the approximation of the target distribution. Recent work in this area primarily focuses on ameliorating the proposal adaptation procedure for high-dimensional applications. However, most of the AIS algorithms use simple proposal distributions for sampling, which might be inadequate in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03857","kind":"arxiv","version":2},"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/2312.03857/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:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xw5V9vAzXZAW8lzwIjPC9HjE6TpdGiPW8wj8+bddj1wUQNpFXftAcoVjsMcYdesBKXWrIJaJXVpUxrjOHIoyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:36:07.431569Z"},"content_sha256":"9d5168f3fe75f35d4bde5cea7b6aee133cd463d127bbb68dfcc13d3844070c4a","schema_version":"1.0","event_id":"sha256:9d5168f3fe75f35d4bde5cea7b6aee133cd463d127bbb68dfcc13d3844070c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO/bundle.json","state_url":"https://pith.science/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO/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-09T03:36:07Z","links":{"resolver":"https://pith.science/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO","bundle":"https://pith.science/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO/bundle.json","state":"https://pith.science/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODOG4SC2NZL6CDWAPDHVLGN3AO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ODOG4SC2NZL6CDWAPDHVLGN3AO","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":"468a7d17883f59b0f5b6c9089e70f1f1db4f0130256034e428dcc55dc16a2c39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-12-06T19:11:10Z","title_canon_sha256":"a1cc349fa1d77809b29736aab28c0b39724a6c57bfa6482e7b0d5852b2efba5b"},"schema_version":"1.0","source":{"id":"2312.03857","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.03857","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2312.03857v2","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03857","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"ODOG4SC2NZL6","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"ODOG4SC2NZL6CDWA","created_at":"2026-07-05T07:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"ODOG4SC2","created_at":"2026-07-05T07:23:10Z"}],"graph_snapshots":[{"event_id":"sha256:9d5168f3fe75f35d4bde5cea7b6aee133cd463d127bbb68dfcc13d3844070c4a","target":"graph","created_at":"2026-07-05T07:23:10Z","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/2312.03857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Adaptive importance sampling (AIS) methods provide a useful alternative to Markov Chain Monte Carlo (MCMC) algorithms for performing inference of intractable distributions. Population Monte Carlo (PMC) algorithms constitute a family of AIS approaches which adapt the proposal distributions iteratively to improve the approximation of the target distribution. Recent work in this area primarily focuses on ameliorating the proposal adaptation procedure for high-dimensional applications. However, most of the AIS algorithms use simple proposal distributions for sampling, which might be inadequate in ","authors_text":"Antonios Valkanas, Mark Coates, Soumyasundar Pal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-12-06T19:11:10Z","title":"Population Monte Carlo with Normalizing Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03857","kind":"arxiv","version":2},"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:3846c2c99878acba3149d59ec5956c9aee6c12357765b3e6339098a6f54faa3d","target":"record","created_at":"2026-07-05T07:23:10Z","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":"468a7d17883f59b0f5b6c9089e70f1f1db4f0130256034e428dcc55dc16a2c39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-12-06T19:11:10Z","title_canon_sha256":"a1cc349fa1d77809b29736aab28c0b39724a6c57bfa6482e7b0d5852b2efba5b"},"schema_version":"1.0","source":{"id":"2312.03857","kind":"arxiv","version":2}},"canonical_sha256":"70dc6e485a6e57e10ec078cf5599bb039d17d2b83162eaadb2cba93d74241600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70dc6e485a6e57e10ec078cf5599bb039d17d2b83162eaadb2cba93d74241600","first_computed_at":"2026-07-05T07:23:10.095217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:10.095217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTnxMWKiO4himjs6WzVWxCAzjfKi6ahhg1BjbgAE6uv/JyeikKsHtQjliwb5f9uLCNrAD/F7s9PSWKoMfFFLCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:10.095650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.03857","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3846c2c99878acba3149d59ec5956c9aee6c12357765b3e6339098a6f54faa3d","sha256:9d5168f3fe75f35d4bde5cea7b6aee133cd463d127bbb68dfcc13d3844070c4a"],"state_sha256":"b5e9fc8ce0f8dfeccc430ddf8821fce6aaa38868b58329980feb8dad38ff24ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UotLltjCBnVIJ/isbxhq01MbW8U6INlzcpMVp3RrAL41IZi9HNn32N0SHqB4PzUouIvLneoWSpNjxqN7mLpmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:36:07.433605Z","bundle_sha256":"8d1e2320258b7738b6e87142ca9cbd7aed9f02ae7ed7fe8bb4f8c1a2be2ca509"}}