{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SSVKJGIGBKHIQPB5WI3QDLZEMZ","short_pith_number":"pith:SSVKJGIG","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"},"canonical_sha256":"94aaa499060a8e883c3db23701af2466410e1fad0b39a5ae67b2b0ecfceeaaec","source":{"kind":"arxiv","id":"1811.01567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01567","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01567v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01567","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"SSVKJGIGBKHI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SSVKJGIGBKHIQPB5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SSVKJGIG","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SSVKJGIGBKHIQPB5WI3QDLZEMZ","target":"record","payload":{"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"},"canonical_sha256":"94aaa499060a8e883c3db23701af2466410e1fad0b39a5ae67b2b0ecfceeaaec","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"},"source_kind":"arxiv","source_id":"1811.01567","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:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/UO6/n7UP99PuaMisDFg0qr8y4KjfyErNDKGmOZJ9if8A6o5kdnPJAWGRGq1tWN73QHo8NUoTC751Iu/2o0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:22:43.920993Z"},"content_sha256":"089ae1368bb60f2386dee159376fc007d08baffb0b6e4b58d770d2b4b467a027","schema_version":"1.0","event_id":"sha256:089ae1368bb60f2386dee159376fc007d08baffb0b6e4b58d770d2b4b467a027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SSVKJGIGBKHIQPB5WI3QDLZEMZ","target":"graph","payload":{"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"},"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:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WRpHZuLURLNrKRdoLRK5sjErXym/cGgyu/itX6i8k78K56NBTw4Eezc+Sv90QA51kfs7uvw8ugpkvZbOy8fCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:22:43.921414Z"},"content_sha256":"d433088110466165f89c16a95301c2935bf74eecf7464f8330f62226c5886413","schema_version":"1.0","event_id":"sha256:d433088110466165f89c16a95301c2935bf74eecf7464f8330f62226c5886413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/bundle.json","state_url":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/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-28T05:22:43Z","links":{"resolver":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ","bundle":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/bundle.json","state":"https://pith.science/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSVKJGIGBKHIQPB5WI3QDLZEMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SSVKJGIGBKHIQPB5WI3QDLZEMZ","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":"85b036e8a05fa51b3e3c608cb2096db07a22590ff59469707468267e7a6b3b1d","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-05T09:28:13Z","title_canon_sha256":"96a8585365bd4b10f14bc0c98d39b5c8d5692fc3f51c0c9ac4b064d8f2fe5c17"},"schema_version":"1.0","source":{"id":"1811.01567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01567","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01567v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01567","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"SSVKJGIGBKHI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SSVKJGIGBKHIQPB5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SSVKJGIG","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:d433088110466165f89c16a95301c2935bf74eecf7464f8330f62226c5886413","target":"graph","created_at":"2026-05-18T00:01:33Z","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":"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","authors_text":"Naiyan Wang, Xinbang Zhang, Zehao Huang","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-05T09:28:13Z","title":"You Only Search Once: Single Shot Neural Architecture Search via Direct Sparse Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01567","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:089ae1368bb60f2386dee159376fc007d08baffb0b6e4b58d770d2b4b467a027","target":"record","created_at":"2026-05-18T00:01:33Z","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":"85b036e8a05fa51b3e3c608cb2096db07a22590ff59469707468267e7a6b3b1d","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-05T09:28:13Z","title_canon_sha256":"96a8585365bd4b10f14bc0c98d39b5c8d5692fc3f51c0c9ac4b064d8f2fe5c17"},"schema_version":"1.0","source":{"id":"1811.01567","kind":"arxiv","version":1}},"canonical_sha256":"94aaa499060a8e883c3db23701af2466410e1fad0b39a5ae67b2b0ecfceeaaec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94aaa499060a8e883c3db23701af2466410e1fad0b39a5ae67b2b0ecfceeaaec","first_computed_at":"2026-05-18T00:01:33.952431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:33.952431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"accykZnfyhapYhsvDQkfRFpy0lPguHL1Z1DDKfSeZrW87l4RgrKT57ta1v4C6txj7QXQGVsArHVqH9U7nivMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:33.952959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:089ae1368bb60f2386dee159376fc007d08baffb0b6e4b58d770d2b4b467a027","sha256:d433088110466165f89c16a95301c2935bf74eecf7464f8330f62226c5886413"],"state_sha256":"5b6273fd78139a530cb62e7780ffa7605afb554acb4fbdf055a7060a03e93eb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGtpIcm3t7pXls4G5Dueg5k250QqgE4aAXrGg4sEdpdikI2o9IkK0mM027cM5RRLymEOkK2n8yGGmu4YzW1xDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:22:43.923426Z","bundle_sha256":"b1b8884c1f69a70f003d753a39a63b424879679a2d3712b823b7f6bf68b8595c"}}