{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NHI37OWB2HIVX2SMWFDLKFUUQ3","short_pith_number":"pith:NHI37OWB","canonical_record":{"source":{"id":"1709.05340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T01:48:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"df4a22e7b9fc26baffe2ced322e4532a18d5faa86415896ad8a8cf23a7992244","abstract_canon_sha256":"15116c369dd3409e449dd13435dc38b152e71138f588dd4c13cc54c72fe09329"},"schema_version":"1.0"},"canonical_sha256":"69d1bfbac1d1d15bea4cb146b5169486c16ee13c0c11be1aec961c968de8f953","source":{"kind":"arxiv","id":"1709.05340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05340","created_at":"2026-05-18T00:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05340v1","created_at":"2026-05-18T00:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05340","created_at":"2026-05-18T00:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"NHI37OWB2HIV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHI37OWB2HIVX2SM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHI37OWB","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NHI37OWB2HIVX2SMWFDLKFUUQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T01:48:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"df4a22e7b9fc26baffe2ced322e4532a18d5faa86415896ad8a8cf23a7992244","abstract_canon_sha256":"15116c369dd3409e449dd13435dc38b152e71138f588dd4c13cc54c72fe09329"},"schema_version":"1.0"},"canonical_sha256":"69d1bfbac1d1d15bea4cb146b5169486c16ee13c0c11be1aec961c968de8f953","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:01.045244Z","signature_b64":"bYl2COQzJnY/+bS+SoBWNPhSYS7yQmuaihmm48Uv73pAigNjrotgN0l0ogcXV15Za4ESIrocmy4l2OxSp+dSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d1bfbac1d1d15bea4cb146b5169486c16ee13c0c11be1aec961c968de8f953","last_reissued_at":"2026-05-18T00:35:01.044685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:01.044685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05340","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-05-18T00:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DD5ZdT067u6OUeXx3ZGxKJ/KNe/NqMfmH3BpW6ntCOhUMeSNnf2/uzzO9xNCMwhxkiTTgmdCSU8ty0Cf6Ar1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:55:53.615212Z"},"content_sha256":"1de895423d11f3ba4f4d337604e5ca0a11a5906ad7fa86f5b49843f1b680b1ea","schema_version":"1.0","event_id":"sha256:1de895423d11f3ba4f4d337604e5ca0a11a5906ad7fa86f5b49843f1b680b1ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NHI37OWB2HIVX2SMWFDLKFUUQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Capacity Estimation in Hopfield Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Mingoo Seok, Saarthak Sarup","submitted_at":"2017-09-15T01:48:20Z","abstract_excerpt":"Understanding the memory capacity of neural networks remains a challenging problem in implementing artificial intelligence systems. In this paper, we address the notion of capacity with respect to Hopfield networks and propose a dynamic approach to monitoring a network's capacity. We define our understanding of capacity as the maximum number of stored patterns which can be retrieved when probed by the stored patterns. Prior work in this area has presented static expressions dependent on neuron count $N$, forcing network designers to assume worst-case input characteristics for bias and correlat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05340","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":""},"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-18T00:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7epw1Tq0UjiC1XwyGrcsPRT/hH0ySYfxYIkfFniHMx161ddh5/FcyjdYs5PDAGkLwqrv7y15SsBPxTALB17DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:55:53.615576Z"},"content_sha256":"696e69d99d0b1caabf196a29c53ba2f9a7bd7ddf3f4f31d5a78ab3cdf7eb1a3c","schema_version":"1.0","event_id":"sha256:696e69d99d0b1caabf196a29c53ba2f9a7bd7ddf3f4f31d5a78ab3cdf7eb1a3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3/bundle.json","state_url":"https://pith.science/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3/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-26T13:55:53Z","links":{"resolver":"https://pith.science/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3","bundle":"https://pith.science/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3/bundle.json","state":"https://pith.science/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHI37OWB2HIVX2SMWFDLKFUUQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NHI37OWB2HIVX2SMWFDLKFUUQ3","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":"15116c369dd3409e449dd13435dc38b152e71138f588dd4c13cc54c72fe09329","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T01:48:20Z","title_canon_sha256":"df4a22e7b9fc26baffe2ced322e4532a18d5faa86415896ad8a8cf23a7992244"},"schema_version":"1.0","source":{"id":"1709.05340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05340","created_at":"2026-05-18T00:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05340v1","created_at":"2026-05-18T00:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05340","created_at":"2026-05-18T00:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"NHI37OWB2HIV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHI37OWB2HIVX2SM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHI37OWB","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:696e69d99d0b1caabf196a29c53ba2f9a7bd7ddf3f4f31d5a78ab3cdf7eb1a3c","target":"graph","created_at":"2026-05-18T00:35:01Z","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":"Understanding the memory capacity of neural networks remains a challenging problem in implementing artificial intelligence systems. In this paper, we address the notion of capacity with respect to Hopfield networks and propose a dynamic approach to monitoring a network's capacity. We define our understanding of capacity as the maximum number of stored patterns which can be retrieved when probed by the stored patterns. Prior work in this area has presented static expressions dependent on neuron count $N$, forcing network designers to assume worst-case input characteristics for bias and correlat","authors_text":"Mingoo Seok, Saarthak Sarup","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T01:48:20Z","title":"Dynamic Capacity Estimation in Hopfield Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05340","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:1de895423d11f3ba4f4d337604e5ca0a11a5906ad7fa86f5b49843f1b680b1ea","target":"record","created_at":"2026-05-18T00:35:01Z","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":"15116c369dd3409e449dd13435dc38b152e71138f588dd4c13cc54c72fe09329","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T01:48:20Z","title_canon_sha256":"df4a22e7b9fc26baffe2ced322e4532a18d5faa86415896ad8a8cf23a7992244"},"schema_version":"1.0","source":{"id":"1709.05340","kind":"arxiv","version":1}},"canonical_sha256":"69d1bfbac1d1d15bea4cb146b5169486c16ee13c0c11be1aec961c968de8f953","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69d1bfbac1d1d15bea4cb146b5169486c16ee13c0c11be1aec961c968de8f953","first_computed_at":"2026-05-18T00:35:01.044685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:01.044685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bYl2COQzJnY/+bS+SoBWNPhSYS7yQmuaihmm48Uv73pAigNjrotgN0l0ogcXV15Za4ESIrocmy4l2OxSp+dSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:01.045244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de895423d11f3ba4f4d337604e5ca0a11a5906ad7fa86f5b49843f1b680b1ea","sha256:696e69d99d0b1caabf196a29c53ba2f9a7bd7ddf3f4f31d5a78ab3cdf7eb1a3c"],"state_sha256":"f5fee7884dd653a37e513396933aa9730421fac8e85504fca62ca0a2fce7114b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3Dw8vdAzkQaTJ0eXXnZQYU04ATVlkUf9KLybWtMtbhVIB4xMzXc5rxVr/qQi+bvaLwhshaGQ9ke66vRWo8JBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:55:53.617533Z","bundle_sha256":"189b5993658b059925824006295ad57d7247caf919a63132afc805896c4fd3b6"}}