{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:26PFQADSQVVPJ47NW65OS54IP3","short_pith_number":"pith:26PFQADS","canonical_record":{"source":{"id":"1202.2770","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-13T15:48:04Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"8107302b5ae04fe74fbbe63d7d98467209a666827215bd9f72dd903384325c7b","abstract_canon_sha256":"a69203587116c279145b81e2b9127ef10ccd51ab4b13dd3ee5485a64820ccd1f"},"schema_version":"1.0"},"canonical_sha256":"d79e580072856af4f3edb7bae977887efccb3180ae0777dd4961443ceafef21d","source":{"kind":"arxiv","id":"1202.2770","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2770","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2770v4","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2770","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"26PFQADSQVVP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"26PFQADSQVVPJ47N","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"26PFQADS","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:26PFQADSQVVPJ47NW65OS54IP3","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2770","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-13T15:48:04Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"8107302b5ae04fe74fbbe63d7d98467209a666827215bd9f72dd903384325c7b","abstract_canon_sha256":"a69203587116c279145b81e2b9127ef10ccd51ab4b13dd3ee5485a64820ccd1f"},"schema_version":"1.0"},"canonical_sha256":"d79e580072856af4f3edb7bae977887efccb3180ae0777dd4961443ceafef21d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:54.659865Z","signature_b64":"KYgyCJ0EWm2XEhGxmAxFPoN80o4AeZucoOkHEeMk+si2WBjQHa3Y56aqq99X63dBnDWkZyQXKpUduNAmC6HQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79e580072856af4f3edb7bae977887efccb3180ae0777dd4961443ceafef21d","last_reissued_at":"2026-05-18T03:52:54.659065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:54.659065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2770","source_version":4,"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:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIIOGNffcARZVzduzNlMAa74dyG/xE31DNm8lvRNi2GwZEvRvPMcMazRxOdLWp2/mduCaD4meP4ztwotDHi0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:53:15.135596Z"},"content_sha256":"09ef0687bd9f8a1e6f9760eeb9ef56b863d9684d12d0b3e26944ced5183b0800","schema_version":"1.0","event_id":"sha256:09ef0687bd9f8a1e6f9760eeb9ef56b863d9684d12d0b3e26944ced5183b0800"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:26PFQADSQVVPJ47NW65OS54IP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Level Error-Resilient Neural Networks with Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.NE","authors_text":"Amin Karbasi, Amir Hesam Salavati","submitted_at":"2012-02-13T15:48:04Z","abstract_excerpt":"The problem of neural network association is to retrieve a previously memorized pattern from its noisy version using a network of neurons. An ideal neural network should include three components simultaneously: a learning algorithm, a large pattern retrieval capacity and resilience against noise. Prior works in this area usually improve one or two aspects at the cost of the third.\n  Our work takes a step forward in closing this gap. More specifically, we show that by forcing natural constraints on the set of learning patterns, we can drastically improve the retrieval capacity of our neural net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2770","kind":"arxiv","version":4},"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:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zE1M8iJpqUH2qY6viR6Q7UaGEvL7YZQoGaXnkNLKsbh45K7QVASL7qHYKB7AGOR8Hn04O4z6H+weSV7fmHIBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:53:15.135951Z"},"content_sha256":"3e050ae5349ab69f9ccd3f96d2d13755e1d106db2b297b7b081a2b741ebda05b","schema_version":"1.0","event_id":"sha256:3e050ae5349ab69f9ccd3f96d2d13755e1d106db2b297b7b081a2b741ebda05b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26PFQADSQVVPJ47NW65OS54IP3/bundle.json","state_url":"https://pith.science/pith/26PFQADSQVVPJ47NW65OS54IP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26PFQADSQVVPJ47NW65OS54IP3/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-03T21:53:15Z","links":{"resolver":"https://pith.science/pith/26PFQADSQVVPJ47NW65OS54IP3","bundle":"https://pith.science/pith/26PFQADSQVVPJ47NW65OS54IP3/bundle.json","state":"https://pith.science/pith/26PFQADSQVVPJ47NW65OS54IP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26PFQADSQVVPJ47NW65OS54IP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:26PFQADSQVVPJ47NW65OS54IP3","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":"a69203587116c279145b81e2b9127ef10ccd51ab4b13dd3ee5485a64820ccd1f","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-13T15:48:04Z","title_canon_sha256":"8107302b5ae04fe74fbbe63d7d98467209a666827215bd9f72dd903384325c7b"},"schema_version":"1.0","source":{"id":"1202.2770","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2770","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2770v4","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2770","created_at":"2026-05-18T03:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"26PFQADSQVVP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"26PFQADSQVVPJ47N","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"26PFQADS","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:3e050ae5349ab69f9ccd3f96d2d13755e1d106db2b297b7b081a2b741ebda05b","target":"graph","created_at":"2026-05-18T03:52:54Z","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":"The problem of neural network association is to retrieve a previously memorized pattern from its noisy version using a network of neurons. An ideal neural network should include three components simultaneously: a learning algorithm, a large pattern retrieval capacity and resilience against noise. Prior works in this area usually improve one or two aspects at the cost of the third.\n  Our work takes a step forward in closing this gap. More specifically, we show that by forcing natural constraints on the set of learning patterns, we can drastically improve the retrieval capacity of our neural net","authors_text":"Amin Karbasi, Amir Hesam Salavati","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-13T15:48:04Z","title":"Multi-Level Error-Resilient Neural Networks with Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2770","kind":"arxiv","version":4},"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:09ef0687bd9f8a1e6f9760eeb9ef56b863d9684d12d0b3e26944ced5183b0800","target":"record","created_at":"2026-05-18T03:52:54Z","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":"a69203587116c279145b81e2b9127ef10ccd51ab4b13dd3ee5485a64820ccd1f","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-02-13T15:48:04Z","title_canon_sha256":"8107302b5ae04fe74fbbe63d7d98467209a666827215bd9f72dd903384325c7b"},"schema_version":"1.0","source":{"id":"1202.2770","kind":"arxiv","version":4}},"canonical_sha256":"d79e580072856af4f3edb7bae977887efccb3180ae0777dd4961443ceafef21d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d79e580072856af4f3edb7bae977887efccb3180ae0777dd4961443ceafef21d","first_computed_at":"2026-05-18T03:52:54.659065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:54.659065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYgyCJ0EWm2XEhGxmAxFPoN80o4AeZucoOkHEeMk+si2WBjQHa3Y56aqq99X63dBnDWkZyQXKpUduNAmC6HQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:54.659865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2770","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09ef0687bd9f8a1e6f9760eeb9ef56b863d9684d12d0b3e26944ced5183b0800","sha256:3e050ae5349ab69f9ccd3f96d2d13755e1d106db2b297b7b081a2b741ebda05b"],"state_sha256":"63ad1198cb3ea9f892e82ee7222e58ddd650ed15fcd71ae9f803e5daeb9ad901"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18evHsJc4NdvuKPqVqBfqnGBGBzozTDhvQF2R1zjlIRrtd85Rh1tJSrG58ebG6mN2uo8Y8V+JCKnh/3YeC/5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:53:15.137927Z","bundle_sha256":"cfa21ea936101ddce3c2fba40be67f757ca4bcc479dbd0ec59821c2380626810"}}