{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AOCRY5HAPYDVVDZWI4NAWGPYTW","short_pith_number":"pith:AOCRY5HA","canonical_record":{"source":{"id":"1210.1530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-10-04T18:26:03Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"2c1300f6b76c08be597a57556a436482e90587103ee0e8dcf5e20bfb58eb8aca","abstract_canon_sha256":"49aaee53e5019e91fef910429041a9a19547128706006daacb5fbb2cdbcdff4e"},"schema_version":"1.0"},"canonical_sha256":"03851c74e07e075a8f36471a0b19f89db886a378c93d952f3a3ada779209dbc0","source":{"kind":"arxiv","id":"1210.1530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1530","created_at":"2026-05-18T03:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1530v1","created_at":"2026-05-18T03:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1530","created_at":"2026-05-18T03:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"AOCRY5HAPYDV","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AOCRY5HAPYDVVDZW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AOCRY5HA","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AOCRY5HAPYDVVDZWI4NAWGPYTW","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-10-04T18:26:03Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"2c1300f6b76c08be597a57556a436482e90587103ee0e8dcf5e20bfb58eb8aca","abstract_canon_sha256":"49aaee53e5019e91fef910429041a9a19547128706006daacb5fbb2cdbcdff4e"},"schema_version":"1.0"},"canonical_sha256":"03851c74e07e075a8f36471a0b19f89db886a378c93d952f3a3ada779209dbc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:03.204191Z","signature_b64":"CMXTzsVdkAi1Ve6IAXy/rhOf/U/6SU63GUX9VeMs5ymH9LuphQpkV5l6+3AEl3T2BTB4c93PKv1rB39mTt/PCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03851c74e07e075a8f36471a0b19f89db886a378c93d952f3a3ada779209dbc0","last_reissued_at":"2026-05-18T03:44:03.203356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:03.203356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1530","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-05-18T03:44:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdCwWeB2B0XEI7bm25eEeSSq32I2B9Fobaz7kujf6NOUkRF/mGPHy739UieLS+F263GU9y8EE2n5H9KZ3nN+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:18:48.816705Z"},"content_sha256":"76ade8f56e1b0df1901c28bb8338f8a89128fc7dc515eccf502a975cee694d9f","schema_version":"1.0","event_id":"sha256:76ade8f56e1b0df1901c28bb8338f8a89128fc7dc515eccf502a975cee694d9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AOCRY5HAPYDVVDZWI4NAWGPYTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A network of spiking neurons for computing sparse representations in an energy efficient way","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.NE","authors_text":"Alexander Genkin, Dmitri B. Chklovskii, Tao Hu","submitted_at":"2012-10-04T18:26:03Z","abstract_excerpt":"Computing sparse redundant representations is an important problem both in applied mathematics and neuroscience. In many applications, this problem must be solved in an energy efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating via low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, such operation is equivalent to a network of integrate-and-fire neu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1530","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":""},"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-05-18T03:44:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7u0Vvu7WBpiqMOLAzlOY91qFolwjXg0HTSnbS/R83C0Tefy3sP+ZK82LMmcMj0IGZ4JgLrvDOlNdI2UdBQ/+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:18:48.817051Z"},"content_sha256":"d8061dea118e212302554cddabe58476bc78186c87190e1c0ee6ffcf8f93813b","schema_version":"1.0","event_id":"sha256:d8061dea118e212302554cddabe58476bc78186c87190e1c0ee6ffcf8f93813b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW/bundle.json","state_url":"https://pith.science/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW/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-06-22T17:18:48Z","links":{"resolver":"https://pith.science/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW","bundle":"https://pith.science/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW/bundle.json","state":"https://pith.science/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOCRY5HAPYDVVDZWI4NAWGPYTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AOCRY5HAPYDVVDZWI4NAWGPYTW","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":"49aaee53e5019e91fef910429041a9a19547128706006daacb5fbb2cdbcdff4e","cross_cats_sorted":["q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-10-04T18:26:03Z","title_canon_sha256":"2c1300f6b76c08be597a57556a436482e90587103ee0e8dcf5e20bfb58eb8aca"},"schema_version":"1.0","source":{"id":"1210.1530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1530","created_at":"2026-05-18T03:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1530v1","created_at":"2026-05-18T03:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1530","created_at":"2026-05-18T03:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"AOCRY5HAPYDV","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AOCRY5HAPYDVVDZW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AOCRY5HA","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:d8061dea118e212302554cddabe58476bc78186c87190e1c0ee6ffcf8f93813b","target":"graph","created_at":"2026-05-18T03:44:03Z","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"},"paper":{"abstract_excerpt":"Computing sparse redundant representations is an important problem both in applied mathematics and neuroscience. In many applications, this problem must be solved in an energy efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating via low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, such operation is equivalent to a network of integrate-and-fire neu","authors_text":"Alexander Genkin, Dmitri B. Chklovskii, Tao Hu","cross_cats":["q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-10-04T18:26:03Z","title":"A network of spiking neurons for computing sparse representations in an energy efficient way"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1530","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:76ade8f56e1b0df1901c28bb8338f8a89128fc7dc515eccf502a975cee694d9f","target":"record","created_at":"2026-05-18T03:44:03Z","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":"49aaee53e5019e91fef910429041a9a19547128706006daacb5fbb2cdbcdff4e","cross_cats_sorted":["q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-10-04T18:26:03Z","title_canon_sha256":"2c1300f6b76c08be597a57556a436482e90587103ee0e8dcf5e20bfb58eb8aca"},"schema_version":"1.0","source":{"id":"1210.1530","kind":"arxiv","version":1}},"canonical_sha256":"03851c74e07e075a8f36471a0b19f89db886a378c93d952f3a3ada779209dbc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03851c74e07e075a8f36471a0b19f89db886a378c93d952f3a3ada779209dbc0","first_computed_at":"2026-05-18T03:44:03.203356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:03.203356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMXTzsVdkAi1Ve6IAXy/rhOf/U/6SU63GUX9VeMs5ymH9LuphQpkV5l6+3AEl3T2BTB4c93PKv1rB39mTt/PCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:03.204191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ade8f56e1b0df1901c28bb8338f8a89128fc7dc515eccf502a975cee694d9f","sha256:d8061dea118e212302554cddabe58476bc78186c87190e1c0ee6ffcf8f93813b"],"state_sha256":"63dae332709346f7ccc74017eab0a4d1949dd57d2c815a3c89fe88dbedcd772f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTfpYnRZ1mkFYtfamEEN0PjNc/61OrqQAAnKW+x+i7aFYsgEqYypFAqLAEX23JOx0fTws+RwwiDIuu6IQg2EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:18:48.818967Z","bundle_sha256":"32aa89b1314a0d988db9d2fcde1c14b6c8c11402400f896108f6ba8871561927"}}