{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YJRFO3G4THIPSX6SACUKEQBQEV","short_pith_number":"pith:YJRFO3G4","schema_version":"1.0","canonical_sha256":"c262576cdc99d0f95fd200a8a24030255f39c1e010cb2bfc0613116e4e2e2646","source":{"kind":"arxiv","id":"2104.11014","version":6},"attestation_state":"computed","paper":{"title":"Network Space Search for Pareto-Efficient Spaces","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Hao-Yun Chen, Hsien-Kai Kuo, Hung-Jen Chen, Kevin Jou, Min-Fong Hong, Min-Hung Chen, Yi-Min Tsai, Yu-Syuan Xu","submitted_at":"2021-04-22T12:23:53Z","abstract_excerpt":"Network spaces have been known as a critical factor in both handcrafted network designs or defining search spaces for Neural Architecture Search (NAS). However, an effective space involves tremendous prior knowledge and/or manual effort, and additional constraints are required to discover efficiency-aware architectures. In this paper, we define a new problem, Network Space Search (NSS), as searching for favorable network spaces instead of a single architecture. We propose an NSS method to directly search for efficient-aware network spaces automatically, reducing the manual effort and immense c"},"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":"2104.11014","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2021-04-22T12:23:53Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9542b4aba2d26c90afb70a076792da06e2931dc181ed69d3e30d4fe6ce45afe9","abstract_canon_sha256":"783c0ac34e0fef8057db77f11767839518bc1ca4ff77076e8235fe7b08b23c29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:45.915907Z","signature_b64":"nSm3a4e85iQg/5pd1u7UilwKG0W4QhPCXE18N25bY94AeH6DIvZuB/NuVn2zVhcwSncDeX6SkGtIoZWT669aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c262576cdc99d0f95fd200a8a24030255f39c1e010cb2bfc0613116e4e2e2646","last_reissued_at":"2026-07-05T02:50:45.915443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:45.915443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Space Search for Pareto-Efficient Spaces","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Hao-Yun Chen, Hsien-Kai Kuo, Hung-Jen Chen, Kevin Jou, Min-Fong Hong, Min-Hung Chen, Yi-Min Tsai, Yu-Syuan Xu","submitted_at":"2021-04-22T12:23:53Z","abstract_excerpt":"Network spaces have been known as a critical factor in both handcrafted network designs or defining search spaces for Neural Architecture Search (NAS). However, an effective space involves tremendous prior knowledge and/or manual effort, and additional constraints are required to discover efficiency-aware architectures. In this paper, we define a new problem, Network Space Search (NSS), as searching for favorable network spaces instead of a single architecture. We propose an NSS method to directly search for efficient-aware network spaces automatically, reducing the manual effort and immense c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.11014","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.11014/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.11014","created_at":"2026-07-05T02:50:45.915507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.11014v6","created_at":"2026-07-05T02:50:45.915507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.11014","created_at":"2026-07-05T02:50:45.915507+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJRFO3G4THIP","created_at":"2026-07-05T02:50:45.915507+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJRFO3G4THIPSX6S","created_at":"2026-07-05T02:50:45.915507+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJRFO3G4","created_at":"2026-07-05T02:50:45.915507+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/YJRFO3G4THIPSX6SACUKEQBQEV","json":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV.json","graph_json":"https://pith.science/api/pith-number/YJRFO3G4THIPSX6SACUKEQBQEV/graph.json","events_json":"https://pith.science/api/pith-number/YJRFO3G4THIPSX6SACUKEQBQEV/events.json","paper":"https://pith.science/paper/YJRFO3G4"},"agent_actions":{"view_html":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV","download_json":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV.json","view_paper":"https://pith.science/paper/YJRFO3G4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.11014&json=true","fetch_graph":"https://pith.science/api/pith-number/YJRFO3G4THIPSX6SACUKEQBQEV/graph.json","fetch_events":"https://pith.science/api/pith-number/YJRFO3G4THIPSX6SACUKEQBQEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV/action/storage_attestation","attest_author":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV/action/author_attestation","sign_citation":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV/action/citation_signature","submit_replication":"https://pith.science/pith/YJRFO3G4THIPSX6SACUKEQBQEV/action/replication_record"}},"created_at":"2026-07-05T02:50:45.915507+00:00","updated_at":"2026-07-05T02:50:45.915507+00:00"}