{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RYXCHBIF3GERRV4RPXDR3ZLMAM","short_pith_number":"pith:RYXCHBIF","canonical_record":{"source":{"id":"2604.20524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2026-04-22T13:02:33Z","cross_cats_sorted":["cond-mat.dis-nn","cs.NE"],"title_canon_sha256":"818e7dee5cd19b12e11fb87d269a8940ed22015d2db5cade556c00a4c1d4e052","abstract_canon_sha256":"9c5f3f85c3bc7825d396ae3939aaba22a9c342185cbf756caaebe78e370ccdbc"},"schema_version":"1.0"},"canonical_sha256":"8e2e238505d98918d7917dc71de56c033d87c494aa3ddff53d7ba5ddda9f040d","source":{"kind":"arxiv","id":"2604.20524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.20524","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"2604.20524v1","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20524","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"RYXCHBIF3GER","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"pith_short_16","alias_value":"RYXCHBIF3GERRV4R","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"pith_short_8","alias_value":"RYXCHBIF","created_at":"2026-07-08T01:19:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RYXCHBIF3GERRV4RPXDR3ZLMAM","target":"record","payload":{"canonical_record":{"source":{"id":"2604.20524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2026-04-22T13:02:33Z","cross_cats_sorted":["cond-mat.dis-nn","cs.NE"],"title_canon_sha256":"818e7dee5cd19b12e11fb87d269a8940ed22015d2db5cade556c00a4c1d4e052","abstract_canon_sha256":"9c5f3f85c3bc7825d396ae3939aaba22a9c342185cbf756caaebe78e370ccdbc"},"schema_version":"1.0"},"canonical_sha256":"8e2e238505d98918d7917dc71de56c033d87c494aa3ddff53d7ba5ddda9f040d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:19:13.234435Z","signature_b64":"tOUmeOqw1rXGFpXV8B4pOQWUvrBzXK4C5D5YkRrBBvFCJ/fyHtLMtDtqJ+IAgMvlLdhJ3wbNqiFl8SG1I9hKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2e238505d98918d7917dc71de56c033d87c494aa3ddff53d7ba5ddda9f040d","last_reissued_at":"2026-07-08T01:19:13.233870Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:19:13.233870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.20524","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-08T01:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXELaRzR9IEChJgFb9p382x5nrJ1AxRyZaHB/sqHGCfx9b9XwQNKg4V1NwysuoD5TRp1BkjyzMut0+XmajNCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T22:52:13.212911Z"},"content_sha256":"ce52f5b10275932be8e51bf766502073f7b827559a766f84b605be0c7397eb95","schema_version":"1.0","event_id":"sha256:ce52f5b10275932be8e51bf766502073f7b827559a766f84b605be0c7397eb95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RYXCHBIF3GERRV4RPXDR3ZLMAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Response time of lateral predictive coding and benefits of modular structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Optimal lateral predictive coding networks can minimize response time to near the theoretical lower bound while keeping predictive error and signal robustness unchanged, and modular structures with fewer connections perform equivalently to全","cross_cats":["cond-mat.dis-nn","cs.NE"],"primary_cat":"q-bio.NC","authors_text":"Guanghui Cai, Hai-Jun Zhou, Weikang Wang, Zhen-Ye Huang","submitted_at":"2026-04-22T13:02:33Z","abstract_excerpt":"Lateral predictive coding (LPC) is a simple theoretical framework to appreciate feature detection in biological neural circuits. Recent theoretical work [Huang et al., Phys.Rev.E 112, 034304 (2025)] has successfully constructed optimal LPC networks capable of extracting non-Gaussian hidden input features by imposing the tradeoff between energetic cost and information robustness, but the resulting dynamical systems of recurrent interactions can be very slow in responding to external inputs. We investigate response-time reduction in the present paper. We find that the characteristic response tim"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We find that the characteristic response time of the LPC system can be minimized to closely approaching the lower-bound value without compromising the mean predictive error (energetic cost) and the information robustness of signal transmission. We further demonstrate that optimal LPC networks taking a modular structural organization with extensively reduced number of lateral interactions are equally excellent as all-to-all completely connected networks, in terms of feature detection performance, response time, energetic cost and information robustness.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That adjustments to the recurrent dynamical system can reduce response time to near the lower bound while leaving mean predictive error and information robustness unchanged, and that modular reductions in lateral interactions preserve all performance metrics equivalently to full connectivity.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Optimal LPC networks achieve near-minimal response times without trade-offs in energetic cost or robustness, and modular structures with reduced lateral connections match all-to-all networks in performance.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Optimal lateral predictive coding networks can minimize response time to near the theoretical lower bound while keeping predictive error and signal robustness unchanged, and modular structures with fewer connections perform equivalently to全","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a77b062dbccf298276b70cd648b7ebbf67c0f006902a3cb9c6b4e75699a72728"},"source":{"id":"2604.20524","kind":"arxiv","version":1},"verdict":{"id":"9ed7d51f-e047-46a5-8263-a751c3fcff62","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T23:00:15.029117Z","strongest_claim":"We find that the characteristic response time of the LPC system can be minimized to closely approaching the lower-bound value without compromising the mean predictive error (energetic cost) and the information robustness of signal transmission. We further demonstrate that optimal LPC networks taking a modular structural organization with extensively reduced number of lateral interactions are equally excellent as all-to-all completely connected networks, in terms of feature detection performance, response time, energetic cost and information robustness.","one_line_summary":"Optimal LPC networks achieve near-minimal response times without trade-offs in energetic cost or robustness, and modular structures with reduced lateral connections match all-to-all networks in performance.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That adjustments to the recurrent dynamical system can reduce response time to near the lower bound while leaving mean predictive error and information robustness unchanged, and that modular reductions in lateral interactions preserve all performance metrics equivalently to full connectivity.","pith_extraction_headline":"Optimal lateral predictive coding networks can minimize response time to near the theoretical lower bound while keeping predictive error and signal robustness unchanged, and modular structures with fewer connections perform equivalently to全"},"integrity":{"clean":false,"summary":{"advisory":2,"critical":0,"by_detector":{"doi_compliance":{"total":2,"advisory":2,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2604.20524/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/PhysRevE.67.041908.G.Cai) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":31,"audited_at":"2026-05-20T01:50:54.108686Z","detected_doi":"10.1103/PhysRevE.67.041908.G.Cai","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/3jk3-x177.G.Cai) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":12,"audited_at":"2026-05-20T01:50:54.108686Z","detected_doi":"10.1103/3jk3-x177.G.Cai","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T14:38:31.636886Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-20T01:50:54.108686Z","status":"completed","version":"1.0.0","findings_count":2}],"snapshot_sha256":"2c85c7b5e8e1025385a29f487e521275e0ca385b77734ace807626cd85a9dc77"},"references":{"count":31,"sample":[{"doi":"10.1103/physrevlett.114.028103","year":2015,"title":"Retrieval capabilities of hierarchical networks: From Dyson to Hopfield","work_id":"9fda982a-442e-4054-8ed8-aa7a82459918","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.patter.2022.100639","year":2022,"title":"Predictive coding is a consequence of energy efficiency in recurrent neural networks","work_id":"3e9b71df-36ec-4fbc-adfc-a9c23989f127","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.neunet.2012.06.003","year":2012,"title":"doi:10.1016/j.neunet.2012.06.003","work_id":"34c75eb0-e422-451a-9864-5fe147a108a7","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.neuron.2012.10.038","year":2012,"title":"Canonical microcircuits for predictive coding","work_id":"ee7b3997-9d5d-408f-a0e2-7026f15e5dd3","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1162/neco.1995.7.6.1129","year":1995,"title":"Bell and Terrence J","work_id":"31e24ba6-97cc-452d-9610-2bb59380ad9b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"4a2101308d97038e41e0e670752c9b4d8bf7ff76db31a0adefc266cc084c01e6","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":"9ed7d51f-e047-46a5-8263-a751c3fcff62"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-08T01:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FrOPW0lVlG+lMiBz3nMhFcoV22+/fliiW7vYd8S/anIr+Izu1dKDfiDf7XWuwlLp2sQw3LLy7uqcaU2W4+hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T22:52:13.213563Z"},"content_sha256":"930a42c876de1658815f6255946ed857920b8063ec508509be9ba82dc3e9c22b","schema_version":"1.0","event_id":"sha256:930a42c876de1658815f6255946ed857920b8063ec508509be9ba82dc3e9c22b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RYXCHBIF3GERRV4RPXDR3ZLMAM","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/PhysRevE.67.041908.G.Cai) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Zhou, H., 2003. Network landscape from a Brownian particle’s perspective. Physical Review E 67, 041908. doi:10.1103/PhysRevE.67. 041908. G. Cai et al.:Preprint submitted to ElsevierPage 16 of 16","arxiv_id":"2604.20524","detector":"doi_compliance","evidence":{"ref_index":31,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Zhou, H., 2003. Network landscape from a Brownian particle’s perspective. Physical Review E 67, 041908. doi:10.1103/PhysRevE.67. 041908. G. Cai et al.:Preprint submitted to ElsevierPage 16 of 16","reconstructed_doi":"10.1103/PhysRevE.67.041908.G.Cai"},"severity":"advisory","ref_index":31,"audited_at":"2026-05-20T01:50:54.108686Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevE.67.041908.G.Cai","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"7a119dab5c032045069b6323f061682989148c9e5e6bc54facdefeeaac4853aa","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":4134,"payload_sha256":"28ab077048c2416575bf0b57d4970b67cc64e837055dae10264c769869feca7e","signature_b64":"5VTvdFnbiawJgoHWj57AmWY1WgJ3WrxM+khxcE0RQAAMpLxEmXdxcUXL7KhLNIq4Dj0a463utMBZpLnzGiOHAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFMUM16mDawXj4t8Kn9kLSd5xDywpK2mIbM1X/AhN5p5fxCuFAA7gpwtdfBdqZwuO2hkfw+jL6H9tMjGoo6lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T22:52:13.215391Z"},"content_sha256":"7e253c3b0200cc3aab602c4649f826e48364df624636eea02c7ddb197220975d","schema_version":"1.0","event_id":"sha256:7e253c3b0200cc3aab602c4649f826e48364df624636eea02c7ddb197220975d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:RYXCHBIF3GERRV4RPXDR3ZLMAM","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/3jk3-x177.G.Cai) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Huang, Z.Y., Wang, W., Zhou, H.J., 2025. Discontinuous phase transitions of feature detection in lateral predictive coding. Physical Review E 112, 034304. doi:10.1103/3jk3-x177. G. Cai et al.:Preprint submitted to ElsevierPage 15 of 16 Late","arxiv_id":"2604.20524","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Huang, Z.Y., Wang, W., Zhou, H.J., 2025. Discontinuous phase transitions of feature detection in lateral predictive coding. Physical Review E 112, 034304. doi:10.1103/3jk3-x177. G. Cai et al.:Preprint submitted to ElsevierPage 15 of 16 Late","reconstructed_doi":"10.1103/3jk3-x177.G.Cai"},"severity":"advisory","ref_index":12,"audited_at":"2026-05-20T01:50:54.108686Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/3jk3-x177.G.Cai","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2b11a6cd2a5c09697e60d9d35f16356948c942e5c7969bae4207cfd4c74dff7b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":4133,"payload_sha256":"33659f6f7d88cdadb9f0fd89e11245097f5ae89feba0abda5ddb51c4616c11e7","signature_b64":"1/5RLoIUGUGwky41frRPbJlH/htPVzm4VY9PZ77BCvvt1L6FWCXtIJHcxWwHRgjORrIxeoEf6QfAnGtR+Uq2AQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZR0hRiA7L8+rf248oVYcBQM2hGamHEuhueEV5bzknpAgGRh1zAMV8XE9iiW4FW8u55670vBI1IL5RvJ1CQp9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T22:52:13.215693Z"},"content_sha256":"e83183655770dad8f241b907e9afdc77d7fac6277b75cab4941261e0ba3a1f84","schema_version":"1.0","event_id":"sha256:e83183655770dad8f241b907e9afdc77d7fac6277b75cab4941261e0ba3a1f84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM/bundle.json","state_url":"https://pith.science/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM/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-18T22:52:13Z","links":{"resolver":"https://pith.science/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM","bundle":"https://pith.science/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM/bundle.json","state":"https://pith.science/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYXCHBIF3GERRV4RPXDR3ZLMAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RYXCHBIF3GERRV4RPXDR3ZLMAM","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9c5f3f85c3bc7825d396ae3939aaba22a9c342185cbf756caaebe78e370ccdbc","cross_cats_sorted":["cond-mat.dis-nn","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2026-04-22T13:02:33Z","title_canon_sha256":"818e7dee5cd19b12e11fb87d269a8940ed22015d2db5cade556c00a4c1d4e052"},"schema_version":"1.0","source":{"id":"2604.20524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.20524","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"2604.20524v1","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20524","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"RYXCHBIF3GER","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"pith_short_16","alias_value":"RYXCHBIF3GERRV4R","created_at":"2026-07-08T01:19:13Z"},{"alias_kind":"pith_short_8","alias_value":"RYXCHBIF","created_at":"2026-07-08T01:19:13Z"}],"graph_snapshots":[{"event_id":"sha256:930a42c876de1658815f6255946ed857920b8063ec508509be9ba82dc3e9c22b","target":"graph","created_at":"2026-07-08T01:19:13Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We find that the characteristic response time of the LPC system can be minimized to closely approaching the lower-bound value without compromising the mean predictive error (energetic cost) and the information robustness of signal transmission. We further demonstrate that optimal LPC networks taking a modular structural organization with extensively reduced number of lateral interactions are equally excellent as all-to-all completely connected networks, in terms of feature detection performance, response time, energetic cost and information robustness."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That adjustments to the recurrent dynamical system can reduce response time to near the lower bound while leaving mean predictive error and information robustness unchanged, and that modular reductions in lateral interactions preserve all performance metrics equivalently to full connectivity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Optimal LPC networks achieve near-minimal response times without trade-offs in energetic cost or robustness, and modular structures with reduced lateral connections match all-to-all networks in performance."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Optimal lateral predictive coding networks can minimize response time to near the theoretical lower bound while keeping predictive error and signal robustness unchanged, and modular structures with fewer connections perform equivalently to全"}],"snapshot_sha256":"a77b062dbccf298276b70cd648b7ebbf67c0f006902a3cb9c6b4e75699a72728"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T14:38:31.636886Z","status":"completed","version":"1.0.0"},{"findings_count":2,"name":"doi_compliance","ran_at":"2026-05-20T01:50:54.108686Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.20524/integrity.json","findings":[{"audited_at":"2026-05-20T01:50:54.108686Z","detected_arxiv_id":null,"detected_doi":"10.1103/PhysRevE.67.041908.G.Cai","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/PhysRevE.67.041908.G.Cai) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":31,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-20T01:50:54.108686Z","detected_arxiv_id":null,"detected_doi":"10.1103/3jk3-x177.G.Cai","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1103/3jk3-x177.G.Cai) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":12,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"2c85c7b5e8e1025385a29f487e521275e0ca385b77734ace807626cd85a9dc77","summary":{"advisory":2,"by_detector":{"doi_compliance":{"advisory":2,"critical":0,"informational":0,"total":2}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lateral predictive coding (LPC) is a simple theoretical framework to appreciate feature detection in biological neural circuits. Recent theoretical work [Huang et al., Phys.Rev.E 112, 034304 (2025)] has successfully constructed optimal LPC networks capable of extracting non-Gaussian hidden input features by imposing the tradeoff between energetic cost and information robustness, but the resulting dynamical systems of recurrent interactions can be very slow in responding to external inputs. We investigate response-time reduction in the present paper. We find that the characteristic response tim","authors_text":"Guanghui Cai, Hai-Jun Zhou, Weikang Wang, Zhen-Ye Huang","cross_cats":["cond-mat.dis-nn","cs.NE"],"headline":"Optimal lateral predictive coding networks can minimize response time to near the theoretical lower bound while keeping predictive error and signal robustness unchanged, and modular structures with fewer connections perform equivalently to全","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2026-04-22T13:02:33Z","title":"Response time of lateral predictive coding and benefits of modular structures"},"references":{"count":31,"internal_anchors":0,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"10.1103/physrevlett.114.028103","is_internal_anchor":false,"ref_index":1,"title":"Retrieval capabilities of hierarchical networks: From Dyson to Hopfield","work_id":"9fda982a-442e-4054-8ed8-aa7a82459918","year":2015},{"cited_arxiv_id":"","doi":"10.1016/j.patter.2022.100639","is_internal_anchor":false,"ref_index":2,"title":"Predictive coding is a consequence of energy efficiency in recurrent neural networks","work_id":"3e9b71df-36ec-4fbc-adfc-a9c23989f127","year":2022},{"cited_arxiv_id":"","doi":"10.1016/j.neunet.2012.06.003","is_internal_anchor":false,"ref_index":3,"title":"doi:10.1016/j.neunet.2012.06.003","work_id":"34c75eb0-e422-451a-9864-5fe147a108a7","year":2012},{"cited_arxiv_id":"","doi":"10.1016/j.neuron.2012.10.038","is_internal_anchor":false,"ref_index":4,"title":"Canonical microcircuits for predictive coding","work_id":"ee7b3997-9d5d-408f-a0e2-7026f15e5dd3","year":2012},{"cited_arxiv_id":"","doi":"10.1162/neco.1995.7.6.1129","is_internal_anchor":false,"ref_index":5,"title":"Bell and Terrence J","work_id":"31e24ba6-97cc-452d-9610-2bb59380ad9b","year":1995}],"snapshot_sha256":"4a2101308d97038e41e0e670752c9b4d8bf7ff76db31a0adefc266cc084c01e6"},"source":{"id":"2604.20524","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-09T23:00:15.029117Z","id":"9ed7d51f-e047-46a5-8263-a751c3fcff62","model_set":{"reader":"grok-4.3"},"one_line_summary":"Optimal LPC networks achieve near-minimal response times without trade-offs in energetic cost or robustness, and modular structures with reduced lateral connections match all-to-all networks in performance.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Optimal lateral predictive coding networks can minimize response time to near the theoretical lower bound while keeping predictive error and signal robustness unchanged, and modular structures with fewer connections perform equivalently to全","strongest_claim":"We find that the characteristic response time of the LPC system can be minimized to closely approaching the lower-bound value without compromising the mean predictive error (energetic cost) and the information robustness of signal transmission. We further demonstrate that optimal LPC networks taking a modular structural organization with extensively reduced number of lateral interactions are equally excellent as all-to-all completely connected networks, in terms of feature detection performance, response time, energetic cost and information robustness.","weakest_assumption":"That adjustments to the recurrent dynamical system can reduce response time to near the lower bound while leaving mean predictive error and information robustness unchanged, and that modular reductions in lateral interactions preserve all performance metrics equivalently to full connectivity."}},"verdict_id":"9ed7d51f-e047-46a5-8263-a751c3fcff62"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce52f5b10275932be8e51bf766502073f7b827559a766f84b605be0c7397eb95","target":"record","created_at":"2026-07-08T01:19:13Z","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":"9c5f3f85c3bc7825d396ae3939aaba22a9c342185cbf756caaebe78e370ccdbc","cross_cats_sorted":["cond-mat.dis-nn","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2026-04-22T13:02:33Z","title_canon_sha256":"818e7dee5cd19b12e11fb87d269a8940ed22015d2db5cade556c00a4c1d4e052"},"schema_version":"1.0","source":{"id":"2604.20524","kind":"arxiv","version":1}},"canonical_sha256":"8e2e238505d98918d7917dc71de56c033d87c494aa3ddff53d7ba5ddda9f040d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2e238505d98918d7917dc71de56c033d87c494aa3ddff53d7ba5ddda9f040d","first_computed_at":"2026-07-08T01:19:13.233870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:19:13.233870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tOUmeOqw1rXGFpXV8B4pOQWUvrBzXK4C5D5YkRrBBvFCJ/fyHtLMtDtqJ+IAgMvlLdhJ3wbNqiFl8SG1I9hKAQ==","signature_status":"signed_v1","signed_at":"2026-07-08T01:19:13.234435Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.20524","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:7e253c3b0200cc3aab602c4649f826e48364df624636eea02c7ddb197220975d","sha256:e83183655770dad8f241b907e9afdc77d7fac6277b75cab4941261e0ba3a1f84"]}],"invalid_events":[],"applied_event_ids":["sha256:ce52f5b10275932be8e51bf766502073f7b827559a766f84b605be0c7397eb95","sha256:930a42c876de1658815f6255946ed857920b8063ec508509be9ba82dc3e9c22b"],"state_sha256":"9b4dfb3cbcee2cfb6a3cc74fb4e4b77342e7b885c4f7ae1a3b6e7e7f147c964b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpsJCytF2pNaHztRzojnuhLoIbICxo6Ik17+e6ZNuW9B6ClezEl4SlauyYgQIL/+llYjJtbzPi/7xmmesEX1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T22:52:13.217806Z","bundle_sha256":"c6909cbe74412bcdb58513115cb5e0bd63589399383b46b1db71157e72b57ea5"}}