{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JGWRJTQBQXO7KSYCAPDO5LLD76","short_pith_number":"pith:JGWRJTQB","canonical_record":{"source":{"id":"2311.06103","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T15:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"9e9ae28393b3953027200be3544c5c8abeb0a9f889eb455869ff330265567723","abstract_canon_sha256":"327a350255bd36723cb88e8e353151ce5f07e79c5360d5f005dc54fad5c202eb"},"schema_version":"1.0"},"canonical_sha256":"49ad14ce0185ddf54b0203c6eead63ffa1eae824d7d9b1d4156230a587d3569b","source":{"kind":"arxiv","id":"2311.06103","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06103","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06103v2","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06103","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"pith_short_12","alias_value":"JGWRJTQBQXO7","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"JGWRJTQBQXO7KSYC","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"JGWRJTQB","created_at":"2026-07-05T08:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JGWRJTQBQXO7KSYCAPDO5LLD76","target":"record","payload":{"canonical_record":{"source":{"id":"2311.06103","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T15:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"9e9ae28393b3953027200be3544c5c8abeb0a9f889eb455869ff330265567723","abstract_canon_sha256":"327a350255bd36723cb88e8e353151ce5f07e79c5360d5f005dc54fad5c202eb"},"schema_version":"1.0"},"canonical_sha256":"49ad14ce0185ddf54b0203c6eead63ffa1eae824d7d9b1d4156230a587d3569b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:15.274246Z","signature_b64":"O5q33e1psBTYLjo47YO+duS9GLGn0extKqwCue8c17/Chs32/BS8tQ//SqaduSvgdoyMCveVKM+tWgFOAhzmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ad14ce0185ddf54b0203c6eead63ffa1eae824d7d9b1d4156230a587d3569b","last_reissued_at":"2026-07-05T08:26:15.273659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:15.273659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.06103","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-05T08:26:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OTcO1HsPR4Gde7KowRmsycA3qODUFiwi7kP8OiE3Vr9R4SB01EeEUj94mDamPVCp9lOd+99iuq6L8v0IC9d6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:38:38.481622Z"},"content_sha256":"b58cce940109f4cc11e4b31b0cdd8fd2c068fa7f897d48189d74d0be84c46e49","schema_version":"1.0","event_id":"sha256:b58cce940109f4cc11e4b31b0cdd8fd2c068fa7f897d48189d74d0be84c46e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JGWRJTQBQXO7KSYCAPDO5LLD76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"1-Lipschitz Neural Networks are more expressive with N-Activations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bernd Prach, Christoph H. Lampert","submitted_at":"2023-11-10T15:12:04Z","abstract_excerpt":"A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives for networks with a small Lipschitz constant. Several recent works have focused on how to construct such Lipschitz networks, typically by imposing constraints on the weight matrices. In this work, we study an orthogonal aspect, namely the role of the activation function. We show that commonly used activation functions, such as MaxMin, as well as all piece-wis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06103","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/2311.06103/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-05T08:26:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFeOdxBqDBolECWd4hojB5BtZIpvfW0us/uj9W0JFXWI1WCEbF/hGHJ0KUbkBA3UNM5jde/pJcFzNFKqsMvDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:38:38.482330Z"},"content_sha256":"c1533ca169fa0019fe61f03f97d6293821d913a15cb59e67a9bc1cf5137dc268","schema_version":"1.0","event_id":"sha256:c1533ca169fa0019fe61f03f97d6293821d913a15cb59e67a9bc1cf5137dc268"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGWRJTQBQXO7KSYCAPDO5LLD76/bundle.json","state_url":"https://pith.science/pith/JGWRJTQBQXO7KSYCAPDO5LLD76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGWRJTQBQXO7KSYCAPDO5LLD76/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-19T13:38:38Z","links":{"resolver":"https://pith.science/pith/JGWRJTQBQXO7KSYCAPDO5LLD76","bundle":"https://pith.science/pith/JGWRJTQBQXO7KSYCAPDO5LLD76/bundle.json","state":"https://pith.science/pith/JGWRJTQBQXO7KSYCAPDO5LLD76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGWRJTQBQXO7KSYCAPDO5LLD76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JGWRJTQBQXO7KSYCAPDO5LLD76","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":"327a350255bd36723cb88e8e353151ce5f07e79c5360d5f005dc54fad5c202eb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T15:12:04Z","title_canon_sha256":"9e9ae28393b3953027200be3544c5c8abeb0a9f889eb455869ff330265567723"},"schema_version":"1.0","source":{"id":"2311.06103","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06103","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06103v2","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06103","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"pith_short_12","alias_value":"JGWRJTQBQXO7","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"JGWRJTQBQXO7KSYC","created_at":"2026-07-05T08:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"JGWRJTQB","created_at":"2026-07-05T08:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:c1533ca169fa0019fe61f03f97d6293821d913a15cb59e67a9bc1cf5137dc268","target":"graph","created_at":"2026-07-05T08:26:15Z","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/2311.06103/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives for networks with a small Lipschitz constant. Several recent works have focused on how to construct such Lipschitz networks, typically by imposing constraints on the weight matrices. In this work, we study an orthogonal aspect, namely the role of the activation function. We show that commonly used activation functions, such as MaxMin, as well as all piece-wis","authors_text":"Bernd Prach, Christoph H. Lampert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T15:12:04Z","title":"1-Lipschitz Neural Networks are more expressive with N-Activations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06103","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:b58cce940109f4cc11e4b31b0cdd8fd2c068fa7f897d48189d74d0be84c46e49","target":"record","created_at":"2026-07-05T08:26:15Z","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":"327a350255bd36723cb88e8e353151ce5f07e79c5360d5f005dc54fad5c202eb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T15:12:04Z","title_canon_sha256":"9e9ae28393b3953027200be3544c5c8abeb0a9f889eb455869ff330265567723"},"schema_version":"1.0","source":{"id":"2311.06103","kind":"arxiv","version":2}},"canonical_sha256":"49ad14ce0185ddf54b0203c6eead63ffa1eae824d7d9b1d4156230a587d3569b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49ad14ce0185ddf54b0203c6eead63ffa1eae824d7d9b1d4156230a587d3569b","first_computed_at":"2026-07-05T08:26:15.273659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:26:15.273659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O5q33e1psBTYLjo47YO+duS9GLGn0extKqwCue8c17/Chs32/BS8tQ//SqaduSvgdoyMCveVKM+tWgFOAhzmBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:26:15.274246Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.06103","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b58cce940109f4cc11e4b31b0cdd8fd2c068fa7f897d48189d74d0be84c46e49","sha256:c1533ca169fa0019fe61f03f97d6293821d913a15cb59e67a9bc1cf5137dc268"],"state_sha256":"96fe01bd960aab6c3fac3b49ca3cb2582016d5786fad34a0f8042bb2bb3ba501"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tS8kyxbdLiTBDyyLVB3em6L3LjjAA+zKrjkiO8VX6YOvo+0+E7ILYju4RBcmCx/fjfZcoa32AJpxUakyN6jzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:38:38.495315Z","bundle_sha256":"5354a1eaeb142eb489dba2d5aa832e6dd80ec25261147b1af509cb436b3f4c26"}}