{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M3SK2AFMJ2OUEBFYHF4ZSSASUL","short_pith_number":"pith:M3SK2AFM","canonical_record":{"source":{"id":"1501.06115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-25T05:11:34Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"c4884b52ba1924936c881cab1ff9cd12c38b75b5517e79696bf7f5949241a608","abstract_canon_sha256":"901263e3da030f5bc5dc7cb470e16da386c22b701f01ef8b900bc613197b50d3"},"schema_version":"1.0"},"canonical_sha256":"66e4ad00ac4e9d4204b83979994812a2efe0921c327be637d93616dfc1297b51","source":{"kind":"arxiv","id":"1501.06115","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06115","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06115v2","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06115","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"M3SK2AFMJ2OU","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M3SK2AFMJ2OUEBFY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M3SK2AFM","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M3SK2AFMJ2OUEBFYHF4ZSSASUL","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-25T05:11:34Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"c4884b52ba1924936c881cab1ff9cd12c38b75b5517e79696bf7f5949241a608","abstract_canon_sha256":"901263e3da030f5bc5dc7cb470e16da386c22b701f01ef8b900bc613197b50d3"},"schema_version":"1.0"},"canonical_sha256":"66e4ad00ac4e9d4204b83979994812a2efe0921c327be637d93616dfc1297b51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:58.262861Z","signature_b64":"uMN6rx2d2uVByaNhS9wH3dLdSBjBLGOaQxQ2/FCNNP7s/YgQM2nXMi1G/O3G741r22vLvleg0azv5iM9hRyVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e4ad00ac4e9d4204b83979994812a2efe0921c327be637d93616dfc1297b51","last_reissued_at":"2026-05-18T02:27:58.262135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:58.262135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06115","source_version":2,"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:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUf+2yw4J/xxPTNSIz89LGNTzmtOMTUWkuJYvziHIk0IIPld1DHy2bYtn0t++NBPfrE/yrjQM32pmTX+Xm4QAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:28:42.682463Z"},"content_sha256":"c5e1a9b0b0e4f7515fcb20e1622ef69ed1109cb33351ee59f13e3d15566b7385","schema_version":"1.0","event_id":"sha256:c5e1a9b0b0e4f7515fcb20e1622ef69ed1109cb33351ee59f13e3d15566b7385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M3SK2AFMJ2OUEBFYHF4ZSSASUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Extreme Learning Machines: A Study on Classification Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Jun Miao, Laiyun Qing, Wentao Zhu","submitted_at":"2015-01-25T05:11:34Z","abstract_excerpt":"Extreme learning machine (ELM) is an extremely fast learning method and has a powerful performance for pattern recognition tasks proven by enormous researches and engineers. However, its good generalization ability is built on large numbers of hidden neurons, which is not beneficial to real time response in the test process. In this paper, we proposed new ways, named \"constrained extreme learning machines\" (CELMs), to randomly select hidden neurons based on sample distribution. Compared to completely random selection of hidden nodes in ELM, the CELMs randomly select hidden nodes from the const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06115","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":""},"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:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cp0Ku6jLKbODPp6QXwCmi91sH/1vcEbq1j6mBTtkvEn4IkPIAiiyV+Bl6dd7MTsr4fiurxHrPZupfFp5GMvtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:28:42.683146Z"},"content_sha256":"49a18cb37761cb5adf845fee0556cfa0f72a4e1ca23918c7af591e23c61f7db0","schema_version":"1.0","event_id":"sha256:49a18cb37761cb5adf845fee0556cfa0f72a4e1ca23918c7af591e23c61f7db0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL/bundle.json","state_url":"https://pith.science/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL/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-06T10:28:42Z","links":{"resolver":"https://pith.science/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL","bundle":"https://pith.science/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL/bundle.json","state":"https://pith.science/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3SK2AFMJ2OUEBFYHF4ZSSASUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M3SK2AFMJ2OUEBFYHF4ZSSASUL","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":"901263e3da030f5bc5dc7cb470e16da386c22b701f01ef8b900bc613197b50d3","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-25T05:11:34Z","title_canon_sha256":"c4884b52ba1924936c881cab1ff9cd12c38b75b5517e79696bf7f5949241a608"},"schema_version":"1.0","source":{"id":"1501.06115","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06115","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06115v2","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06115","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"M3SK2AFMJ2OU","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M3SK2AFMJ2OUEBFY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M3SK2AFM","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:49a18cb37761cb5adf845fee0556cfa0f72a4e1ca23918c7af591e23c61f7db0","target":"graph","created_at":"2026-05-18T02:27:58Z","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) is an extremely fast learning method and has a powerful performance for pattern recognition tasks proven by enormous researches and engineers. However, its good generalization ability is built on large numbers of hidden neurons, which is not beneficial to real time response in the test process. In this paper, we proposed new ways, named \"constrained extreme learning machines\" (CELMs), to randomly select hidden neurons based on sample distribution. Compared to completely random selection of hidden nodes in ELM, the CELMs randomly select hidden nodes from the const","authors_text":"Jun Miao, Laiyun Qing, Wentao Zhu","cross_cats":["cs.CV","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-25T05:11:34Z","title":"Constrained Extreme Learning Machines: A Study on Classification Cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06115","kind":"arxiv","version":2},"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:c5e1a9b0b0e4f7515fcb20e1622ef69ed1109cb33351ee59f13e3d15566b7385","target":"record","created_at":"2026-05-18T02:27:58Z","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":"901263e3da030f5bc5dc7cb470e16da386c22b701f01ef8b900bc613197b50d3","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-25T05:11:34Z","title_canon_sha256":"c4884b52ba1924936c881cab1ff9cd12c38b75b5517e79696bf7f5949241a608"},"schema_version":"1.0","source":{"id":"1501.06115","kind":"arxiv","version":2}},"canonical_sha256":"66e4ad00ac4e9d4204b83979994812a2efe0921c327be637d93616dfc1297b51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66e4ad00ac4e9d4204b83979994812a2efe0921c327be637d93616dfc1297b51","first_computed_at":"2026-05-18T02:27:58.262135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:58.262135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uMN6rx2d2uVByaNhS9wH3dLdSBjBLGOaQxQ2/FCNNP7s/YgQM2nXMi1G/O3G741r22vLvleg0azv5iM9hRyVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:58.262861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06115","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5e1a9b0b0e4f7515fcb20e1622ef69ed1109cb33351ee59f13e3d15566b7385","sha256:49a18cb37761cb5adf845fee0556cfa0f72a4e1ca23918c7af591e23c61f7db0"],"state_sha256":"a79777b3774f15f236a2f0b476c16dacc117a41ce8e849b05dd53ea7fddcd945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAjxxz0+OGW4cRDO3XTbtpMiCuS0tyxvLB77c6zQEyI+DYyqTZXJY5IgOTjym5vNxlHF0YdBn+UIyN8iAACKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:28:42.686699Z","bundle_sha256":"e0571442d466e43d75e1283f91ad448f2aa26c7c3aea1c9b21dc467bcf8cc633"}}