{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GGEI7DJBXIWJFJ4JZE64TO5A3R","short_pith_number":"pith:GGEI7DJB","schema_version":"1.0","canonical_sha256":"31888f8d21ba2c92a789c93dc9bba0dc4778bbfe48ef9e795fc1e0113e085879","source":{"kind":"arxiv","id":"2501.11407","version":1},"attestation_state":"computed","paper":{"title":"A Truly Sparse and General Implementation of Gradient-Based Synaptic Plasticity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Anil Kaya, Emre Neftci, Florian Assmuth, Jamie Lohoff","submitted_at":"2025-01-20T11:14:11Z","abstract_excerpt":"Online synaptic plasticity rules derived from gradient descent achieve high accuracy on a wide range of practical tasks. However, their software implementation often requires tediously hand-derived gradients or using gradient backpropagation which sacrifices the online capability of the rules. In this work, we present a custom automatic differentiation (AD) pipeline for sparse and online implementation of gradient-based synaptic plasticity rules that generalizes to arbitrary neuron models. Our work combines the programming ease of backpropagation-type methods for forward AD while being memory-"},"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":"2501.11407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-01-20T11:14:11Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b8669bf46f356f0c9a3dc180ae80ac143ee5a003d076c62c4735043ca407b727","abstract_canon_sha256":"f76be0d221e03611feddcb55734c54a05ba721a4e713a9477dc2381e6cf86036"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:08.249031Z","signature_b64":"/VUuJXo18IjkJIRtPA/sr0CrxDhKK3MZCOhrtRTSTJ/EeZgixFC+la2dnog7vW8HXCxLiZVtgoJYRQZR49XzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31888f8d21ba2c92a789c93dc9bba0dc4778bbfe48ef9e795fc1e0113e085879","last_reissued_at":"2026-07-05T10:03:08.248631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:08.248631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Truly Sparse and General Implementation of Gradient-Based Synaptic Plasticity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Anil Kaya, Emre Neftci, Florian Assmuth, Jamie Lohoff","submitted_at":"2025-01-20T11:14:11Z","abstract_excerpt":"Online synaptic plasticity rules derived from gradient descent achieve high accuracy on a wide range of practical tasks. However, their software implementation often requires tediously hand-derived gradients or using gradient backpropagation which sacrifices the online capability of the rules. In this work, we present a custom automatic differentiation (AD) pipeline for sparse and online implementation of gradient-based synaptic plasticity rules that generalizes to arbitrary neuron models. Our work combines the programming ease of backpropagation-type methods for forward AD while being memory-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11407","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/2501.11407/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":"2501.11407","created_at":"2026-07-05T10:03:08.248685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11407v1","created_at":"2026-07-05T10:03:08.248685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11407","created_at":"2026-07-05T10:03:08.248685+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGEI7DJBXIWJ","created_at":"2026-07-05T10:03:08.248685+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGEI7DJBXIWJFJ4J","created_at":"2026-07-05T10:03:08.248685+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGEI7DJB","created_at":"2026-07-05T10:03:08.248685+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.02181","citing_title":"A Survey of Scaling in Large Language Model Reasoning","ref_index":119,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R","json":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R.json","graph_json":"https://pith.science/api/pith-number/GGEI7DJBXIWJFJ4JZE64TO5A3R/graph.json","events_json":"https://pith.science/api/pith-number/GGEI7DJBXIWJFJ4JZE64TO5A3R/events.json","paper":"https://pith.science/paper/GGEI7DJB"},"agent_actions":{"view_html":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R","download_json":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R.json","view_paper":"https://pith.science/paper/GGEI7DJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11407&json=true","fetch_graph":"https://pith.science/api/pith-number/GGEI7DJBXIWJFJ4JZE64TO5A3R/graph.json","fetch_events":"https://pith.science/api/pith-number/GGEI7DJBXIWJFJ4JZE64TO5A3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R/action/storage_attestation","attest_author":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R/action/author_attestation","sign_citation":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R/action/citation_signature","submit_replication":"https://pith.science/pith/GGEI7DJBXIWJFJ4JZE64TO5A3R/action/replication_record"}},"created_at":"2026-07-05T10:03:08.248685+00:00","updated_at":"2026-07-05T10:03:08.248685+00:00"}