{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TGXJBXQMOQTMDCT33NKLCTQYBY","short_pith_number":"pith:TGXJBXQM","canonical_record":{"source":{"id":"1901.00434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T16:05:28Z","cross_cats_sorted":["cs.NE","math.CO","stat.ML"],"title_canon_sha256":"6da1e3ce1dd8ebdf22b94c7fbda1e5b3b2163d7c46df63caedd67e369ae2c0dc","abstract_canon_sha256":"79a63a58d03d9d5a35b63656e9dae3de4f3faccb422b7019ff429fa135e6fd45"},"schema_version":"1.0"},"canonical_sha256":"99ae90de0c7426c18a7bdb54b14e180e239a34655f9b48fd74688280e9b999e2","source":{"kind":"arxiv","id":"1901.00434","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00434","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00434v2","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00434","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"TGXJBXQMOQTM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TGXJBXQMOQTMDCT3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TGXJBXQM","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TGXJBXQMOQTMDCT33NKLCTQYBY","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T16:05:28Z","cross_cats_sorted":["cs.NE","math.CO","stat.ML"],"title_canon_sha256":"6da1e3ce1dd8ebdf22b94c7fbda1e5b3b2163d7c46df63caedd67e369ae2c0dc","abstract_canon_sha256":"79a63a58d03d9d5a35b63656e9dae3de4f3faccb422b7019ff429fa135e6fd45"},"schema_version":"1.0"},"canonical_sha256":"99ae90de0c7426c18a7bdb54b14e180e239a34655f9b48fd74688280e9b999e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:02.353691Z","signature_b64":"aDZz3jgAXutrB/A79ZLCZ2kB0Ul5GSHbWlHluHbTxHtfV/aHK/dGPMEoLv19uXqaCpSGCVyLXWcgryJm5tMjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99ae90de0c7426c18a7bdb54b14e180e239a34655f9b48fd74688280e9b999e2","last_reissued_at":"2026-05-17T23:50:02.353199Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:02.353199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00434","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-17T23:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2Som9jHxinssTP+n+X3ypRJJD3tmJJYEyMG2h+eiU9itBMXAi+aEy8ieZN/bZNmmdDddHpYjHaFWnU4uogYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:42:19.354647Z"},"content_sha256":"41c4c2df96d2925e9cadab6c8a40f8153a712576dd0698d462e2ad1cb6c8ba2c","schema_version":"1.0","event_id":"sha256:41c4c2df96d2925e9cadab6c8a40f8153a712576dd0698d462e2ad1cb6c8ba2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TGXJBXQMOQTMDCT33NKLCTQYBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The capacity of feedforward neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Pierre Baldi, Roman Vershynin","submitted_at":"2019-01-02T16:05:28Z","abstract_excerpt":"A long standing open problem in the theory of neural networks is the development of quantitative methods to estimate and compare the capabilities of different architectures. Here we define the capacity of an architecture by the binary logarithm of the number of functions it can compute, as the synaptic weights are varied. The capacity provides an upper bound on the number of bits that can be extracted from the training data and stored in the architecture during learning. We study the capacity of layered, fully-connected, architectures of linear threshold neurons with $L$ layers of size $n_1,n_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00434","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-17T23:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDh/N80yZrt5iKy2UoXrgEMpSyWlq/YoxpW/skcWZFXyK1eFxC8jw04XuK9EqmSuaq2z+5bKGW7dITeNshPDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:42:19.355325Z"},"content_sha256":"c21860b82af3d6eeac25a108ce24e372d9a48362b8714761c4dc477081608170","schema_version":"1.0","event_id":"sha256:c21860b82af3d6eeac25a108ce24e372d9a48362b8714761c4dc477081608170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGXJBXQMOQTMDCT33NKLCTQYBY/bundle.json","state_url":"https://pith.science/pith/TGXJBXQMOQTMDCT33NKLCTQYBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGXJBXQMOQTMDCT33NKLCTQYBY/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-26T21:42:19Z","links":{"resolver":"https://pith.science/pith/TGXJBXQMOQTMDCT33NKLCTQYBY","bundle":"https://pith.science/pith/TGXJBXQMOQTMDCT33NKLCTQYBY/bundle.json","state":"https://pith.science/pith/TGXJBXQMOQTMDCT33NKLCTQYBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGXJBXQMOQTMDCT33NKLCTQYBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TGXJBXQMOQTMDCT33NKLCTQYBY","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":"79a63a58d03d9d5a35b63656e9dae3de4f3faccb422b7019ff429fa135e6fd45","cross_cats_sorted":["cs.NE","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T16:05:28Z","title_canon_sha256":"6da1e3ce1dd8ebdf22b94c7fbda1e5b3b2163d7c46df63caedd67e369ae2c0dc"},"schema_version":"1.0","source":{"id":"1901.00434","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00434","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00434v2","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00434","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"TGXJBXQMOQTM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TGXJBXQMOQTMDCT3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TGXJBXQM","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:c21860b82af3d6eeac25a108ce24e372d9a48362b8714761c4dc477081608170","target":"graph","created_at":"2026-05-17T23:50:02Z","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":"A long standing open problem in the theory of neural networks is the development of quantitative methods to estimate and compare the capabilities of different architectures. Here we define the capacity of an architecture by the binary logarithm of the number of functions it can compute, as the synaptic weights are varied. The capacity provides an upper bound on the number of bits that can be extracted from the training data and stored in the architecture during learning. We study the capacity of layered, fully-connected, architectures of linear threshold neurons with $L$ layers of size $n_1,n_","authors_text":"Pierre Baldi, Roman Vershynin","cross_cats":["cs.NE","math.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T16:05:28Z","title":"The capacity of feedforward neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00434","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:41c4c2df96d2925e9cadab6c8a40f8153a712576dd0698d462e2ad1cb6c8ba2c","target":"record","created_at":"2026-05-17T23:50:02Z","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":"79a63a58d03d9d5a35b63656e9dae3de4f3faccb422b7019ff429fa135e6fd45","cross_cats_sorted":["cs.NE","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T16:05:28Z","title_canon_sha256":"6da1e3ce1dd8ebdf22b94c7fbda1e5b3b2163d7c46df63caedd67e369ae2c0dc"},"schema_version":"1.0","source":{"id":"1901.00434","kind":"arxiv","version":2}},"canonical_sha256":"99ae90de0c7426c18a7bdb54b14e180e239a34655f9b48fd74688280e9b999e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99ae90de0c7426c18a7bdb54b14e180e239a34655f9b48fd74688280e9b999e2","first_computed_at":"2026-05-17T23:50:02.353199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:02.353199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aDZz3jgAXutrB/A79ZLCZ2kB0Ul5GSHbWlHluHbTxHtfV/aHK/dGPMEoLv19uXqaCpSGCVyLXWcgryJm5tMjBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:02.353691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00434","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41c4c2df96d2925e9cadab6c8a40f8153a712576dd0698d462e2ad1cb6c8ba2c","sha256:c21860b82af3d6eeac25a108ce24e372d9a48362b8714761c4dc477081608170"],"state_sha256":"767036933ff285ff8cf619b3e3e86439cb3f8ceadbd42a29815a51ed7910af80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xO8zE9n2Ggb7YOgF2vbvIni7qmHq8pkw3xmhrR+YGjuBKK0/tDSR6eo893Pc2SK1H3syUHJ6S4VxgEsj6dqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:42:19.358836Z","bundle_sha256":"ceaf3f1c5d548c2e615fdbf694c64d2de8aed6cdeff49e4e01a4710bdf84b587"}}