{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FVEKDQSA5U3JRGCWH73FINYRMO","short_pith_number":"pith:FVEKDQSA","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"},"canonical_sha256":"2d48a1c240ed369898563ff654371163ac107c605bb18baa55fe13cea39fb674","source":{"kind":"arxiv","id":"1907.08307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08307","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08307v1","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08307","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"FVEKDQSA5U3J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVEKDQSA5U3JRGCW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVEKDQSA","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FVEKDQSA5U3JRGCWH73FINYRMO","target":"record","payload":{"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"},"canonical_sha256":"2d48a1c240ed369898563ff654371163ac107c605bb18baa55fe13cea39fb674","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"},"source_kind":"arxiv","source_id":"1907.08307","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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuua5yCvnje1nAdbyUrynUMpbrFnJoAj3rUkASmA/gui1+088TXAKkq/YQjwQkqhzvaA8QK9wKpJzl3/GKJeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:00:55.948571Z"},"content_sha256":"b9d83b55c91734d82a0b0f4af5037725e1afebd112fdaf7f87244ea8f88f80f6","schema_version":"1.0","event_id":"sha256:b9d83b55c91734d82a0b0f4af5037725e1afebd112fdaf7f87244ea8f88f80f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FVEKDQSA5U3JRGCWH73FINYRMO","target":"graph","payload":{"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"},"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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0PeF2wHsVItIf5dtYMNClEmYko+zisj4urFaK7XcsODiagJqWQPly81aJVYHN4rDZ9rE5McF6soLj0j4ckTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:00:55.949161Z"},"content_sha256":"126616340c7387dacded3c838803536cd15cee503b085695a2c012457226d3fa","schema_version":"1.0","event_id":"sha256:126616340c7387dacded3c838803536cd15cee503b085695a2c012457226d3fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/bundle.json","state_url":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVEKDQSA5U3JRGCWH73FINYRMO/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-25T13:00:55Z","links":{"resolver":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO","bundle":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/bundle.json","state":"https://pith.science/pith/FVEKDQSA5U3JRGCWH73FINYRMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVEKDQSA5U3JRGCWH73FINYRMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FVEKDQSA5U3JRGCWH73FINYRMO","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":"9596eb2aeec22467246f44da20badf567c9ae36bcfc4a751b5263ebd677de5ce","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T22:05:49Z","title_canon_sha256":"1d727a535fcfb58bfb132cae08ba719e43d7218f251fdeb5bc6cb525e08765e7"},"schema_version":"1.0","source":{"id":"1907.08307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08307","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08307v1","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08307","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"FVEKDQSA5U3J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVEKDQSA5U3JRGCW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVEKDQSA","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:126616340c7387dacded3c838803536cd15cee503b085695a2c012457226d3fa","target":"graph","created_at":"2026-05-17T23:40:10Z","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":"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","authors_text":"Martin Wistuba","cross_cats":["cs.CV","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T22:05:49Z","title":"XferNAS: Transfer Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08307","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:b9d83b55c91734d82a0b0f4af5037725e1afebd112fdaf7f87244ea8f88f80f6","target":"record","created_at":"2026-05-17T23:40:10Z","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":"9596eb2aeec22467246f44da20badf567c9ae36bcfc4a751b5263ebd677de5ce","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T22:05:49Z","title_canon_sha256":"1d727a535fcfb58bfb132cae08ba719e43d7218f251fdeb5bc6cb525e08765e7"},"schema_version":"1.0","source":{"id":"1907.08307","kind":"arxiv","version":1}},"canonical_sha256":"2d48a1c240ed369898563ff654371163ac107c605bb18baa55fe13cea39fb674","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d48a1c240ed369898563ff654371163ac107c605bb18baa55fe13cea39fb674","first_computed_at":"2026-05-17T23:40:10.265819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.265819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7aX0g4eSnZLq3x7fCykiFsrEIO3UvCuVZ+FG+xRl8teUG99k9tZOyNUx2My9zbcXR+FCi+l8ybUvChoaJvHgDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.266422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9d83b55c91734d82a0b0f4af5037725e1afebd112fdaf7f87244ea8f88f80f6","sha256:126616340c7387dacded3c838803536cd15cee503b085695a2c012457226d3fa"],"state_sha256":"2d5cbd27e40c07ee860cc4894a61592bf0c3663351bcdcd9c038de0f02f44a00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4biK3UpqJHp7x9nkNm8w8PawXLOpUe12eBTmHKcA4XMCHnHDIi3mGl69BmK/cTXQf+9FpxsyKy1I8VsMgqSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:00:55.952263Z","bundle_sha256":"93fe839c3484493d9461dfbd3afc93aa8e2121e77d8e7e1e6fb75776a6e1a095"}}