{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JRWN6G7UJ6UP4BFHOSXC3Y4POH","short_pith_number":"pith:JRWN6G7U","canonical_record":{"source":{"id":"1906.08031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T12:00:00Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"81ac4061ca2ce70ee6a1c28f9a3ccce535242886ca3bcb988876e28f07ab6dcf","abstract_canon_sha256":"6da925f729c7c7ed5533f4e49cf0fd0e3b16f4520ad5a44886970e11fe0df8d3"},"schema_version":"1.0"},"canonical_sha256":"4c6cdf1bf44fa8fe04a774ae2de38f71e5726c01b6b5abe0adeca6a41cfb5be6","source":{"kind":"arxiv","id":"1906.08031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08031","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08031v1","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08031","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"JRWN6G7UJ6UP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRWN6G7UJ6UP4BFH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRWN6G7U","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JRWN6G7UJ6UP4BFHOSXC3Y4POH","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T12:00:00Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"81ac4061ca2ce70ee6a1c28f9a3ccce535242886ca3bcb988876e28f07ab6dcf","abstract_canon_sha256":"6da925f729c7c7ed5533f4e49cf0fd0e3b16f4520ad5a44886970e11fe0df8d3"},"schema_version":"1.0"},"canonical_sha256":"4c6cdf1bf44fa8fe04a774ae2de38f71e5726c01b6b5abe0adeca6a41cfb5be6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:54.816676Z","signature_b64":"WOZ1IOWfhm6TbfXOe0uHEUcAHamBNoFPPHIjcIbR2LEVHyd+9Qr1sD9TEOLXerO9EX8+RYldcx2hRZv5Pb4bDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c6cdf1bf44fa8fe04a774ae2de38f71e5726c01b6b5abe0adeca6a41cfb5be6","last_reissued_at":"2026-05-17T23:42:54.816124Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:54.816124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08031","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:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KZF7ew5zxKEuvyPktK00NyDyLCdriCUkoR41E5lglbxz6I8PhkcBIQGPFwSvsl+49glbDkHKvnzoFoBTqbZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:43:36.864339Z"},"content_sha256":"c2e6db2eca2953575837e126ac308cef71cede8fc6c9afdc21c2a654fb0b64d5","schema_version":"1.0","event_id":"sha256:c2e6db2eca2953575837e126ac308cef71cede8fc6c9afdc21c2a654fb0b64d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JRWN6G7UJ6UP4BFHOSXC3Y4POH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"XNAS: Neural Architecture Search with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Asaf Noy, Itamar Friedman, Lihi Zelnik-Manor, Niv Nayman, Rong Jin, Tal Ridnik","submitted_at":"2019-06-19T12:00:00Z","abstract_excerpt":"This paper introduces a novel optimization method for differential neural architecture search, based on the theory of prediction with expert advice. Its optimization criterion is well fitted for an architecture-selection, i.e., it minimizes the regret incurred by a sub-optimal selection of operations. Unlike previous search relaxations, that require hard pruning of architectures, our method is designed to dynamically wipe out inferior architectures and enhance superior ones. It achieves an optimal worst-case regret bound and suggests the use of multiple learning-rates, based on the amount of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08031","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:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4mxYl7uvWMwmV3u4twLx4cLoc2Zq19dDoOl0HElYtbomzxKD23gA/WiRXgT414OJPbBqapuC8bp+9hFrb4EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:43:36.864746Z"},"content_sha256":"2be8a34f8a2ab908b1ec70fcbd57a68960aa3692ab8213792fb4b3a4740e2d6e","schema_version":"1.0","event_id":"sha256:2be8a34f8a2ab908b1ec70fcbd57a68960aa3692ab8213792fb4b3a4740e2d6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH/bundle.json","state_url":"https://pith.science/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH/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-23T15:43:36Z","links":{"resolver":"https://pith.science/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH","bundle":"https://pith.science/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH/bundle.json","state":"https://pith.science/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRWN6G7UJ6UP4BFHOSXC3Y4POH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JRWN6G7UJ6UP4BFHOSXC3Y4POH","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":"6da925f729c7c7ed5533f4e49cf0fd0e3b16f4520ad5a44886970e11fe0df8d3","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T12:00:00Z","title_canon_sha256":"81ac4061ca2ce70ee6a1c28f9a3ccce535242886ca3bcb988876e28f07ab6dcf"},"schema_version":"1.0","source":{"id":"1906.08031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08031","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08031v1","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08031","created_at":"2026-05-17T23:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"JRWN6G7UJ6UP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRWN6G7UJ6UP4BFH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRWN6G7U","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2be8a34f8a2ab908b1ec70fcbd57a68960aa3692ab8213792fb4b3a4740e2d6e","target":"graph","created_at":"2026-05-17T23:42:54Z","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":"This paper introduces a novel optimization method for differential neural architecture search, based on the theory of prediction with expert advice. Its optimization criterion is well fitted for an architecture-selection, i.e., it minimizes the regret incurred by a sub-optimal selection of operations. Unlike previous search relaxations, that require hard pruning of architectures, our method is designed to dynamically wipe out inferior architectures and enhance superior ones. It achieves an optimal worst-case regret bound and suggests the use of multiple learning-rates, based on the amount of i","authors_text":"Asaf Noy, Itamar Friedman, Lihi Zelnik-Manor, Niv Nayman, Rong Jin, Tal Ridnik","cross_cats":["cs.CV","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T12:00:00Z","title":"XNAS: Neural Architecture Search with Expert Advice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08031","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:c2e6db2eca2953575837e126ac308cef71cede8fc6c9afdc21c2a654fb0b64d5","target":"record","created_at":"2026-05-17T23:42:54Z","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":"6da925f729c7c7ed5533f4e49cf0fd0e3b16f4520ad5a44886970e11fe0df8d3","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-19T12:00:00Z","title_canon_sha256":"81ac4061ca2ce70ee6a1c28f9a3ccce535242886ca3bcb988876e28f07ab6dcf"},"schema_version":"1.0","source":{"id":"1906.08031","kind":"arxiv","version":1}},"canonical_sha256":"4c6cdf1bf44fa8fe04a774ae2de38f71e5726c01b6b5abe0adeca6a41cfb5be6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c6cdf1bf44fa8fe04a774ae2de38f71e5726c01b6b5abe0adeca6a41cfb5be6","first_computed_at":"2026-05-17T23:42:54.816124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:54.816124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WOZ1IOWfhm6TbfXOe0uHEUcAHamBNoFPPHIjcIbR2LEVHyd+9Qr1sD9TEOLXerO9EX8+RYldcx2hRZv5Pb4bDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:54.816676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2e6db2eca2953575837e126ac308cef71cede8fc6c9afdc21c2a654fb0b64d5","sha256:2be8a34f8a2ab908b1ec70fcbd57a68960aa3692ab8213792fb4b3a4740e2d6e"],"state_sha256":"cff1de488e0702b7993bd681965975599036ce91cec7bd4634a8961c4bf78723"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FvwK2nNZOQ/x1/85jW1vN/UA0clK7Hv+a4a78sNonoLsLn+AM18GvpJGKFRu+fCoOanfpU6KeSUX2eZEXrzrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:43:36.867639Z","bundle_sha256":"f65b5590a584ce4501bf420f28460d245d9ba1effe11f94042f7906f2d604628"}}