{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J3W6GODCMDDFQSDK4HPLPUE7Z2","short_pith_number":"pith:J3W6GODC","canonical_record":{"source":{"id":"1206.2081","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2012-06-11T02:15:22Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"4bfddf5a7b2f95b6fe0a4eb219b201cccd51a32d23946f7c83c5fb618eba7acf","abstract_canon_sha256":"8a60febdb2f6a022b301edb53c9ad2a034658a8eba5fd8080163a345a6aa86f4"},"schema_version":"1.0"},"canonical_sha256":"4eede3386260c658486ae1deb7d09fcea0b555c143a7744a8458d01b86687e1a","source":{"kind":"arxiv","id":"1206.2081","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2081","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2081v3","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2081","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"J3W6GODCMDDF","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J3W6GODCMDDFQSDK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J3W6GODC","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J3W6GODCMDDFQSDK4HPLPUE7Z2","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2081","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2012-06-11T02:15:22Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"4bfddf5a7b2f95b6fe0a4eb219b201cccd51a32d23946f7c83c5fb618eba7acf","abstract_canon_sha256":"8a60febdb2f6a022b301edb53c9ad2a034658a8eba5fd8080163a345a6aa86f4"},"schema_version":"1.0"},"canonical_sha256":"4eede3386260c658486ae1deb7d09fcea0b555c143a7744a8458d01b86687e1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:34.108247Z","signature_b64":"xxfU8f+JSUb2sIay5k697si+RI0c2O/nTckNOsCViHbW+0KF/R7OpGFQGdX8Dojxeb/lJ/8IHtPx1P5QeM1yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eede3386260c658486ae1deb7d09fcea0b555c143a7744a8458d01b86687e1a","last_reissued_at":"2026-05-18T02:17:34.107491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:34.107491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2081","source_version":3,"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-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/cGbK6n3TO9EWgVjJWxtjW3Fdo1K+CCwkIrpFPZDA/hE7MV/bRILCyf8KemCUy7v5t+VF4l7INqnlXKc6FLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:14:13.615362Z"},"content_sha256":"f25c5a7a137b080769f24d07387430375a256a842fa328cabfcb3a1b44ec1b7f","schema_version":"1.0","event_id":"sha256:f25c5a7a137b080769f24d07387430375a256a842fa328cabfcb3a1b44ec1b7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J3W6GODCMDDFQSDK4HPLPUE7Z2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust exponential binary pattern storage in Little-Hopfield networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"q-bio.NC","authors_text":"Christopher Hillar, Kilian Koepsell, Ngoc Tran","submitted_at":"2012-06-11T02:15:22Z","abstract_excerpt":"The Little-Hopfield network is an auto-associative computational model of neural memory storage and retrieval. This model is known to robustly store collections of randomly generated binary patterns as stable-states of the network dynamics. However, the number of binary memories so storable scales linearly in the number of neurons, and it has been a long-standing open problem whether robust exponential storage of binary patterns was possible in such a network memory model. In this note, we design simple families of Little-Hopfield networks that provably solve this problem affirmatively. As a b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2081","kind":"arxiv","version":3},"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-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0nRanDJZkZpGe0mLIWgshy7TPPXInP3h9xIde91M8aANWTs7Le6jFU80g+SQBS2ysWsZayp/nC8eLZvXGgNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:14:13.615713Z"},"content_sha256":"04e152f35dde195c8febefc60a915e8912470a923549ee36a48334d390d1f9f7","schema_version":"1.0","event_id":"sha256:04e152f35dde195c8febefc60a915e8912470a923549ee36a48334d390d1f9f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2/bundle.json","state_url":"https://pith.science/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2/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-06-20T05:14:13Z","links":{"resolver":"https://pith.science/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2","bundle":"https://pith.science/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2/bundle.json","state":"https://pith.science/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3W6GODCMDDFQSDK4HPLPUE7Z2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J3W6GODCMDDFQSDK4HPLPUE7Z2","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":"8a60febdb2f6a022b301edb53c9ad2a034658a8eba5fd8080163a345a6aa86f4","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2012-06-11T02:15:22Z","title_canon_sha256":"4bfddf5a7b2f95b6fe0a4eb219b201cccd51a32d23946f7c83c5fb618eba7acf"},"schema_version":"1.0","source":{"id":"1206.2081","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2081","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2081v3","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2081","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"J3W6GODCMDDF","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J3W6GODCMDDFQSDK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J3W6GODC","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:04e152f35dde195c8febefc60a915e8912470a923549ee36a48334d390d1f9f7","target":"graph","created_at":"2026-05-18T02:17:34Z","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 Little-Hopfield network is an auto-associative computational model of neural memory storage and retrieval. This model is known to robustly store collections of randomly generated binary patterns as stable-states of the network dynamics. However, the number of binary memories so storable scales linearly in the number of neurons, and it has been a long-standing open problem whether robust exponential storage of binary patterns was possible in such a network memory model. In this note, we design simple families of Little-Hopfield networks that provably solve this problem affirmatively. As a b","authors_text":"Christopher Hillar, Kilian Koepsell, Ngoc Tran","cross_cats":["math.CO","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2012-06-11T02:15:22Z","title":"Robust exponential binary pattern storage in Little-Hopfield networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2081","kind":"arxiv","version":3},"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:f25c5a7a137b080769f24d07387430375a256a842fa328cabfcb3a1b44ec1b7f","target":"record","created_at":"2026-05-18T02:17:34Z","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":"8a60febdb2f6a022b301edb53c9ad2a034658a8eba5fd8080163a345a6aa86f4","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2012-06-11T02:15:22Z","title_canon_sha256":"4bfddf5a7b2f95b6fe0a4eb219b201cccd51a32d23946f7c83c5fb618eba7acf"},"schema_version":"1.0","source":{"id":"1206.2081","kind":"arxiv","version":3}},"canonical_sha256":"4eede3386260c658486ae1deb7d09fcea0b555c143a7744a8458d01b86687e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eede3386260c658486ae1deb7d09fcea0b555c143a7744a8458d01b86687e1a","first_computed_at":"2026-05-18T02:17:34.107491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:34.107491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xxfU8f+JSUb2sIay5k697si+RI0c2O/nTckNOsCViHbW+0KF/R7OpGFQGdX8Dojxeb/lJ/8IHtPx1P5QeM1yAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:34.108247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2081","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f25c5a7a137b080769f24d07387430375a256a842fa328cabfcb3a1b44ec1b7f","sha256:04e152f35dde195c8febefc60a915e8912470a923549ee36a48334d390d1f9f7"],"state_sha256":"5b626bb333a25b97291ab090619245f6ed42395c2a84971eed71197b611b5995"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOCz9EYZA7QIzoOcoOK6B1dzVmXMYgPEf/JckzXPsZ+FBOyP9gHS3GXsN7V5CkvhD7ZHPJEDxzVqnbNDCeI9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:14:13.617743Z","bundle_sha256":"4846d29d1ea676fdb744665d03d2d89d59f1b7e7b9c751b4596c9bd90fe36f81"}}