{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:I5G6U62DRWQX3IN5UTCM3ZXA6Q","short_pith_number":"pith:I5G6U62D","canonical_record":{"source":{"id":"2403.01907","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-04T10:10:23Z","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT","math.PR"],"title_canon_sha256":"eb97b904c64881a669de7df40476abc0fdf01edf430ec02bac5f510a7f04b22b","abstract_canon_sha256":"da4e9da8ac527d212afd122837dc2312c0f01702d8d7030de219cbe8f77c4c57"},"schema_version":"1.0"},"canonical_sha256":"474dea7b438da17da1bda4c4cde6e0f4247ae90e7b9a81c83596b896cf134a70","source":{"kind":"arxiv","id":"2403.01907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01907","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01907v1","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01907","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"I5G6U62DRWQX","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"pith_short_16","alias_value":"I5G6U62DRWQX3IN5","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"pith_short_8","alias_value":"I5G6U62D","created_at":"2026-07-05T07:51:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:I5G6U62DRWQX3IN5UTCM3ZXA6Q","target":"record","payload":{"canonical_record":{"source":{"id":"2403.01907","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-04T10:10:23Z","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT","math.PR"],"title_canon_sha256":"eb97b904c64881a669de7df40476abc0fdf01edf430ec02bac5f510a7f04b22b","abstract_canon_sha256":"da4e9da8ac527d212afd122837dc2312c0f01702d8d7030de219cbe8f77c4c57"},"schema_version":"1.0"},"canonical_sha256":"474dea7b438da17da1bda4c4cde6e0f4247ae90e7b9a81c83596b896cf134a70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:53.876981Z","signature_b64":"TLInFk/5CnDnaHw6Wi4zlxvcxdyUAe2Ho+HRGWwHJSjen1Jdaxg7LWBb5Hkg4lA00TG1iAE746WtfrPhU2MbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"474dea7b438da17da1bda4c4cde6e0f4247ae90e7b9a81c83596b896cf134a70","last_reissued_at":"2026-07-05T07:51:53.876506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:53.876506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.01907","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-05T07:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylwEWwNOlJ8CYDkhgAOk/cwDRi2GPhCz1YLfOS2TNulrveMs8ohIk2hIlCXm+GM543WM0kYpavCOQnHmzx/eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:20:50.998131Z"},"content_sha256":"8d6c88a17d41c52e08df0d17d7ab0f592bbd8da46c57d9f7999f0900476fcd66","schema_version":"1.0","event_id":"sha256:8d6c88a17d41c52e08df0d17d7ab0f592bbd8da46c57d9f7999f0900476fcd66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:I5G6U62DRWQX3IN5UTCM3ZXA6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity of the Hebbian-Hopfield network associative memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT","math.PR"],"primary_cat":"stat.ML","authors_text":"Mihailo Stojnic","submitted_at":"2024-03-04T10:10:23Z","abstract_excerpt":"In \\cite{Hop82}, Hopfield introduced a \\emph{Hebbian} learning rule based neural network model and suggested how it can efficiently operate as an associative memory. Studying random binary patterns, he also uncovered that, if a small fraction of errors is tolerated in the stored patterns retrieval, the capacity of the network (maximal number of memorized patterns, $m$) scales linearly with each pattern's size, $n$. Moreover, he famously predicted $\\alpha_c=\\lim_{n\\rightarrow\\infty}\\frac{m}{n}\\approx 0.14$. We study this very same scenario with two famous pattern's basins of attraction: \\textbf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01907","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/2403.01907/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-05T07:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5IcI+BhjpyF44fk+G2uT19Lx661heIksB3DXiYyFTpbeygn12CY5ocfh5sMTIsyyX6VGg+I9MM7KaOHtuYKJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:20:50.998978Z"},"content_sha256":"cbf97dc695a5f01ca4cbdf60287a8ae63a4a0b2a37d94894bd924f92e8144b70","schema_version":"1.0","event_id":"sha256:cbf97dc695a5f01ca4cbdf60287a8ae63a4a0b2a37d94894bd924f92e8144b70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q/bundle.json","state_url":"https://pith.science/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q/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-19T15:20:51Z","links":{"resolver":"https://pith.science/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q","bundle":"https://pith.science/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q/bundle.json","state":"https://pith.science/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5G6U62DRWQX3IN5UTCM3ZXA6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I5G6U62DRWQX3IN5UTCM3ZXA6Q","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":"da4e9da8ac527d212afd122837dc2312c0f01702d8d7030de219cbe8f77c4c57","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-04T10:10:23Z","title_canon_sha256":"eb97b904c64881a669de7df40476abc0fdf01edf430ec02bac5f510a7f04b22b"},"schema_version":"1.0","source":{"id":"2403.01907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01907","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01907v1","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01907","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"I5G6U62DRWQX","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"pith_short_16","alias_value":"I5G6U62DRWQX3IN5","created_at":"2026-07-05T07:51:53Z"},{"alias_kind":"pith_short_8","alias_value":"I5G6U62D","created_at":"2026-07-05T07:51:53Z"}],"graph_snapshots":[{"event_id":"sha256:cbf97dc695a5f01ca4cbdf60287a8ae63a4a0b2a37d94894bd924f92e8144b70","target":"graph","created_at":"2026-07-05T07:51:53Z","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/2403.01907/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In \\cite{Hop82}, Hopfield introduced a \\emph{Hebbian} learning rule based neural network model and suggested how it can efficiently operate as an associative memory. Studying random binary patterns, he also uncovered that, if a small fraction of errors is tolerated in the stored patterns retrieval, the capacity of the network (maximal number of memorized patterns, $m$) scales linearly with each pattern's size, $n$. Moreover, he famously predicted $\\alpha_c=\\lim_{n\\rightarrow\\infty}\\frac{m}{n}\\approx 0.14$. We study this very same scenario with two famous pattern's basins of attraction: \\textbf","authors_text":"Mihailo Stojnic","cross_cats":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-04T10:10:23Z","title":"Capacity of the Hebbian-Hopfield network associative memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01907","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:8d6c88a17d41c52e08df0d17d7ab0f592bbd8da46c57d9f7999f0900476fcd66","target":"record","created_at":"2026-07-05T07:51:53Z","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":"da4e9da8ac527d212afd122837dc2312c0f01702d8d7030de219cbe8f77c4c57","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-04T10:10:23Z","title_canon_sha256":"eb97b904c64881a669de7df40476abc0fdf01edf430ec02bac5f510a7f04b22b"},"schema_version":"1.0","source":{"id":"2403.01907","kind":"arxiv","version":1}},"canonical_sha256":"474dea7b438da17da1bda4c4cde6e0f4247ae90e7b9a81c83596b896cf134a70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"474dea7b438da17da1bda4c4cde6e0f4247ae90e7b9a81c83596b896cf134a70","first_computed_at":"2026-07-05T07:51:53.876506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:51:53.876506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TLInFk/5CnDnaHw6Wi4zlxvcxdyUAe2Ho+HRGWwHJSjen1Jdaxg7LWBb5Hkg4lA00TG1iAE746WtfrPhU2MbBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:51:53.876981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.01907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d6c88a17d41c52e08df0d17d7ab0f592bbd8da46c57d9f7999f0900476fcd66","sha256:cbf97dc695a5f01ca4cbdf60287a8ae63a4a0b2a37d94894bd924f92e8144b70"],"state_sha256":"ef4229524bc98b859d4f77056fc27123ec95a258e5ad132e52ed73c3a79688ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3m3SEohn4R+eW3swIloJge1Xwvez6uEn34asuXQ6XpvR7rXSDJKBR+BKTaQgKplid8ceLg4FI5fInchRQ7IQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T15:20:51.005702Z","bundle_sha256":"dd3f256a81902a78f29c8a649237acaadef920a1a69f1b5d859a6b71fa89cd42"}}