{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PFPIJIDFKRDP2EATIDKOJXGQKJ","short_pith_number":"pith:PFPIJIDF","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"},"canonical_sha256":"795e84a0655446fd101340d4e4dcd05249ed82d4d3472d4c7d9f81240d699320","source":{"kind":"arxiv","id":"1009.4958","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4958","created_at":"2026-05-18T02:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4958v2","created_at":"2026-05-18T02:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4958","created_at":"2026-05-18T02:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"PFPIJIDFKRDP","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PFPIJIDFKRDP2EAT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PFPIJIDF","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PFPIJIDFKRDP2EATIDKOJXGQKJ","target":"record","payload":{"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"},"canonical_sha256":"795e84a0655446fd101340d4e4dcd05249ed82d4d3472d4c7d9f81240d699320","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"},"source_kind":"arxiv","source_id":"1009.4958","source_version":2,"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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCShjIpTitHJcForv1ScwiaENiPBsy5X/kIkVxIyHriY/ggK+6zXK0dJ5tCP6/YrydHrlgvuZ4653gOUTWHTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:39:30.161212Z"},"content_sha256":"e30657eefd320ccf933a667e110c7697f6237b4d247624701584378ecad478fe","schema_version":"1.0","event_id":"sha256:e30657eefd320ccf933a667e110c7697f6237b4d247624701584378ecad478fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PFPIJIDFKRDP2EATIDKOJXGQKJ","target":"graph","payload":{"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"},"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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kymfQFmcl5ggcDYj/MgbwCFPzpvDPd5UKEZ73QK/To4UEnOYkqm0uwOjLmJM4ZZ9iPxARhGmYCS3xIULi696AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:39:30.161574Z"},"content_sha256":"3ed73024c94268f7a31ed0fe40164b2960f7c9f12b02f0071397a09cfa29a447","schema_version":"1.0","event_id":"sha256:3ed73024c94268f7a31ed0fe40164b2960f7c9f12b02f0071397a09cfa29a447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/bundle.json","state_url":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/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-20T20:39:30Z","links":{"resolver":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ","bundle":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/bundle.json","state":"https://pith.science/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFPIJIDFKRDP2EATIDKOJXGQKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PFPIJIDFKRDP2EATIDKOJXGQKJ","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":"50f134494a8b57cc5741a9ff2fa04570feef21be79e6f56f5ca8ce03fe06a9bd","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2010-09-24T23:28:30Z","title_canon_sha256":"dc834c368d7fa1e19c7a7a4fc9a99461ae526e432b1c686d0d8d15104d7e239a"},"schema_version":"1.0","source":{"id":"1009.4958","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4958","created_at":"2026-05-18T02:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4958v2","created_at":"2026-05-18T02:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4958","created_at":"2026-05-18T02:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"PFPIJIDFKRDP","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PFPIJIDFKRDP2EAT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PFPIJIDF","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:3ed73024c94268f7a31ed0fe40164b2960f7c9f12b02f0071397a09cfa29a447","target":"graph","created_at":"2026-05-18T02:26:32Z","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":"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","authors_text":"Anda Degeratu, Carina Curto, Vladimir Itskov","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2010-09-24T23:28:30Z","title":"Flexible Memory Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4958","kind":"arxiv","version":2},"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:e30657eefd320ccf933a667e110c7697f6237b4d247624701584378ecad478fe","target":"record","created_at":"2026-05-18T02:26:32Z","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":"50f134494a8b57cc5741a9ff2fa04570feef21be79e6f56f5ca8ce03fe06a9bd","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2010-09-24T23:28:30Z","title_canon_sha256":"dc834c368d7fa1e19c7a7a4fc9a99461ae526e432b1c686d0d8d15104d7e239a"},"schema_version":"1.0","source":{"id":"1009.4958","kind":"arxiv","version":2}},"canonical_sha256":"795e84a0655446fd101340d4e4dcd05249ed82d4d3472d4c7d9f81240d699320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"795e84a0655446fd101340d4e4dcd05249ed82d4d3472d4c7d9f81240d699320","first_computed_at":"2026-05-18T02:26:32.125298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:32.125298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i5p6q9Y4Zc7whlaa8jRTMQYZO8UmJJHOzYpKYRb8C40NKJBI5mQTF/KBaqVrii1iqSLigVLwUlec4Ya7/2btBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:32.125690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4958","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e30657eefd320ccf933a667e110c7697f6237b4d247624701584378ecad478fe","sha256:3ed73024c94268f7a31ed0fe40164b2960f7c9f12b02f0071397a09cfa29a447"],"state_sha256":"9bab0c707392abf16d5e08e5a2f8de53721bc659841f0781b2072701aecf2230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84UcpKUdOC1Zd1ff5dFgl20gjMhsOXhER8qJEwEwhug/vVjdHBrUj0FnklNq96LXww3hCB4AHTi0r7kCDrTiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:39:30.163506Z","bundle_sha256":"43799f183afb122fb9940320a3ec537f1bceb048462431d10ffef2ecee17c12a"}}