{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OTA2GN36CDKIZBPAQW3SRITS6V","short_pith_number":"pith:OTA2GN36","canonical_record":{"source":{"id":"1806.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-12T20:41:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a4dd162c366b220273901a66d7a3880c24bd3ed54ee82639cded49289d3b3301","abstract_canon_sha256":"4da307576c5d6b15fe730a7adca9dee909d2984f4e7c3c8215b92c1b3b2496f6"},"schema_version":"1.0"},"canonical_sha256":"74c1a3377e10d48c85e085b728a272f552de5dc73028b56c1848e2aa8a9a5884","source":{"kind":"arxiv","id":"1806.07912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07912","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07912v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07912","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"OTA2GN36CDKI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTA2GN36CDKIZBPA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTA2GN36","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OTA2GN36CDKIZBPAQW3SRITS6V","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-12T20:41:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a4dd162c366b220273901a66d7a3880c24bd3ed54ee82639cded49289d3b3301","abstract_canon_sha256":"4da307576c5d6b15fe730a7adca9dee909d2984f4e7c3c8215b92c1b3b2496f6"},"schema_version":"1.0"},"canonical_sha256":"74c1a3377e10d48c85e085b728a272f552de5dc73028b56c1848e2aa8a9a5884","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:42.688209Z","signature_b64":"MkVAc17Wclr2dg6A+k/WSNxLsFX01toJT4g94dKcG7nWNNAg8cgPbZ4t/paT4FdusAvuavrCuKaGwYBnYh+1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74c1a3377e10d48c85e085b728a272f552de5dc73028b56c1848e2aa8a9a5884","last_reissued_at":"2026-05-18T00:12:42.687565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:42.687565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07912","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:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiOnR8c6dZ3sqRZtzsb9gvD3uuGyvDNTfAioWy3hcJGEE5iwSCfWBHiyp+EkvCqcNXsGorrndouJOfj60BZzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:33.247825Z"},"content_sha256":"5717290062e284213ac8ed1365d98ba64134eac8399cf88004124dab78db363d","schema_version":"1.0","event_id":"sha256:5717290062e284213ac8ed1365d98ba64134eac8399cf88004124dab78db363d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OTA2GN36CDKIZBPAQW3SRITS6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource-Efficient Neural Architect","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Greg Diamos, Hairong Liu, Haonan Yu, Sercan \\\"O. Ar{\\i}k, Siavash Ebrahimi, Yanqi Zhou","submitted_at":"2018-06-12T20:41:32Z","abstract_excerpt":"Neural Architecture Search (NAS) is a laborious process. Prior work on automated NAS targets mainly on improving accuracy, but lacks consideration of computational resource use. We propose the Resource-Efficient Neural Architect (RENA), an efficient resource-constrained NAS using reinforcement learning with network embedding. RENA uses a policy network to process the network embeddings to generate new configurations. We demonstrate RENA on image recognition and keyword spotting (KWS) problems. RENA can find novel architectures that achieve high performance even with tight resource constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07912","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:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtSZQozdGZoDtLvy0STriL7i2SQzw/ajblbQYL6X09O8aijqdQPBse/kEyUA7aKyRDu3h0+Z+4d2p4yt3K5iBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:33.248337Z"},"content_sha256":"f4adc206d9aeb2c27bd68ceb2ef50f59c2b38e5807c06d1e8b071f58a446880d","schema_version":"1.0","event_id":"sha256:f4adc206d9aeb2c27bd68ceb2ef50f59c2b38e5807c06d1e8b071f58a446880d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTA2GN36CDKIZBPAQW3SRITS6V/bundle.json","state_url":"https://pith.science/pith/OTA2GN36CDKIZBPAQW3SRITS6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTA2GN36CDKIZBPAQW3SRITS6V/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-05-26T15:48:33Z","links":{"resolver":"https://pith.science/pith/OTA2GN36CDKIZBPAQW3SRITS6V","bundle":"https://pith.science/pith/OTA2GN36CDKIZBPAQW3SRITS6V/bundle.json","state":"https://pith.science/pith/OTA2GN36CDKIZBPAQW3SRITS6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTA2GN36CDKIZBPAQW3SRITS6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OTA2GN36CDKIZBPAQW3SRITS6V","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":"4da307576c5d6b15fe730a7adca9dee909d2984f4e7c3c8215b92c1b3b2496f6","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-12T20:41:32Z","title_canon_sha256":"a4dd162c366b220273901a66d7a3880c24bd3ed54ee82639cded49289d3b3301"},"schema_version":"1.0","source":{"id":"1806.07912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07912","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07912v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07912","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"OTA2GN36CDKI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTA2GN36CDKIZBPA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTA2GN36","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f4adc206d9aeb2c27bd68ceb2ef50f59c2b38e5807c06d1e8b071f58a446880d","target":"graph","created_at":"2026-05-18T00:12: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":"Neural Architecture Search (NAS) is a laborious process. Prior work on automated NAS targets mainly on improving accuracy, but lacks consideration of computational resource use. We propose the Resource-Efficient Neural Architect (RENA), an efficient resource-constrained NAS using reinforcement learning with network embedding. RENA uses a policy network to process the network embeddings to generate new configurations. We demonstrate RENA on image recognition and keyword spotting (KWS) problems. RENA can find novel architectures that achieve high performance even with tight resource constraints.","authors_text":"Greg Diamos, Hairong Liu, Haonan Yu, Sercan \\\"O. Ar{\\i}k, Siavash Ebrahimi, Yanqi Zhou","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-12T20:41:32Z","title":"Resource-Efficient Neural Architect"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07912","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:5717290062e284213ac8ed1365d98ba64134eac8399cf88004124dab78db363d","target":"record","created_at":"2026-05-18T00:12: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":"4da307576c5d6b15fe730a7adca9dee909d2984f4e7c3c8215b92c1b3b2496f6","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-12T20:41:32Z","title_canon_sha256":"a4dd162c366b220273901a66d7a3880c24bd3ed54ee82639cded49289d3b3301"},"schema_version":"1.0","source":{"id":"1806.07912","kind":"arxiv","version":1}},"canonical_sha256":"74c1a3377e10d48c85e085b728a272f552de5dc73028b56c1848e2aa8a9a5884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74c1a3377e10d48c85e085b728a272f552de5dc73028b56c1848e2aa8a9a5884","first_computed_at":"2026-05-18T00:12:42.687565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:42.687565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkVAc17Wclr2dg6A+k/WSNxLsFX01toJT4g94dKcG7nWNNAg8cgPbZ4t/paT4FdusAvuavrCuKaGwYBnYh+1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:42.688209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5717290062e284213ac8ed1365d98ba64134eac8399cf88004124dab78db363d","sha256:f4adc206d9aeb2c27bd68ceb2ef50f59c2b38e5807c06d1e8b071f58a446880d"],"state_sha256":"52b0d0421c6b826fb29af64fceeb2e64b624f5e0219c2ea82fa496a7366e6ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3G2GwhtUzcvll7A3nemQGUbtGvFgz6SX4gybKwCL5mzN473gfh5lk0DEMOUPOBpm/Rq+NoNSRTuq/J8W/AsaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:48:33.250637Z","bundle_sha256":"42710fe2fa0977a06550717fdbada35f46991fc1cebbfeac50cb1512afbd1142"}}