{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FVEKDQSA5U3JRGCWH73FINYRMO","short_pith_number":"pith:FVEKDQSA","schema_version":"1.0","canonical_sha256":"2d48a1c240ed369898563ff654371163ac107c605bb18baa55fe13cea39fb674","source":{"kind":"arxiv","id":"1907.08307","version":1},"attestation_state":"computed","paper":{"title":"XferNAS: Transfer Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Wistuba","submitted_at":"2019-07-18T22:05:49Z","abstract_excerpt":"The term Neural Architecture Search (NAS) refers to the automatic optimization of network architectures for a new, previously unknown task. Since testing an architecture is computationally very expensive, many optimizers need days or even weeks to find suitable architectures. However, this search time can be significantly reduced if knowledge from previous searches on different tasks is reused. In this work, we propose a generally applicable framework that introduces only minor changes to existing optimizers to leverage this feature. As an example, we select an existing optimizer and demonstra"},"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":"1907.08307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T22:05:49Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"1d727a535fcfb58bfb132cae08ba719e43d7218f251fdeb5bc6cb525e08765e7","abstract_canon_sha256":"9596eb2aeec22467246f44da20badf567c9ae36bcfc4a751b5263ebd677de5ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.266422Z","signature_b64":"7aX0g4eSnZLq3x7fCykiFsrEIO3UvCuVZ+FG+xRl8teUG99k9tZOyNUx2My9zbcXR+FCi+l8ybUvChoaJvHgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d48a1c240ed369898563ff654371163ac107c605bb18baa55fe13cea39fb674","last_reissued_at":"2026-05-17T23:40:10.265819Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.265819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"XferNAS: Transfer Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Wistuba","submitted_at":"2019-07-18T22:05:49Z","abstract_excerpt":"The term Neural Architecture Search (NAS) refers to the automatic optimization of network architectures for a new, previously unknown task. Since testing an architecture is computationally very expensive, many optimizers need days or even weeks to find suitable architectures. However, this search time can be significantly reduced if knowledge from previous searches on different tasks is reused. In this work, we propose a generally applicable framework that introduces only minor changes to existing optimizers to leverage this feature. As an example, we select an existing optimizer and demonstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08307","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":"1907.08307","created_at":"2026-05-17T23:40:10.265896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08307v1","created_at":"2026-05-17T23:40:10.265896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08307","created_at":"2026-05-17T23:40:10.265896+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVEKDQSA5U3J","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVEKDQSA5U3JRGCW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVEKDQSA","created_at":"2026-05-18T12:33:15.570797+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/FVEKDQSA5U3JRGCWH73FINYRMO","json":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO.json","graph_json":"https://pith.science/api/pith-number/FVEKDQSA5U3JRGCWH73FINYRMO/graph.json","events_json":"https://pith.science/api/pith-number/FVEKDQSA5U3JRGCWH73FINYRMO/events.json","paper":"https://pith.science/paper/FVEKDQSA"},"agent_actions":{"view_html":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO","download_json":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO.json","view_paper":"https://pith.science/paper/FVEKDQSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08307&json=true","fetch_graph":"https://pith.science/api/pith-number/FVEKDQSA5U3JRGCWH73FINYRMO/graph.json","fetch_events":"https://pith.science/api/pith-number/FVEKDQSA5U3JRGCWH73FINYRMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/action/storage_attestation","attest_author":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/action/author_attestation","sign_citation":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/action/citation_signature","submit_replication":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/action/replication_record"}},"created_at":"2026-05-17T23:40:10.265896+00:00","updated_at":"2026-05-17T23:40:10.265896+00:00"}