{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IOODR5OTRFDDOXPNFGKW4JKRU3","short_pith_number":"pith:IOODR5OT","schema_version":"1.0","canonical_sha256":"439c38f5d38946375ded29956e2551a6cc6749eb20b4c7c0671337c0f52addf0","source":{"kind":"arxiv","id":"2205.11716","version":2},"attestation_state":"computed","paper":{"title":"Randomly Initialized One-Layer Neural Networks Make Data Linearly Separable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Promit Ghosal, Srinath Mahankali, Yihang Sun","submitted_at":"2022-05-24T01:38:43Z","abstract_excerpt":"Recently, neural networks have demonstrated remarkable capabilities in mapping two arbitrary sets to two linearly separable sets. The prospect of achieving this with randomly initialized neural networks is particularly appealing due to the computational efficiency compared to fully trained networks. This paper contributes by establishing that, given sufficient width, a randomly initialized one-layer neural network can, with high probability, transform two sets into two linearly separable sets without any training. Moreover, we furnish precise bounds on the necessary width of the neural network"},"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":"2205.11716","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T01:38:43Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"5b04649662440adb253e0b5038743b8fca38b1c7ceb4c9199111da1c4808878e","abstract_canon_sha256":"2f9a6a0876520f228863143d8a5a201ba30d7f6f5a5228bbaa92a7d97c6e2820"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:04.997347Z","signature_b64":"MiBESEm9zwookXFCBDrNvbzsOPpo6qxdEC2VStRfJk8cCdyONGn0K/5ah+4wLN8HXPpJtDEws+Hboqi4hNvyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439c38f5d38946375ded29956e2551a6cc6749eb20b4c7c0671337c0f52addf0","last_reissued_at":"2026-07-05T06:58:04.996870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:04.996870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomly Initialized One-Layer Neural Networks Make Data Linearly Separable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Promit Ghosal, Srinath Mahankali, Yihang Sun","submitted_at":"2022-05-24T01:38:43Z","abstract_excerpt":"Recently, neural networks have demonstrated remarkable capabilities in mapping two arbitrary sets to two linearly separable sets. The prospect of achieving this with randomly initialized neural networks is particularly appealing due to the computational efficiency compared to fully trained networks. This paper contributes by establishing that, given sufficient width, a randomly initialized one-layer neural network can, with high probability, transform two sets into two linearly separable sets without any training. Moreover, we furnish precise bounds on the necessary width of the neural network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.11716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.11716","created_at":"2026-07-05T06:58:04.996928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.11716v2","created_at":"2026-07-05T06:58:04.996928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11716","created_at":"2026-07-05T06:58:04.996928+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOODR5OTRFDD","created_at":"2026-07-05T06:58:04.996928+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOODR5OTRFDDOXPN","created_at":"2026-07-05T06:58:04.996928+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOODR5OT","created_at":"2026-07-05T06:58:04.996928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13479","citing_title":"Position: Pause Recycling LoRAs and Prioritize Mechanisms to Uncover Limits and Effectiveness","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3","json":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3.json","graph_json":"https://pith.science/api/pith-number/IOODR5OTRFDDOXPNFGKW4JKRU3/graph.json","events_json":"https://pith.science/api/pith-number/IOODR5OTRFDDOXPNFGKW4JKRU3/events.json","paper":"https://pith.science/paper/IOODR5OT"},"agent_actions":{"view_html":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3","download_json":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3.json","view_paper":"https://pith.science/paper/IOODR5OT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.11716&json=true","fetch_graph":"https://pith.science/api/pith-number/IOODR5OTRFDDOXPNFGKW4JKRU3/graph.json","fetch_events":"https://pith.science/api/pith-number/IOODR5OTRFDDOXPNFGKW4JKRU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3/action/storage_attestation","attest_author":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3/action/author_attestation","sign_citation":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3/action/citation_signature","submit_replication":"https://pith.science/pith/IOODR5OTRFDDOXPNFGKW4JKRU3/action/replication_record"}},"created_at":"2026-07-05T06:58:04.996928+00:00","updated_at":"2026-07-05T06:58:04.996928+00:00"}