{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PFPIJIDFKRDP2EATIDKOJXGQKJ","short_pith_number":"pith:PFPIJIDF","schema_version":"1.0","canonical_sha256":"795e84a0655446fd101340d4e4dcd05249ed82d4d3472d4c7d9f81240d699320","source":{"kind":"arxiv","id":"1009.4958","version":2},"attestation_state":"computed","paper":{"title":"Flexible Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"q-bio.NC","authors_text":"Anda Degeratu, Carina Curto, Vladimir Itskov","submitted_at":"2010-09-24T23:28:30Z","abstract_excerpt":"Networks of neurons in some brain areas are flexible enough to encode new memories quickly. Using a standard firing rate model of recurrent networks, we develop a theory of flexible memory networks. Our main results characterize networks having the maximal number of flexible memory patterns, given a constraint graph on the network's connectivity matrix. Modulo a mild topological condition, we find a close connection between maximally flexible networks and rank 1 matrices. The topological condition is H_1(X;Z)=0, where X is the clique complex associated to the network's constraint graph; this c"},"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":"1009.4958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2010-09-24T23:28:30Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"dc834c368d7fa1e19c7a7a4fc9a99461ae526e432b1c686d0d8d15104d7e239a","abstract_canon_sha256":"50f134494a8b57cc5741a9ff2fa04570feef21be79e6f56f5ca8ce03fe06a9bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:32.125690Z","signature_b64":"i5p6q9Y4Zc7whlaa8jRTMQYZO8UmJJHOzYpKYRb8C40NKJBI5mQTF/KBaqVrii1iqSLigVLwUlec4Ya7/2btBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"795e84a0655446fd101340d4e4dcd05249ed82d4d3472d4c7d9f81240d699320","last_reissued_at":"2026-05-18T02:26:32.125298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:32.125298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"q-bio.NC","authors_text":"Anda Degeratu, Carina Curto, Vladimir Itskov","submitted_at":"2010-09-24T23:28:30Z","abstract_excerpt":"Networks of neurons in some brain areas are flexible enough to encode new memories quickly. Using a standard firing rate model of recurrent networks, we develop a theory of flexible memory networks. Our main results characterize networks having the maximal number of flexible memory patterns, given a constraint graph on the network's connectivity matrix. Modulo a mild topological condition, we find a close connection between maximally flexible networks and rank 1 matrices. The topological condition is H_1(X;Z)=0, where X is the clique complex associated to the network's constraint graph; this c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4958","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.4958","created_at":"2026-05-18T02:26:32.125364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4958v2","created_at":"2026-05-18T02:26:32.125364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4958","created_at":"2026-05-18T02:26:32.125364+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFPIJIDFKRDP","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFPIJIDFKRDP2EAT","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFPIJIDF","created_at":"2026-05-18T12:26:12.377268+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/PFPIJIDFKRDP2EATIDKOJXGQKJ","json":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ.json","graph_json":"https://pith.science/api/pith-number/PFPIJIDFKRDP2EATIDKOJXGQKJ/graph.json","events_json":"https://pith.science/api/pith-number/PFPIJIDFKRDP2EATIDKOJXGQKJ/events.json","paper":"https://pith.science/paper/PFPIJIDF"},"agent_actions":{"view_html":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ","download_json":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ.json","view_paper":"https://pith.science/paper/PFPIJIDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4958&json=true","fetch_graph":"https://pith.science/api/pith-number/PFPIJIDFKRDP2EATIDKOJXGQKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PFPIJIDFKRDP2EATIDKOJXGQKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/action/storage_attestation","attest_author":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/action/author_attestation","sign_citation":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/action/citation_signature","submit_replication":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/action/replication_record"}},"created_at":"2026-05-18T02:26:32.125364+00:00","updated_at":"2026-05-18T02:26:32.125364+00:00"}