{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PE3HDXUIOFDYZMKA3R4OLXX2VX","short_pith_number":"pith:PE3HDXUI","schema_version":"1.0","canonical_sha256":"793671de8871478cb140dc78e5defaaddd496b317f805f9d71114f409c1a6bc6","source":{"kind":"arxiv","id":"2006.03741","version":1},"attestation_state":"computed","paper":{"title":"Expressivity of expand-and-sparsify representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Christopher Tosh, Sanjoy Dasgupta","submitted_at":"2020-06-05T23:36:59Z","abstract_excerpt":"A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \\in \\R^d$ is mapped to much higher dimension $m \\gg d$ by a random linear transformation, and is then sparsified by a winner-take-all process in which only the positions of the top $k$ values are retained, yielding a $k$-sparse vector $z \\in \\{0,1\\}^m$. We study the benefits of this representation for subsequent learning.\n  We first show a universal approximation property, that arbitrary continuous functions of $x$ are well approximated by linear functions of $z$, provid"},"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":"2006.03741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-06-05T23:36:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fbc56c0e9685aa3043c94d74795cc5070aab2c93e56b1b663cd0881ba60f26de","abstract_canon_sha256":"fa7aa34422f57525e802cba98ebbe48513a21e2f6d35ac543c4e3f494d59c042"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:32.549365Z","signature_b64":"EyA1GloYmJ7RIcxbwjKm80Y4rZlF65ayh4UfmQWQTOU2ZbbHkveO9W6XmzK3o4pjAQbH2h2h48pb1EiNTOnYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"793671de8871478cb140dc78e5defaaddd496b317f805f9d71114f409c1a6bc6","last_reissued_at":"2026-07-05T01:08:32.548873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:32.548873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expressivity of expand-and-sparsify representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Christopher Tosh, Sanjoy Dasgupta","submitted_at":"2020-06-05T23:36:59Z","abstract_excerpt":"A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \\in \\R^d$ is mapped to much higher dimension $m \\gg d$ by a random linear transformation, and is then sparsified by a winner-take-all process in which only the positions of the top $k$ values are retained, yielding a $k$-sparse vector $z \\in \\{0,1\\}^m$. We study the benefits of this representation for subsequent learning.\n  We first show a universal approximation property, that arbitrary continuous functions of $x$ are well approximated by linear functions of $z$, provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.03741/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":"2006.03741","created_at":"2026-07-05T01:08:32.548948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.03741v1","created_at":"2026-07-05T01:08:32.548948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03741","created_at":"2026-07-05T01:08:32.548948+00:00"},{"alias_kind":"pith_short_12","alias_value":"PE3HDXUIOFDY","created_at":"2026-07-05T01:08:32.548948+00:00"},{"alias_kind":"pith_short_16","alias_value":"PE3HDXUIOFDYZMKA","created_at":"2026-07-05T01:08:32.548948+00:00"},{"alias_kind":"pith_short_8","alias_value":"PE3HDXUI","created_at":"2026-07-05T01:08:32.548948+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14741","citing_title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX","json":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX.json","graph_json":"https://pith.science/api/pith-number/PE3HDXUIOFDYZMKA3R4OLXX2VX/graph.json","events_json":"https://pith.science/api/pith-number/PE3HDXUIOFDYZMKA3R4OLXX2VX/events.json","paper":"https://pith.science/paper/PE3HDXUI"},"agent_actions":{"view_html":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX","download_json":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX.json","view_paper":"https://pith.science/paper/PE3HDXUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.03741&json=true","fetch_graph":"https://pith.science/api/pith-number/PE3HDXUIOFDYZMKA3R4OLXX2VX/graph.json","fetch_events":"https://pith.science/api/pith-number/PE3HDXUIOFDYZMKA3R4OLXX2VX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX/action/storage_attestation","attest_author":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX/action/author_attestation","sign_citation":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX/action/citation_signature","submit_replication":"https://pith.science/pith/PE3HDXUIOFDYZMKA3R4OLXX2VX/action/replication_record"}},"created_at":"2026-07-05T01:08:32.548948+00:00","updated_at":"2026-07-05T01:08:32.548948+00:00"}