{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NV4POQZP733TPDP7HNT2SJHO76","short_pith_number":"pith:NV4POQZP","canonical_record":{"source":{"id":"2103.06435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-03-11T03:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"9a698ba0ad27740a8510be3adc50e2eb87e30c3127617dc2d3b25f4f885c564f","abstract_canon_sha256":"8ebfbec7fc16c9c55c9e7e1b647ee1a26fa73043c1ab1f9066f6aceaf1bf61a4"},"schema_version":"1.0"},"canonical_sha256":"6d78f7432ffef7378dff3b67a924eeffb678254e7b68b100b32bab2779d9c25c","source":{"kind":"arxiv","id":"2103.06435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.06435","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"2103.06435v1","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06435","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"NV4POQZP733T","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"pith_short_16","alias_value":"NV4POQZP733TPDP7","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"pith_short_8","alias_value":"NV4POQZP","created_at":"2026-07-05T02:22:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NV4POQZP733TPDP7HNT2SJHO76","target":"record","payload":{"canonical_record":{"source":{"id":"2103.06435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-03-11T03:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"9a698ba0ad27740a8510be3adc50e2eb87e30c3127617dc2d3b25f4f885c564f","abstract_canon_sha256":"8ebfbec7fc16c9c55c9e7e1b647ee1a26fa73043c1ab1f9066f6aceaf1bf61a4"},"schema_version":"1.0"},"canonical_sha256":"6d78f7432ffef7378dff3b67a924eeffb678254e7b68b100b32bab2779d9c25c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:09.109337Z","signature_b64":"/Rvp6Ij75RunUwjCk5yNQvl5xRuEgYk1PnDViUz1f292SLtherUL80XFxY/WbmwOLgpFdHoiWndjhCoKpT2vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d78f7432ffef7378dff3b67a924eeffb678254e7b68b100b32bab2779d9c25c","last_reissued_at":"2026-07-05T02:22:09.108881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:09.108881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.06435","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-07-05T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMgNNJIsvgMqZs0AstWiRJjpeGTRouISBTiFjFqyGpdxhKpS0KBuaQqC8EBZ+e0asclhM5DWbbdVBTuTNz86CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:22:41.895325Z"},"content_sha256":"ff209fbfe97de4556262e3faaf8cbaabfdb4f9957359b1bce94390f61d1ed3cf","schema_version":"1.0","event_id":"sha256:ff209fbfe97de4556262e3faaf8cbaabfdb4f9957359b1bce94390f61d1ed3cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NV4POQZP733TPDP7HNT2SJHO76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Population-Based Evolution Optimizes a Meta-Learning Objective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Kevin Frans, Olaf Witkowski","submitted_at":"2021-03-11T03:45:43Z","abstract_excerpt":"Meta-learning models, or models that learn to learn, have been a long-desired target for their ability to quickly solve new tasks. Traditional meta-learning methods can require expensive inner and outer loops, thus there is demand for algorithms that discover strong learners without explicitly searching for them. We draw parallels to the study of evolvable genomes in evolutionary systems -- genomes with a strong capacity to adapt -- and propose that meta-learning and adaptive evolvability optimize for the same objective: high performance after a set of learning iterations. We argue that popula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06435","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.06435/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-05T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCiaGp1F+fb4N+LRYmocXPJSAxVYRhIwK3R9JEH70d5S7z/cIYSFbMa4RoTBcNCF8A14hyTU47tYFk7zWulhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:22:41.895819Z"},"content_sha256":"c4f6aa90c4ca41b0d7d4a01f7b0320116819dcfba0a899282bc4db10ae1f28fb","schema_version":"1.0","event_id":"sha256:c4f6aa90c4ca41b0d7d4a01f7b0320116819dcfba0a899282bc4db10ae1f28fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NV4POQZP733TPDP7HNT2SJHO76/bundle.json","state_url":"https://pith.science/pith/NV4POQZP733TPDP7HNT2SJHO76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NV4POQZP733TPDP7HNT2SJHO76/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-08-09T06:22:41Z","links":{"resolver":"https://pith.science/pith/NV4POQZP733TPDP7HNT2SJHO76","bundle":"https://pith.science/pith/NV4POQZP733TPDP7HNT2SJHO76/bundle.json","state":"https://pith.science/pith/NV4POQZP733TPDP7HNT2SJHO76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NV4POQZP733TPDP7HNT2SJHO76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NV4POQZP733TPDP7HNT2SJHO76","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":"8ebfbec7fc16c9c55c9e7e1b647ee1a26fa73043c1ab1f9066f6aceaf1bf61a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-03-11T03:45:43Z","title_canon_sha256":"9a698ba0ad27740a8510be3adc50e2eb87e30c3127617dc2d3b25f4f885c564f"},"schema_version":"1.0","source":{"id":"2103.06435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.06435","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"2103.06435v1","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06435","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"NV4POQZP733T","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"pith_short_16","alias_value":"NV4POQZP733TPDP7","created_at":"2026-07-05T02:22:09Z"},{"alias_kind":"pith_short_8","alias_value":"NV4POQZP","created_at":"2026-07-05T02:22:09Z"}],"graph_snapshots":[{"event_id":"sha256:c4f6aa90c4ca41b0d7d4a01f7b0320116819dcfba0a899282bc4db10ae1f28fb","target":"graph","created_at":"2026-07-05T02:22:09Z","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/2103.06435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Meta-learning models, or models that learn to learn, have been a long-desired target for their ability to quickly solve new tasks. Traditional meta-learning methods can require expensive inner and outer loops, thus there is demand for algorithms that discover strong learners without explicitly searching for them. We draw parallels to the study of evolvable genomes in evolutionary systems -- genomes with a strong capacity to adapt -- and propose that meta-learning and adaptive evolvability optimize for the same objective: high performance after a set of learning iterations. We argue that popula","authors_text":"Kevin Frans, Olaf Witkowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-03-11T03:45:43Z","title":"Population-Based Evolution Optimizes a Meta-Learning Objective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06435","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:ff209fbfe97de4556262e3faaf8cbaabfdb4f9957359b1bce94390f61d1ed3cf","target":"record","created_at":"2026-07-05T02:22:09Z","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":"8ebfbec7fc16c9c55c9e7e1b647ee1a26fa73043c1ab1f9066f6aceaf1bf61a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-03-11T03:45:43Z","title_canon_sha256":"9a698ba0ad27740a8510be3adc50e2eb87e30c3127617dc2d3b25f4f885c564f"},"schema_version":"1.0","source":{"id":"2103.06435","kind":"arxiv","version":1}},"canonical_sha256":"6d78f7432ffef7378dff3b67a924eeffb678254e7b68b100b32bab2779d9c25c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d78f7432ffef7378dff3b67a924eeffb678254e7b68b100b32bab2779d9c25c","first_computed_at":"2026-07-05T02:22:09.108881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:09.108881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Rvp6Ij75RunUwjCk5yNQvl5xRuEgYk1PnDViUz1f292SLtherUL80XFxY/WbmwOLgpFdHoiWndjhCoKpT2vCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:09.109337Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.06435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff209fbfe97de4556262e3faaf8cbaabfdb4f9957359b1bce94390f61d1ed3cf","sha256:c4f6aa90c4ca41b0d7d4a01f7b0320116819dcfba0a899282bc4db10ae1f28fb"],"state_sha256":"88923a52b0398cae1239e5ee23e781b0523fe0dc482a1790a3958a817f5fc77c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJ1WwI9GahTm7+X7cybF5+zPv1U0U1nWazAiCwdgSXSXczc7kOYsc50PrggT1tGhytwT8e7wXXg8/Q5rCJgZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T06:22:41.900133Z","bundle_sha256":"55ffaa7213f2538c55b808d2ba17d9c1315ec217e733f298e719e2ddebab8346"}}