{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:G345W6SKKUTLHKW4HDPKBCDIOF","short_pith_number":"pith:G345W6SK","canonical_record":{"source":{"id":"2212.00720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-11-16T00:11:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b7c285ec22322b4bc37e09f8df2e3ecce0c02106ee360f6e612c276d2b9143f5","abstract_canon_sha256":"86a721ff7cb1e12cb07358bb5638697bfea532861ac39ba595e8775cbbedc16b"},"schema_version":"1.0"},"canonical_sha256":"36f9db7a4a5526b3aadc38dea08868717a0384ac10fd08f8f3ef733e59221e50","source":{"kind":"arxiv","id":"2212.00720","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.00720","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"2212.00720v2","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.00720","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"G345W6SKKUTL","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"pith_short_16","alias_value":"G345W6SKKUTLHKW4","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"pith_short_8","alias_value":"G345W6SK","created_at":"2026-07-05T07:42:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:G345W6SKKUTLHKW4HDPKBCDIOF","target":"record","payload":{"canonical_record":{"source":{"id":"2212.00720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-11-16T00:11:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b7c285ec22322b4bc37e09f8df2e3ecce0c02106ee360f6e612c276d2b9143f5","abstract_canon_sha256":"86a721ff7cb1e12cb07358bb5638697bfea532861ac39ba595e8775cbbedc16b"},"schema_version":"1.0"},"canonical_sha256":"36f9db7a4a5526b3aadc38dea08868717a0384ac10fd08f8f3ef733e59221e50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:42:15.859484Z","signature_b64":"+1q9UF5+JDsRp0PaJR5rmJjGMYQR9MFa56h5uApXl5UlHB3Mneb2DlIpVcuWF/fTPL+ig7An/glrjaQdnc7+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f9db7a4a5526b3aadc38dea08868717a0384ac10fd08f8f3ef733e59221e50","last_reissued_at":"2026-07-05T07:42:15.858987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:42:15.858987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.00720","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-07-05T07:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGjjeo+IcT3CY+0ydyqNGzD15kPSBDnx3JTsT5L3w4AK/mDsvTa5XqZm1XiELqSCFhTlmCDuQ/7/VANw5Cy4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:00:23.578606Z"},"content_sha256":"24b24a70b8ca964540eff40ceb1b091ad1e6a9c53b93e716e32c3379be55995d","schema_version":"1.0","event_id":"sha256:24b24a70b8ca964540eff40ceb1b091ad1e6a9c53b93e716e32c3379be55995d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:G345W6SKKUTLHKW4HDPKBCDIOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Beren Millidge, Cornelius Emde, Lei Sha, Rafal Bogacz, Thomas Lukasiewicz, Tommaso Salvatori, Yordan Yordanov, Yuhang Song, Zhenghua Xu","submitted_at":"2022-11-16T00:11:04Z","abstract_excerpt":"Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. Training such models, however, is quite inefficient and unstable. In this work, we show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one, and has theoretical guarantees in terms of convergence. The proposed algorithm, that we call incremental predictive coding (iPC) is also more biologically plausible than the original one, as it it fully automatic. In an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.00720","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.00720/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-05T07:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEPQC3G5DfjS5gXR4kDBNccZNY+Lem813RfnYS+i8Emg7UTKiSi7qIgpIC7i5M71CanYetmfpK+ybMWQ0N9ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:00:23.579773Z"},"content_sha256":"4a5e20bb34f448aa690b1b2a90a19456d84eda6f9d6a813a06c4a158664701c7","schema_version":"1.0","event_id":"sha256:4a5e20bb34f448aa690b1b2a90a19456d84eda6f9d6a813a06c4a158664701c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G345W6SKKUTLHKW4HDPKBCDIOF/bundle.json","state_url":"https://pith.science/pith/G345W6SKKUTLHKW4HDPKBCDIOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G345W6SKKUTLHKW4HDPKBCDIOF/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-07-31T16:00:23Z","links":{"resolver":"https://pith.science/pith/G345W6SKKUTLHKW4HDPKBCDIOF","bundle":"https://pith.science/pith/G345W6SKKUTLHKW4HDPKBCDIOF/bundle.json","state":"https://pith.science/pith/G345W6SKKUTLHKW4HDPKBCDIOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G345W6SKKUTLHKW4HDPKBCDIOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:G345W6SKKUTLHKW4HDPKBCDIOF","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":"86a721ff7cb1e12cb07358bb5638697bfea532861ac39ba595e8775cbbedc16b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-11-16T00:11:04Z","title_canon_sha256":"b7c285ec22322b4bc37e09f8df2e3ecce0c02106ee360f6e612c276d2b9143f5"},"schema_version":"1.0","source":{"id":"2212.00720","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.00720","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"2212.00720v2","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.00720","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"G345W6SKKUTL","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"pith_short_16","alias_value":"G345W6SKKUTLHKW4","created_at":"2026-07-05T07:42:15Z"},{"alias_kind":"pith_short_8","alias_value":"G345W6SK","created_at":"2026-07-05T07:42:15Z"}],"graph_snapshots":[{"event_id":"sha256:4a5e20bb34f448aa690b1b2a90a19456d84eda6f9d6a813a06c4a158664701c7","target":"graph","created_at":"2026-07-05T07:42:15Z","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/2212.00720/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. Training such models, however, is quite inefficient and unstable. In this work, we show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one, and has theoretical guarantees in terms of convergence. The proposed algorithm, that we call incremental predictive coding (iPC) is also more biologically plausible than the original one, as it it fully automatic. In an ","authors_text":"Beren Millidge, Cornelius Emde, Lei Sha, Rafal Bogacz, Thomas Lukasiewicz, Tommaso Salvatori, Yordan Yordanov, Yuhang Song, Zhenghua Xu","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-11-16T00:11:04Z","title":"A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.00720","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:24b24a70b8ca964540eff40ceb1b091ad1e6a9c53b93e716e32c3379be55995d","target":"record","created_at":"2026-07-05T07:42:15Z","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":"86a721ff7cb1e12cb07358bb5638697bfea532861ac39ba595e8775cbbedc16b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-11-16T00:11:04Z","title_canon_sha256":"b7c285ec22322b4bc37e09f8df2e3ecce0c02106ee360f6e612c276d2b9143f5"},"schema_version":"1.0","source":{"id":"2212.00720","kind":"arxiv","version":2}},"canonical_sha256":"36f9db7a4a5526b3aadc38dea08868717a0384ac10fd08f8f3ef733e59221e50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36f9db7a4a5526b3aadc38dea08868717a0384ac10fd08f8f3ef733e59221e50","first_computed_at":"2026-07-05T07:42:15.858987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:42:15.858987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1q9UF5+JDsRp0PaJR5rmJjGMYQR9MFa56h5uApXl5UlHB3Mneb2DlIpVcuWF/fTPL+ig7An/glrjaQdnc7+Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:42:15.859484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.00720","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24b24a70b8ca964540eff40ceb1b091ad1e6a9c53b93e716e32c3379be55995d","sha256:4a5e20bb34f448aa690b1b2a90a19456d84eda6f9d6a813a06c4a158664701c7"],"state_sha256":"f06a2c47a3259e16b54f8d4f629e540c90172884db8ad028f911a0623e199881"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jl//kqb/EEorQBh2oHxfHOQ68j74stXDhzN7ilbQxL5X6fXzlaHpCYu//mkMAaTza0nNXn2m9+QIDpIklosIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T16:00:23.592656Z","bundle_sha256":"66178c156c7c1aa3e5e85aed893590a093f161e863151c617439b3e89ed670c7"}}