{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C6DFELVNXRF4MORLLIJ3P7YTFE","short_pith_number":"pith:C6DFELVN","canonical_record":{"source":{"id":"1411.4625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2014-11-17T20:25:07Z","cross_cats_sorted":["math-ph","math.MP","q-bio.NC"],"title_canon_sha256":"edf89489f764cf3876a45b04e11610f0878c25d036eeefc527f1ce8a664f3bc5","abstract_canon_sha256":"6b0356faf5f40cdac5e4b092f991be7a2df5ec52c14d0853d3e6f8509cca165a"},"schema_version":"1.0"},"canonical_sha256":"1786522eadbc4bc63a2b5a13b7ff1329276c5ba57dad2577d94b0a3a5e7615ba","source":{"kind":"arxiv","id":"1411.4625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4625","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4625v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4625","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"C6DFELVNXRF4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C6DFELVNXRF4MORL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C6DFELVN","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C6DFELVNXRF4MORLLIJ3P7YTFE","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2014-11-17T20:25:07Z","cross_cats_sorted":["math-ph","math.MP","q-bio.NC"],"title_canon_sha256":"edf89489f764cf3876a45b04e11610f0878c25d036eeefc527f1ce8a664f3bc5","abstract_canon_sha256":"6b0356faf5f40cdac5e4b092f991be7a2df5ec52c14d0853d3e6f8509cca165a"},"schema_version":"1.0"},"canonical_sha256":"1786522eadbc4bc63a2b5a13b7ff1329276c5ba57dad2577d94b0a3a5e7615ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.949525Z","signature_b64":"R4K9Cd2OjXa6XKBRdMrIOihlqu7BhdxYIAjbg+NppS95A+BWcdaxNqrEqjytGi+xoubHX/zZ0WssRqs+4UUbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1786522eadbc4bc63a2b5a13b7ff1329276c5ba57dad2577d94b0a3a5e7615ba","last_reissued_at":"2026-05-18T01:55:52.948995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.948995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4625","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-05-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVVWMTHIbvHu1Ndi9ILDNpxp2PRODoF1hZ5B1jxJLxSGjztY4JGERfC66yZGaPhw679P3V4biUiFa6qVQ2i9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:36.194586Z"},"content_sha256":"672b1d42d1e168e3b447bd5af76533281b3bd38702ea2f1f92aad8af4510f0bb","schema_version":"1.0","event_id":"sha256:672b1d42d1e168e3b447bd5af76533281b3bd38702ea2f1f92aad8af4510f0bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C6DFELVNXRF4MORLLIJ3P7YTFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust exponential memory in Hopfield networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","q-bio.NC"],"primary_cat":"nlin.AO","authors_text":"Christopher Hillar, Ngoc M. Tran","submitted_at":"2014-11-17T20:25:07Z","abstract_excerpt":"The Hopfield recurrent neural network is a classical auto-associative model of memory, in which collections of symmetrically-coupled McCulloch-Pitts neurons interact to perform emergent computation. Although previous researchers have explored the potential of this network to solve combinatorial optimization problems and store memories as attractors of its deterministic dynamics, a basic open problem is to design a family of Hopfield networks with a number of noise-tolerant memories that grows exponentially with neural population size. Here, we discover such networks by minimizing probability f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4625","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":""},"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-05-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQeKKga9akvZ967BYw8BE0hOeJxY9J8Ii8kmIBO6BCzmQ70WmtBb0mMmH0pSWKdR0oCk0If+VbB71iktgnpfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:36.194953Z"},"content_sha256":"e053c0666103a5b5525907944ac19de31e15f5be41d53f8043885d0c9794e99c","schema_version":"1.0","event_id":"sha256:e053c0666103a5b5525907944ac19de31e15f5be41d53f8043885d0c9794e99c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6DFELVNXRF4MORLLIJ3P7YTFE/bundle.json","state_url":"https://pith.science/pith/C6DFELVNXRF4MORLLIJ3P7YTFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6DFELVNXRF4MORLLIJ3P7YTFE/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-05-30T05:52:36Z","links":{"resolver":"https://pith.science/pith/C6DFELVNXRF4MORLLIJ3P7YTFE","bundle":"https://pith.science/pith/C6DFELVNXRF4MORLLIJ3P7YTFE/bundle.json","state":"https://pith.science/pith/C6DFELVNXRF4MORLLIJ3P7YTFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6DFELVNXRF4MORLLIJ3P7YTFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C6DFELVNXRF4MORLLIJ3P7YTFE","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":"6b0356faf5f40cdac5e4b092f991be7a2df5ec52c14d0853d3e6f8509cca165a","cross_cats_sorted":["math-ph","math.MP","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2014-11-17T20:25:07Z","title_canon_sha256":"edf89489f764cf3876a45b04e11610f0878c25d036eeefc527f1ce8a664f3bc5"},"schema_version":"1.0","source":{"id":"1411.4625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4625","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4625v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4625","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"C6DFELVNXRF4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C6DFELVNXRF4MORL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C6DFELVN","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:e053c0666103a5b5525907944ac19de31e15f5be41d53f8043885d0c9794e99c","target":"graph","created_at":"2026-05-18T01:55:52Z","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"},"paper":{"abstract_excerpt":"The Hopfield recurrent neural network is a classical auto-associative model of memory, in which collections of symmetrically-coupled McCulloch-Pitts neurons interact to perform emergent computation. Although previous researchers have explored the potential of this network to solve combinatorial optimization problems and store memories as attractors of its deterministic dynamics, a basic open problem is to design a family of Hopfield networks with a number of noise-tolerant memories that grows exponentially with neural population size. Here, we discover such networks by minimizing probability f","authors_text":"Christopher Hillar, Ngoc M. Tran","cross_cats":["math-ph","math.MP","q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2014-11-17T20:25:07Z","title":"Robust exponential memory in Hopfield networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4625","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:672b1d42d1e168e3b447bd5af76533281b3bd38702ea2f1f92aad8af4510f0bb","target":"record","created_at":"2026-05-18T01:55:52Z","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":"6b0356faf5f40cdac5e4b092f991be7a2df5ec52c14d0853d3e6f8509cca165a","cross_cats_sorted":["math-ph","math.MP","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2014-11-17T20:25:07Z","title_canon_sha256":"edf89489f764cf3876a45b04e11610f0878c25d036eeefc527f1ce8a664f3bc5"},"schema_version":"1.0","source":{"id":"1411.4625","kind":"arxiv","version":2}},"canonical_sha256":"1786522eadbc4bc63a2b5a13b7ff1329276c5ba57dad2577d94b0a3a5e7615ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1786522eadbc4bc63a2b5a13b7ff1329276c5ba57dad2577d94b0a3a5e7615ba","first_computed_at":"2026-05-18T01:55:52.948995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.948995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R4K9Cd2OjXa6XKBRdMrIOihlqu7BhdxYIAjbg+NppS95A+BWcdaxNqrEqjytGi+xoubHX/zZ0WssRqs+4UUbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.949525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:672b1d42d1e168e3b447bd5af76533281b3bd38702ea2f1f92aad8af4510f0bb","sha256:e053c0666103a5b5525907944ac19de31e15f5be41d53f8043885d0c9794e99c"],"state_sha256":"62b966d16f830363aa5a390c2f52c72f03d2597abf84f2491edd32ff1324bd61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hv2A2j39B3P22s6IIBWY+Fv0MstDRzDX9IhF4mUkA9coVFIxIrc0E4LwEzAK0BwJ3CrbgLZxtdIp5DHMfHFNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:52:36.197068Z","bundle_sha256":"820cc5b265b5909c7a983da54ee2809eea19d956cb8ebb83eecc40d8e69b7d1d"}}