{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K7BQWBQVAZ4USBQOAZ5IR4PG3N","short_pith_number":"pith:K7BQWBQV","schema_version":"1.0","canonical_sha256":"57c30b0615067949060e067a88f1e6db4ad9f6427773f11ca8d0b90d5f43a6ed","source":{"kind":"arxiv","id":"1507.07580","version":1},"attestation_state":"computed","paper":{"title":"Computational principles of biological memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Marcus K. Benna, Stefano Fusi","submitted_at":"2015-07-27T20:29:33Z","abstract_excerpt":"Memories are stored, retained, and recollected through complex, coupled processes operating on multiple timescales. To understand the computational principles behind these intricate networks of interactions we construct a broad class of synaptic models that efficiently harnesses biological complexity to preserve numerous memories. The memory capacity scales almost linearly with the number of synapses, which is a substantial improvement over the square root scaling of previous models. This was achieved by combining multiple dynamical processes that initially store memories in fast variables and"},"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":"1507.07580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-07-27T20:29:33Z","cross_cats_sorted":[],"title_canon_sha256":"66ab389e2516eaec3abaf937bb5f66170492e6db20337e3b6d7b6a255c8d2f5b","abstract_canon_sha256":"85c6ac12d6116906487718e69361e39ef77e09d9eebe0088e3d93748aa9db287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:12.401003Z","signature_b64":"tncm3AxFwZiBzPKyViFpjFoZDPe1ZB/DGePejGN2oqB7LTI4heyGeJEaKlJrtVwCsZrwab8jV7g2iFmEn67eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c30b0615067949060e067a88f1e6db4ad9f6427773f11ca8d0b90d5f43a6ed","last_reissued_at":"2026-05-18T01:36:12.400569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:12.400569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational principles of biological memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Marcus K. Benna, Stefano Fusi","submitted_at":"2015-07-27T20:29:33Z","abstract_excerpt":"Memories are stored, retained, and recollected through complex, coupled processes operating on multiple timescales. To understand the computational principles behind these intricate networks of interactions we construct a broad class of synaptic models that efficiently harnesses biological complexity to preserve numerous memories. The memory capacity scales almost linearly with the number of synapses, which is a substantial improvement over the square root scaling of previous models. This was achieved by combining multiple dynamical processes that initially store memories in fast variables and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07580","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":"1507.07580","created_at":"2026-05-18T01:36:12.400631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07580v1","created_at":"2026-05-18T01:36:12.400631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07580","created_at":"2026-05-18T01:36:12.400631+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7BQWBQVAZ4U","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7BQWBQVAZ4USBQO","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7BQWBQV","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.13334","citing_title":"A Survey of Context Engineering for Large Language Models","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N","json":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N.json","graph_json":"https://pith.science/api/pith-number/K7BQWBQVAZ4USBQOAZ5IR4PG3N/graph.json","events_json":"https://pith.science/api/pith-number/K7BQWBQVAZ4USBQOAZ5IR4PG3N/events.json","paper":"https://pith.science/paper/K7BQWBQV"},"agent_actions":{"view_html":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N","download_json":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N.json","view_paper":"https://pith.science/paper/K7BQWBQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07580&json=true","fetch_graph":"https://pith.science/api/pith-number/K7BQWBQVAZ4USBQOAZ5IR4PG3N/graph.json","fetch_events":"https://pith.science/api/pith-number/K7BQWBQVAZ4USBQOAZ5IR4PG3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N/action/storage_attestation","attest_author":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N/action/author_attestation","sign_citation":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N/action/citation_signature","submit_replication":"https://pith.science/pith/K7BQWBQVAZ4USBQOAZ5IR4PG3N/action/replication_record"}},"created_at":"2026-05-18T01:36:12.400631+00:00","updated_at":"2026-05-18T01:36:12.400631+00:00"}