{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UHCCJZNVVN2BQQHRFXETNCRAPF","short_pith_number":"pith:UHCCJZNV","canonical_record":{"source":{"id":"1901.08013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-20T08:42:41Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e1be745520877f93a6689c22319f5376998a6cf45a9d2f9766d10a3009283a02","abstract_canon_sha256":"5f48fe8cc52f62db16ad6105198cb204700b2349f311f1dbb80f7fd80f7ab659"},"schema_version":"1.0"},"canonical_sha256":"a1c424e5b5ab741840f12dc9368a20797733dcfcf05642c249e9bb8e481feaf6","source":{"kind":"arxiv","id":"1901.08013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08013","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08013v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08013","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"UHCCJZNVVN2B","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UHCCJZNVVN2BQQHR","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UHCCJZNV","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UHCCJZNVVN2BQQHRFXETNCRAPF","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-20T08:42:41Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e1be745520877f93a6689c22319f5376998a6cf45a9d2f9766d10a3009283a02","abstract_canon_sha256":"5f48fe8cc52f62db16ad6105198cb204700b2349f311f1dbb80f7fd80f7ab659"},"schema_version":"1.0"},"canonical_sha256":"a1c424e5b5ab741840f12dc9368a20797733dcfcf05642c249e9bb8e481feaf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.309290Z","signature_b64":"qwpP2tbaHa2AxQM0BrEa6ncB5wlV4pvIokWMa6LDlmtqKjx2Xy4VIKwVe2nSe0osHxOeiTU1xa5MZksUuXX3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1c424e5b5ab741840f12dc9368a20797733dcfcf05642c249e9bb8e481feaf6","last_reissued_at":"2026-05-17T23:55:39.308920Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.308920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08013","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZRHuAodzSuf1KZ+GbwFgNcmRTb/mfsIhCBgjy+lbvEUDbqlietaMCNTgn8GrixPqcc3yyOdrTz2xwI960y/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:39:15.851136Z"},"content_sha256":"811a9a7000d8d5163d67ff06048438f72a3b8c7357af3042f27a83113381b047","schema_version":"1.0","event_id":"sha256:811a9a7000d8d5163d67ff06048438f72a3b8c7357af3042f27a83113381b047"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UHCCJZNVVN2BQQHRFXETNCRAPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DarwinML: A Graph-based Evolutionary Algorithm for Automated Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Chunhuan Lin, Fei Qi, Gaoyang Tang, Guangming Shi, Guangrui Qian, Hang Yang, Xiong An, Yu Song, Zhaohui Xia","submitted_at":"2018-11-20T08:42:41Z","abstract_excerpt":"As an emerging field, Automated Machine Learning (AutoML) aims to reduce or eliminate manual operations that require expertise in machine learning. In this paper, a graph-based architecture is employed to represent flexible combinations of ML models, which provides a large searching space compared to tree-based and stacking-based architectures. Based on this, an evolutionary algorithm is proposed to search for the best architecture, where the mutation and heredity operators are the key for architecture evolution. With Bayesian hyper-parameter optimization, the proposed approach can automate th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08013","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTHj0ewqNDXXKTth8fYPeJMBwR2/4KIf1VrTTByWEcYQ+IslMtB+3DDFZg24hFlKs7JgHTLGL2ADwJ+QgyayAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:39:15.851851Z"},"content_sha256":"f52c02f5d4f41290b3cca4db92ff196f5bd838362cbb7b7ee6d877ac015ed710","schema_version":"1.0","event_id":"sha256:f52c02f5d4f41290b3cca4db92ff196f5bd838362cbb7b7ee6d877ac015ed710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHCCJZNVVN2BQQHRFXETNCRAPF/bundle.json","state_url":"https://pith.science/pith/UHCCJZNVVN2BQQHRFXETNCRAPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHCCJZNVVN2BQQHRFXETNCRAPF/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-10T23:39:15Z","links":{"resolver":"https://pith.science/pith/UHCCJZNVVN2BQQHRFXETNCRAPF","bundle":"https://pith.science/pith/UHCCJZNVVN2BQQHRFXETNCRAPF/bundle.json","state":"https://pith.science/pith/UHCCJZNVVN2BQQHRFXETNCRAPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHCCJZNVVN2BQQHRFXETNCRAPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UHCCJZNVVN2BQQHRFXETNCRAPF","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":"5f48fe8cc52f62db16ad6105198cb204700b2349f311f1dbb80f7fd80f7ab659","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-20T08:42:41Z","title_canon_sha256":"e1be745520877f93a6689c22319f5376998a6cf45a9d2f9766d10a3009283a02"},"schema_version":"1.0","source":{"id":"1901.08013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08013","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08013v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08013","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"UHCCJZNVVN2B","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UHCCJZNVVN2BQQHR","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UHCCJZNV","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:f52c02f5d4f41290b3cca4db92ff196f5bd838362cbb7b7ee6d877ac015ed710","target":"graph","created_at":"2026-05-17T23:55:39Z","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":"As an emerging field, Automated Machine Learning (AutoML) aims to reduce or eliminate manual operations that require expertise in machine learning. In this paper, a graph-based architecture is employed to represent flexible combinations of ML models, which provides a large searching space compared to tree-based and stacking-based architectures. Based on this, an evolutionary algorithm is proposed to search for the best architecture, where the mutation and heredity operators are the key for architecture evolution. With Bayesian hyper-parameter optimization, the proposed approach can automate th","authors_text":"Chunhuan Lin, Fei Qi, Gaoyang Tang, Guangming Shi, Guangrui Qian, Hang Yang, Xiong An, Yu Song, Zhaohui Xia","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-20T08:42:41Z","title":"DarwinML: A Graph-based Evolutionary Algorithm for Automated Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08013","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:811a9a7000d8d5163d67ff06048438f72a3b8c7357af3042f27a83113381b047","target":"record","created_at":"2026-05-17T23:55:39Z","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":"5f48fe8cc52f62db16ad6105198cb204700b2349f311f1dbb80f7fd80f7ab659","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-20T08:42:41Z","title_canon_sha256":"e1be745520877f93a6689c22319f5376998a6cf45a9d2f9766d10a3009283a02"},"schema_version":"1.0","source":{"id":"1901.08013","kind":"arxiv","version":1}},"canonical_sha256":"a1c424e5b5ab741840f12dc9368a20797733dcfcf05642c249e9bb8e481feaf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1c424e5b5ab741840f12dc9368a20797733dcfcf05642c249e9bb8e481feaf6","first_computed_at":"2026-05-17T23:55:39.308920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:39.308920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qwpP2tbaHa2AxQM0BrEa6ncB5wlV4pvIokWMa6LDlmtqKjx2Xy4VIKwVe2nSe0osHxOeiTU1xa5MZksUuXX3AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:39.309290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:811a9a7000d8d5163d67ff06048438f72a3b8c7357af3042f27a83113381b047","sha256:f52c02f5d4f41290b3cca4db92ff196f5bd838362cbb7b7ee6d877ac015ed710"],"state_sha256":"34b96f62a406b122171f76dd1d6df6a41025f3c4c520ac3ac9e1ee548093cb79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amIS2Mmd0z/aAI78mrqqRlUok0ne6LWFbDMoxw4yX9dquKKDih5YleGf3AlGl+I7zfxczaV9B56Nr+KdUcdZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:39:15.856094Z","bundle_sha256":"175b6462011bb7ad4147df3c83583649f1b0b70096a05b69d6e4ef8f5a304640"}}