{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PV3XR2E3EE7PZVQ5TV5KMO4B5Y","short_pith_number":"pith:PV3XR2E3","canonical_record":{"source":{"id":"1408.2004","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T01:36:03Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"a7cc78d7857c4c701bcc714e3518a014d97be87875ec51b3e3707c037903268c","abstract_canon_sha256":"5fd29ab9bff30f3438b52c57d74e7bff45f767ff9001d65b9736702aad91828e"},"schema_version":"1.0"},"canonical_sha256":"7d7778e89b213efcd61d9d7aa63b81ee0dcccdc47e47f4b78c8cc207ee992af4","source":{"kind":"arxiv","id":"1408.2004","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2004","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2004v3","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2004","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"PV3XR2E3EE7P","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PV3XR2E3EE7PZVQ5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PV3XR2E3","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PV3XR2E3EE7PZVQ5TV5KMO4B5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2004","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T01:36:03Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"a7cc78d7857c4c701bcc714e3518a014d97be87875ec51b3e3707c037903268c","abstract_canon_sha256":"5fd29ab9bff30f3438b52c57d74e7bff45f767ff9001d65b9736702aad91828e"},"schema_version":"1.0"},"canonical_sha256":"7d7778e89b213efcd61d9d7aa63b81ee0dcccdc47e47f4b78c8cc207ee992af4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:07.519579Z","signature_b64":"ubsmNboYPP8qQX5y6Tw/QjhSvbaE8XpwpcabeJeRRlV/b/vkusXG/oIJXnrvKhwxF4EoDVqnruurzC57/bSxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d7778e89b213efcd61d9d7aa63b81ee0dcccdc47e47f4b78c8cc207ee992af4","last_reissued_at":"2026-05-18T02:42:07.519159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:07.519159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2004","source_version":3,"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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpAY/9NwggTfBooty55Z3YnDJFWWKMukTAgDXXQqLK//lktx6AGhlhFU7HClVUliRUHoCU44uZ5+eCtc08qwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:32:07.679296Z"},"content_sha256":"6ecb3184f03fe2a5eae016e2d8040a8003cf0ba378bb8745791596739eb2fb42","schema_version":"1.0","event_id":"sha256:6ecb3184f03fe2a5eae016e2d8040a8003cf0ba378bb8745791596739eb2fb42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PV3XR2E3EE7PZVQ5TV5KMO4B5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RMSE-ELM: Recursive Model based Selective Ensemble of Extreme Learning Machines for Robustness Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Amaury Lendasse, Bo Han, Bo He, Mengmeng Ma, Tianhong Yan, Tingting Sun","submitted_at":"2014-08-09T01:36:03Z","abstract_excerpt":"Extreme learning machine (ELM) as an emerging branch of shallow networks has shown its excellent generalization and fast learning speed. However, for blended data, the robustness of ELM is weak because its weights and biases of hidden nodes are set randomly. Moreover, the noisy data exert a negative effect. To solve this problem, a new framework called RMSE-ELM is proposed in this paper. It is a two-layer recursive model. In the first layer, the framework trains lots of ELMs in different groups concurrently, then employs selective ensemble to pick out an optimal set of ELMs in each group, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2004","kind":"arxiv","version":3},"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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jtum3AFVbHIGsA4iBcEIbNSI8gmyN8d+bkKNrJGEha9V3KILSWsAu7mAATYxaJUz9MpGDMqUQlGsvRqV2vdEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:32:07.679664Z"},"content_sha256":"9942fcd32f8615e7ade1658821eea3c6c05b0f8864aa149f767c4639ef432044","schema_version":"1.0","event_id":"sha256:9942fcd32f8615e7ade1658821eea3c6c05b0f8864aa149f767c4639ef432044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y/bundle.json","state_url":"https://pith.science/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y/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-06-04T20:32:07Z","links":{"resolver":"https://pith.science/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y","bundle":"https://pith.science/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y/bundle.json","state":"https://pith.science/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PV3XR2E3EE7PZVQ5TV5KMO4B5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PV3XR2E3EE7PZVQ5TV5KMO4B5Y","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":"5fd29ab9bff30f3438b52c57d74e7bff45f767ff9001d65b9736702aad91828e","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T01:36:03Z","title_canon_sha256":"a7cc78d7857c4c701bcc714e3518a014d97be87875ec51b3e3707c037903268c"},"schema_version":"1.0","source":{"id":"1408.2004","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2004","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2004v3","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2004","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"PV3XR2E3EE7P","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PV3XR2E3EE7PZVQ5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PV3XR2E3","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:9942fcd32f8615e7ade1658821eea3c6c05b0f8864aa149f767c4639ef432044","target":"graph","created_at":"2026-05-18T02:42:07Z","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":"Extreme learning machine (ELM) as an emerging branch of shallow networks has shown its excellent generalization and fast learning speed. However, for blended data, the robustness of ELM is weak because its weights and biases of hidden nodes are set randomly. Moreover, the noisy data exert a negative effect. To solve this problem, a new framework called RMSE-ELM is proposed in this paper. It is a two-layer recursive model. In the first layer, the framework trains lots of ELMs in different groups concurrently, then employs selective ensemble to pick out an optimal set of ELMs in each group, whic","authors_text":"Amaury Lendasse, Bo Han, Bo He, Mengmeng Ma, Tianhong Yan, Tingting Sun","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T01:36:03Z","title":"RMSE-ELM: Recursive Model based Selective Ensemble of Extreme Learning Machines for Robustness Improvement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2004","kind":"arxiv","version":3},"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:6ecb3184f03fe2a5eae016e2d8040a8003cf0ba378bb8745791596739eb2fb42","target":"record","created_at":"2026-05-18T02:42:07Z","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":"5fd29ab9bff30f3438b52c57d74e7bff45f767ff9001d65b9736702aad91828e","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T01:36:03Z","title_canon_sha256":"a7cc78d7857c4c701bcc714e3518a014d97be87875ec51b3e3707c037903268c"},"schema_version":"1.0","source":{"id":"1408.2004","kind":"arxiv","version":3}},"canonical_sha256":"7d7778e89b213efcd61d9d7aa63b81ee0dcccdc47e47f4b78c8cc207ee992af4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d7778e89b213efcd61d9d7aa63b81ee0dcccdc47e47f4b78c8cc207ee992af4","first_computed_at":"2026-05-18T02:42:07.519159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:07.519159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubsmNboYPP8qQX5y6Tw/QjhSvbaE8XpwpcabeJeRRlV/b/vkusXG/oIJXnrvKhwxF4EoDVqnruurzC57/bSxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:07.519579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2004","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ecb3184f03fe2a5eae016e2d8040a8003cf0ba378bb8745791596739eb2fb42","sha256:9942fcd32f8615e7ade1658821eea3c6c05b0f8864aa149f767c4639ef432044"],"state_sha256":"9d609e30cdb79d4f4e3c0839f7207264ddc24563e7247a1bf1d2cb79cb360722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIV04AFSgNPrFvt9WpDPMFtKiizXGG4+gxAioD26YzelaYIC/NQjFbOYpE1hLdQcUFo+kc1afbj1SP8dgXIgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:32:07.681647Z","bundle_sha256":"caf5144c796560b92fd926a9a5804a3cc5f8926017cf6853e3f020aa543ee255"}}