{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3UJ35CU3N52JFXUYNJVGVICLYN","short_pith_number":"pith:3UJ35CU3","canonical_record":{"source":{"id":"1401.4714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-19T18:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"022d1d96dad6c4a92ab3832ba473d1d1dc69a48407119d7d0ad968735d7487dc","abstract_canon_sha256":"1136eedd2f11801beaf91b61a855ef2e97454f52e7e9816439a05b78aa49f1e8"},"schema_version":"1.0"},"canonical_sha256":"dd13be8a9b6f7492de986a6a6aa04bc360d7184628e499c6dcb6e60e29a0ee52","source":{"kind":"arxiv","id":"1401.4714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4714","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4714v1","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4714","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"3UJ35CU3N52J","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3UJ35CU3N52JFXUY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3UJ35CU3","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3UJ35CU3N52JFXUYNJVGVICLYN","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-19T18:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"022d1d96dad6c4a92ab3832ba473d1d1dc69a48407119d7d0ad968735d7487dc","abstract_canon_sha256":"1136eedd2f11801beaf91b61a855ef2e97454f52e7e9816439a05b78aa49f1e8"},"schema_version":"1.0"},"canonical_sha256":"dd13be8a9b6f7492de986a6a6aa04bc360d7184628e499c6dcb6e60e29a0ee52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:44.839834Z","signature_b64":"pLYPpUr/43Ary8VtMUTnDZm2GGVZ14nBy/7CvkmlWll7uXbMEWJ5JjDOenv3Ox1oAl62tUohoVeSiXDI0/4LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd13be8a9b6f7492de986a6a6aa04bc360d7184628e499c6dcb6e60e29a0ee52","last_reissued_at":"2026-05-18T03:01:44.839237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:44.839237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4714","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-18T03:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/71kVEQjH/kWzN0CZZ3Dq/JZFXZvaCnXWnl10NAv23DgEsroHl8UZanjrM0lBtNhFH8uqlKhSQLxoNCS1K70CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:13:32.851054Z"},"content_sha256":"d90c50b6164102a6db7d578a71ae9843bb2a114cc49aca171701aedc769c6090","schema_version":"1.0","event_id":"sha256:d90c50b6164102a6db7d578a71ae9843bb2a114cc49aca171701aedc769c6090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3UJ35CU3N52JFXUYNJVGVICLYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Christoph Waldhauser, Ronald Hochreiter","submitted_at":"2014-01-19T18:27:41Z","abstract_excerpt":"The optimization of dynamic problems is both widespread and difficult. When conducting dynamic optimization, a balance between reinitialization and computational expense has to be found. There are multiple approaches to this. In parallel genetic algorithms, multiple sub-populations concurrently try to optimize a potentially dynamic problem. But as the number of sub-population increases, their efficiency decreases. Cultural algorithms provide a framework that has the potential to make optimizations more efficient. But they adapt slowly to changing environments. We thus suggest a confluence of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4714","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-18T03:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y51xM5vm4WvppQXOpCeWdGmoPL9lNshSHAAJcvyqJZt4Qxu4JmYqzo1wDemCAmCI50TPO8tMWG2YLTshCzasDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:13:32.851418Z"},"content_sha256":"a2aec7d11f17e5be3d197d4f223f697c89abd7703db9dbe534b95b239b4cc732","schema_version":"1.0","event_id":"sha256:a2aec7d11f17e5be3d197d4f223f697c89abd7703db9dbe534b95b239b4cc732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UJ35CU3N52JFXUYNJVGVICLYN/bundle.json","state_url":"https://pith.science/pith/3UJ35CU3N52JFXUYNJVGVICLYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UJ35CU3N52JFXUYNJVGVICLYN/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-01T19:13:32Z","links":{"resolver":"https://pith.science/pith/3UJ35CU3N52JFXUYNJVGVICLYN","bundle":"https://pith.science/pith/3UJ35CU3N52JFXUYNJVGVICLYN/bundle.json","state":"https://pith.science/pith/3UJ35CU3N52JFXUYNJVGVICLYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UJ35CU3N52JFXUYNJVGVICLYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3UJ35CU3N52JFXUYNJVGVICLYN","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":"1136eedd2f11801beaf91b61a855ef2e97454f52e7e9816439a05b78aa49f1e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-19T18:27:41Z","title_canon_sha256":"022d1d96dad6c4a92ab3832ba473d1d1dc69a48407119d7d0ad968735d7487dc"},"schema_version":"1.0","source":{"id":"1401.4714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4714","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4714v1","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4714","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"3UJ35CU3N52J","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3UJ35CU3N52JFXUY","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3UJ35CU3","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:a2aec7d11f17e5be3d197d4f223f697c89abd7703db9dbe534b95b239b4cc732","target":"graph","created_at":"2026-05-18T03:01: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":"The optimization of dynamic problems is both widespread and difficult. When conducting dynamic optimization, a balance between reinitialization and computational expense has to be found. There are multiple approaches to this. In parallel genetic algorithms, multiple sub-populations concurrently try to optimize a potentially dynamic problem. But as the number of sub-population increases, their efficiency decreases. Cultural algorithms provide a framework that has the potential to make optimizations more efficient. But they adapt slowly to changing environments. We thus suggest a confluence of t","authors_text":"Christoph Waldhauser, Ronald Hochreiter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-19T18:27:41Z","title":"Revolutionary Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4714","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:d90c50b6164102a6db7d578a71ae9843bb2a114cc49aca171701aedc769c6090","target":"record","created_at":"2026-05-18T03:01: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":"1136eedd2f11801beaf91b61a855ef2e97454f52e7e9816439a05b78aa49f1e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-19T18:27:41Z","title_canon_sha256":"022d1d96dad6c4a92ab3832ba473d1d1dc69a48407119d7d0ad968735d7487dc"},"schema_version":"1.0","source":{"id":"1401.4714","kind":"arxiv","version":1}},"canonical_sha256":"dd13be8a9b6f7492de986a6a6aa04bc360d7184628e499c6dcb6e60e29a0ee52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd13be8a9b6f7492de986a6a6aa04bc360d7184628e499c6dcb6e60e29a0ee52","first_computed_at":"2026-05-18T03:01:44.839237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:44.839237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pLYPpUr/43Ary8VtMUTnDZm2GGVZ14nBy/7CvkmlWll7uXbMEWJ5JjDOenv3Ox1oAl62tUohoVeSiXDI0/4LAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:44.839834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d90c50b6164102a6db7d578a71ae9843bb2a114cc49aca171701aedc769c6090","sha256:a2aec7d11f17e5be3d197d4f223f697c89abd7703db9dbe534b95b239b4cc732"],"state_sha256":"1fd6b4e3918854418057433ef4db8dfc17251558ecb769b7b7e8f3d8eac639b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6vbJF7rUMaSA6AALVcCaoSMhvSkTRs550fxJ0RKPnuf6weYKhIBs79gncW7iZdOB4GcCBw3g/QAcGur0fcIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:13:32.853646Z","bundle_sha256":"674fb3a39a29e4e889db2b94c60457b19b11cddd90fd7ad4f6781ee1a5db00b0"}}