{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ITKUGKJMBPUBN7YORSJVPULCRV","short_pith_number":"pith:ITKUGKJM","schema_version":"1.0","canonical_sha256":"44d543292c0be816ff0e8c9357d1628d742363dfbc3f24fe5c465e9356ba79da","source":{"kind":"arxiv","id":"1802.03488","version":1},"attestation_state":"computed","paper":{"title":"Generalization of an Upper Bound on the Number of Nodes Needed to Achieve Linear Separability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Katja Seeliger, Marcel van Gerven, Marjolein Troost","submitted_at":"2018-02-10T00:49:51Z","abstract_excerpt":"An important issue in neural network research is how to choose the number of nodes and layers such as to solve a classification problem. We provide new intuitions based on earlier results by An et al. (2015) by deriving an upper bound on the number of nodes in networks with two hidden layers such that linear separability can be achieved. Concretely, we show that if the data can be described in terms of N finite sets and the used activation function f is non-constant, increasing and has a left asymptote, we can derive how many nodes are needed to linearly separate these sets. This will be an up"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.03488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-10T00:49:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0623b327c94e15a3ae2fab8b026f6f4f5c0b95080b5259188b022784d8d34163","abstract_canon_sha256":"815e829c1948f15f1ade346000ccbe9182bf553ba1cf0a0210639008a977e657"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:51.431853Z","signature_b64":"iSuTItOkVfcpqLIg4L8cmSQSjkmZ2dvARt6Qy6bXJkJTWeeyHBenulimO9zcCWMUWv5S5XkU4z+ij/5EGaF/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44d543292c0be816ff0e8c9357d1628d742363dfbc3f24fe5c465e9356ba79da","last_reissued_at":"2026-05-18T00:23:51.431180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:51.431180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization of an Upper Bound on the Number of Nodes Needed to Achieve Linear Separability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Katja Seeliger, Marcel van Gerven, Marjolein Troost","submitted_at":"2018-02-10T00:49:51Z","abstract_excerpt":"An important issue in neural network research is how to choose the number of nodes and layers such as to solve a classification problem. We provide new intuitions based on earlier results by An et al. (2015) by deriving an upper bound on the number of nodes in networks with two hidden layers such that linear separability can be achieved. Concretely, we show that if the data can be described in terms of N finite sets and the used activation function f is non-constant, increasing and has a left asymptote, we can derive how many nodes are needed to linearly separate these sets. This will be an up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03488","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.03488","created_at":"2026-05-18T00:23:51.431284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03488v1","created_at":"2026-05-18T00:23:51.431284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03488","created_at":"2026-05-18T00:23:51.431284+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITKUGKJMBPUB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITKUGKJMBPUBN7YO","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITKUGKJM","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV","json":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV.json","graph_json":"https://pith.science/api/pith-number/ITKUGKJMBPUBN7YORSJVPULCRV/graph.json","events_json":"https://pith.science/api/pith-number/ITKUGKJMBPUBN7YORSJVPULCRV/events.json","paper":"https://pith.science/paper/ITKUGKJM"},"agent_actions":{"view_html":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV","download_json":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV.json","view_paper":"https://pith.science/paper/ITKUGKJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03488&json=true","fetch_graph":"https://pith.science/api/pith-number/ITKUGKJMBPUBN7YORSJVPULCRV/graph.json","fetch_events":"https://pith.science/api/pith-number/ITKUGKJMBPUBN7YORSJVPULCRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV/action/storage_attestation","attest_author":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV/action/author_attestation","sign_citation":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV/action/citation_signature","submit_replication":"https://pith.science/pith/ITKUGKJMBPUBN7YORSJVPULCRV/action/replication_record"}},"created_at":"2026-05-18T00:23:51.431284+00:00","updated_at":"2026-05-18T00:23:51.431284+00:00"}