{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LXZUZU6GN3Z65DK6GSOLON6XO3","short_pith_number":"pith:LXZUZU6G","canonical_record":{"source":{"id":"2412.18349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2024-12-24T11:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"4e7bf4bd24b1f82711ad7b556c4d1df8ec5332960187da9fc4150820455e1732","abstract_canon_sha256":"7361daa1309b42310755d44ad9e96acd9b9053900104be506436d939dd1d0cdb"},"schema_version":"1.0"},"canonical_sha256":"5df34cd3c66ef3ee8d5e349cb737d776d19e71ab84520e5fa53a821d886e029c","source":{"kind":"arxiv","id":"2412.18349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.18349","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"arxiv_version","alias_value":"2412.18349v1","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18349","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"pith_short_12","alias_value":"LXZUZU6GN3Z6","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"pith_short_16","alias_value":"LXZUZU6GN3Z65DK6","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"pith_short_8","alias_value":"LXZUZU6G","created_at":"2026-07-05T09:53:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LXZUZU6GN3Z65DK6GSOLON6XO3","target":"record","payload":{"canonical_record":{"source":{"id":"2412.18349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2024-12-24T11:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"4e7bf4bd24b1f82711ad7b556c4d1df8ec5332960187da9fc4150820455e1732","abstract_canon_sha256":"7361daa1309b42310755d44ad9e96acd9b9053900104be506436d939dd1d0cdb"},"schema_version":"1.0"},"canonical_sha256":"5df34cd3c66ef3ee8d5e349cb737d776d19e71ab84520e5fa53a821d886e029c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:54.242545Z","signature_b64":"j4+Ht4mfSvfALu9pMucwq8IOdARWbQUGUEudEyafoToBUSoeNYrSm+NB+waYZ34K+NtW47TEWzKi/KtE9hiYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5df34cd3c66ef3ee8d5e349cb737d776d19e71ab84520e5fa53a821d886e029c","last_reissued_at":"2026-07-05T09:53:54.241953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:54.241953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.18349","source_version":1,"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-07-05T09:53:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NREj+FrCUcoOd0y6Xid7jxPdsUMgT5gWSQSVEKV6KQ5KiArf4eiOx56SjgosxXg9KFCnpOUEVf8qeCTHh+cABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:10:33.690990Z"},"content_sha256":"fd821eacc17d7aef717e662f61398b1f0943a7eb87f76688394048336f0ea2bb","schema_version":"1.0","event_id":"sha256:fd821eacc17d7aef717e662f61398b1f0943a7eb87f76688394048336f0ea2bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LXZUZU6GN3Z65DK6GSOLON6XO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural auto-association with optimal Bayesian learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andreas Knoblauch","submitted_at":"2024-12-24T11:22:18Z","abstract_excerpt":"Neural associative memories are single layer perceptrons with fast synaptic learning typically storing discrete associations between pairs of neural activity patterns. Previous works have analyzed the optimal networks under naive Bayes assumptions of independent pattern components and heteroassociation, where the task is to learn associations from input to output patterns. Here I study the optimal Bayesian associative network for auto-association where input and output layers are identical. In particular, I compare performance to different variants of approximate Bayesian learning rules, like "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18349","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.18349/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:53:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHvbO4jGTgXt18DeaOJ4T+FDILSKF/t0b5mR1HxrTcSSS4JXgSi6+ozmU5SjmXmPIT4GbEyEr1wOkSq789nnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:10:33.691589Z"},"content_sha256":"4799f1509fcbf9aa66c457ae91abe1234a8ff071bac5951a84b135b4c16953ed","schema_version":"1.0","event_id":"sha256:4799f1509fcbf9aa66c457ae91abe1234a8ff071bac5951a84b135b4c16953ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXZUZU6GN3Z65DK6GSOLON6XO3/bundle.json","state_url":"https://pith.science/pith/LXZUZU6GN3Z65DK6GSOLON6XO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXZUZU6GN3Z65DK6GSOLON6XO3/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-08-04T12:10:33Z","links":{"resolver":"https://pith.science/pith/LXZUZU6GN3Z65DK6GSOLON6XO3","bundle":"https://pith.science/pith/LXZUZU6GN3Z65DK6GSOLON6XO3/bundle.json","state":"https://pith.science/pith/LXZUZU6GN3Z65DK6GSOLON6XO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXZUZU6GN3Z65DK6GSOLON6XO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LXZUZU6GN3Z65DK6GSOLON6XO3","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":"7361daa1309b42310755d44ad9e96acd9b9053900104be506436d939dd1d0cdb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2024-12-24T11:22:18Z","title_canon_sha256":"4e7bf4bd24b1f82711ad7b556c4d1df8ec5332960187da9fc4150820455e1732"},"schema_version":"1.0","source":{"id":"2412.18349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.18349","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"arxiv_version","alias_value":"2412.18349v1","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18349","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"pith_short_12","alias_value":"LXZUZU6GN3Z6","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"pith_short_16","alias_value":"LXZUZU6GN3Z65DK6","created_at":"2026-07-05T09:53:54Z"},{"alias_kind":"pith_short_8","alias_value":"LXZUZU6G","created_at":"2026-07-05T09:53:54Z"}],"graph_snapshots":[{"event_id":"sha256:4799f1509fcbf9aa66c457ae91abe1234a8ff071bac5951a84b135b4c16953ed","target":"graph","created_at":"2026-07-05T09:53:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.18349/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural associative memories are single layer perceptrons with fast synaptic learning typically storing discrete associations between pairs of neural activity patterns. Previous works have analyzed the optimal networks under naive Bayes assumptions of independent pattern components and heteroassociation, where the task is to learn associations from input to output patterns. Here I study the optimal Bayesian associative network for auto-association where input and output layers are identical. In particular, I compare performance to different variants of approximate Bayesian learning rules, like ","authors_text":"Andreas Knoblauch","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2024-12-24T11:22:18Z","title":"Neural auto-association with optimal Bayesian learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18349","kind":"arxiv","version":1},"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:fd821eacc17d7aef717e662f61398b1f0943a7eb87f76688394048336f0ea2bb","target":"record","created_at":"2026-07-05T09:53:54Z","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":"7361daa1309b42310755d44ad9e96acd9b9053900104be506436d939dd1d0cdb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2024-12-24T11:22:18Z","title_canon_sha256":"4e7bf4bd24b1f82711ad7b556c4d1df8ec5332960187da9fc4150820455e1732"},"schema_version":"1.0","source":{"id":"2412.18349","kind":"arxiv","version":1}},"canonical_sha256":"5df34cd3c66ef3ee8d5e349cb737d776d19e71ab84520e5fa53a821d886e029c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5df34cd3c66ef3ee8d5e349cb737d776d19e71ab84520e5fa53a821d886e029c","first_computed_at":"2026-07-05T09:53:54.241953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:54.241953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j4+Ht4mfSvfALu9pMucwq8IOdARWbQUGUEudEyafoToBUSoeNYrSm+NB+waYZ34K+NtW47TEWzKi/KtE9hiYDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:54.242545Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.18349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd821eacc17d7aef717e662f61398b1f0943a7eb87f76688394048336f0ea2bb","sha256:4799f1509fcbf9aa66c457ae91abe1234a8ff071bac5951a84b135b4c16953ed"],"state_sha256":"6387fb698cff143df1d1c98cbe073e63e4dedac8665603622142ba9017381fb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yX6oLu0NbXXhGP4c4ncchsI+wOW8tvUkb594PBVAkVG1I9oNJUnIDOY601X3mwpTWj2hTqN2uSVCtgEkYQ4ICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:10:33.696792Z","bundle_sha256":"e580fa330ee9144448bcb96d8f97c07a6f6393c7b74e15d2dfdc9c2cd4569f44"}}