{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QYALUGXNTZJQYWYQEJIKRIXY2Y","short_pith_number":"pith:QYALUGXN","schema_version":"1.0","canonical_sha256":"8600ba1aed9e530c5b102250a8a2f8d60a7177390c883cd7bfd1da6331db6300","source":{"kind":"arxiv","id":"1407.6029","version":1},"attestation_state":"computed","paper":{"title":"A binary Hopfield network with $1/\\log(n)$ information rate and applications to grid cell decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"q-bio.NC","authors_text":"David J. Schwab, Ila Fiete, Ngoc M. Tran","submitted_at":"2014-07-22T20:32:46Z","abstract_excerpt":"A Hopfield network is an auto-associative, distributive model of neural memory storage and retrieval. A form of error-correcting code, the Hopfield network can learn a set of patterns as stable points of the network dynamic, and retrieve them from noisy inputs -- thus Hopfield networks are their own decoders. Unlike in coding theory, where the information rate of a good code (in the Shannon sense) is finite but the cost of decoding does not play a role in the rate, the information rate of Hopfield networks trained with state-of-the-art learning algorithms is of the order ${\\log(n)}/{n}$, a qua"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.6029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2014-07-22T20:32:46Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"1faec3ed6a0017cfe0946c3f79141f4b57a133389593474d494fcb8036f5bb2a","abstract_canon_sha256":"c0cfe0e2eb0eae8e4c49d39a16cad9c31fff054640e3f2d9d60b182264341d5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:59.291040Z","signature_b64":"YSqVgVCh7ewZlRZHo3zm6lwXWBY+haGm00iAERfuIrfldUhmq1T3r/OUyDw9n4kgdu1xcaFsxCeeWwDT81UCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8600ba1aed9e530c5b102250a8a2f8d60a7177390c883cd7bfd1da6331db6300","last_reissued_at":"2026-05-18T02:46:59.290424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:59.290424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A binary Hopfield network with $1/\\log(n)$ information rate and applications to grid cell decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"q-bio.NC","authors_text":"David J. Schwab, Ila Fiete, Ngoc M. Tran","submitted_at":"2014-07-22T20:32:46Z","abstract_excerpt":"A Hopfield network is an auto-associative, distributive model of neural memory storage and retrieval. A form of error-correcting code, the Hopfield network can learn a set of patterns as stable points of the network dynamic, and retrieve them from noisy inputs -- thus Hopfield networks are their own decoders. Unlike in coding theory, where the information rate of a good code (in the Shannon sense) is finite but the cost of decoding does not play a role in the rate, the information rate of Hopfield networks trained with state-of-the-art learning algorithms is of the order ${\\log(n)}/{n}$, a qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6029","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.6029","created_at":"2026-05-18T02:46:59.290520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6029v1","created_at":"2026-05-18T02:46:59.290520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6029","created_at":"2026-05-18T02:46:59.290520+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYALUGXNTZJQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYALUGXNTZJQYWYQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYALUGXN","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y","json":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y.json","graph_json":"https://pith.science/api/pith-number/QYALUGXNTZJQYWYQEJIKRIXY2Y/graph.json","events_json":"https://pith.science/api/pith-number/QYALUGXNTZJQYWYQEJIKRIXY2Y/events.json","paper":"https://pith.science/paper/QYALUGXN"},"agent_actions":{"view_html":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y","download_json":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y.json","view_paper":"https://pith.science/paper/QYALUGXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6029&json=true","fetch_graph":"https://pith.science/api/pith-number/QYALUGXNTZJQYWYQEJIKRIXY2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/QYALUGXNTZJQYWYQEJIKRIXY2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y/action/storage_attestation","attest_author":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y/action/author_attestation","sign_citation":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y/action/citation_signature","submit_replication":"https://pith.science/pith/QYALUGXNTZJQYWYQEJIKRIXY2Y/action/replication_record"}},"created_at":"2026-05-18T02:46:59.290520+00:00","updated_at":"2026-05-18T02:46:59.290520+00:00"}