{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HOTCKEVR6R5UUDEAV664Q5BDH2","short_pith_number":"pith:HOTCKEVR","canonical_record":{"source":{"id":"1307.7970","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-01T01:15:53Z","cross_cats_sorted":["cs.NE","math.IT"],"title_canon_sha256":"25ba1aff7deb8a2cec9c5950171e5e95230e19e967776dca66e31e2a4a8e1568","abstract_canon_sha256":"eb8d0651f670e0dfcb925e9e5eed8a471822c44dc5dad70c7067767cce938130"},"schema_version":"1.0"},"canonical_sha256":"3ba62512b1f47b4a0c80afbdc874233ea23d2e4c5373e552309610c875822dff","source":{"kind":"arxiv","id":"1307.7970","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7970","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7970v4","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7970","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"HOTCKEVR6R5U","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOTCKEVR6R5UUDEA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOTCKEVR","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HOTCKEVR6R5UUDEAV664Q5BDH2","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7970","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-01T01:15:53Z","cross_cats_sorted":["cs.NE","math.IT"],"title_canon_sha256":"25ba1aff7deb8a2cec9c5950171e5e95230e19e967776dca66e31e2a4a8e1568","abstract_canon_sha256":"eb8d0651f670e0dfcb925e9e5eed8a471822c44dc5dad70c7067767cce938130"},"schema_version":"1.0"},"canonical_sha256":"3ba62512b1f47b4a0c80afbdc874233ea23d2e4c5373e552309610c875822dff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:40.557653Z","signature_b64":"IJ3RnO4W7xepq7+5T+P1hYDs7Vv9wFFhgdrTR4Ogyse+mB1vgYFvo2ebp8DlBnEV2mdlDlA63LpCVsfd0AQABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba62512b1f47b4a0c80afbdc874233ea23d2e4c5373e552309610c875822dff","last_reissued_at":"2026-05-18T02:25:40.557154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:40.557154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7970","source_version":4,"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:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEPkF6t6IVoSLWU3ySe2l0+HOFM89mEY/hxV86lAWv/XZ99TsAZ6FdkbL9u977mOjuemPW3rvEZqbjiSHC0FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:36:54.065066Z"},"content_sha256":"d48d463a839994034fb4f1b432fa5425c8b4e7df40971a16fcb252708642346d","schema_version":"1.0","event_id":"sha256:d48d463a839994034fb4f1b432fa5425c8b4e7df40971a16fcb252708642346d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HOTCKEVR6R5UUDEAV664Q5BDH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short Term Memory Capacity in Networks via the Restricted Isometry Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.IT"],"primary_cat":"cs.IT","authors_text":"Adam S. Charles, Christopher J. Rozell, Han Lun Yap","submitted_at":"2013-07-01T01:15:53Z","abstract_excerpt":"Cortical networks are hypothesized to rely on transient network activity to support short term memory (STM). In this paper we study the capacity of randomly connected recurrent linear networks for performing STM when the input signals are approximately sparse in some basis. We leverage results from compressed sensing to provide rigorous non asymptotic recovery guarantees, quantifying the impact of the input sparsity level, the input sparsity basis, and the network characteristics on the system capacity. Our analysis demonstrates that network memory capacities can scale superlinearly with the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7970","kind":"arxiv","version":4},"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:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8jdS8vxGadwusRGSU7DYx1tzNGdZwKWENOg+7kD7Fu7JmdXLGNbA6iPo/7i+q0id12RHAbByQJOZY7b5E2SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:36:54.065444Z"},"content_sha256":"0f4d3686c33666152cd9acb4f909da9bbe095e7a0e4c242344ae0817e0b52b21","schema_version":"1.0","event_id":"sha256:0f4d3686c33666152cd9acb4f909da9bbe095e7a0e4c242344ae0817e0b52b21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOTCKEVR6R5UUDEAV664Q5BDH2/bundle.json","state_url":"https://pith.science/pith/HOTCKEVR6R5UUDEAV664Q5BDH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOTCKEVR6R5UUDEAV664Q5BDH2/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-01T17:36:54Z","links":{"resolver":"https://pith.science/pith/HOTCKEVR6R5UUDEAV664Q5BDH2","bundle":"https://pith.science/pith/HOTCKEVR6R5UUDEAV664Q5BDH2/bundle.json","state":"https://pith.science/pith/HOTCKEVR6R5UUDEAV664Q5BDH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOTCKEVR6R5UUDEAV664Q5BDH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HOTCKEVR6R5UUDEAV664Q5BDH2","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":"eb8d0651f670e0dfcb925e9e5eed8a471822c44dc5dad70c7067767cce938130","cross_cats_sorted":["cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-01T01:15:53Z","title_canon_sha256":"25ba1aff7deb8a2cec9c5950171e5e95230e19e967776dca66e31e2a4a8e1568"},"schema_version":"1.0","source":{"id":"1307.7970","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7970","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7970v4","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7970","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"HOTCKEVR6R5U","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOTCKEVR6R5UUDEA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOTCKEVR","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:0f4d3686c33666152cd9acb4f909da9bbe095e7a0e4c242344ae0817e0b52b21","target":"graph","created_at":"2026-05-18T02:25:40Z","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":"Cortical networks are hypothesized to rely on transient network activity to support short term memory (STM). In this paper we study the capacity of randomly connected recurrent linear networks for performing STM when the input signals are approximately sparse in some basis. We leverage results from compressed sensing to provide rigorous non asymptotic recovery guarantees, quantifying the impact of the input sparsity level, the input sparsity basis, and the network characteristics on the system capacity. Our analysis demonstrates that network memory capacities can scale superlinearly with the n","authors_text":"Adam S. Charles, Christopher J. Rozell, Han Lun Yap","cross_cats":["cs.NE","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-01T01:15:53Z","title":"Short Term Memory Capacity in Networks via the Restricted Isometry Property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7970","kind":"arxiv","version":4},"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:d48d463a839994034fb4f1b432fa5425c8b4e7df40971a16fcb252708642346d","target":"record","created_at":"2026-05-18T02:25:40Z","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":"eb8d0651f670e0dfcb925e9e5eed8a471822c44dc5dad70c7067767cce938130","cross_cats_sorted":["cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-01T01:15:53Z","title_canon_sha256":"25ba1aff7deb8a2cec9c5950171e5e95230e19e967776dca66e31e2a4a8e1568"},"schema_version":"1.0","source":{"id":"1307.7970","kind":"arxiv","version":4}},"canonical_sha256":"3ba62512b1f47b4a0c80afbdc874233ea23d2e4c5373e552309610c875822dff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba62512b1f47b4a0c80afbdc874233ea23d2e4c5373e552309610c875822dff","first_computed_at":"2026-05-18T02:25:40.557154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:40.557154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IJ3RnO4W7xepq7+5T+P1hYDs7Vv9wFFhgdrTR4Ogyse+mB1vgYFvo2ebp8DlBnEV2mdlDlA63LpCVsfd0AQABA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:40.557653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7970","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d48d463a839994034fb4f1b432fa5425c8b4e7df40971a16fcb252708642346d","sha256:0f4d3686c33666152cd9acb4f909da9bbe095e7a0e4c242344ae0817e0b52b21"],"state_sha256":"2892856f36c75af9b9aa2bb0f6cdf1b0572e8d7e2574d4cc4ba775915551ec8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OWRK1k4voWRoJWFKRvyJpwHMgUe2lLYLMhILNdfAYzZU+9mGY3urLyH8mtTYtoe7CeCSnlkGiN9lEj+3WzwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:36:54.067392Z","bundle_sha256":"0bf0b9a865202e3bc216a80318a7f7e4e95893d16b08904c298d331cbf99f372"}}