{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HYZB5WHB3A77BJX22U7LZHYDXX","short_pith_number":"pith:HYZB5WHB","canonical_record":{"source":{"id":"1302.1156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-02-05T19:14:39Z","cross_cats_sorted":[],"title_canon_sha256":"5cfd126930168d31d7095201c394d32abd00a13e3a943a8e5a7c2f57bb81fa62","abstract_canon_sha256":"beb8a041d6656e69815063ea9298b212fd76f12de82d4d87759b9d8d3d57a0fb"},"schema_version":"1.0"},"canonical_sha256":"3e321ed8e1d83ff0a6fad53ebc9f03bdf444ea9a98587e9a8eedf16f369442dc","source":{"kind":"arxiv","id":"1302.1156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1156","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1156v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1156","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"HYZB5WHB3A77","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HYZB5WHB3A77BJX2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HYZB5WHB","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HYZB5WHB3A77BJX22U7LZHYDXX","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-02-05T19:14:39Z","cross_cats_sorted":[],"title_canon_sha256":"5cfd126930168d31d7095201c394d32abd00a13e3a943a8e5a7c2f57bb81fa62","abstract_canon_sha256":"beb8a041d6656e69815063ea9298b212fd76f12de82d4d87759b9d8d3d57a0fb"},"schema_version":"1.0"},"canonical_sha256":"3e321ed8e1d83ff0a6fad53ebc9f03bdf444ea9a98587e9a8eedf16f369442dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:37.154388Z","signature_b64":"48a1qVtrrxlEB4tbQJq2bS61iBoMj41MM6B8pHpXrnjqFCafK+6s1OtzUdozv37zIddjRk8yMW5HkOFm7xn/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e321ed8e1d83ff0a6fad53ebc9f03bdf444ea9a98587e9a8eedf16f369442dc","last_reissued_at":"2026-05-18T03:33:37.153640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:37.153640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1156","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-18T03:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3YLOwPCrPOSYSLQC7XVQoQfaxGkNTX1L2vw+OSRcGLtDkh6H7HkfqQYgcxQBsZpILQVb3pr7VjIYWqojaOSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:04:29.451902Z"},"content_sha256":"2ef67fec746886e715bc800a28e5bed7093597fc85c26b73d1748a15adff9cf2","schema_version":"1.0","event_id":"sha256:2ef67fec746886e715bc800a28e5bed7093597fc85c26b73d1748a15adff9cf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HYZB5WHB3A77BJX22U7LZHYDXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Non-Binary Associative Memory with Exponential Pattern Retrieval Capacity and Iterative Learning: Extended Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Amin Shokrollahi, Amir Hesam Salavati, K. Raj Kumar","submitted_at":"2013-02-05T19:14:39Z","abstract_excerpt":"We consider the problem of neural association for a network of non-binary neurons. Here, the task is to first memorize a set of patterns using a network of neurons whose states assume values from a finite number of integer levels. Later, the same network should be able to recall previously memorized patterns from their noisy versions. Prior work in this area consider storing a finite number of purely random patterns, and have shown that the pattern retrieval capacities (maximum number of patterns that can be memorized) scale only linearly with the number of neurons in the network.\n  In our for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1156","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-18T03:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZMBW8DrfxCtvb224PcTumCmbDV4gGbciKDwogCqWdvw7yqdgJhT2sHJdmDh2aAMw89mf90RflL4VTAl6n4ACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:04:29.452246Z"},"content_sha256":"1d469436a998f74fa4b99f7edf1a69ad95fc40b5d45969d689f83d82b5568dc8","schema_version":"1.0","event_id":"sha256:1d469436a998f74fa4b99f7edf1a69ad95fc40b5d45969d689f83d82b5568dc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYZB5WHB3A77BJX22U7LZHYDXX/bundle.json","state_url":"https://pith.science/pith/HYZB5WHB3A77BJX22U7LZHYDXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYZB5WHB3A77BJX22U7LZHYDXX/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-25T19:04:29Z","links":{"resolver":"https://pith.science/pith/HYZB5WHB3A77BJX22U7LZHYDXX","bundle":"https://pith.science/pith/HYZB5WHB3A77BJX22U7LZHYDXX/bundle.json","state":"https://pith.science/pith/HYZB5WHB3A77BJX22U7LZHYDXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYZB5WHB3A77BJX22U7LZHYDXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HYZB5WHB3A77BJX22U7LZHYDXX","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":"beb8a041d6656e69815063ea9298b212fd76f12de82d4d87759b9d8d3d57a0fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-02-05T19:14:39Z","title_canon_sha256":"5cfd126930168d31d7095201c394d32abd00a13e3a943a8e5a7c2f57bb81fa62"},"schema_version":"1.0","source":{"id":"1302.1156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1156","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1156v2","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1156","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"HYZB5WHB3A77","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HYZB5WHB3A77BJX2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HYZB5WHB","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:1d469436a998f74fa4b99f7edf1a69ad95fc40b5d45969d689f83d82b5568dc8","target":"graph","created_at":"2026-05-18T03:33:37Z","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 consider the problem of neural association for a network of non-binary neurons. Here, the task is to first memorize a set of patterns using a network of neurons whose states assume values from a finite number of integer levels. Later, the same network should be able to recall previously memorized patterns from their noisy versions. Prior work in this area consider storing a finite number of purely random patterns, and have shown that the pattern retrieval capacities (maximum number of patterns that can be memorized) scale only linearly with the number of neurons in the network.\n  In our for","authors_text":"Amin Shokrollahi, Amir Hesam Salavati, K. Raj Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-02-05T19:14:39Z","title":"A Non-Binary Associative Memory with Exponential Pattern Retrieval Capacity and Iterative Learning: Extended Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1156","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:2ef67fec746886e715bc800a28e5bed7093597fc85c26b73d1748a15adff9cf2","target":"record","created_at":"2026-05-18T03:33:37Z","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":"beb8a041d6656e69815063ea9298b212fd76f12de82d4d87759b9d8d3d57a0fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-02-05T19:14:39Z","title_canon_sha256":"5cfd126930168d31d7095201c394d32abd00a13e3a943a8e5a7c2f57bb81fa62"},"schema_version":"1.0","source":{"id":"1302.1156","kind":"arxiv","version":2}},"canonical_sha256":"3e321ed8e1d83ff0a6fad53ebc9f03bdf444ea9a98587e9a8eedf16f369442dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e321ed8e1d83ff0a6fad53ebc9f03bdf444ea9a98587e9a8eedf16f369442dc","first_computed_at":"2026-05-18T03:33:37.153640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:37.153640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48a1qVtrrxlEB4tbQJq2bS61iBoMj41MM6B8pHpXrnjqFCafK+6s1OtzUdozv37zIddjRk8yMW5HkOFm7xn/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:37.154388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ef67fec746886e715bc800a28e5bed7093597fc85c26b73d1748a15adff9cf2","sha256:1d469436a998f74fa4b99f7edf1a69ad95fc40b5d45969d689f83d82b5568dc8"],"state_sha256":"3320dec63233c0e67cbf6b9edd26aa11eebd1e030c45ce2dde2a938ac960f5f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxlrO5n0d8w3q7a5vqYiEXPxCix8VK7uOJn2kZgfTtk3DP4aGKHmPr640D8uCKti5HUDEqkLfEhrOjd8K/B+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:04:29.454190Z","bundle_sha256":"3ef3f86f57e2e6c7db19d618ae8da5791069649f840a732b5fd46fb81ed4c51d"}}