{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7JHJUX4JAYKLKEKND3OJQYED3A","short_pith_number":"pith:7JHJUX4J","canonical_record":{"source":{"id":"1808.01766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-06T08:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"ed368ef82efb50b2078312b9d6a6253ee7e3c3d473db10fec3d248b992bc5b7d","abstract_canon_sha256":"dd63c07b2bd3f1b9743490e0ce669945ae15f89a6fb6cfd4182161b7c2cca2d3"},"schema_version":"1.0"},"canonical_sha256":"fa4e9a5f890614b5114d1edc986083d82afddff33b9adba8c12d0fef233744ff","source":{"kind":"arxiv","id":"1808.01766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01766","created_at":"2026-05-18T00:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01766v1","created_at":"2026-05-18T00:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01766","created_at":"2026-05-18T00:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"7JHJUX4JAYKL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7JHJUX4JAYKLKEKN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7JHJUX4J","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7JHJUX4JAYKLKEKND3OJQYED3A","target":"record","payload":{"canonical_record":{"source":{"id":"1808.01766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-06T08:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"ed368ef82efb50b2078312b9d6a6253ee7e3c3d473db10fec3d248b992bc5b7d","abstract_canon_sha256":"dd63c07b2bd3f1b9743490e0ce669945ae15f89a6fb6cfd4182161b7c2cca2d3"},"schema_version":"1.0"},"canonical_sha256":"fa4e9a5f890614b5114d1edc986083d82afddff33b9adba8c12d0fef233744ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:49.696729Z","signature_b64":"mnjYO6AvsHAvhcpheODLemQh2KtFFO0YmkvvX99DsnxbKBv9PiwarJODZbY7drdJy68JicBBVO3K5121kQzKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa4e9a5f890614b5114d1edc986083d82afddff33b9adba8c12d0fef233744ff","last_reissued_at":"2026-05-18T00:08:49.696051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:49.696051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.01766","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:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+WaeBScWYTBnfOBqWGS9oOpze6RhxrwmVocahKLLYJfnSuoC4TC0mQ/1fotbNd0f/2jWagircpuq4b/yqiVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:34:56.001290Z"},"content_sha256":"909017ce0df82f7938f1e3305731b5c2815cc3645e0fbcb6fc5fdb699e37ead0","schema_version":"1.0","event_id":"sha256:909017ce0df82f7938f1e3305731b5c2815cc3645e0fbcb6fc5fdb699e37ead0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7JHJUX4JAYKLKEKND3OJQYED3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimizing Deep Convolutional Neural Networks by Evolutionary Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"D. D. N. De Silva, M. U. B. Dias, S. Fernando","submitted_at":"2018-08-06T08:29:26Z","abstract_excerpt":"Optimization for deep networks is currently a very active area of research. As neural networks become deeper, the ability in manually optimizing the network becomes harder. Mini-batch normalization, identification of effective respective fields, momentum updates, introduction of residual blocks, learning rate adoption, etc. have been proposed to speed up the rate of convergent in manual training process while keeping the higher accuracy level. However, the problem of finding optimal topological structure for a given problem is becoming a challenging task need to be addressed immediately. Few r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01766","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:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXdzEuGPBT6WpH9dH52bf8KRWu/wIFMW1l4Vas+aKnwJyEjo5SU/BkTkXGGfyLkmm+ZoYyFjhxv1wQ3qbPRpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:34:56.001652Z"},"content_sha256":"70f81bb16b894d0815719a41fcfd84fdd0dce666232fb6ba0a2ae57ace5857bf","schema_version":"1.0","event_id":"sha256:70f81bb16b894d0815719a41fcfd84fdd0dce666232fb6ba0a2ae57ace5857bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JHJUX4JAYKLKEKND3OJQYED3A/bundle.json","state_url":"https://pith.science/pith/7JHJUX4JAYKLKEKND3OJQYED3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JHJUX4JAYKLKEKND3OJQYED3A/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-30T07:34:56Z","links":{"resolver":"https://pith.science/pith/7JHJUX4JAYKLKEKND3OJQYED3A","bundle":"https://pith.science/pith/7JHJUX4JAYKLKEKND3OJQYED3A/bundle.json","state":"https://pith.science/pith/7JHJUX4JAYKLKEKND3OJQYED3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JHJUX4JAYKLKEKND3OJQYED3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7JHJUX4JAYKLKEKND3OJQYED3A","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":"dd63c07b2bd3f1b9743490e0ce669945ae15f89a6fb6cfd4182161b7c2cca2d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-06T08:29:26Z","title_canon_sha256":"ed368ef82efb50b2078312b9d6a6253ee7e3c3d473db10fec3d248b992bc5b7d"},"schema_version":"1.0","source":{"id":"1808.01766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01766","created_at":"2026-05-18T00:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01766v1","created_at":"2026-05-18T00:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01766","created_at":"2026-05-18T00:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"7JHJUX4JAYKL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7JHJUX4JAYKLKEKN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7JHJUX4J","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:70f81bb16b894d0815719a41fcfd84fdd0dce666232fb6ba0a2ae57ace5857bf","target":"graph","created_at":"2026-05-18T00:08:49Z","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":"Optimization for deep networks is currently a very active area of research. As neural networks become deeper, the ability in manually optimizing the network becomes harder. Mini-batch normalization, identification of effective respective fields, momentum updates, introduction of residual blocks, learning rate adoption, etc. have been proposed to speed up the rate of convergent in manual training process while keeping the higher accuracy level. However, the problem of finding optimal topological structure for a given problem is becoming a challenging task need to be addressed immediately. Few r","authors_text":"D. D. N. De Silva, M. U. B. Dias, S. Fernando","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-06T08:29:26Z","title":"On Optimizing Deep Convolutional Neural Networks by Evolutionary Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01766","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:909017ce0df82f7938f1e3305731b5c2815cc3645e0fbcb6fc5fdb699e37ead0","target":"record","created_at":"2026-05-18T00:08:49Z","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":"dd63c07b2bd3f1b9743490e0ce669945ae15f89a6fb6cfd4182161b7c2cca2d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-08-06T08:29:26Z","title_canon_sha256":"ed368ef82efb50b2078312b9d6a6253ee7e3c3d473db10fec3d248b992bc5b7d"},"schema_version":"1.0","source":{"id":"1808.01766","kind":"arxiv","version":1}},"canonical_sha256":"fa4e9a5f890614b5114d1edc986083d82afddff33b9adba8c12d0fef233744ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa4e9a5f890614b5114d1edc986083d82afddff33b9adba8c12d0fef233744ff","first_computed_at":"2026-05-18T00:08:49.696051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:49.696051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mnjYO6AvsHAvhcpheODLemQh2KtFFO0YmkvvX99DsnxbKBv9PiwarJODZbY7drdJy68JicBBVO3K5121kQzKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:49.696729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:909017ce0df82f7938f1e3305731b5c2815cc3645e0fbcb6fc5fdb699e37ead0","sha256:70f81bb16b894d0815719a41fcfd84fdd0dce666232fb6ba0a2ae57ace5857bf"],"state_sha256":"92d89d15fce5f54c87860b13edd896822f2122b8e21508c8667d18ab64366880"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4vQ+fKGHkTUEr72WbrN6PrPWqTdD2VeCS1pdhpB3NgdLs/BRYoeRjvaAdILi+w3DEVbJj5PX7cDgO4t0if+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:34:56.003513Z","bundle_sha256":"a2e01a5a628e831b8101f1f097ce8fc5cc93c8206e28a289c00b941c038ac45a"}}