{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BQEBMNXUSJNMUXFIDHJFH3NCR3","short_pith_number":"pith:BQEBMNXU","canonical_record":{"source":{"id":"1706.01382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-06-05T15:43:40Z","cross_cats_sorted":["cs.DC","cs.DS","q-bio.NC"],"title_canon_sha256":"546de3d15e6b76d180961f55a50939d92f548278c81d681f20b0959886ca2658","abstract_canon_sha256":"62dbdb6b410139085f9e81554c3387eac3acb3286f28334f26b9604a9a4dcd42"},"schema_version":"1.0"},"canonical_sha256":"0c081636f4925aca5ca819d253eda28efd4653efaafa860362d868e48372ecea","source":{"kind":"arxiv","id":"1706.01382","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01382","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01382v2","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01382","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"BQEBMNXUSJNM","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQEBMNXUSJNMUXFI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQEBMNXU","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BQEBMNXUSJNMUXFIDHJFH3NCR3","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-06-05T15:43:40Z","cross_cats_sorted":["cs.DC","cs.DS","q-bio.NC"],"title_canon_sha256":"546de3d15e6b76d180961f55a50939d92f548278c81d681f20b0959886ca2658","abstract_canon_sha256":"62dbdb6b410139085f9e81554c3387eac3acb3286f28334f26b9604a9a4dcd42"},"schema_version":"1.0"},"canonical_sha256":"0c081636f4925aca5ca819d253eda28efd4653efaafa860362d868e48372ecea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:44.919462Z","signature_b64":"HnQ7v8BYxLrvj7cC0TyUhouBFq8Z2fy9UgrYNCQPypEo79/dIik+jav4ZQkF+O3/rSPBDfDrEt300hVZVbVDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c081636f4925aca5ca819d253eda28efd4653efaafa860362d868e48372ecea","last_reissued_at":"2026-05-18T00:37:44.918718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:44.918718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01382","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-05-18T00:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zXYY0aLMOhYXtrRnBNEKG5qqivjmgJemCsdsNaOD4I86rG4Yio/BqhkJpsGRFRwjsi0fsLzXBhTA68+xivZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:30:09.944665Z"},"content_sha256":"90027941ac605f01307e96ddb7053eb21c719aa33fa45d7ef783c98551c36918","schema_version":"1.0","event_id":"sha256:90027941ac605f01307e96ddb7053eb21c719aa33fa45d7ef783c98551c36918"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BQEBMNXUSJNMUXFIDHJFH3NCR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","q-bio.NC"],"primary_cat":"cs.NE","authors_text":"Cameron Musco, Merav Parter, Nancy Lynch","submitted_at":"2017-06-05T15:43:40Z","abstract_excerpt":"We study distributed algorithms implemented in a simplified biologically inspired model for stochastic spiking neural networks. We focus on tradeoffs between computation time and network complexity, along with the role of randomness in efficient neural computation.\n  It is widely accepted that neural computation is inherently stochastic. In recent work, we explored how this stochasticity could be leveraged to solve the `winner-take-all' leader election task. Here, we focus on using randomness in neural algorithms for similarity testing and compression. In the most basic setting, given two $n$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01382","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":""},"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-18T00:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRLuh1IDVX5cG06MsPTSj0wRLRNiSp62N0Rjr3pTwu8YhUaSGUWW+SkkekvByIOKiBYbzXYamjGLwKorGr18Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:30:09.945055Z"},"content_sha256":"07afc3455058e983b2b28ee5169096bc0430ec1d716d38dce782a5fb4b74404e","schema_version":"1.0","event_id":"sha256:07afc3455058e983b2b28ee5169096bc0430ec1d716d38dce782a5fb4b74404e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3/bundle.json","state_url":"https://pith.science/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3/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-05-27T18:30:09Z","links":{"resolver":"https://pith.science/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3","bundle":"https://pith.science/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3/bundle.json","state":"https://pith.science/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQEBMNXUSJNMUXFIDHJFH3NCR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BQEBMNXUSJNMUXFIDHJFH3NCR3","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":"62dbdb6b410139085f9e81554c3387eac3acb3286f28334f26b9604a9a4dcd42","cross_cats_sorted":["cs.DC","cs.DS","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-06-05T15:43:40Z","title_canon_sha256":"546de3d15e6b76d180961f55a50939d92f548278c81d681f20b0959886ca2658"},"schema_version":"1.0","source":{"id":"1706.01382","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01382","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01382v2","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01382","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"BQEBMNXUSJNM","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQEBMNXUSJNMUXFI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQEBMNXU","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:07afc3455058e983b2b28ee5169096bc0430ec1d716d38dce782a5fb4b74404e","target":"graph","created_at":"2026-05-18T00:37:44Z","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":"We study distributed algorithms implemented in a simplified biologically inspired model for stochastic spiking neural networks. We focus on tradeoffs between computation time and network complexity, along with the role of randomness in efficient neural computation.\n  It is widely accepted that neural computation is inherently stochastic. In recent work, we explored how this stochasticity could be leveraged to solve the `winner-take-all' leader election task. Here, we focus on using randomness in neural algorithms for similarity testing and compression. In the most basic setting, given two $n$-","authors_text":"Cameron Musco, Merav Parter, Nancy Lynch","cross_cats":["cs.DC","cs.DS","q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-06-05T15:43:40Z","title":"Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01382","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:90027941ac605f01307e96ddb7053eb21c719aa33fa45d7ef783c98551c36918","target":"record","created_at":"2026-05-18T00:37:44Z","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":"62dbdb6b410139085f9e81554c3387eac3acb3286f28334f26b9604a9a4dcd42","cross_cats_sorted":["cs.DC","cs.DS","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-06-05T15:43:40Z","title_canon_sha256":"546de3d15e6b76d180961f55a50939d92f548278c81d681f20b0959886ca2658"},"schema_version":"1.0","source":{"id":"1706.01382","kind":"arxiv","version":2}},"canonical_sha256":"0c081636f4925aca5ca819d253eda28efd4653efaafa860362d868e48372ecea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c081636f4925aca5ca819d253eda28efd4653efaafa860362d868e48372ecea","first_computed_at":"2026-05-18T00:37:44.918718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:44.918718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HnQ7v8BYxLrvj7cC0TyUhouBFq8Z2fy9UgrYNCQPypEo79/dIik+jav4ZQkF+O3/rSPBDfDrEt300hVZVbVDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:44.919462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01382","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90027941ac605f01307e96ddb7053eb21c719aa33fa45d7ef783c98551c36918","sha256:07afc3455058e983b2b28ee5169096bc0430ec1d716d38dce782a5fb4b74404e"],"state_sha256":"8aa3fb5a1e2665925f088eb0283c31f4e29323384a4b0a962e5bb768d7d24343"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huBNJ3q3vZ5oj9T5kzASi16FpKwduIY4t3pY/EgoNdsshywNDfLYX645paGmouhwY9VT3wUwyuz5IV5VReS4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:30:09.948398Z","bundle_sha256":"2534f08fe663c25c7a6232601bbe6359d772c2e9e1c44517706e55625e7efdff"}}