{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7OX4XXDXB7AVZHLEYJPE2ESVZH","short_pith_number":"pith:7OX4XXDX","canonical_record":{"source":{"id":"1502.05313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-18T17:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"a8852f34623b768e60e8bfad896e585ba442b67848b8e017c40f9de46fac2df1","abstract_canon_sha256":"a875ca056cd27bd17650a9345e24a0407325494ff7eb1ad051d6225afb21b5d6"},"schema_version":"1.0"},"canonical_sha256":"fbafcbdc770fc15c9d64c25e4d1255c9ec36b3abb01943401ee495c5ff695be0","source":{"kind":"arxiv","id":"1502.05313","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05313","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05313v2","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05313","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"7OX4XXDXB7AV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7OX4XXDXB7AVZHLE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7OX4XXDX","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7OX4XXDXB7AVZHLEYJPE2ESVZH","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-18T17:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"a8852f34623b768e60e8bfad896e585ba442b67848b8e017c40f9de46fac2df1","abstract_canon_sha256":"a875ca056cd27bd17650a9345e24a0407325494ff7eb1ad051d6225afb21b5d6"},"schema_version":"1.0"},"canonical_sha256":"fbafcbdc770fc15c9d64c25e4d1255c9ec36b3abb01943401ee495c5ff695be0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:12.221166Z","signature_b64":"fVfcELL42ihiaGJTF7bRIPUXVQ7g6TbyYZUgOOYTBlkwUnF9EVTl1VyAVVxHZsWu5oPsNzk4Ksk8766rgbXFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbafcbdc770fc15c9d64c25e4d1255c9ec36b3abb01943401ee495c5ff695be0","last_reissued_at":"2026-05-18T02:20:12.220582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:12.220582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05313","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-05-18T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0xlw72C5sVB/WDFXviQPt3LPkDxdX/Hk+SirjDvKSSSdrFyviSLx9X/t3i3GYKUNXx8OynpT9D3Z4/4jCq/0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:56:44.139778Z"},"content_sha256":"7d0f9fe2a26e45ee2d28a9d84e64e9cce09fb32bff10119a48ffb30822d2ac0b","schema_version":"1.0","event_id":"sha256:7d0f9fe2a26e45ee2d28a9d84e64e9cce09fb32bff10119a48ffb30822d2ac0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7OX4XXDXB7AVZHLEYJPE2ESVZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variational Optimization of Annealing Schedules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Taichi Kiwaki","submitted_at":"2015-02-18T17:45:44Z","abstract_excerpt":"Annealed importance sampling (AIS) is a common algorithm to estimate partition functions of useful stochastic models. One important problem for obtaining accurate AIS estimates is the selection of an annealing schedule. Conventionally, an annealing schedule is often determined heuristically or is simply set as a linearly increasing sequence. In this paper, we propose an algorithm for the optimal schedule by deriving a functional that dominates the AIS estimation error and by numerically minimizing this functional. We experimentally demonstrate that the proposed algorithm mostly outperforms con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05313","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":""},"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:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbdOVRnk6XcfICqG/Rm0xxEy5TmaIPNZAFpIqBZ0qe29gKamCJtUO02nvC0F6cpZj/wBTnQjzUUAW+ywqKspAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:56:44.140131Z"},"content_sha256":"7839f23fac376fe3999e73749f638f04d61689bc1534ec1cb979a777488c7b0b","schema_version":"1.0","event_id":"sha256:7839f23fac376fe3999e73749f638f04d61689bc1534ec1cb979a777488c7b0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH/bundle.json","state_url":"https://pith.science/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH/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-06-11T12:56:44Z","links":{"resolver":"https://pith.science/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH","bundle":"https://pith.science/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH/bundle.json","state":"https://pith.science/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OX4XXDXB7AVZHLEYJPE2ESVZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7OX4XXDXB7AVZHLEYJPE2ESVZH","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":"a875ca056cd27bd17650a9345e24a0407325494ff7eb1ad051d6225afb21b5d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-18T17:45:44Z","title_canon_sha256":"a8852f34623b768e60e8bfad896e585ba442b67848b8e017c40f9de46fac2df1"},"schema_version":"1.0","source":{"id":"1502.05313","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05313","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05313v2","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05313","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"7OX4XXDXB7AV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7OX4XXDXB7AVZHLE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7OX4XXDX","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:7839f23fac376fe3999e73749f638f04d61689bc1534ec1cb979a777488c7b0b","target":"graph","created_at":"2026-05-18T02:20:12Z","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":"Annealed importance sampling (AIS) is a common algorithm to estimate partition functions of useful stochastic models. One important problem for obtaining accurate AIS estimates is the selection of an annealing schedule. Conventionally, an annealing schedule is often determined heuristically or is simply set as a linearly increasing sequence. In this paper, we propose an algorithm for the optimal schedule by deriving a functional that dominates the AIS estimation error and by numerically minimizing this functional. We experimentally demonstrate that the proposed algorithm mostly outperforms con","authors_text":"Taichi Kiwaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-18T17:45:44Z","title":"Variational Optimization of Annealing Schedules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05313","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:7d0f9fe2a26e45ee2d28a9d84e64e9cce09fb32bff10119a48ffb30822d2ac0b","target":"record","created_at":"2026-05-18T02:20:12Z","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":"a875ca056cd27bd17650a9345e24a0407325494ff7eb1ad051d6225afb21b5d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-18T17:45:44Z","title_canon_sha256":"a8852f34623b768e60e8bfad896e585ba442b67848b8e017c40f9de46fac2df1"},"schema_version":"1.0","source":{"id":"1502.05313","kind":"arxiv","version":2}},"canonical_sha256":"fbafcbdc770fc15c9d64c25e4d1255c9ec36b3abb01943401ee495c5ff695be0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbafcbdc770fc15c9d64c25e4d1255c9ec36b3abb01943401ee495c5ff695be0","first_computed_at":"2026-05-18T02:20:12.220582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:12.220582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVfcELL42ihiaGJTF7bRIPUXVQ7g6TbyYZUgOOYTBlkwUnF9EVTl1VyAVVxHZsWu5oPsNzk4Ksk8766rgbXFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:12.221166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05313","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d0f9fe2a26e45ee2d28a9d84e64e9cce09fb32bff10119a48ffb30822d2ac0b","sha256:7839f23fac376fe3999e73749f638f04d61689bc1534ec1cb979a777488c7b0b"],"state_sha256":"8290137b3283064b5427985a7c6aef48b73b0fc8379cc008997fb30826637709"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iVacvvfKhfSrCg8M37g2BfQOMdpUoDouqdK4xnk81/PP6cqStZQWppW7llSpWPE9rDzLDDP2OJ2I9QEQO4wKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:56:44.142139Z","bundle_sha256":"1b03c0cbf5038a24b06131abc0feb2edd130a7358352663c47b231f3fe13d01b"}}