{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IXNCGUD4IBCC5LMGLXFHBTGLT5","short_pith_number":"pith:IXNCGUD4","canonical_record":{"source":{"id":"1901.01347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-05T00:56:09Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"d5e2d73115a8b3c0f937fd9c2955392a4adc117ab514b81eb2748229a1e99806","abstract_canon_sha256":"11e3665d647d5961bc9994de459e8918a65585421389c97cc1608cf21e79077b"},"schema_version":"1.0"},"canonical_sha256":"45da23507c40442ead865dca70cccb9f44e9aa7549c9c270ec2d53af1788a871","source":{"kind":"arxiv","id":"1901.01347","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01347","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01347v2","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01347","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"IXNCGUD4IBCC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IXNCGUD4IBCC5LMG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IXNCGUD4","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IXNCGUD4IBCC5LMGLXFHBTGLT5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-05T00:56:09Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"d5e2d73115a8b3c0f937fd9c2955392a4adc117ab514b81eb2748229a1e99806","abstract_canon_sha256":"11e3665d647d5961bc9994de459e8918a65585421389c97cc1608cf21e79077b"},"schema_version":"1.0"},"canonical_sha256":"45da23507c40442ead865dca70cccb9f44e9aa7549c9c270ec2d53af1788a871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:48.619406Z","signature_b64":"DESMoki2YNLYxgvbtLN0oJC2QFsit0mmklwR81/JRxuVlOXaRnVyErpkRNJksoFCihU3dTtdl/w7P2imvwzWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45da23507c40442ead865dca70cccb9f44e9aa7549c9c270ec2d53af1788a871","last_reissued_at":"2026-05-17T23:50:48.618749Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:48.618749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01347","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-17T23:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fxb7qFPrtp8exkOWLdcSON4azKn7GXwuHQVLib4Qb30Pg4llgUgGTlgntSUnz/Sv7ZhIPTajueriFWdEJgnAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:29:37.987692Z"},"content_sha256":"3434c6d5d8bcc235890f2d189bc86f5ce433e8dcbc7a5e1a880505e17055d653","schema_version":"1.0","event_id":"sha256:3434c6d5d8bcc235890f2d189bc86f5ce433e8dcbc7a5e1a880505e17055d653"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IXNCGUD4IBCC5LMGLXFHBTGLT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Remember More with Less Memorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hung Le, Svetha Venkatesh, Truyen Tran","submitted_at":"2019-01-05T00:56:09Z","abstract_excerpt":"Memory-augmented neural networks consisting of a neural controller and an external memory have shown potentials in long-term sequential learning. Current RAM-like memory models maintain memory accessing every timesteps, thus they do not effectively leverage the short-term memory held in the controller. We hypothesize that this scheme of writing is suboptimal in memory utilization and introduces redundant computation. To validate our hypothesis, we derive a theoretical bound on the amount of information stored in a RAM-like system and formulate an optimization problem that maximizes the bound. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01347","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-17T23:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHSS1s3b32wu8jbBHcPjlqP7wgn3Y3FFKjJV+ZVwOQXMxrrvM65ARSjtX0Vx874B7dlNaSCKxUS43YgRWKhfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:29:37.988044Z"},"content_sha256":"482b9988c54e4867fe624dcbfa159031b4469ddb10b4bd1d74556d563406bbe8","schema_version":"1.0","event_id":"sha256:482b9988c54e4867fe624dcbfa159031b4469ddb10b4bd1d74556d563406bbe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5/bundle.json","state_url":"https://pith.science/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5/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-05-20T09:29:37Z","links":{"resolver":"https://pith.science/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5","bundle":"https://pith.science/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5/bundle.json","state":"https://pith.science/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXNCGUD4IBCC5LMGLXFHBTGLT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IXNCGUD4IBCC5LMGLXFHBTGLT5","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":"11e3665d647d5961bc9994de459e8918a65585421389c97cc1608cf21e79077b","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-05T00:56:09Z","title_canon_sha256":"d5e2d73115a8b3c0f937fd9c2955392a4adc117ab514b81eb2748229a1e99806"},"schema_version":"1.0","source":{"id":"1901.01347","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01347","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01347v2","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01347","created_at":"2026-05-17T23:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"IXNCGUD4IBCC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IXNCGUD4IBCC5LMG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IXNCGUD4","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:482b9988c54e4867fe624dcbfa159031b4469ddb10b4bd1d74556d563406bbe8","target":"graph","created_at":"2026-05-17T23:50:48Z","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":"Memory-augmented neural networks consisting of a neural controller and an external memory have shown potentials in long-term sequential learning. Current RAM-like memory models maintain memory accessing every timesteps, thus they do not effectively leverage the short-term memory held in the controller. We hypothesize that this scheme of writing is suboptimal in memory utilization and introduces redundant computation. To validate our hypothesis, we derive a theoretical bound on the amount of information stored in a RAM-like system and formulate an optimization problem that maximizes the bound. ","authors_text":"Hung Le, Svetha Venkatesh, Truyen Tran","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-05T00:56:09Z","title":"Learning to Remember More with Less Memorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01347","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:3434c6d5d8bcc235890f2d189bc86f5ce433e8dcbc7a5e1a880505e17055d653","target":"record","created_at":"2026-05-17T23:50:48Z","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":"11e3665d647d5961bc9994de459e8918a65585421389c97cc1608cf21e79077b","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-05T00:56:09Z","title_canon_sha256":"d5e2d73115a8b3c0f937fd9c2955392a4adc117ab514b81eb2748229a1e99806"},"schema_version":"1.0","source":{"id":"1901.01347","kind":"arxiv","version":2}},"canonical_sha256":"45da23507c40442ead865dca70cccb9f44e9aa7549c9c270ec2d53af1788a871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45da23507c40442ead865dca70cccb9f44e9aa7549c9c270ec2d53af1788a871","first_computed_at":"2026-05-17T23:50:48.618749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:48.618749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DESMoki2YNLYxgvbtLN0oJC2QFsit0mmklwR81/JRxuVlOXaRnVyErpkRNJksoFCihU3dTtdl/w7P2imvwzWCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:48.619406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01347","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3434c6d5d8bcc235890f2d189bc86f5ce433e8dcbc7a5e1a880505e17055d653","sha256:482b9988c54e4867fe624dcbfa159031b4469ddb10b4bd1d74556d563406bbe8"],"state_sha256":"fb557e29b0518ad11e664c74269b88c9c0e4e4adfaa086e76cd0899357311038"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOiHDO7dH13y0FZiWljwIiCtrTqIkrqVfFcpLNQPj9eXbJE2mBWAONyLQAnIGsEMfBT79R011nxk8Pd2AOEqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:29:37.990001Z","bundle_sha256":"049e8652397e5e19aa362a8d04d7a0d1722ac90da5737fcb242747b5a310c4ca"}}