{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5TRF2ZVTMOHUDFPI5Y2TWSSFFS","short_pith_number":"pith:5TRF2ZVT","canonical_record":{"source":{"id":"1904.12760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-29T14:59:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"100298b2c895db6b5a9b21eb5403ab19a0a32e1d19e4c5dd15951e705feb6629","abstract_canon_sha256":"2ee4e3e1a032aa4c2dceb57252b23cbb576389e452db9dc523731ef3dbc4d312"},"schema_version":"1.0"},"canonical_sha256":"ece25d66b3638f4195e8ee353b4a452c917f8c8ab969dd5bc1b8a4196d21761c","source":{"kind":"arxiv","id":"1904.12760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12760","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12760v1","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12760","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"5TRF2ZVTMOHU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5TRF2ZVTMOHUDFPI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5TRF2ZVT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5TRF2ZVTMOHUDFPI5Y2TWSSFFS","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-29T14:59:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"100298b2c895db6b5a9b21eb5403ab19a0a32e1d19e4c5dd15951e705feb6629","abstract_canon_sha256":"2ee4e3e1a032aa4c2dceb57252b23cbb576389e452db9dc523731ef3dbc4d312"},"schema_version":"1.0"},"canonical_sha256":"ece25d66b3638f4195e8ee353b4a452c917f8c8ab969dd5bc1b8a4196d21761c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:34.205009Z","signature_b64":"UuoQqHFUakWZnqiOFFAEwzqn6fKo7AcxZxmzGN0nLzpaeywW0nNdnAfhgHHQ3bozbl7Bso3RY+EWOnV8A7VCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece25d66b3638f4195e8ee353b4a452c917f8c8ab969dd5bc1b8a4196d21761c","last_reissued_at":"2026-05-17T23:47:34.204523Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:34.204523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12760","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:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yj2VKoqWHpa7kYwqDnl4yxTIwFDHWMEuxIkpFVv5uwudyW9VldHPFzfwjZYrOJzMLdneEZ5ZWqOrrk2SfPl5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:25:50.838161Z"},"content_sha256":"efefbcdd289b623523e5c56f74ac1a3a70f85fad3d0b9accb1f8d2a5f81d1395","schema_version":"1.0","event_id":"sha256:efefbcdd289b623523e5c56f74ac1a3a70f85fad3d0b9accb1f8d2a5f81d1395"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5TRF2ZVTMOHUDFPI5Y2TWSSFFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Progressive Differentiable Architecture Search: Bridging the Depth Gap between Search and Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jun Wu, Lingxi Xie, Qi Tian, Xin Chen","submitted_at":"2019-04-29T14:59:28Z","abstract_excerpt":"Recently, differentiable search methods have made major progress in reducing the computational costs of neural architecture search. However, these approaches often report lower accuracy in evaluating the searched architecture or transferring it to another dataset. This is arguably due to the large gap between the architecture depths in search and evaluation scenarios. In this paper, we present an efficient algorithm which allows the depth of searched architectures to grow gradually during the training procedure. This brings two issues, namely, heavier computational overheads and weaker search "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12760","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:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yB7/vOJitN6jeCi8kZxUan9OqvEbQ+zHYJZ3KQRNl+3p+tMG0gc/VLVyvT8P7htXjaCLLNlrbxWJoXF6bRtbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:25:50.838693Z"},"content_sha256":"bab7b8fbca868c07fde968e5757e789ee92e00b3b5254420a26d173d001cf70e","schema_version":"1.0","event_id":"sha256:bab7b8fbca868c07fde968e5757e789ee92e00b3b5254420a26d173d001cf70e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS/bundle.json","state_url":"https://pith.science/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS/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-20T01:25:50Z","links":{"resolver":"https://pith.science/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS","bundle":"https://pith.science/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS/bundle.json","state":"https://pith.science/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TRF2ZVTMOHUDFPI5Y2TWSSFFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5TRF2ZVTMOHUDFPI5Y2TWSSFFS","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":"2ee4e3e1a032aa4c2dceb57252b23cbb576389e452db9dc523731ef3dbc4d312","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-29T14:59:28Z","title_canon_sha256":"100298b2c895db6b5a9b21eb5403ab19a0a32e1d19e4c5dd15951e705feb6629"},"schema_version":"1.0","source":{"id":"1904.12760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12760","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12760v1","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12760","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"5TRF2ZVTMOHU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5TRF2ZVTMOHUDFPI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5TRF2ZVT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:bab7b8fbca868c07fde968e5757e789ee92e00b3b5254420a26d173d001cf70e","target":"graph","created_at":"2026-05-17T23:47:34Z","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":"Recently, differentiable search methods have made major progress in reducing the computational costs of neural architecture search. However, these approaches often report lower accuracy in evaluating the searched architecture or transferring it to another dataset. This is arguably due to the large gap between the architecture depths in search and evaluation scenarios. In this paper, we present an efficient algorithm which allows the depth of searched architectures to grow gradually during the training procedure. This brings two issues, namely, heavier computational overheads and weaker search ","authors_text":"Jun Wu, Lingxi Xie, Qi Tian, Xin Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-29T14:59:28Z","title":"Progressive Differentiable Architecture Search: Bridging the Depth Gap between Search and Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12760","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:efefbcdd289b623523e5c56f74ac1a3a70f85fad3d0b9accb1f8d2a5f81d1395","target":"record","created_at":"2026-05-17T23:47:34Z","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":"2ee4e3e1a032aa4c2dceb57252b23cbb576389e452db9dc523731ef3dbc4d312","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-29T14:59:28Z","title_canon_sha256":"100298b2c895db6b5a9b21eb5403ab19a0a32e1d19e4c5dd15951e705feb6629"},"schema_version":"1.0","source":{"id":"1904.12760","kind":"arxiv","version":1}},"canonical_sha256":"ece25d66b3638f4195e8ee353b4a452c917f8c8ab969dd5bc1b8a4196d21761c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ece25d66b3638f4195e8ee353b4a452c917f8c8ab969dd5bc1b8a4196d21761c","first_computed_at":"2026-05-17T23:47:34.204523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:34.204523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuoQqHFUakWZnqiOFFAEwzqn6fKo7AcxZxmzGN0nLzpaeywW0nNdnAfhgHHQ3bozbl7Bso3RY+EWOnV8A7VCBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:34.205009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efefbcdd289b623523e5c56f74ac1a3a70f85fad3d0b9accb1f8d2a5f81d1395","sha256:bab7b8fbca868c07fde968e5757e789ee92e00b3b5254420a26d173d001cf70e"],"state_sha256":"503dbbeb75e0c144700731864605b6789a0a83233073caa01a59db67f747d2c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+636L9YChfjjWqLhV8qq+xeQBucI3rKaQFBbk5bOsM71+9lPsP9Fgc21njXN8CXjsX8D7WeTSXV+wLs7S4wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:25:50.842579Z","bundle_sha256":"fed7acc97d1961c786b29304eb8b6c996187ea1b255f549168434ed3361edba4"}}