{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SSVKJGIGBKHIQPB5WI3QDLZEMZ","short_pith_number":"pith:SSVKJGIG","schema_version":"1.0","canonical_sha256":"94aaa499060a8e883c3db23701af2466410e1fad0b39a5ae67b2b0ecfceeaaec","source":{"kind":"arxiv","id":"1811.01567","version":1},"attestation_state":"computed","paper":{"title":"You Only Search Once: Single Shot Neural Architecture Search via Direct Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Naiyan Wang, Xinbang Zhang, Zehao Huang","submitted_at":"2018-11-05T09:28:13Z","abstract_excerpt":"Recently Neural Architecture Search (NAS) has aroused great interest in both academia and industry, however it remains challenging because of its huge and non-continuous search space. Instead of applying evolutionary algorithm or reinforcement learning as previous works, this paper proposes a Direct Sparse Optimization NAS (DSO-NAS) method. In DSO-NAS, we provide a novel model pruning view to NAS problem. In specific, we start from a completely connected block, and then introduce scaling factors to scale the information flow between operations. Next, we impose sparse regularizations to prune u"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.01567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-05T09:28:13Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"96a8585365bd4b10f14bc0c98d39b5c8d5692fc3f51c0c9ac4b064d8f2fe5c17","abstract_canon_sha256":"85b036e8a05fa51b3e3c608cb2096db07a22590ff59469707468267e7a6b3b1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:33.952959Z","signature_b64":"accykZnfyhapYhsvDQkfRFpy0lPguHL1Z1DDKfSeZrW87l4RgrKT57ta1v4C6txj7QXQGVsArHVqH9U7nivMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94aaa499060a8e883c3db23701af2466410e1fad0b39a5ae67b2b0ecfceeaaec","last_reissued_at":"2026-05-18T00:01:33.952431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:33.952431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"You Only Search Once: Single Shot Neural Architecture Search via Direct Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Naiyan Wang, Xinbang Zhang, Zehao Huang","submitted_at":"2018-11-05T09:28:13Z","abstract_excerpt":"Recently Neural Architecture Search (NAS) has aroused great interest in both academia and industry, however it remains challenging because of its huge and non-continuous search space. Instead of applying evolutionary algorithm or reinforcement learning as previous works, this paper proposes a Direct Sparse Optimization NAS (DSO-NAS) method. In DSO-NAS, we provide a novel model pruning view to NAS problem. In specific, we start from a completely connected block, and then introduce scaling factors to scale the information flow between operations. Next, we impose sparse regularizations to prune u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01567","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.01567","created_at":"2026-05-18T00:01:33.952513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01567v1","created_at":"2026-05-18T00:01:33.952513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01567","created_at":"2026-05-18T00:01:33.952513+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSVKJGIGBKHI","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSVKJGIGBKHIQPB5","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSVKJGIG","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ","json":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ.json","graph_json":"https://pith.science/api/pith-number/SSVKJGIGBKHIQPB5WI3QDLZEMZ/graph.json","events_json":"https://pith.science/api/pith-number/SSVKJGIGBKHIQPB5WI3QDLZEMZ/events.json","paper":"https://pith.science/paper/SSVKJGIG"},"agent_actions":{"view_html":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ","download_json":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ.json","view_paper":"https://pith.science/paper/SSVKJGIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01567&json=true","fetch_graph":"https://pith.science/api/pith-number/SSVKJGIGBKHIQPB5WI3QDLZEMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SSVKJGIGBKHIQPB5WI3QDLZEMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/action/storage_attestation","attest_author":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/action/author_attestation","sign_citation":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/action/citation_signature","submit_replication":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/action/replication_record"}},"created_at":"2026-05-18T00:01:33.952513+00:00","updated_at":"2026-05-18T00:01:33.952513+00:00"}