{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U32GUCXGAKPNMD5XR3PMMZRYZ4","short_pith_number":"pith:U32GUCXG","canonical_record":{"source":{"id":"1905.08537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T10:39:04Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"d6405d1896d0fe807c79ac2b7ecde9047c52899c8a20298dd45785665942b804","abstract_canon_sha256":"16edb81de9795e9a1c3265b8e42724b8a69fd9af731b8f0a3b7cc61753d21ab3"},"schema_version":"1.0"},"canonical_sha256":"a6f46a0ae6029ed60fb78edec66638cf3b0e85e2185626e4149f54859adb621f","source":{"kind":"arxiv","id":"1905.08537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08537","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08537v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08537","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"U32GUCXGAKPN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U32GUCXGAKPNMD5X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U32GUCXG","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U32GUCXGAKPNMD5XR3PMMZRYZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T10:39:04Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"d6405d1896d0fe807c79ac2b7ecde9047c52899c8a20298dd45785665942b804","abstract_canon_sha256":"16edb81de9795e9a1c3265b8e42724b8a69fd9af731b8f0a3b7cc61753d21ab3"},"schema_version":"1.0"},"canonical_sha256":"a6f46a0ae6029ed60fb78edec66638cf3b0e85e2185626e4149f54859adb621f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:42.886910Z","signature_b64":"9J31nnTwhiy29waUcObCGkUIHCRSv2aSxA5L7/Wwo0du8WMMkHeRUyLSXSJNamOkIGXNJzmCTq23iM0L6BFkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f46a0ae6029ed60fb78edec66638cf3b0e85e2185626e4149f54859adb621f","last_reissued_at":"2026-05-17T23:45:42.886307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:42.886307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08537","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:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TG/clzlnU9RaoH+lXml0leVMggRoN4JhfgAstTuBRvcTLPysK3F5CnlKZzMclJwLWvypBd05nS5mEwkn7TujCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:27:14.388677Z"},"content_sha256":"670717beca858ddc9599330a670ad20c21cf8ea0722942a042d228648d02b906","schema_version":"1.0","event_id":"sha256:670717beca858ddc9599330a670ad20c21cf8ea0722942a042d228648d02b906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U32GUCXGAKPNMD5XR3PMMZRYZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Stochastic Natural Gradient Method for One-Shot Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kento Uchida, Kouhei Nishida, Nozomu Yoshinari, Shinichi Shirakawa, Shota Saito, Youhei Akimoto","submitted_at":"2019-05-21T10:39:04Z","abstract_excerpt":"High sensitivity of neural architecture search (NAS) methods against their input such as step-size (i.e., learning rate) and search space prevents practitioners from applying them out-of-the-box to their own problems, albeit its purpose is to automate a part of tuning process. Aiming at a fast, robust, and widely-applicable NAS, we develop a generic optimization framework for NAS. We turn a coupled optimization of connection weights and neural architecture into a differentiable optimization by means of stochastic relaxation. It accepts arbitrary search space (widely-applicable) and enables to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08537","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:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qr9kN97j8cBFlMwceOrbDhyIFh4HsN/PV3rh1CX5ThyZCljPMvuVETntm0J9OEJZgr/kyKqFzVOTuA2m4wIqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:27:14.389027Z"},"content_sha256":"e16929d339832f00a79796c7b7d08c913b5441f1dc3f9c8529651362b970634e","schema_version":"1.0","event_id":"sha256:e16929d339832f00a79796c7b7d08c913b5441f1dc3f9c8529651362b970634e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4/bundle.json","state_url":"https://pith.science/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4/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-11T11:27:14Z","links":{"resolver":"https://pith.science/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4","bundle":"https://pith.science/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4/bundle.json","state":"https://pith.science/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U32GUCXGAKPNMD5XR3PMMZRYZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U32GUCXGAKPNMD5XR3PMMZRYZ4","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":"16edb81de9795e9a1c3265b8e42724b8a69fd9af731b8f0a3b7cc61753d21ab3","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T10:39:04Z","title_canon_sha256":"d6405d1896d0fe807c79ac2b7ecde9047c52899c8a20298dd45785665942b804"},"schema_version":"1.0","source":{"id":"1905.08537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08537","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08537v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08537","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"U32GUCXGAKPN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U32GUCXGAKPNMD5X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U32GUCXG","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:e16929d339832f00a79796c7b7d08c913b5441f1dc3f9c8529651362b970634e","target":"graph","created_at":"2026-05-17T23:45:42Z","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":"High sensitivity of neural architecture search (NAS) methods against their input such as step-size (i.e., learning rate) and search space prevents practitioners from applying them out-of-the-box to their own problems, albeit its purpose is to automate a part of tuning process. Aiming at a fast, robust, and widely-applicable NAS, we develop a generic optimization framework for NAS. We turn a coupled optimization of connection weights and neural architecture into a differentiable optimization by means of stochastic relaxation. It accepts arbitrary search space (widely-applicable) and enables to ","authors_text":"Kento Uchida, Kouhei Nishida, Nozomu Yoshinari, Shinichi Shirakawa, Shota Saito, Youhei Akimoto","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T10:39:04Z","title":"Adaptive Stochastic Natural Gradient Method for One-Shot Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08537","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:670717beca858ddc9599330a670ad20c21cf8ea0722942a042d228648d02b906","target":"record","created_at":"2026-05-17T23:45:42Z","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":"16edb81de9795e9a1c3265b8e42724b8a69fd9af731b8f0a3b7cc61753d21ab3","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-21T10:39:04Z","title_canon_sha256":"d6405d1896d0fe807c79ac2b7ecde9047c52899c8a20298dd45785665942b804"},"schema_version":"1.0","source":{"id":"1905.08537","kind":"arxiv","version":1}},"canonical_sha256":"a6f46a0ae6029ed60fb78edec66638cf3b0e85e2185626e4149f54859adb621f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6f46a0ae6029ed60fb78edec66638cf3b0e85e2185626e4149f54859adb621f","first_computed_at":"2026-05-17T23:45:42.886307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:42.886307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9J31nnTwhiy29waUcObCGkUIHCRSv2aSxA5L7/Wwo0du8WMMkHeRUyLSXSJNamOkIGXNJzmCTq23iM0L6BFkCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:42.886910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:670717beca858ddc9599330a670ad20c21cf8ea0722942a042d228648d02b906","sha256:e16929d339832f00a79796c7b7d08c913b5441f1dc3f9c8529651362b970634e"],"state_sha256":"15d477fd9e4803c49c835044114379c853fca3dc6b5964348ca69c5c16be5b0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b77DhkJXKK73yqgJz8Cl8S3kaOTx/MmjSeU5KQSWDNv9iACW43pXupbiqH+MxDbPTel1gCDlThEtATwvKbbwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:27:14.390895Z","bundle_sha256":"1bbeffbba5bc470471185f6470f38020eea676cc42891e4ad2b3281dd13d0ec9"}}