{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GUELED5TSAY2FOCZMOYN4IQ273","short_pith_number":"pith:GUELED5T","schema_version":"1.0","canonical_sha256":"3508b20fb39031a2b85963b0de221afec9090bef19b0e61a30a170464239890d","source":{"kind":"arxiv","id":"2104.09223","version":1},"attestation_state":"computed","paper":{"title":"Coarse-to-Fine Searching for Efficient Generative Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Han Shu, Jiahao Wang, Weihao Xia, Yujiu Yang, Yunhe Wang","submitted_at":"2021-04-19T11:46:20Z","abstract_excerpt":"This paper studies the neural architecture search (NAS) problem for developing efficient generator networks. Compared with deep models for visual recognition tasks, generative adversarial network (GAN) are usually designed to conduct various complex image generation. We first discover an intact search space of generator networks including three dimensionalities, i.e., path, operator, channel for fully excavating the network performance. To reduce the huge search cost, we explore a coarse-to-fine search strategy which divides the overall search process into three sub-optimization problems accor"},"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.09223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-04-19T11:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"06eca46a32684806198126cd453b8ac457f0e13b91a950b03fb815ea2df06db8","abstract_canon_sha256":"941416844acc8b5305d7cb01906c24320e4b8cc06f4ab11961ea40f1a3ad1363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:10.774393Z","signature_b64":"R2DvuVtEmLjX8MFQLxSll4Ek7RETcaDCPzFIvl+XSzdBa7VW3C2ikPuWWD8NKxEwQu/ZNbR3qbvSnGfoP5YpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3508b20fb39031a2b85963b0de221afec9090bef19b0e61a30a170464239890d","last_reissued_at":"2026-07-05T02:33:10.773995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:10.773995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coarse-to-Fine Searching for Efficient Generative Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Han Shu, Jiahao Wang, Weihao Xia, Yujiu Yang, Yunhe Wang","submitted_at":"2021-04-19T11:46:20Z","abstract_excerpt":"This paper studies the neural architecture search (NAS) problem for developing efficient generator networks. Compared with deep models for visual recognition tasks, generative adversarial network (GAN) are usually designed to conduct various complex image generation. We first discover an intact search space of generator networks including three dimensionalities, i.e., path, operator, channel for fully excavating the network performance. To reduce the huge search cost, we explore a coarse-to-fine search strategy which divides the overall search process into three sub-optimization problems accor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.09223","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.09223/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.09223","created_at":"2026-07-05T02:33:10.774052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.09223v1","created_at":"2026-07-05T02:33:10.774052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.09223","created_at":"2026-07-05T02:33:10.774052+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUELED5TSAY2","created_at":"2026-07-05T02:33:10.774052+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUELED5TSAY2FOCZ","created_at":"2026-07-05T02:33:10.774052+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUELED5T","created_at":"2026-07-05T02:33:10.774052+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/GUELED5TSAY2FOCZMOYN4IQ273","json":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273.json","graph_json":"https://pith.science/api/pith-number/GUELED5TSAY2FOCZMOYN4IQ273/graph.json","events_json":"https://pith.science/api/pith-number/GUELED5TSAY2FOCZMOYN4IQ273/events.json","paper":"https://pith.science/paper/GUELED5T"},"agent_actions":{"view_html":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273","download_json":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273.json","view_paper":"https://pith.science/paper/GUELED5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.09223&json=true","fetch_graph":"https://pith.science/api/pith-number/GUELED5TSAY2FOCZMOYN4IQ273/graph.json","fetch_events":"https://pith.science/api/pith-number/GUELED5TSAY2FOCZMOYN4IQ273/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273/action/storage_attestation","attest_author":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273/action/author_attestation","sign_citation":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273/action/citation_signature","submit_replication":"https://pith.science/pith/GUELED5TSAY2FOCZMOYN4IQ273/action/replication_record"}},"created_at":"2026-07-05T02:33:10.774052+00:00","updated_at":"2026-07-05T02:33:10.774052+00:00"}