{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IZYUA4Z7D36JL4C4PPE45O5QV5","short_pith_number":"pith:IZYUA4Z7","canonical_record":{"source":{"id":"1512.03850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-12-12T00:08:27Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"007659e8095f3699a7c97a2c5d8d393fc0b43eb2d6be775beed8571e02262b65","abstract_canon_sha256":"c2556ee2ee96b25bbfdec156d00c3fec4c1a1806dcefb77e654c2f5e73ba3ed1"},"schema_version":"1.0"},"canonical_sha256":"467140733f1efc95f05c7bc9cebbb0af54492a7d632541b3bf3328ef21f4cc3c","source":{"kind":"arxiv","id":"1512.03850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03850","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03850v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03850","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"IZYUA4Z7D36J","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZYUA4Z7D36JL4C4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZYUA4Z7","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IZYUA4Z7D36JL4C4PPE45O5QV5","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-12-12T00:08:27Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"007659e8095f3699a7c97a2c5d8d393fc0b43eb2d6be775beed8571e02262b65","abstract_canon_sha256":"c2556ee2ee96b25bbfdec156d00c3fec4c1a1806dcefb77e654c2f5e73ba3ed1"},"schema_version":"1.0"},"canonical_sha256":"467140733f1efc95f05c7bc9cebbb0af54492a7d632541b3bf3328ef21f4cc3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:55.440414Z","signature_b64":"4Uk30/OZl9FdU0CE1AwnL/t5vTieiXCTDSvT1pnvGN0HmLzKpqh/1hsd6L1V6NGbMBEsXhu6DsU9Hr0LQr70DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467140733f1efc95f05c7bc9cebbb0af54492a7d632541b3bf3328ef21f4cc3c","last_reissued_at":"2026-05-18T01:10:55.439868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:55.439868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03850","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-18T01:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzFve8ORIwWyqIGhoFbexlg449NBY89WPiZh5iPtf63JfzUigzMUBdKLIjw7J0TI1Hw6yr4sv+xOCP44z5EuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:55:13.303591Z"},"content_sha256":"ae71561724cec985d190cce9dc0fec2ff84713c06effe4c6b026e88f1a11f4e8","schema_version":"1.0","event_id":"sha256:ae71561724cec985d190cce9dc0fec2ff84713c06effe4c6b026e88f1a11f4e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IZYUA4Z7D36JL4C4PPE45O5QV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Perceptrons for Memorizing Complex Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"q-bio.NC","authors_text":"Danh-Tai Hoang, Junghyo Jo, Juyong Song, Marissa Pastor","submitted_at":"2015-12-12T00:08:27Z","abstract_excerpt":"Feedforward neural networks have been investigated to understand learning and memory, as well as applied to numerous practical problems in pattern classification. It is a rule of thumb that more complex tasks require larger networks. However, the design of optimal network architectures for specific tasks is still an unsolved fundamental problem. In this study, we consider three-layered neural networks for memorizing binary patterns. We developed a new complexity measure of binary patterns, and estimated the minimal network size for memorizing them as a function of their complexity. We formulat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03850","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-18T01:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWFtpv0eNEjjkjCWFmid8zm/uOR1HEp63R8QpXpGlOsK6sCrF7K+2F8KKDeYa2A+o4x1rkXCx9F9opNX4DXuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:55:13.303938Z"},"content_sha256":"3a93ba78804299a814ee324537370678382291c04c1c5269f81dd652c77b873f","schema_version":"1.0","event_id":"sha256:3a93ba78804299a814ee324537370678382291c04c1c5269f81dd652c77b873f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZYUA4Z7D36JL4C4PPE45O5QV5/bundle.json","state_url":"https://pith.science/pith/IZYUA4Z7D36JL4C4PPE45O5QV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZYUA4Z7D36JL4C4PPE45O5QV5/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-23T07:55:13Z","links":{"resolver":"https://pith.science/pith/IZYUA4Z7D36JL4C4PPE45O5QV5","bundle":"https://pith.science/pith/IZYUA4Z7D36JL4C4PPE45O5QV5/bundle.json","state":"https://pith.science/pith/IZYUA4Z7D36JL4C4PPE45O5QV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZYUA4Z7D36JL4C4PPE45O5QV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IZYUA4Z7D36JL4C4PPE45O5QV5","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":"c2556ee2ee96b25bbfdec156d00c3fec4c1a1806dcefb77e654c2f5e73ba3ed1","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-12-12T00:08:27Z","title_canon_sha256":"007659e8095f3699a7c97a2c5d8d393fc0b43eb2d6be775beed8571e02262b65"},"schema_version":"1.0","source":{"id":"1512.03850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03850","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03850v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03850","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"IZYUA4Z7D36J","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZYUA4Z7D36JL4C4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZYUA4Z7","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:3a93ba78804299a814ee324537370678382291c04c1c5269f81dd652c77b873f","target":"graph","created_at":"2026-05-18T01:10:55Z","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":"Feedforward neural networks have been investigated to understand learning and memory, as well as applied to numerous practical problems in pattern classification. It is a rule of thumb that more complex tasks require larger networks. However, the design of optimal network architectures for specific tasks is still an unsolved fundamental problem. In this study, we consider three-layered neural networks for memorizing binary patterns. We developed a new complexity measure of binary patterns, and estimated the minimal network size for memorizing them as a function of their complexity. We formulat","authors_text":"Danh-Tai Hoang, Junghyo Jo, Juyong Song, Marissa Pastor","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-12-12T00:08:27Z","title":"Minimal Perceptrons for Memorizing Complex Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03850","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:ae71561724cec985d190cce9dc0fec2ff84713c06effe4c6b026e88f1a11f4e8","target":"record","created_at":"2026-05-18T01:10:55Z","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":"c2556ee2ee96b25bbfdec156d00c3fec4c1a1806dcefb77e654c2f5e73ba3ed1","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2015-12-12T00:08:27Z","title_canon_sha256":"007659e8095f3699a7c97a2c5d8d393fc0b43eb2d6be775beed8571e02262b65"},"schema_version":"1.0","source":{"id":"1512.03850","kind":"arxiv","version":1}},"canonical_sha256":"467140733f1efc95f05c7bc9cebbb0af54492a7d632541b3bf3328ef21f4cc3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"467140733f1efc95f05c7bc9cebbb0af54492a7d632541b3bf3328ef21f4cc3c","first_computed_at":"2026-05-18T01:10:55.439868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:55.439868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Uk30/OZl9FdU0CE1AwnL/t5vTieiXCTDSvT1pnvGN0HmLzKpqh/1hsd6L1V6NGbMBEsXhu6DsU9Hr0LQr70DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:55.440414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae71561724cec985d190cce9dc0fec2ff84713c06effe4c6b026e88f1a11f4e8","sha256:3a93ba78804299a814ee324537370678382291c04c1c5269f81dd652c77b873f"],"state_sha256":"04d5d88812ab835ffdbcc278ef13c1af51ed03de4d9ed9cf91fcd35177370cd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd3H9ecUwrJJzpE65rTfHfCUjyUZ4miE2ukK1ASavsh0iVkxzBpRFD4ih45J16ASvZ3M6WP/C4paBTaHZWbbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:55:13.305904Z","bundle_sha256":"c6368079a6645170ea0f4710f63ae8c8a224b47c43027d8ae3f4dc6f6057f9fd"}}