{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4JNJG6CMSEJBHF72O7CUWGM7GA","short_pith_number":"pith:4JNJG6CM","canonical_record":{"source":{"id":"1806.06010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-18T03:57:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"25fa92e96ab2c437303a504be622296ad060939458511a710d71c4a2c6095a2b","abstract_canon_sha256":"a8974741d0234e8b604e66f8109d6d84bb1a4038c32fea3ffe28d5bc2a1628c9"},"schema_version":"1.0"},"canonical_sha256":"e25a93784c91121397fa77c54b199f300c198ee3b6b3b8fa6fca3e051e742e34","source":{"kind":"arxiv","id":"1806.06010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06010","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06010v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06010","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"4JNJG6CMSEJB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4JNJG6CMSEJBHF72","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4JNJG6CM","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4JNJG6CMSEJBHF72O7CUWGM7GA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-18T03:57:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"25fa92e96ab2c437303a504be622296ad060939458511a710d71c4a2c6095a2b","abstract_canon_sha256":"a8974741d0234e8b604e66f8109d6d84bb1a4038c32fea3ffe28d5bc2a1628c9"},"schema_version":"1.0"},"canonical_sha256":"e25a93784c91121397fa77c54b199f300c198ee3b6b3b8fa6fca3e051e742e34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:21.640452Z","signature_b64":"L+4Puyv+yBwdkaStG/U9orsXAUQQDjhEAn+AqPE8JE6dPTUx/WC7Jt0guBzCmSdagl4A6+mqCVYkLzgKT5v0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25a93784c91121397fa77c54b199f300c198ee3b6b3b8fa6fca3e051e742e34","last_reissued_at":"2026-05-18T00:10:21.639845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:21.639845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06010","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:10:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EZlcFUH2Kg2yIXGsEBfJ4aznUT3fdjJumHGBKBA4qpl9cFHpeUX5mvYwxaLyN7c69zHOxSEqbtUNOMXRziKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:52:55.790811Z"},"content_sha256":"b0ba7b2f71f63caff60c752ee7d6f62da1caf9f83bb3d373bddc4eef8a4f58d6","schema_version":"1.0","event_id":"sha256:b0ba7b2f71f63caff60c752ee7d6f62da1caf9f83bb3d373bddc4eef8a4f58d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4JNJG6CMSEJBHF72O7CUWGM7GA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Self-Replication Basis for Designing Complex Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Thommen George Karimpanal","submitted_at":"2018-05-18T03:57:41Z","abstract_excerpt":"In this work, we describe a self-replication-based mechanism for designing agents of increasing complexity. We demonstrate the validity of this approach by solving simple, standard evolutionary computation problems in simulation. In the context of these simulation results, we describe the fundamental differences of this approach when compared to traditional approaches. Further, we highlight the possible advantages of applying this approach to the problem of designing complex artificial agents, along with the potential drawbacks and issues to be addressed in the future."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06010","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:10:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pSRR0H8X90CPFrANYi73HPQBuue6vmZKYUJPcLel6a8sLGyQFgB6m40ZStEdyf/8WvBKyNAr1fyJRo70121DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:52:55.791450Z"},"content_sha256":"40e5f6128a28ca6040be56492ec5112277dafd4a5bc03bb142ce74191edda8fc","schema_version":"1.0","event_id":"sha256:40e5f6128a28ca6040be56492ec5112277dafd4a5bc03bb142ce74191edda8fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JNJG6CMSEJBHF72O7CUWGM7GA/bundle.json","state_url":"https://pith.science/pith/4JNJG6CMSEJBHF72O7CUWGM7GA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JNJG6CMSEJBHF72O7CUWGM7GA/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-04T06:52:55Z","links":{"resolver":"https://pith.science/pith/4JNJG6CMSEJBHF72O7CUWGM7GA","bundle":"https://pith.science/pith/4JNJG6CMSEJBHF72O7CUWGM7GA/bundle.json","state":"https://pith.science/pith/4JNJG6CMSEJBHF72O7CUWGM7GA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JNJG6CMSEJBHF72O7CUWGM7GA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4JNJG6CMSEJBHF72O7CUWGM7GA","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":"a8974741d0234e8b604e66f8109d6d84bb1a4038c32fea3ffe28d5bc2a1628c9","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-18T03:57:41Z","title_canon_sha256":"25fa92e96ab2c437303a504be622296ad060939458511a710d71c4a2c6095a2b"},"schema_version":"1.0","source":{"id":"1806.06010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06010","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06010v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06010","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"4JNJG6CMSEJB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4JNJG6CMSEJBHF72","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4JNJG6CM","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:40e5f6128a28ca6040be56492ec5112277dafd4a5bc03bb142ce74191edda8fc","target":"graph","created_at":"2026-05-18T00:10:21Z","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 work, we describe a self-replication-based mechanism for designing agents of increasing complexity. We demonstrate the validity of this approach by solving simple, standard evolutionary computation problems in simulation. In the context of these simulation results, we describe the fundamental differences of this approach when compared to traditional approaches. Further, we highlight the possible advantages of applying this approach to the problem of designing complex artificial agents, along with the potential drawbacks and issues to be addressed in the future.","authors_text":"Thommen George Karimpanal","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-18T03:57:41Z","title":"A Self-Replication Basis for Designing Complex Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06010","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:b0ba7b2f71f63caff60c752ee7d6f62da1caf9f83bb3d373bddc4eef8a4f58d6","target":"record","created_at":"2026-05-18T00:10:21Z","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":"a8974741d0234e8b604e66f8109d6d84bb1a4038c32fea3ffe28d5bc2a1628c9","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-18T03:57:41Z","title_canon_sha256":"25fa92e96ab2c437303a504be622296ad060939458511a710d71c4a2c6095a2b"},"schema_version":"1.0","source":{"id":"1806.06010","kind":"arxiv","version":1}},"canonical_sha256":"e25a93784c91121397fa77c54b199f300c198ee3b6b3b8fa6fca3e051e742e34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25a93784c91121397fa77c54b199f300c198ee3b6b3b8fa6fca3e051e742e34","first_computed_at":"2026-05-18T00:10:21.639845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:21.639845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L+4Puyv+yBwdkaStG/U9orsXAUQQDjhEAn+AqPE8JE6dPTUx/WC7Jt0guBzCmSdagl4A6+mqCVYkLzgKT5v0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:21.640452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0ba7b2f71f63caff60c752ee7d6f62da1caf9f83bb3d373bddc4eef8a4f58d6","sha256:40e5f6128a28ca6040be56492ec5112277dafd4a5bc03bb142ce74191edda8fc"],"state_sha256":"79f2935be6f48f8117be4076791431af3597e6bcc96fb7f5e2d93998a0086128"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Maz6zjB8SgkD+SuN/v27dgGTjFA/PEZtPZ1t4dShNb9R2kbPQH0ofcT34Sct/15iAE8kIg04gdQmskq0KiJOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:52:55.795091Z","bundle_sha256":"5c2b2fa3864630bb4ea234e7c838ba8d1fe0e2d449325bc8d64beab2ebbb8dc3"}}