{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BCOLC5CIPXUDMTGK3V3QLV4CHN","short_pith_number":"pith:BCOLC5CI","canonical_record":{"source":{"id":"1902.05116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-13T20:38:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db310d0f35c1c091ed71567c3ddfa702e4899e1a15fb3e680277f450b30c9690","abstract_canon_sha256":"abd395c110daa9d4dc54fc34a9e41043b21b915d68bddd3014c293d8a7b2444f"},"schema_version":"1.0"},"canonical_sha256":"089cb174487de8364ccadd7705d7823b447ff0ac8a89a1d3f5dbbfa2bab562a9","source":{"kind":"arxiv","id":"1902.05116","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05116","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05116v1","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05116","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"pith_short_12","alias_value":"BCOLC5CIPXUD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BCOLC5CIPXUDMTGK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BCOLC5CI","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BCOLC5CIPXUDMTGK3V3QLV4CHN","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-13T20:38:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db310d0f35c1c091ed71567c3ddfa702e4899e1a15fb3e680277f450b30c9690","abstract_canon_sha256":"abd395c110daa9d4dc54fc34a9e41043b21b915d68bddd3014c293d8a7b2444f"},"schema_version":"1.0"},"canonical_sha256":"089cb174487de8364ccadd7705d7823b447ff0ac8a89a1d3f5dbbfa2bab562a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:01.894402Z","signature_b64":"3Gi3oIKcKvPn+OpVoc5FlP/CBiTmAo/2sbVPNK40UOcPoI+1smptS/X+zOd2mZSXQtMUow4IHsRXdnRzJOhlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"089cb174487de8364ccadd7705d7823b447ff0ac8a89a1d3f5dbbfa2bab562a9","last_reissued_at":"2026-05-17T23:54:01.893870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:01.893870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05116","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:54:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Giq+WPF1eFlms88KefL0vioIpiXksO/iUkWwwZm8t7PHwjIRFO2679i0EsMqIlhPXkFJZw7Xc6ugYToO0Yg3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:08:27.059219Z"},"content_sha256":"c87e3511881f4e570e2fa3f07a92b3815b9e7549604b9d2d13b7a7c60888aca7","schema_version":"1.0","event_id":"sha256:c87e3511881f4e570e2fa3f07a92b3815b9e7549604b9d2d13b7a7c60888aca7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BCOLC5CIPXUDMTGK3V3QLV4CHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francesco Paolo Casale, Jonathan Gordon, Nicolo Fusi","submitted_at":"2019-02-13T20:38:18Z","abstract_excerpt":"In neural architecture search (NAS), the space of neural network architectures is automatically explored to maximize predictive accuracy for a given task. Despite the success of recent approaches, most existing methods cannot be directly applied to large scale problems because of their prohibitive computational complexity or high memory usage. In this work, we propose a Probabilistic approach to neural ARchitecture SEarCh (PARSEC) that drastically reduces memory requirements while maintaining state-of-the-art computational complexity, making it possible to directly search over more complex arc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05116","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:54:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYmrR+CsFBY3e7qgYh5FtCvgKha/grD1hiMMzVWh0PZtJ7wFg7LujGWY0UT5vL9Drlsci92uoCvbOlnjQEoHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:08:27.059585Z"},"content_sha256":"921a8d9ea7837e7a3a03d3af9f841fd53d410612ce7767b783d31e77b0a12da6","schema_version":"1.0","event_id":"sha256:921a8d9ea7837e7a3a03d3af9f841fd53d410612ce7767b783d31e77b0a12da6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN/bundle.json","state_url":"https://pith.science/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN/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-30T06:08:27Z","links":{"resolver":"https://pith.science/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN","bundle":"https://pith.science/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN/bundle.json","state":"https://pith.science/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCOLC5CIPXUDMTGK3V3QLV4CHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BCOLC5CIPXUDMTGK3V3QLV4CHN","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":"abd395c110daa9d4dc54fc34a9e41043b21b915d68bddd3014c293d8a7b2444f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-13T20:38:18Z","title_canon_sha256":"db310d0f35c1c091ed71567c3ddfa702e4899e1a15fb3e680277f450b30c9690"},"schema_version":"1.0","source":{"id":"1902.05116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05116","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05116v1","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05116","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"pith_short_12","alias_value":"BCOLC5CIPXUD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BCOLC5CIPXUDMTGK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BCOLC5CI","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:921a8d9ea7837e7a3a03d3af9f841fd53d410612ce7767b783d31e77b0a12da6","target":"graph","created_at":"2026-05-17T23:54:01Z","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":"In neural architecture search (NAS), the space of neural network architectures is automatically explored to maximize predictive accuracy for a given task. Despite the success of recent approaches, most existing methods cannot be directly applied to large scale problems because of their prohibitive computational complexity or high memory usage. In this work, we propose a Probabilistic approach to neural ARchitecture SEarCh (PARSEC) that drastically reduces memory requirements while maintaining state-of-the-art computational complexity, making it possible to directly search over more complex arc","authors_text":"Francesco Paolo Casale, Jonathan Gordon, Nicolo Fusi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-13T20:38:18Z","title":"Probabilistic Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05116","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:c87e3511881f4e570e2fa3f07a92b3815b9e7549604b9d2d13b7a7c60888aca7","target":"record","created_at":"2026-05-17T23:54:01Z","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":"abd395c110daa9d4dc54fc34a9e41043b21b915d68bddd3014c293d8a7b2444f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-13T20:38:18Z","title_canon_sha256":"db310d0f35c1c091ed71567c3ddfa702e4899e1a15fb3e680277f450b30c9690"},"schema_version":"1.0","source":{"id":"1902.05116","kind":"arxiv","version":1}},"canonical_sha256":"089cb174487de8364ccadd7705d7823b447ff0ac8a89a1d3f5dbbfa2bab562a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"089cb174487de8364ccadd7705d7823b447ff0ac8a89a1d3f5dbbfa2bab562a9","first_computed_at":"2026-05-17T23:54:01.893870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:01.893870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Gi3oIKcKvPn+OpVoc5FlP/CBiTmAo/2sbVPNK40UOcPoI+1smptS/X+zOd2mZSXQtMUow4IHsRXdnRzJOhlCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:01.894402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c87e3511881f4e570e2fa3f07a92b3815b9e7549604b9d2d13b7a7c60888aca7","sha256:921a8d9ea7837e7a3a03d3af9f841fd53d410612ce7767b783d31e77b0a12da6"],"state_sha256":"6452edc143bf3acc48b34d3cbbd199117d6ea9af99c9f1a0ff8665211307de58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Xs9ixsdj8UScI/AhNfL4LqWBf6A4HdJ2JV5KP18QoTrCUjb4//n6Tku97mujWPHylUKrz5J47hO4ftoSPvVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:08:27.061657Z","bundle_sha256":"019efeb5cb4163bdfb5890d62887885981a64cb1591b8dab44aac38d54462430"}}