{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6F2LNBB5XKYSU3Z43JLPJVWWM4","short_pith_number":"pith:6F2LNBB5","canonical_record":{"source":{"id":"1804.01756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-05T10:07:05Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"9cea7c511725f6db91187c6f48deaa31b5c1ffdb708a87fae37b8be82625b3e1","abstract_canon_sha256":"203b073da5f95298fcb8b42a43eb70b30da12ffaed808078a92cd981bf5c2d8d"},"schema_version":"1.0"},"canonical_sha256":"f174b6843dbab12a6f3cda56f4d6d6672b83de64d73f4228b0a104b682558bca","source":{"kind":"arxiv","id":"1804.01756","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01756","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01756v3","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01756","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"6F2LNBB5XKYS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6F2LNBB5XKYSU3Z4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6F2LNBB5","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6F2LNBB5XKYSU3Z43JLPJVWWM4","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-05T10:07:05Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"9cea7c511725f6db91187c6f48deaa31b5c1ffdb708a87fae37b8be82625b3e1","abstract_canon_sha256":"203b073da5f95298fcb8b42a43eb70b30da12ffaed808078a92cd981bf5c2d8d"},"schema_version":"1.0"},"canonical_sha256":"f174b6843dbab12a6f3cda56f4d6d6672b83de64d73f4228b0a104b682558bca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:04.310846Z","signature_b64":"CGdT/jTyWpIqhCt+gkQUdgq9uHju40GQabunUP3WIcQec7BT/h97Lo6GRXOe/DocWUKV3uKc0sqyguMX+LpnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f174b6843dbab12a6f3cda56f4d6d6672b83de64d73f4228b0a104b682558bca","last_reissued_at":"2026-05-18T00:13:04.309953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:04.309953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01756","source_version":3,"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-18T00:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpB5qlRn0PvBQ4J6nOeCf5rW3omU9IFoWMDMkhSuFLdchjwII+4/+PqXwN2WSnUfhx2/p1mvUeT4iwn9ODq5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:09:01.229248Z"},"content_sha256":"9132aaedb55114ed37634af50958607f84b19a8950822c5c68fd0bd12a7f105a","schema_version":"1.0","event_id":"sha256:9132aaedb55114ed37634af50958607f84b19a8950822c5c68fd0bd12a7f105a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6F2LNBB5XKYSU3Z43JLPJVWWM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Kanerva Machine: A Generative Distributed Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Alex Graves, Greg Wayne, Timothy Lillicrap, Yan Wu","submitted_at":"2018-04-05T10:07:05Z","abstract_excerpt":"We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva's sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian update-rule. We formulate it as a hierarchical conditional generative model, where memory provides a rich data-dependent prior distribution. Consequently, the top-down memory and bottom-up perception are combined to produce the code representing an observation. Empirically, we demonst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01756","kind":"arxiv","version":3},"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-18T00:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w6MwrQyuazad8G6UP88/qvcKEPqZLHgjP42Z0CtcFhcsXsfhApoJE3Zh0diNUlktp/b8yPBpOd8Gn8b3UmSoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:09:01.230008Z"},"content_sha256":"eca9b47301beaf7e33d25ad8a5d5c57c25c921baec4dcf408f708d99a9592335","schema_version":"1.0","event_id":"sha256:eca9b47301beaf7e33d25ad8a5d5c57c25c921baec4dcf408f708d99a9592335"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4/bundle.json","state_url":"https://pith.science/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4/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-10T13:09:01Z","links":{"resolver":"https://pith.science/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4","bundle":"https://pith.science/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4/bundle.json","state":"https://pith.science/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6F2LNBB5XKYSU3Z43JLPJVWWM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6F2LNBB5XKYSU3Z43JLPJVWWM4","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":"203b073da5f95298fcb8b42a43eb70b30da12ffaed808078a92cd981bf5c2d8d","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-05T10:07:05Z","title_canon_sha256":"9cea7c511725f6db91187c6f48deaa31b5c1ffdb708a87fae37b8be82625b3e1"},"schema_version":"1.0","source":{"id":"1804.01756","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01756","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01756v3","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01756","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"6F2LNBB5XKYS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6F2LNBB5XKYSU3Z4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6F2LNBB5","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:eca9b47301beaf7e33d25ad8a5d5c57c25c921baec4dcf408f708d99a9592335","target":"graph","created_at":"2026-05-18T00:13:04Z","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":"We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva's sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian update-rule. We formulate it as a hierarchical conditional generative model, where memory provides a rich data-dependent prior distribution. Consequently, the top-down memory and bottom-up perception are combined to produce the code representing an observation. Empirically, we demonst","authors_text":"Alex Graves, Greg Wayne, Timothy Lillicrap, Yan Wu","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-05T10:07:05Z","title":"The Kanerva Machine: A Generative Distributed Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01756","kind":"arxiv","version":3},"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:9132aaedb55114ed37634af50958607f84b19a8950822c5c68fd0bd12a7f105a","target":"record","created_at":"2026-05-18T00:13:04Z","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":"203b073da5f95298fcb8b42a43eb70b30da12ffaed808078a92cd981bf5c2d8d","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-05T10:07:05Z","title_canon_sha256":"9cea7c511725f6db91187c6f48deaa31b5c1ffdb708a87fae37b8be82625b3e1"},"schema_version":"1.0","source":{"id":"1804.01756","kind":"arxiv","version":3}},"canonical_sha256":"f174b6843dbab12a6f3cda56f4d6d6672b83de64d73f4228b0a104b682558bca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f174b6843dbab12a6f3cda56f4d6d6672b83de64d73f4228b0a104b682558bca","first_computed_at":"2026-05-18T00:13:04.309953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:04.309953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGdT/jTyWpIqhCt+gkQUdgq9uHju40GQabunUP3WIcQec7BT/h97Lo6GRXOe/DocWUKV3uKc0sqyguMX+LpnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:04.310846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01756","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9132aaedb55114ed37634af50958607f84b19a8950822c5c68fd0bd12a7f105a","sha256:eca9b47301beaf7e33d25ad8a5d5c57c25c921baec4dcf408f708d99a9592335"],"state_sha256":"648f822c191cf7f96d79dcecefecea26ed1e0fcf905374f278f05654643a5331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Jw2R5KHGPgaGpzMpOhcdJna+3QdCyevI9fzqcyZGBoxEtEouvGuQW7ZnJW/2Ot1KZgh4hNsPAsWiBnafGOFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:09:01.234246Z","bundle_sha256":"6183ab9f96647812db3c331f5330d6beb71ef6fd4151afc0906a0ed4bd622035"}}