{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5GT64IMEPGQT4SPYKO6P5PUNY3","short_pith_number":"pith:5GT64IME","canonical_record":{"source":{"id":"1011.1170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-11-04T14:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"aaac9982c1e661c795a68bec7cbff73fc4dc69629c11d4cb202ff03f68d8a95c","abstract_canon_sha256":"d845ca53b0afce379dc9a74fbd928d1f0b7b2e07bce4ae1891ac53540bb14abe"},"schema_version":"1.0"},"canonical_sha256":"e9a7ee218479a13e49f853bcfebe8dc6c4385fe705921f74ca7d7756b855be91","source":{"kind":"arxiv","id":"1011.1170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1170","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1170v1","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1170","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"5GT64IMEPGQT","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5GT64IMEPGQT4SPY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5GT64IME","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5GT64IMEPGQT4SPYKO6P5PUNY3","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-11-04T14:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"aaac9982c1e661c795a68bec7cbff73fc4dc69629c11d4cb202ff03f68d8a95c","abstract_canon_sha256":"d845ca53b0afce379dc9a74fbd928d1f0b7b2e07bce4ae1891ac53540bb14abe"},"schema_version":"1.0"},"canonical_sha256":"e9a7ee218479a13e49f853bcfebe8dc6c4385fe705921f74ca7d7756b855be91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:11.916443Z","signature_b64":"Y0fSejIbpY0RNRPlb2i8Mm38eSHfup/OPvmlkXP9F2JV481/e/HZXC3aqXlEVKhi+nA2sg6qbOFg+jME4lhQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a7ee218479a13e49f853bcfebe8dc6c4385fe705921f74ca7d7756b855be91","last_reissued_at":"2026-05-18T02:56:11.916041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:11.916041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1170","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"su8LSFsPRkvFoKW2rfpONVbx3DJxQI1RQJEjOLQrghz4mJ0DoVguWhZwjIth5/IZK4fmz6FrFdc/C7ijHXcvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:34:21.411724Z"},"content_sha256":"17dcf735f6c1764a775c9df74a53dbe7ff0a6fddb4eabce03c512beeef120955","schema_version":"1.0","event_id":"sha256:17dcf735f6c1764a775c9df74a53dbe7ff0a6fddb4eabce03c512beeef120955"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5GT64IMEPGQT4SPYKO6P5PUNY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interacting Multiple Try Algorithms with Different Proposal Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Fabrizio Leisen, Radu V. Craiu, Roberto Casarin","submitted_at":"2010-11-04T14:26:11Z","abstract_excerpt":"We propose a new class of interacting Markov chain Monte Carlo (MCMC) algorithms designed for increasing the efficiency of a modified multiple-try Metropolis (MTM) algorithm. The extension with respect to the existing MCMC literature is twofold. The sampler proposed extends the basic MTM algorithm by allowing different proposal distributions in the multiple-try generation step. We exploit the structure of the MTM algorithm with different proposal distributions to naturally introduce an interacting MTM mechanism (IMTM) that expands the class of population Monte Carlo methods. We show the validi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1170","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmdwHkDsVJnQJNuU3cQnXFrQf3Eaq/5a9nfRJan0VH9EP9sicAkyPQUWu42nFGkn+cQ4KFJSQvxmv7HYp6HkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:34:21.412065Z"},"content_sha256":"84139e893e83833399b22ac3b9f649f43f6792543b9470f0218fb07b690b531e","schema_version":"1.0","event_id":"sha256:84139e893e83833399b22ac3b9f649f43f6792543b9470f0218fb07b690b531e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GT64IMEPGQT4SPYKO6P5PUNY3/bundle.json","state_url":"https://pith.science/pith/5GT64IMEPGQT4SPYKO6P5PUNY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GT64IMEPGQT4SPYKO6P5PUNY3/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-29T20:34:21Z","links":{"resolver":"https://pith.science/pith/5GT64IMEPGQT4SPYKO6P5PUNY3","bundle":"https://pith.science/pith/5GT64IMEPGQT4SPYKO6P5PUNY3/bundle.json","state":"https://pith.science/pith/5GT64IMEPGQT4SPYKO6P5PUNY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GT64IMEPGQT4SPYKO6P5PUNY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5GT64IMEPGQT4SPYKO6P5PUNY3","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":"d845ca53b0afce379dc9a74fbd928d1f0b7b2e07bce4ae1891ac53540bb14abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-11-04T14:26:11Z","title_canon_sha256":"aaac9982c1e661c795a68bec7cbff73fc4dc69629c11d4cb202ff03f68d8a95c"},"schema_version":"1.0","source":{"id":"1011.1170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1170","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1170v1","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1170","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"5GT64IMEPGQT","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5GT64IMEPGQT4SPY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5GT64IME","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:84139e893e83833399b22ac3b9f649f43f6792543b9470f0218fb07b690b531e","target":"graph","created_at":"2026-05-18T02:56:11Z","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 propose a new class of interacting Markov chain Monte Carlo (MCMC) algorithms designed for increasing the efficiency of a modified multiple-try Metropolis (MTM) algorithm. The extension with respect to the existing MCMC literature is twofold. The sampler proposed extends the basic MTM algorithm by allowing different proposal distributions in the multiple-try generation step. We exploit the structure of the MTM algorithm with different proposal distributions to naturally introduce an interacting MTM mechanism (IMTM) that expands the class of population Monte Carlo methods. We show the validi","authors_text":"Fabrizio Leisen, Radu V. Craiu, Roberto Casarin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-11-04T14:26:11Z","title":"Interacting Multiple Try Algorithms with Different Proposal Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1170","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:17dcf735f6c1764a775c9df74a53dbe7ff0a6fddb4eabce03c512beeef120955","target":"record","created_at":"2026-05-18T02:56:11Z","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":"d845ca53b0afce379dc9a74fbd928d1f0b7b2e07bce4ae1891ac53540bb14abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-11-04T14:26:11Z","title_canon_sha256":"aaac9982c1e661c795a68bec7cbff73fc4dc69629c11d4cb202ff03f68d8a95c"},"schema_version":"1.0","source":{"id":"1011.1170","kind":"arxiv","version":1}},"canonical_sha256":"e9a7ee218479a13e49f853bcfebe8dc6c4385fe705921f74ca7d7756b855be91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9a7ee218479a13e49f853bcfebe8dc6c4385fe705921f74ca7d7756b855be91","first_computed_at":"2026-05-18T02:56:11.916041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:11.916041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0fSejIbpY0RNRPlb2i8Mm38eSHfup/OPvmlkXP9F2JV481/e/HZXC3aqXlEVKhi+nA2sg6qbOFg+jME4lhQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:11.916443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17dcf735f6c1764a775c9df74a53dbe7ff0a6fddb4eabce03c512beeef120955","sha256:84139e893e83833399b22ac3b9f649f43f6792543b9470f0218fb07b690b531e"],"state_sha256":"04175e16525f8d5f48f3d78cf34f9e2d50a97a6bb2c603295314ba5a3b12e1dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh2IdakXWc4oD5CrTlM0zpIZ8BZnLGTe8mgyeZu8EUM/WTGxlI7PW4dDyIzdy56b8Q0a2Ls3rx05GPa9UAQ7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:34:21.414087Z","bundle_sha256":"ea26273deb7b48e61dc38e27e7d055de128183f64f170552eb19f0e252e84c5b"}}