{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CHXVVJTJDP7MFT7ROVKNZLG5H5","short_pith_number":"pith:CHXVVJTJ","canonical_record":{"source":{"id":"2502.11162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-16T15:28:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e0eed7e35a1cb54f63a71356c40d3b939f2c210bc5e6fcb8aa4d5b2945745c5e","abstract_canon_sha256":"19702246b4a1396880ab37454471c30abd988292b2cc6c5476a3b433c6030de6"},"schema_version":"1.0"},"canonical_sha256":"11ef5aa6691bfec2cff17554dcacdd3f4a4bcabd2ddd05cf3f7eb8656cd96f35","source":{"kind":"arxiv","id":"2502.11162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11162","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11162v1","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11162","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"CHXVVJTJDP7M","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"pith_short_16","alias_value":"CHXVVJTJDP7MFT7R","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"pith_short_8","alias_value":"CHXVVJTJ","created_at":"2026-07-05T10:15:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CHXVVJTJDP7MFT7ROVKNZLG5H5","target":"record","payload":{"canonical_record":{"source":{"id":"2502.11162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-16T15:28:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e0eed7e35a1cb54f63a71356c40d3b939f2c210bc5e6fcb8aa4d5b2945745c5e","abstract_canon_sha256":"19702246b4a1396880ab37454471c30abd988292b2cc6c5476a3b433c6030de6"},"schema_version":"1.0"},"canonical_sha256":"11ef5aa6691bfec2cff17554dcacdd3f4a4bcabd2ddd05cf3f7eb8656cd96f35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:04.538477Z","signature_b64":"oEkSDkek3Br5F0Yw3qLw2v+b+MhwIPOyjL7RsETPwcggXL/DtbXpsNSz4HsL5RFjI8ghBOetS8V7B3HjoLygAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11ef5aa6691bfec2cff17554dcacdd3f4a4bcabd2ddd05cf3f7eb8656cd96f35","last_reissued_at":"2026-07-05T10:15:04.537983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:04.537983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.11162","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-07-05T10:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqTTVWE8QG5s97ligmE5xN/bU0Ackc8OjlgCJUYyZUgAiGMPChBfui7svGmeBgsjDdrwDDDukw9vB1WZEBz5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:44:38.812781Z"},"content_sha256":"91b863e31a30d5fb1958dfc6e413e6699a66d8adbd45f0813994573fec18e5f5","schema_version":"1.0","event_id":"sha256:91b863e31a30d5fb1958dfc6e413e6699a66d8adbd45f0813994573fec18e5f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CHXVVJTJDP7MFT7ROVKNZLG5H5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logarithmic Width Suffices for Robust Memorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amitsour Egosi, Gilad Yehudai, Ohad Shamir","submitted_at":"2025-02-16T15:28:21Z","abstract_excerpt":"The memorization capacity of neural networks with a given architecture has been thoroughly studied in many works. Specifically, it is well-known that memorizing $N$ samples can be done using a network of constant width, independent of $N$. However, the required constructions are often quite delicate. In this paper, we consider the natural question of how well feedforward ReLU neural networks can memorize robustly, namely while being able to withstand adversarial perturbations of a given radius. We establish both upper and lower bounds on the possible radius for general $l_p$ norms, implying (a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11162","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/2502.11162/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-05T10:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yck6noIlGvmwLzzaklr1yaQqAHeZDOqKzq2fMBPwAXPa36o4+nvxg0FCUI9hbsTzYYCChX8tPDKCFIzbpPuWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:44:38.813143Z"},"content_sha256":"c0ca1f82802f39bd33b0c6d467c46c3a5cd5047bfacc9b4607910c545a6b3af8","schema_version":"1.0","event_id":"sha256:c0ca1f82802f39bd33b0c6d467c46c3a5cd5047bfacc9b4607910c545a6b3af8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5/bundle.json","state_url":"https://pith.science/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5/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-07-07T08:44:38Z","links":{"resolver":"https://pith.science/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5","bundle":"https://pith.science/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5/bundle.json","state":"https://pith.science/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHXVVJTJDP7MFT7ROVKNZLG5H5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CHXVVJTJDP7MFT7ROVKNZLG5H5","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":"19702246b4a1396880ab37454471c30abd988292b2cc6c5476a3b433c6030de6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-16T15:28:21Z","title_canon_sha256":"e0eed7e35a1cb54f63a71356c40d3b939f2c210bc5e6fcb8aa4d5b2945745c5e"},"schema_version":"1.0","source":{"id":"2502.11162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11162","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11162v1","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11162","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"CHXVVJTJDP7M","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"pith_short_16","alias_value":"CHXVVJTJDP7MFT7R","created_at":"2026-07-05T10:15:04Z"},{"alias_kind":"pith_short_8","alias_value":"CHXVVJTJ","created_at":"2026-07-05T10:15:04Z"}],"graph_snapshots":[{"event_id":"sha256:c0ca1f82802f39bd33b0c6d467c46c3a5cd5047bfacc9b4607910c545a6b3af8","target":"graph","created_at":"2026-07-05T10:15:04Z","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/2502.11162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The memorization capacity of neural networks with a given architecture has been thoroughly studied in many works. Specifically, it is well-known that memorizing $N$ samples can be done using a network of constant width, independent of $N$. However, the required constructions are often quite delicate. In this paper, we consider the natural question of how well feedforward ReLU neural networks can memorize robustly, namely while being able to withstand adversarial perturbations of a given radius. We establish both upper and lower bounds on the possible radius for general $l_p$ norms, implying (a","authors_text":"Amitsour Egosi, Gilad Yehudai, Ohad Shamir","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-16T15:28:21Z","title":"Logarithmic Width Suffices for Robust Memorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11162","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:91b863e31a30d5fb1958dfc6e413e6699a66d8adbd45f0813994573fec18e5f5","target":"record","created_at":"2026-07-05T10:15:04Z","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":"19702246b4a1396880ab37454471c30abd988292b2cc6c5476a3b433c6030de6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-16T15:28:21Z","title_canon_sha256":"e0eed7e35a1cb54f63a71356c40d3b939f2c210bc5e6fcb8aa4d5b2945745c5e"},"schema_version":"1.0","source":{"id":"2502.11162","kind":"arxiv","version":1}},"canonical_sha256":"11ef5aa6691bfec2cff17554dcacdd3f4a4bcabd2ddd05cf3f7eb8656cd96f35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11ef5aa6691bfec2cff17554dcacdd3f4a4bcabd2ddd05cf3f7eb8656cd96f35","first_computed_at":"2026-07-05T10:15:04.537983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:04.537983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oEkSDkek3Br5F0Yw3qLw2v+b+MhwIPOyjL7RsETPwcggXL/DtbXpsNSz4HsL5RFjI8ghBOetS8V7B3HjoLygAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:04.538477Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91b863e31a30d5fb1958dfc6e413e6699a66d8adbd45f0813994573fec18e5f5","sha256:c0ca1f82802f39bd33b0c6d467c46c3a5cd5047bfacc9b4607910c545a6b3af8"],"state_sha256":"d9b83e0f7ab41eb9f0466ca8ce3ffe2a5f0c5d8d445f354ca9194700430d5903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pSOo6bKL368xnBh4qbsNgU/Ku7Vy8oJ8qJskyEisb4xV9Sm0uauabLdmtjuuED+Pq/H96I+4WxgiJhPtIdMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:44:38.815060Z","bundle_sha256":"ff59b941f7564d37b39966758d50b73a92acb020a614be7f0ce7b97805d8f396"}}