{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JIHLPVA3XJ2UHLR6UEOUWVL2OA","short_pith_number":"pith:JIHLPVA3","schema_version":"1.0","canonical_sha256":"4a0eb7d41bba7543ae3ea11d4b557a7007f1bba9a0ca20dc3fd988c658ff76a2","source":{"kind":"arxiv","id":"2606.29528","version":1},"attestation_state":"computed","paper":{"title":"Supervised Hebbian learning in Deep Counterstream Associative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andreas Knoblauch","submitted_at":"2026-06-28T17:44:13Z","abstract_excerpt":"Modern machine learning applications employ deep neural networks training with the error backpropagation algorithm. Although this algorithm is very effective, it lacks biological realism. For example, backpropagation requires symmetric connectivity, and a separate neural processing channel for error signals. Prior works have therefore proposed a number of more realistic alternatives for error backpropagation. However, most of them still suffer from demanding preassumptions that may be not fulfilled in the real brain, for example, they often still require either symmetric connectivity or two se"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.29528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-06-28T17:44:13Z","cross_cats_sorted":[],"title_canon_sha256":"50c0d9670eb7d4fa50f538f27c22f78d44b74f95f0a946e497cbcdba1d418cc1","abstract_canon_sha256":"0f0786c5be3b867bbfde148f36b57a7a32531626de7f2f4c8bb78bb54c7c40aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:10.415741Z","signature_b64":"jaNT9bVhwMBunVb1thQSPl+0M68tTsK88l+h0PJ1jo1avmPWJVfAMlZu+ORA/BFgBIAiQbbVQ12/8QOJxIEqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a0eb7d41bba7543ae3ea11d4b557a7007f1bba9a0ca20dc3fd988c658ff76a2","last_reissued_at":"2026-06-30T01:18:10.414857Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:10.414857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Hebbian learning in Deep Counterstream Associative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andreas Knoblauch","submitted_at":"2026-06-28T17:44:13Z","abstract_excerpt":"Modern machine learning applications employ deep neural networks training with the error backpropagation algorithm. Although this algorithm is very effective, it lacks biological realism. For example, backpropagation requires symmetric connectivity, and a separate neural processing channel for error signals. Prior works have therefore proposed a number of more realistic alternatives for error backpropagation. However, most of them still suffer from demanding preassumptions that may be not fulfilled in the real brain, for example, they often still require either symmetric connectivity or two se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29528","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/2606.29528/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.29528","created_at":"2026-06-30T01:18:10.415005+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29528v1","created_at":"2026-06-30T01:18:10.415005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29528","created_at":"2026-06-30T01:18:10.415005+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIHLPVA3XJ2U","created_at":"2026-06-30T01:18:10.415005+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIHLPVA3XJ2UHLR6","created_at":"2026-06-30T01:18:10.415005+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIHLPVA3","created_at":"2026-06-30T01:18:10.415005+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.16027","citing_title":"Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA","json":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA.json","graph_json":"https://pith.science/api/pith-number/JIHLPVA3XJ2UHLR6UEOUWVL2OA/graph.json","events_json":"https://pith.science/api/pith-number/JIHLPVA3XJ2UHLR6UEOUWVL2OA/events.json","paper":"https://pith.science/paper/JIHLPVA3"},"agent_actions":{"view_html":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA","download_json":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA.json","view_paper":"https://pith.science/paper/JIHLPVA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29528&json=true","fetch_graph":"https://pith.science/api/pith-number/JIHLPVA3XJ2UHLR6UEOUWVL2OA/graph.json","fetch_events":"https://pith.science/api/pith-number/JIHLPVA3XJ2UHLR6UEOUWVL2OA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA/action/storage_attestation","attest_author":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA/action/author_attestation","sign_citation":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA/action/citation_signature","submit_replication":"https://pith.science/pith/JIHLPVA3XJ2UHLR6UEOUWVL2OA/action/replication_record"}},"created_at":"2026-06-30T01:18:10.415005+00:00","updated_at":"2026-06-30T01:18:10.415005+00:00"}