{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4G5FELHEEFHRHW6BHP4EFX2G2Y","short_pith_number":"pith:4G5FELHE","schema_version":"1.0","canonical_sha256":"e1ba522ce4214f13dbc13bf842df46d6217a1140bb7f634bac78fd813aad2f10","source":{"kind":"arxiv","id":"2403.13134","version":1},"attestation_state":"computed","paper":{"title":"Robust NAS under adversarial training: benchmark, theory, and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl-Johann Simon-Gabriel, Fanghui Liu, Grigorios G Chrysos, Volkan Cevher, Yongtao Wu","submitted_at":"2024-03-19T20:10:23Z","abstract_excerpt":"Recent developments in neural architecture search (NAS) emphasize the significance of considering robust architectures against malicious data. However, there is a notable absence of benchmark evaluations and theoretical guarantees for searching these robust architectures, especially when adversarial training is considered. In this work, we aim to address these two challenges, making twofold contributions. First, we release a comprehensive data set that encompasses both clean accuracy and robust accuracy for a vast array of adversarially trained networks from the NAS-Bench-201 search space on i"},"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":"2403.13134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-19T20:10:23Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4150d9fd0f275044f9bebbe6c0ec6b7faf9dc2a47b2b83b0869c91de6dd57b27","abstract_canon_sha256":"2e1d375c347994d9479f4f9af815ff78fbebe91e2da960029513141a9c5eeca0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:31.688427Z","signature_b64":"hU5uRps+3yPGOwmDonp6wQPKr4wbY2gcGajI1uqh/AD/JEnp256wT738yhJvP5rPqzswd5JGoCiXpP43fj7LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1ba522ce4214f13dbc13bf842df46d6217a1140bb7f634bac78fd813aad2f10","last_reissued_at":"2026-07-05T07:58:31.687971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:31.687971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust NAS under adversarial training: benchmark, theory, and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl-Johann Simon-Gabriel, Fanghui Liu, Grigorios G Chrysos, Volkan Cevher, Yongtao Wu","submitted_at":"2024-03-19T20:10:23Z","abstract_excerpt":"Recent developments in neural architecture search (NAS) emphasize the significance of considering robust architectures against malicious data. However, there is a notable absence of benchmark evaluations and theoretical guarantees for searching these robust architectures, especially when adversarial training is considered. In this work, we aim to address these two challenges, making twofold contributions. First, we release a comprehensive data set that encompasses both clean accuracy and robust accuracy for a vast array of adversarially trained networks from the NAS-Bench-201 search space on i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.13134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.13134","created_at":"2026-07-05T07:58:31.688035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13134v1","created_at":"2026-07-05T07:58:31.688035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13134","created_at":"2026-07-05T07:58:31.688035+00:00"},{"alias_kind":"pith_short_12","alias_value":"4G5FELHEEFHR","created_at":"2026-07-05T07:58:31.688035+00:00"},{"alias_kind":"pith_short_16","alias_value":"4G5FELHEEFHRHW6B","created_at":"2026-07-05T07:58:31.688035+00:00"},{"alias_kind":"pith_short_8","alias_value":"4G5FELHE","created_at":"2026-07-05T07:58:31.688035+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15014","citing_title":"On Accelerating Edge AI: Optimizing Resource-Constrained Environments","ref_index":118,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y","json":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y.json","graph_json":"https://pith.science/api/pith-number/4G5FELHEEFHRHW6BHP4EFX2G2Y/graph.json","events_json":"https://pith.science/api/pith-number/4G5FELHEEFHRHW6BHP4EFX2G2Y/events.json","paper":"https://pith.science/paper/4G5FELHE"},"agent_actions":{"view_html":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y","download_json":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y.json","view_paper":"https://pith.science/paper/4G5FELHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13134&json=true","fetch_graph":"https://pith.science/api/pith-number/4G5FELHEEFHRHW6BHP4EFX2G2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/4G5FELHEEFHRHW6BHP4EFX2G2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y/action/storage_attestation","attest_author":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y/action/author_attestation","sign_citation":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y/action/citation_signature","submit_replication":"https://pith.science/pith/4G5FELHEEFHRHW6BHP4EFX2G2Y/action/replication_record"}},"created_at":"2026-07-05T07:58:31.688035+00:00","updated_at":"2026-07-05T07:58:31.688035+00:00"}