{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4VMBMWXWOCV6UHWOEE22CHG3ZG","short_pith_number":"pith:4VMBMWXW","canonical_record":{"source":{"id":"1804.02485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-07T00:11:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81e3f15b17699319738fc41efe78e91d104ed1153e8c0215ee8a1b90a28eca8b","abstract_canon_sha256":"b7eabff58ea959ec1506b732a1c3f397b243787bf66a8619c600a608024932b2"},"schema_version":"1.0"},"canonical_sha256":"e558165af670abea1ece2135a11cdbc99be6b2b0217c0a752c50f713c9248974","source":{"kind":"arxiv","id":"1804.02485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02485","created_at":"2026-05-18T00:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02485v1","created_at":"2026-05-18T00:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02485","created_at":"2026-05-18T00:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"4VMBMWXWOCV6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4VMBMWXWOCV6UHWO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4VMBMWXW","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4VMBMWXWOCV6UHWOEE22CHG3ZG","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-07T00:11:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81e3f15b17699319738fc41efe78e91d104ed1153e8c0215ee8a1b90a28eca8b","abstract_canon_sha256":"b7eabff58ea959ec1506b732a1c3f397b243787bf66a8619c600a608024932b2"},"schema_version":"1.0"},"canonical_sha256":"e558165af670abea1ece2135a11cdbc99be6b2b0217c0a752c50f713c9248974","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:59.353867Z","signature_b64":"/K7dRx3ala1ZuUzwjVhW1iK8KoMqkAJD+g8QuZmaKZpIUL/UepwGzP21CKEJ4WAI2qtbxGR4zVoSOmDnEi7BAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e558165af670abea1ece2135a11cdbc99be6b2b0217c0a752c50f713c9248974","last_reissued_at":"2026-05-18T00:18:59.352344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:59.352344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02485","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-18T00:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kp9S9ucz4XEQOZf0f6CDEZHoYTlvdrnOH4FjYNEwOnAs7zbBV95yMHihN9VjbkhFIXt3eyxecJQaiZnY+LebBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:30:30.300467Z"},"content_sha256":"84b98f43a53b46fec151aee49ae5271366db8de88f9f3468481c3367097f7107","schema_version":"1.0","event_id":"sha256:84b98f43a53b46fec151aee49ae5271366db8de88f9f3468481c3367097f7107"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4VMBMWXWOCV6UHWOEE22CHG3ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fortified Networks: Improving the Robustness of Deep Networks by Modeling the Manifold of Hidden Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Lamb, Anirudh Goyal, Dmitriy Serdyuk, Ioannis Mitliagkas, Jonathan Binas, Sandeep Subramanian, Yoshua Bengio","submitted_at":"2018-04-07T00:11:05Z","abstract_excerpt":"Deep networks have achieved impressive results across a variety of important tasks. However a known weakness is a failure to perform well when evaluated on data which differ from the training distribution, even if these differences are very small, as is the case with adversarial examples. We propose Fortified Networks, a simple transformation of existing networks, which fortifies the hidden layers in a deep network by identifying when the hidden states are off of the data manifold, and maps these hidden states back to parts of the data manifold where the network performs well. Our principal co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02485","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-18T00:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHaKIXItL5IL+FolBzmGc0qp7/A9pe4QPyRJ2O2VKYuLRITVWkqBO3JvpGdYq6eTofy+2uksX/0rjdRda9niDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:30:30.300947Z"},"content_sha256":"544e9fcdf3a04a721e1ac0c97d2737062952c5af3b5e95ecebade985646177c7","schema_version":"1.0","event_id":"sha256:544e9fcdf3a04a721e1ac0c97d2737062952c5af3b5e95ecebade985646177c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG/bundle.json","state_url":"https://pith.science/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG/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-03T18:30:30Z","links":{"resolver":"https://pith.science/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG","bundle":"https://pith.science/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG/bundle.json","state":"https://pith.science/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VMBMWXWOCV6UHWOEE22CHG3ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4VMBMWXWOCV6UHWOEE22CHG3ZG","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":"b7eabff58ea959ec1506b732a1c3f397b243787bf66a8619c600a608024932b2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-07T00:11:05Z","title_canon_sha256":"81e3f15b17699319738fc41efe78e91d104ed1153e8c0215ee8a1b90a28eca8b"},"schema_version":"1.0","source":{"id":"1804.02485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02485","created_at":"2026-05-18T00:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02485v1","created_at":"2026-05-18T00:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02485","created_at":"2026-05-18T00:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"4VMBMWXWOCV6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4VMBMWXWOCV6UHWO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4VMBMWXW","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:544e9fcdf3a04a721e1ac0c97d2737062952c5af3b5e95ecebade985646177c7","target":"graph","created_at":"2026-05-18T00:18:59Z","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":"Deep networks have achieved impressive results across a variety of important tasks. However a known weakness is a failure to perform well when evaluated on data which differ from the training distribution, even if these differences are very small, as is the case with adversarial examples. We propose Fortified Networks, a simple transformation of existing networks, which fortifies the hidden layers in a deep network by identifying when the hidden states are off of the data manifold, and maps these hidden states back to parts of the data manifold where the network performs well. Our principal co","authors_text":"Alex Lamb, Anirudh Goyal, Dmitriy Serdyuk, Ioannis Mitliagkas, Jonathan Binas, Sandeep Subramanian, Yoshua Bengio","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-07T00:11:05Z","title":"Fortified Networks: Improving the Robustness of Deep Networks by Modeling the Manifold of Hidden Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02485","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:84b98f43a53b46fec151aee49ae5271366db8de88f9f3468481c3367097f7107","target":"record","created_at":"2026-05-18T00:18:59Z","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":"b7eabff58ea959ec1506b732a1c3f397b243787bf66a8619c600a608024932b2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-07T00:11:05Z","title_canon_sha256":"81e3f15b17699319738fc41efe78e91d104ed1153e8c0215ee8a1b90a28eca8b"},"schema_version":"1.0","source":{"id":"1804.02485","kind":"arxiv","version":1}},"canonical_sha256":"e558165af670abea1ece2135a11cdbc99be6b2b0217c0a752c50f713c9248974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e558165af670abea1ece2135a11cdbc99be6b2b0217c0a752c50f713c9248974","first_computed_at":"2026-05-18T00:18:59.352344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:59.352344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/K7dRx3ala1ZuUzwjVhW1iK8KoMqkAJD+g8QuZmaKZpIUL/UepwGzP21CKEJ4WAI2qtbxGR4zVoSOmDnEi7BAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:59.353867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84b98f43a53b46fec151aee49ae5271366db8de88f9f3468481c3367097f7107","sha256:544e9fcdf3a04a721e1ac0c97d2737062952c5af3b5e95ecebade985646177c7"],"state_sha256":"cb52955019fb3f8bd1069e9fef176c98d3a350fc1308eee29d1abd66365546b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"og4+kRLKcUXgESshTezfyRoYZu3FmtzgHM13gPIbRYEB6gaBthsVTpfTAbXGIcIErK9HcWPhdbPhJnWypsNvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:30:30.304071Z","bundle_sha256":"565147e03144c7c233caa4203ea31d9074490218365f9563d5aef219b029a96f"}}