{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PHV6AMZZXG3GMQ2APWJYTV5NXU","short_pith_number":"pith:PHV6AMZZ","schema_version":"1.0","canonical_sha256":"79ebe03339b9b66643407d9389d7adbd3ff2869cb730747829e50303a94e6465","source":{"kind":"arxiv","id":"2011.10949","version":3},"attestation_state":"computed","paper":{"title":"FP-NAS: Fast Probabilistic Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Bichen Wu, Matt Feiszli, Peizhao Zhang, Xiaoliang Dai, Yuandong Tian, Zhicheng Yan","submitted_at":"2020-11-22T06:10:05Z","abstract_excerpt":"Differential Neural Architecture Search (NAS) requires all layer choices to be held in memory simultaneously; this limits the size of both search space and final architecture. In contrast, Probabilistic NAS, such as PARSEC, learns a distribution over high-performing architectures, and uses only as much memory as needed to train a single model. Nevertheless, it needs to sample many architectures, making it computationally expensive for searching in an extensive space. To solve these problems, we propose a sampling method adaptive to the distribution entropy, drawing more samples to encourage ex"},"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":"2011.10949","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-22T06:10:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4d37ad50fbb31fb6192d19aedfc3b1f2832e0722dbff1bc160ff88ed17a68f57","abstract_canon_sha256":"aeaf591d8b4b4dad06a6d2de6d35c737199b990cabc25dfe2c940600818d06ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:07.121949Z","signature_b64":"feoOZdxN8kcx8DojzHKnL5/y6ikeS8WX2iw2gSM5kNDtz1v4Y+xZ/oLE5tUOxiQOJEnzRE7f5wrRbQaU8gJcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79ebe03339b9b66643407d9389d7adbd3ff2869cb730747829e50303a94e6465","last_reissued_at":"2026-07-05T02:28:07.121460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:07.121460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FP-NAS: Fast Probabilistic Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Bichen Wu, Matt Feiszli, Peizhao Zhang, Xiaoliang Dai, Yuandong Tian, Zhicheng Yan","submitted_at":"2020-11-22T06:10:05Z","abstract_excerpt":"Differential Neural Architecture Search (NAS) requires all layer choices to be held in memory simultaneously; this limits the size of both search space and final architecture. In contrast, Probabilistic NAS, such as PARSEC, learns a distribution over high-performing architectures, and uses only as much memory as needed to train a single model. Nevertheless, it needs to sample many architectures, making it computationally expensive for searching in an extensive space. To solve these problems, we propose a sampling method adaptive to the distribution entropy, drawing more samples to encourage ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10949","kind":"arxiv","version":3},"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/2011.10949/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":"2011.10949","created_at":"2026-07-05T02:28:07.121518+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.10949v3","created_at":"2026-07-05T02:28:07.121518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10949","created_at":"2026-07-05T02:28:07.121518+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHV6AMZZXG3G","created_at":"2026-07-05T02:28:07.121518+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHV6AMZZXG3GMQ2A","created_at":"2026-07-05T02:28:07.121518+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHV6AMZZ","created_at":"2026-07-05T02:28:07.121518+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/PHV6AMZZXG3GMQ2APWJYTV5NXU","json":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU.json","graph_json":"https://pith.science/api/pith-number/PHV6AMZZXG3GMQ2APWJYTV5NXU/graph.json","events_json":"https://pith.science/api/pith-number/PHV6AMZZXG3GMQ2APWJYTV5NXU/events.json","paper":"https://pith.science/paper/PHV6AMZZ"},"agent_actions":{"view_html":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU","download_json":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU.json","view_paper":"https://pith.science/paper/PHV6AMZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.10949&json=true","fetch_graph":"https://pith.science/api/pith-number/PHV6AMZZXG3GMQ2APWJYTV5NXU/graph.json","fetch_events":"https://pith.science/api/pith-number/PHV6AMZZXG3GMQ2APWJYTV5NXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU/action/storage_attestation","attest_author":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU/action/author_attestation","sign_citation":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU/action/citation_signature","submit_replication":"https://pith.science/pith/PHV6AMZZXG3GMQ2APWJYTV5NXU/action/replication_record"}},"created_at":"2026-07-05T02:28:07.121518+00:00","updated_at":"2026-07-05T02:28:07.121518+00:00"}