{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IMKUYUBDKZHWAUZ2JBVQYO3255","short_pith_number":"pith:IMKUYUBD","schema_version":"1.0","canonical_sha256":"43154c5023564f60533a486b0c3b7aef46ca4ebd69bba491e264ea48cda94273","source":{"kind":"arxiv","id":"2505.15833","version":1},"attestation_state":"computed","paper":{"title":"Adversarially Robust Spiking Neural Networks with Sparse Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.NE","authors_text":"Mathias Schmolli, Maximilian Baronig, Ozan \\\"Ozdenizci, Robert Legenstein","submitted_at":"2025-05-16T07:52:51Z","abstract_excerpt":"Deployment of deep neural networks in resource-constrained embedded systems requires innovative algorithmic solutions to facilitate their energy and memory efficiency. To further ensure the reliability of these systems against malicious actors, recent works have extensively studied adversarial robustness of existing architectures. Our work focuses on the intersection of adversarial robustness, memory- and energy-efficiency in neural networks. We introduce a neural network conversion algorithm designed to produce sparse and adversarially robust spiking neural networks (SNNs) by leveraging the s"},"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":"2505.15833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-05-16T07:52:51Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"d51214dbb7e029e05553688cedcedd66654b586dccfbb55d54c481f96d3fcee6","abstract_canon_sha256":"cac64541d4af60c175fa66ed3a41b158315dc959054113a989a5f425c3f72f05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:25.939290Z","signature_b64":"V3RCJ13tO2Kqrq4N3PLS/NiQkwlPYyJX8zQK81AeImTwvziuxaV5TlOeD5cdi2HxU7pWRDV9sGyk/mXjG727AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43154c5023564f60533a486b0c3b7aef46ca4ebd69bba491e264ea48cda94273","last_reissued_at":"2026-07-05T11:07:25.938838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:25.938838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarially Robust Spiking Neural Networks with Sparse Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.NE","authors_text":"Mathias Schmolli, Maximilian Baronig, Ozan \\\"Ozdenizci, Robert Legenstein","submitted_at":"2025-05-16T07:52:51Z","abstract_excerpt":"Deployment of deep neural networks in resource-constrained embedded systems requires innovative algorithmic solutions to facilitate their energy and memory efficiency. To further ensure the reliability of these systems against malicious actors, recent works have extensively studied adversarial robustness of existing architectures. Our work focuses on the intersection of adversarial robustness, memory- and energy-efficiency in neural networks. We introduce a neural network conversion algorithm designed to produce sparse and adversarially robust spiking neural networks (SNNs) by leveraging the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15833","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/2505.15833/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":"2505.15833","created_at":"2026-07-05T11:07:25.938891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15833v1","created_at":"2026-07-05T11:07:25.938891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15833","created_at":"2026-07-05T11:07:25.938891+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMKUYUBDKZHW","created_at":"2026-07-05T11:07:25.938891+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMKUYUBDKZHWAUZ2","created_at":"2026-07-05T11:07:25.938891+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMKUYUBD","created_at":"2026-07-05T11:07:25.938891+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255","json":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255.json","graph_json":"https://pith.science/api/pith-number/IMKUYUBDKZHWAUZ2JBVQYO3255/graph.json","events_json":"https://pith.science/api/pith-number/IMKUYUBDKZHWAUZ2JBVQYO3255/events.json","paper":"https://pith.science/paper/IMKUYUBD"},"agent_actions":{"view_html":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255","download_json":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255.json","view_paper":"https://pith.science/paper/IMKUYUBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15833&json=true","fetch_graph":"https://pith.science/api/pith-number/IMKUYUBDKZHWAUZ2JBVQYO3255/graph.json","fetch_events":"https://pith.science/api/pith-number/IMKUYUBDKZHWAUZ2JBVQYO3255/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255/action/storage_attestation","attest_author":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255/action/author_attestation","sign_citation":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255/action/citation_signature","submit_replication":"https://pith.science/pith/IMKUYUBDKZHWAUZ2JBVQYO3255/action/replication_record"}},"created_at":"2026-07-05T11:07:25.938891+00:00","updated_at":"2026-07-05T11:07:25.938891+00:00"}