{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HIXZC64IM3NIZULXVTT5IZYPDN","short_pith_number":"pith:HIXZC64I","schema_version":"1.0","canonical_sha256":"3a2f917b8866da8cd177ace7d4670f1b68fb1aa9a0e7f0477a878e0b01ef1152","source":{"kind":"arxiv","id":"2408.03626","version":2},"attestation_state":"computed","paper":{"title":"On the choice of the non-trainable internal weights in random feature maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Georg A. Gottwald, Nicholas Cranch, Pinak Mandal","submitted_at":"2024-08-07T08:37:23Z","abstract_excerpt":"The computationally cheap machine learning architecture of random feature maps can be viewed as a single-layer feedforward network in which the weights of the hidden layer are random but fixed and only the outer weights are learned via linear regression. The internal weights are typically chosen from a prescribed distribution. The choice of the internal weights significantly impacts the accuracy of random feature maps. We address here the task of how to best select the internal weights. In particular, we consider the forecasting problem whereby random feature maps are used to learn a one-step "},"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":"2408.03626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-07T08:37:23Z","cross_cats_sorted":["physics.data-an","stat.ME","stat.ML"],"title_canon_sha256":"4a67695b8da5889d1d731b34befa5de4708a71ea8a09edc2f4e9d4eb751433e2","abstract_canon_sha256":"c9a1d33221aa768345fba6e62e3e241531b1ab764e8e6ee4bf61d9eeb399be16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:35.179054Z","signature_b64":"XkpNYnr8Y2c33BX7yitqaFZfVG1wDO/FzW5iabxd6aAIJTSCE1p2V1hHUR73H0DSHOwfSnbbzJbSgbzuNNPGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a2f917b8866da8cd177ace7d4670f1b68fb1aa9a0e7f0477a878e0b01ef1152","last_reissued_at":"2026-07-05T10:54:35.177998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:35.177998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the choice of the non-trainable internal weights in random feature maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Georg A. Gottwald, Nicholas Cranch, Pinak Mandal","submitted_at":"2024-08-07T08:37:23Z","abstract_excerpt":"The computationally cheap machine learning architecture of random feature maps can be viewed as a single-layer feedforward network in which the weights of the hidden layer are random but fixed and only the outer weights are learned via linear regression. The internal weights are typically chosen from a prescribed distribution. The choice of the internal weights significantly impacts the accuracy of random feature maps. We address here the task of how to best select the internal weights. In particular, we consider the forecasting problem whereby random feature maps are used to learn a one-step "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03626","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/2408.03626/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":"2408.03626","created_at":"2026-07-05T10:54:35.178064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03626v2","created_at":"2026-07-05T10:54:35.178064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03626","created_at":"2026-07-05T10:54:35.178064+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIXZC64IM3NI","created_at":"2026-07-05T10:54:35.178064+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIXZC64IM3NIZULX","created_at":"2026-07-05T10:54:35.178064+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIXZC64I","created_at":"2026-07-05T10:54:35.178064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.06661","citing_title":"Learning dynamical systems with hit-and-run random feature maps","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN","json":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN.json","graph_json":"https://pith.science/api/pith-number/HIXZC64IM3NIZULXVTT5IZYPDN/graph.json","events_json":"https://pith.science/api/pith-number/HIXZC64IM3NIZULXVTT5IZYPDN/events.json","paper":"https://pith.science/paper/HIXZC64I"},"agent_actions":{"view_html":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN","download_json":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN.json","view_paper":"https://pith.science/paper/HIXZC64I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03626&json=true","fetch_graph":"https://pith.science/api/pith-number/HIXZC64IM3NIZULXVTT5IZYPDN/graph.json","fetch_events":"https://pith.science/api/pith-number/HIXZC64IM3NIZULXVTT5IZYPDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN/action/storage_attestation","attest_author":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN/action/author_attestation","sign_citation":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN/action/citation_signature","submit_replication":"https://pith.science/pith/HIXZC64IM3NIZULXVTT5IZYPDN/action/replication_record"}},"created_at":"2026-07-05T10:54:35.178064+00:00","updated_at":"2026-07-05T10:54:35.178064+00:00"}