{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EOIUSTR4NA3TIZV4TVKIFCEJOD","short_pith_number":"pith:EOIUSTR4","canonical_record":{"source":{"id":"1905.08232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T17:57:57Z","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"title_canon_sha256":"1fe268bbfc6d737a97a5ab5dfc7631aaba371e170505982e899340dcc887f824","abstract_canon_sha256":"d1e971ec9363a747865deb4db32e01422c846162e3700702a1fb9975893887e0"},"schema_version":"1.0"},"canonical_sha256":"2391494e3c68373466bc9d5482888970df93f183016de3263a77b9db3669a110","source":{"kind":"arxiv","id":"1905.08232","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08232","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08232v2","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08232","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"EOIUSTR4NA3T","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"pith_short_16","alias_value":"EOIUSTR4NA3TIZV4","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"pith_short_8","alias_value":"EOIUSTR4","created_at":"2026-07-05T00:42:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EOIUSTR4NA3TIZV4TVKIFCEJOD","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T17:57:57Z","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"title_canon_sha256":"1fe268bbfc6d737a97a5ab5dfc7631aaba371e170505982e899340dcc887f824","abstract_canon_sha256":"d1e971ec9363a747865deb4db32e01422c846162e3700702a1fb9975893887e0"},"schema_version":"1.0"},"canonical_sha256":"2391494e3c68373466bc9d5482888970df93f183016de3263a77b9db3669a110","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:52.237282Z","signature_b64":"t3AIlyL7j+gBTttEz8VQ6fmVvwVw8bo4lLDduNn5s52J5iTW3EWxRSztXy5DR3uWL76gTJx+nLRy1ZpSW7XYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2391494e3c68373466bc9d5482888970df93f183016de3263a77b9db3669a110","last_reissued_at":"2026-07-05T00:42:52.236891Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:52.236891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08232","source_version":2,"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-07-05T00:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5+Xh1vP8TbKTpRuRg0xfA2hMi0ZFeFN8FukeJrOh5FJfGu5GYv408jb0Uk7IpzBiCFSqj7UHrqKzIVhZgAjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:28:34.894125Z"},"content_sha256":"78e9329413cd7ca3f5832b8c375eda30f4229fa4bf033e058bb2fbfcc6cbcd54","schema_version":"1.0","event_id":"sha256:78e9329413cd7ca3f5832b8c375eda30f4229fa4bf033e058bb2fbfcc6cbcd54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EOIUSTR4NA3TIZV4TVKIFCEJOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarially robust transfer learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Shafahi, Amin Ghiasi, Chen Zhu, Christoph Studer, David Jacobs, Parsa Saadatpanah, Tom Goldstein","submitted_at":"2019-05-20T17:57:57Z","abstract_excerpt":"Transfer learning, in which a network is trained on one task and re-purposed on another, is often used to produce neural network classifiers when data is scarce or full-scale training is too costly. When the goal is to produce a model that is not only accurate but also adversarially robust, data scarcity and computational limitations become even more cumbersome. We consider robust transfer learning, in which we transfer not only performance but also robustness from a source model to a target domain. We start by observing that robust networks contain robust feature extractors. By training class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08232","kind":"arxiv","version":2},"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/1905.08232/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"},"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-07-05T00:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUAzV5ud6j9gnQmPlYwjEuKFB6kZtjepz+59FWT15oZRSrRr7wdpOLQY+42JWmHqBzxHfzasAbNAxIZGdtTHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:28:34.894664Z"},"content_sha256":"e2963aacd4dba8e7f39397bc5f24a9b7f26dcf9a509d050394c33d128516d9ee","schema_version":"1.0","event_id":"sha256:e2963aacd4dba8e7f39397bc5f24a9b7f26dcf9a509d050394c33d128516d9ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD/bundle.json","state_url":"https://pith.science/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD/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-08-19T07:28:34Z","links":{"resolver":"https://pith.science/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD","bundle":"https://pith.science/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD/bundle.json","state":"https://pith.science/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EOIUSTR4NA3TIZV4TVKIFCEJOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EOIUSTR4NA3TIZV4TVKIFCEJOD","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":"d1e971ec9363a747865deb4db32e01422c846162e3700702a1fb9975893887e0","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T17:57:57Z","title_canon_sha256":"1fe268bbfc6d737a97a5ab5dfc7631aaba371e170505982e899340dcc887f824"},"schema_version":"1.0","source":{"id":"1905.08232","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08232","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08232v2","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08232","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"EOIUSTR4NA3T","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"pith_short_16","alias_value":"EOIUSTR4NA3TIZV4","created_at":"2026-07-05T00:42:52Z"},{"alias_kind":"pith_short_8","alias_value":"EOIUSTR4","created_at":"2026-07-05T00:42:52Z"}],"graph_snapshots":[{"event_id":"sha256:e2963aacd4dba8e7f39397bc5f24a9b7f26dcf9a509d050394c33d128516d9ee","target":"graph","created_at":"2026-07-05T00:42:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.08232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transfer learning, in which a network is trained on one task and re-purposed on another, is often used to produce neural network classifiers when data is scarce or full-scale training is too costly. When the goal is to produce a model that is not only accurate but also adversarially robust, data scarcity and computational limitations become even more cumbersome. We consider robust transfer learning, in which we transfer not only performance but also robustness from a source model to a target domain. We start by observing that robust networks contain robust feature extractors. By training class","authors_text":"Ali Shafahi, Amin Ghiasi, Chen Zhu, Christoph Studer, David Jacobs, Parsa Saadatpanah, Tom Goldstein","cross_cats":["cs.CR","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T17:57:57Z","title":"Adversarially robust transfer learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08232","kind":"arxiv","version":2},"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:78e9329413cd7ca3f5832b8c375eda30f4229fa4bf033e058bb2fbfcc6cbcd54","target":"record","created_at":"2026-07-05T00:42:52Z","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":"d1e971ec9363a747865deb4db32e01422c846162e3700702a1fb9975893887e0","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T17:57:57Z","title_canon_sha256":"1fe268bbfc6d737a97a5ab5dfc7631aaba371e170505982e899340dcc887f824"},"schema_version":"1.0","source":{"id":"1905.08232","kind":"arxiv","version":2}},"canonical_sha256":"2391494e3c68373466bc9d5482888970df93f183016de3263a77b9db3669a110","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2391494e3c68373466bc9d5482888970df93f183016de3263a77b9db3669a110","first_computed_at":"2026-07-05T00:42:52.236891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:42:52.236891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t3AIlyL7j+gBTttEz8VQ6fmVvwVw8bo4lLDduNn5s52J5iTW3EWxRSztXy5DR3uWL76gTJx+nLRy1ZpSW7XYCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:42:52.237282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08232","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78e9329413cd7ca3f5832b8c375eda30f4229fa4bf033e058bb2fbfcc6cbcd54","sha256:e2963aacd4dba8e7f39397bc5f24a9b7f26dcf9a509d050394c33d128516d9ee"],"state_sha256":"ffe76c0b8ec7ce6320d676719256c5fcd1917402bf88d6f7d5bd17ca3f006c84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQXPH+zX3mceyUUilzJ3MoeQp7Dqt6U4I+m6YnzGiTW8DQ5lRnPgORfRaPVmmN2aIvO4O/KFz+ypinH6v45OBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:28:34.900420Z","bundle_sha256":"c4621fdf5921f897dfc07acd34de576cb316c4a1be213a37e32cc1930bf091ad"}}