{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WV5UTD4MZYQPEU5RHSQCDYSSOJ","short_pith_number":"pith:WV5UTD4M","canonical_record":{"source":{"id":"2102.08093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-02-16T11:28:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"225993e39cbfc893b9666c73df9ad55f9a92a60b7dbeb7c8240854d2009fa1b2","abstract_canon_sha256":"a52e7ed9efda99bfea78f21f430bc8a4d44d230e2968af4b6b0583188c9578af"},"schema_version":"1.0"},"canonical_sha256":"b57b498f8cce20f253b13ca021e2527265425f3ad8d9ebc5cabc7097d4e7e6de","source":{"kind":"arxiv","id":"2102.08093","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.08093","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"arxiv_version","alias_value":"2102.08093v2","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08093","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"pith_short_12","alias_value":"WV5UTD4MZYQP","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"pith_short_16","alias_value":"WV5UTD4MZYQPEU5R","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"pith_short_8","alias_value":"WV5UTD4M","created_at":"2026-07-05T02:22:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WV5UTD4MZYQPEU5RHSQCDYSSOJ","target":"record","payload":{"canonical_record":{"source":{"id":"2102.08093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-02-16T11:28:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"225993e39cbfc893b9666c73df9ad55f9a92a60b7dbeb7c8240854d2009fa1b2","abstract_canon_sha256":"a52e7ed9efda99bfea78f21f430bc8a4d44d230e2968af4b6b0583188c9578af"},"schema_version":"1.0"},"canonical_sha256":"b57b498f8cce20f253b13ca021e2527265425f3ad8d9ebc5cabc7097d4e7e6de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:25.844712Z","signature_b64":"QGIkNq/r5BpX0y5VykC1uiV+zr8Sdb2rPBD9TiEYb3Xau5V/eeYEKSWTyBRmpCVRnfSarqiCKevQfbKyCmzlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57b498f8cce20f253b13ca021e2527265425f3ad8d9ebc5cabc7097d4e7e6de","last_reissued_at":"2026-07-05T02:22:25.844305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:25.844305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.08093","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-05T02:22:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MO/3kRRSn8Y8LORUd6bG1orx3c+vnSkw9srIkoNmlNNGq8jKcGiK1eYmsAbY6BmR4+Qh0Bv8cl0ZX6ckqEDDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:40:32.485295Z"},"content_sha256":"8c258c244ee23876feccfa658ac03487ae6314b6333c6f23e8315ac80cdb6e8d","schema_version":"1.0","event_id":"sha256:8c258c244ee23876feccfa658ac03487ae6314b6333c6f23e8315ac80cdb6e8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WV5UTD4MZYQPEU5RHSQCDYSSOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Law of Robustness for Weight-bounded Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Borja Balle, Hisham Husain","submitted_at":"2021-02-16T11:28:59Z","abstract_excerpt":"Robustness of deep neural networks against adversarial perturbations is a pressing concern motivated by recent findings showing the pervasive nature of such vulnerabilities. One method of characterizing the robustness of a neural network model is through its Lipschitz constant, which forms a robustness certificate. A natural question to ask is, for a fixed model class (such as neural networks) and a dataset of size $n$, what is the smallest achievable Lipschitz constant among all models that fit the dataset? Recently, (Bubeck et al., 2020) conjectured that when using two-layer networks with $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08093","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/2102.08093/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-05T02:22:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wh0YezLQB5HhMfGFNFrwqo5Tv21TqxSLNkQrMg8x8wqOkEiE/XdbddtK9VWvhWr+WNr6RV4pD18Zl6qaBKcVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:40:32.485933Z"},"content_sha256":"7f3d5754b377b47240f495b7fc0b11ef8a7882aed53eb70f1f451e355016f71f","schema_version":"1.0","event_id":"sha256:7f3d5754b377b47240f495b7fc0b11ef8a7882aed53eb70f1f451e355016f71f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ/bundle.json","state_url":"https://pith.science/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ/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-04T13:40:32Z","links":{"resolver":"https://pith.science/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ","bundle":"https://pith.science/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ/bundle.json","state":"https://pith.science/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WV5UTD4MZYQPEU5RHSQCDYSSOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WV5UTD4MZYQPEU5RHSQCDYSSOJ","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":"a52e7ed9efda99bfea78f21f430bc8a4d44d230e2968af4b6b0583188c9578af","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-02-16T11:28:59Z","title_canon_sha256":"225993e39cbfc893b9666c73df9ad55f9a92a60b7dbeb7c8240854d2009fa1b2"},"schema_version":"1.0","source":{"id":"2102.08093","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.08093","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"arxiv_version","alias_value":"2102.08093v2","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08093","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"pith_short_12","alias_value":"WV5UTD4MZYQP","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"pith_short_16","alias_value":"WV5UTD4MZYQPEU5R","created_at":"2026-07-05T02:22:25Z"},{"alias_kind":"pith_short_8","alias_value":"WV5UTD4M","created_at":"2026-07-05T02:22:25Z"}],"graph_snapshots":[{"event_id":"sha256:7f3d5754b377b47240f495b7fc0b11ef8a7882aed53eb70f1f451e355016f71f","target":"graph","created_at":"2026-07-05T02:22:25Z","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/2102.08093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robustness of deep neural networks against adversarial perturbations is a pressing concern motivated by recent findings showing the pervasive nature of such vulnerabilities. One method of characterizing the robustness of a neural network model is through its Lipschitz constant, which forms a robustness certificate. A natural question to ask is, for a fixed model class (such as neural networks) and a dataset of size $n$, what is the smallest achievable Lipschitz constant among all models that fit the dataset? Recently, (Bubeck et al., 2020) conjectured that when using two-layer networks with $k","authors_text":"Borja Balle, Hisham Husain","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-02-16T11:28:59Z","title":"A Law of Robustness for Weight-bounded Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08093","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:8c258c244ee23876feccfa658ac03487ae6314b6333c6f23e8315ac80cdb6e8d","target":"record","created_at":"2026-07-05T02:22:25Z","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":"a52e7ed9efda99bfea78f21f430bc8a4d44d230e2968af4b6b0583188c9578af","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-02-16T11:28:59Z","title_canon_sha256":"225993e39cbfc893b9666c73df9ad55f9a92a60b7dbeb7c8240854d2009fa1b2"},"schema_version":"1.0","source":{"id":"2102.08093","kind":"arxiv","version":2}},"canonical_sha256":"b57b498f8cce20f253b13ca021e2527265425f3ad8d9ebc5cabc7097d4e7e6de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b57b498f8cce20f253b13ca021e2527265425f3ad8d9ebc5cabc7097d4e7e6de","first_computed_at":"2026-07-05T02:22:25.844305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:25.844305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGIkNq/r5BpX0y5VykC1uiV+zr8Sdb2rPBD9TiEYb3Xau5V/eeYEKSWTyBRmpCVRnfSarqiCKevQfbKyCmzlBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:25.844712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.08093","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c258c244ee23876feccfa658ac03487ae6314b6333c6f23e8315ac80cdb6e8d","sha256:7f3d5754b377b47240f495b7fc0b11ef8a7882aed53eb70f1f451e355016f71f"],"state_sha256":"e2ee79b51ca46506fa36abdcf9cf4da2bd67b86b7d238e85384f9385c8ca3286"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Bp3qnrr89KE+rE3c9ZWHmqxVMSGQY5F14h2gTsO2iBZf3w7F90skVOSlFb/euNWREDPGcj+8rG9/3pWpRaWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:40:32.489682Z","bundle_sha256":"f2b5751ef67bda9209aa3ea0c5c6ab81cbd8f549e3c22e08af73bb8f4470c84b"}}