{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IPD5SGQ5RRQFFGXO5CX77S5ZV5","short_pith_number":"pith:IPD5SGQ5","canonical_record":{"source":{"id":"1905.13360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T00:10:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"939fd4c47b65ee1cc10f10016d9a88a09b2734338d347a2e0d9e24f07c797041","abstract_canon_sha256":"29e6e6023d14cc42d04f1e2bd69d20df91d96136cb93e77c58c662263f806a97"},"schema_version":"1.0"},"canonical_sha256":"43c7d91a1d8c60529aeee8afffcbb9af52d19ac576a2057377ca01fd76e00cee","source":{"kind":"arxiv","id":"1905.13360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13360","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13360v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13360","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"IPD5SGQ5RRQF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IPD5SGQ5RRQFFGXO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IPD5SGQ5","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IPD5SGQ5RRQFFGXO5CX77S5ZV5","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T00:10:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"939fd4c47b65ee1cc10f10016d9a88a09b2734338d347a2e0d9e24f07c797041","abstract_canon_sha256":"29e6e6023d14cc42d04f1e2bd69d20df91d96136cb93e77c58c662263f806a97"},"schema_version":"1.0"},"canonical_sha256":"43c7d91a1d8c60529aeee8afffcbb9af52d19ac576a2057377ca01fd76e00cee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.185351Z","signature_b64":"9jxwxy8HZa33lvXTYVIjudqS3ZGhUO+d8RcP4WoknQ60yf8tbvJhnMTOu/TZf5QxHBpC+88F7lfws0YaNsAbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c7d91a1d8c60529aeee8afffcbb9af52d19ac576a2057377ca01fd76e00cee","last_reissued_at":"2026-05-17T23:44:35.184622Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.184622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13360","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:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GyrQVLSHbz5FPXJfMK2SdVT8KQAWxpk/Js60NiSkRR9VKCw4bCRiE1DgXxlUNDI+AfTReB6/q5pO7DyDjVLMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:08:37.759898Z"},"content_sha256":"50650091553cde278fb2eaf69203cc4bb213f522b7d966e7aadea806cd0420d1","schema_version":"1.0","event_id":"sha256:50650091553cde278fb2eaf69203cc4bb213f522b7d966e7aadea806cd0420d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IPD5SGQ5RRQFFGXO5CX77S5ZV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Forward Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Debadeepta Dey, Eric Horvitz, Hanzhang Hu, John Langford, Rich Caruana, Saurajit Mukherjee","submitted_at":"2019-05-31T00:10:17Z","abstract_excerpt":"We propose a neural architecture search (NAS) algorithm, Petridish, to iteratively add shortcut connections to existing network layers. The added shortcut connections effectively perform gradient boosting on the augmented layers. The proposed algorithm is motivated by the feature selection algorithm forward stage-wise linear regression, since we consider NAS as a generalization of feature selection for regression, where NAS selects shortcuts among layers instead of selecting features. In order to reduce the number of trials of possible connection combinations, we train jointly all possible con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13360","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:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVgFBoh4xBvnLPIMiJK/lEnWqlwruTZV0tGEDrLOX79wR16amXLeqhr9GMWLtmOHkR7WtlCZdRGY1HqzugW1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:08:37.760241Z"},"content_sha256":"d045b9a4664f367f0f3cc3b67a49565066cf4bed20a213e126e7d03931af42d2","schema_version":"1.0","event_id":"sha256:d045b9a4664f367f0f3cc3b67a49565066cf4bed20a213e126e7d03931af42d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5/bundle.json","state_url":"https://pith.science/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5/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-04T10:08:37Z","links":{"resolver":"https://pith.science/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5","bundle":"https://pith.science/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5/bundle.json","state":"https://pith.science/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPD5SGQ5RRQFFGXO5CX77S5ZV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IPD5SGQ5RRQFFGXO5CX77S5ZV5","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":"29e6e6023d14cc42d04f1e2bd69d20df91d96136cb93e77c58c662263f806a97","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T00:10:17Z","title_canon_sha256":"939fd4c47b65ee1cc10f10016d9a88a09b2734338d347a2e0d9e24f07c797041"},"schema_version":"1.0","source":{"id":"1905.13360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13360","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13360v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13360","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"IPD5SGQ5RRQF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IPD5SGQ5RRQFFGXO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IPD5SGQ5","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:d045b9a4664f367f0f3cc3b67a49565066cf4bed20a213e126e7d03931af42d2","target":"graph","created_at":"2026-05-17T23:44:35Z","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":"We propose a neural architecture search (NAS) algorithm, Petridish, to iteratively add shortcut connections to existing network layers. The added shortcut connections effectively perform gradient boosting on the augmented layers. The proposed algorithm is motivated by the feature selection algorithm forward stage-wise linear regression, since we consider NAS as a generalization of feature selection for regression, where NAS selects shortcuts among layers instead of selecting features. In order to reduce the number of trials of possible connection combinations, we train jointly all possible con","authors_text":"Debadeepta Dey, Eric Horvitz, Hanzhang Hu, John Langford, Rich Caruana, Saurajit Mukherjee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T00:10:17Z","title":"Efficient Forward Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13360","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:50650091553cde278fb2eaf69203cc4bb213f522b7d966e7aadea806cd0420d1","target":"record","created_at":"2026-05-17T23:44:35Z","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":"29e6e6023d14cc42d04f1e2bd69d20df91d96136cb93e77c58c662263f806a97","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T00:10:17Z","title_canon_sha256":"939fd4c47b65ee1cc10f10016d9a88a09b2734338d347a2e0d9e24f07c797041"},"schema_version":"1.0","source":{"id":"1905.13360","kind":"arxiv","version":1}},"canonical_sha256":"43c7d91a1d8c60529aeee8afffcbb9af52d19ac576a2057377ca01fd76e00cee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43c7d91a1d8c60529aeee8afffcbb9af52d19ac576a2057377ca01fd76e00cee","first_computed_at":"2026-05-17T23:44:35.184622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.184622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9jxwxy8HZa33lvXTYVIjudqS3ZGhUO+d8RcP4WoknQ60yf8tbvJhnMTOu/TZf5QxHBpC+88F7lfws0YaNsAbCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.185351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50650091553cde278fb2eaf69203cc4bb213f522b7d966e7aadea806cd0420d1","sha256:d045b9a4664f367f0f3cc3b67a49565066cf4bed20a213e126e7d03931af42d2"],"state_sha256":"eb1f16ece00f91380b050120c66907f97ba74f0fba76d04c40d175ebcb46e705"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHw7HgJXt2hxZhn1PSRKwiQ1O0p6f2eEiptVu+fFGi727YhJtYtX6Pn4SCJmtOUB12XSO8EnnAAphlpuliOLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:08:37.762258Z","bundle_sha256":"95991b26822a26f6d8c4627285bdc9091cf1c0ce8fdbebfc60a02c8ec9696e43"}}