{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:63HKIHQB7DDQMU5O4KXO5YAI7E","short_pith_number":"pith:63HKIHQB","canonical_record":{"source":{"id":"1805.12388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-31T09:14:34Z","cross_cats_sorted":[],"title_canon_sha256":"2487d1dc1abd56488848c5eaf2b74923d2a89fd7505f8152d8e833a9b817dc70","abstract_canon_sha256":"bce8c447dcd752f90582541f7c2f671da85afe527c3c45936d4e4b949be0081a"},"schema_version":"1.0"},"canonical_sha256":"f6cea41e01f8c70653aee2aeeee008f92976f44bdccd0559137b0370ee16ca19","source":{"kind":"arxiv","id":"1805.12388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12388","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12388v1","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12388","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"63HKIHQB7DDQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"63HKIHQB7DDQMU5O","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"63HKIHQB","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:63HKIHQB7DDQMU5O4KXO5YAI7E","target":"record","payload":{"canonical_record":{"source":{"id":"1805.12388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-31T09:14:34Z","cross_cats_sorted":[],"title_canon_sha256":"2487d1dc1abd56488848c5eaf2b74923d2a89fd7505f8152d8e833a9b817dc70","abstract_canon_sha256":"bce8c447dcd752f90582541f7c2f671da85afe527c3c45936d4e4b949be0081a"},"schema_version":"1.0"},"canonical_sha256":"f6cea41e01f8c70653aee2aeeee008f92976f44bdccd0559137b0370ee16ca19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:30.373987Z","signature_b64":"r5Bopj6eOsQ9PB8Q2/kGtaCBA5sEIhw8orO+KPsBNa1IKVqwB3/TmBrZ4eIwwobJAEFRTAFp2Yp2s+vDdjbtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6cea41e01f8c70653aee2aeeee008f92976f44bdccd0559137b0370ee16ca19","last_reissued_at":"2026-05-18T00:14:30.373453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:30.373453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.12388","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-18T00:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPQaW2lZQhwoe0QLo+7+wbYwrGuAzAPC547VEgdp1UVvcqFN+vNJjlaw50Z+luF12m2kFQEDOb8JVSK5ilrcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:02.749296Z"},"content_sha256":"3eedbf30b09553521771739421a67400ff4ecfd89674e00cf09d51b0b1fba98d","schema_version":"1.0","event_id":"sha256:3eedbf30b09553521771739421a67400ff4ecfd89674e00cf09d51b0b1fba98d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:63HKIHQB7DDQMU5O4KXO5YAI7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Reuse via Importance Sampling in Information Geometric Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Kazuki Ouchi, Kouzou Ohara, Shinichi Shirakawa, Youhei Akimoto","submitted_at":"2018-05-31T09:14:34Z","abstract_excerpt":"In this paper we propose a technique to reduce the number of function evaluations, which is often the bottleneck of the black-box optimization, in the information geometric optimization (IGO) that is a generic framework of the probability model-based black-box optimization algorithms and generalizes several well-known evolutionary algorithms, such as the population-based incremental learning (PBIL) and the pure rank-$\\mu$ update covariance matrix adaptation evolution strategy (CMA-ES). In each iteration, the IGO algorithms update the parameters of the probability distribution to the natural gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12388","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-18T00:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEqhkYbCwX1J2mwOsz1e702v7jQihdi1g7ac4B4wYEEpIWRi+x81vzQXi2lokm29A43dy0cEwQxlRdd4P66vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:02.749651Z"},"content_sha256":"2e089e7b4b1f5ed6a92773b5f3ef86d8c856d637cc6849ca0f8402425c69b21e","schema_version":"1.0","event_id":"sha256:2e089e7b4b1f5ed6a92773b5f3ef86d8c856d637cc6849ca0f8402425c69b21e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63HKIHQB7DDQMU5O4KXO5YAI7E/bundle.json","state_url":"https://pith.science/pith/63HKIHQB7DDQMU5O4KXO5YAI7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63HKIHQB7DDQMU5O4KXO5YAI7E/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-11T14:31:02Z","links":{"resolver":"https://pith.science/pith/63HKIHQB7DDQMU5O4KXO5YAI7E","bundle":"https://pith.science/pith/63HKIHQB7DDQMU5O4KXO5YAI7E/bundle.json","state":"https://pith.science/pith/63HKIHQB7DDQMU5O4KXO5YAI7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63HKIHQB7DDQMU5O4KXO5YAI7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:63HKIHQB7DDQMU5O4KXO5YAI7E","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":"bce8c447dcd752f90582541f7c2f671da85afe527c3c45936d4e4b949be0081a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-31T09:14:34Z","title_canon_sha256":"2487d1dc1abd56488848c5eaf2b74923d2a89fd7505f8152d8e833a9b817dc70"},"schema_version":"1.0","source":{"id":"1805.12388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.12388","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.12388v1","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12388","created_at":"2026-05-18T00:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"63HKIHQB7DDQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"63HKIHQB7DDQMU5O","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"63HKIHQB","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:2e089e7b4b1f5ed6a92773b5f3ef86d8c856d637cc6849ca0f8402425c69b21e","target":"graph","created_at":"2026-05-18T00:14:30Z","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":"In this paper we propose a technique to reduce the number of function evaluations, which is often the bottleneck of the black-box optimization, in the information geometric optimization (IGO) that is a generic framework of the probability model-based black-box optimization algorithms and generalizes several well-known evolutionary algorithms, such as the population-based incremental learning (PBIL) and the pure rank-$\\mu$ update covariance matrix adaptation evolution strategy (CMA-ES). In each iteration, the IGO algorithms update the parameters of the probability distribution to the natural gr","authors_text":"Kazuki Ouchi, Kouzou Ohara, Shinichi Shirakawa, Youhei Akimoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-31T09:14:34Z","title":"Sample Reuse via Importance Sampling in Information Geometric Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12388","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:3eedbf30b09553521771739421a67400ff4ecfd89674e00cf09d51b0b1fba98d","target":"record","created_at":"2026-05-18T00:14:30Z","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":"bce8c447dcd752f90582541f7c2f671da85afe527c3c45936d4e4b949be0081a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-31T09:14:34Z","title_canon_sha256":"2487d1dc1abd56488848c5eaf2b74923d2a89fd7505f8152d8e833a9b817dc70"},"schema_version":"1.0","source":{"id":"1805.12388","kind":"arxiv","version":1}},"canonical_sha256":"f6cea41e01f8c70653aee2aeeee008f92976f44bdccd0559137b0370ee16ca19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6cea41e01f8c70653aee2aeeee008f92976f44bdccd0559137b0370ee16ca19","first_computed_at":"2026-05-18T00:14:30.373453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:30.373453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r5Bopj6eOsQ9PB8Q2/kGtaCBA5sEIhw8orO+KPsBNa1IKVqwB3/TmBrZ4eIwwobJAEFRTAFp2Yp2s+vDdjbtCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:30.373987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.12388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eedbf30b09553521771739421a67400ff4ecfd89674e00cf09d51b0b1fba98d","sha256:2e089e7b4b1f5ed6a92773b5f3ef86d8c856d637cc6849ca0f8402425c69b21e"],"state_sha256":"f48e6f9a42a3b6185b3f2c5c507969539bdf8a6da960ac856c2d3fade5dee830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiNKtb8F0ZUVFBr1A1x3jLJycaeaMM9cvyB47WK3kLqKlf1TzxJdSCqmfXsolFbLbL+YUDc9v/+cETu5cf0yCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:31:02.751539Z","bundle_sha256":"7661cac35f83bfecbe9fd94e7cc638573e71d29429ed5d8b4bd18a55a06a8ba9"}}