{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XKJDEQ7MC33IBEDG5UKVNTFIBI","short_pith_number":"pith:XKJDEQ7M","schema_version":"1.0","canonical_sha256":"ba923243ec16f6809066ed1556cca80a283c1dd95784f1cf251f946fdcb6afa5","source":{"kind":"arxiv","id":"2005.06149","version":1},"attestation_state":"computed","paper":{"title":"DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Xu, Jiliang Tang, Wei Jin, Yaxin Li","submitted_at":"2020-05-13T04:43:46Z","abstract_excerpt":"DeepRobust is a PyTorch adversarial learning library which aims to build a comprehensive and easy-to-use platform to foster this research field. It currently contains more than 10 attack algorithms and 8 defense algorithms in image domain and 9 attack algorithms and 4 defense algorithms in graph domain, under a variety of deep learning architectures. In this manual, we introduce the main contents of DeepRobust with detailed instructions. The library is kept updated and can be found at https://github.com/DSE-MSU/DeepRobust."},"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":"2005.06149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-13T04:43:46Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"3eb57263ec6a6e66fc6c9107cc608937ac56999ac07864faeb900ac6efe10d38","abstract_canon_sha256":"9b7518df5c6894de66f12e5436ec216f8dc29b9568e5afce58656aa8bc4ac519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:32.487752Z","signature_b64":"0/KnwdYNMibT6TXK1xVUu32xmR6GeHV6q9axIacBuBMXH/zY5fYk57VDy9gHwB3W7pdWFeu2mvIaEiCVzF/6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba923243ec16f6809066ed1556cca80a283c1dd95784f1cf251f946fdcb6afa5","last_reissued_at":"2026-07-05T01:02:32.487256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:32.487256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Xu, Jiliang Tang, Wei Jin, Yaxin Li","submitted_at":"2020-05-13T04:43:46Z","abstract_excerpt":"DeepRobust is a PyTorch adversarial learning library which aims to build a comprehensive and easy-to-use platform to foster this research field. It currently contains more than 10 attack algorithms and 8 defense algorithms in image domain and 9 attack algorithms and 4 defense algorithms in graph domain, under a variety of deep learning architectures. In this manual, we introduce the main contents of DeepRobust with detailed instructions. The library is kept updated and can be found at https://github.com/DSE-MSU/DeepRobust."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.06149","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/2005.06149/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":"2005.06149","created_at":"2026-07-05T01:02:32.487338+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.06149v1","created_at":"2026-07-05T01:02:32.487338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.06149","created_at":"2026-07-05T01:02:32.487338+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKJDEQ7MC33I","created_at":"2026-07-05T01:02:32.487338+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKJDEQ7MC33IBEDG","created_at":"2026-07-05T01:02:32.487338+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKJDEQ7M","created_at":"2026-07-05T01:02:32.487338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13022","citing_title":"Quality-Preserving Imperceptible Adversarial Attack on Skeleton-based Human Action Recognition","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05534","citing_title":"Adversarial Graph Neural Network Benchmarks: Towards Practical and Fair Evaluation","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11257","citing_title":"Unified Graph Prompt Learning via Low-Rank Graph Message Prompting","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI","json":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI.json","graph_json":"https://pith.science/api/pith-number/XKJDEQ7MC33IBEDG5UKVNTFIBI/graph.json","events_json":"https://pith.science/api/pith-number/XKJDEQ7MC33IBEDG5UKVNTFIBI/events.json","paper":"https://pith.science/paper/XKJDEQ7M"},"agent_actions":{"view_html":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI","download_json":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI.json","view_paper":"https://pith.science/paper/XKJDEQ7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.06149&json=true","fetch_graph":"https://pith.science/api/pith-number/XKJDEQ7MC33IBEDG5UKVNTFIBI/graph.json","fetch_events":"https://pith.science/api/pith-number/XKJDEQ7MC33IBEDG5UKVNTFIBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI/action/storage_attestation","attest_author":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI/action/author_attestation","sign_citation":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI/action/citation_signature","submit_replication":"https://pith.science/pith/XKJDEQ7MC33IBEDG5UKVNTFIBI/action/replication_record"}},"created_at":"2026-07-05T01:02:32.487338+00:00","updated_at":"2026-07-05T01:02:32.487338+00:00"}