{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Y2DMGUB4QBBJMNHDIKDN2JXO3D","short_pith_number":"pith:Y2DMGUB4","canonical_record":{"source":{"id":"2401.15425","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-27T14:25:41Z","cross_cats_sorted":[],"title_canon_sha256":"255486e1561547a473e331f78fb566580b19373d089f17eb1c777abc50fa186f","abstract_canon_sha256":"b63c6bd4238ab71d0ffac5e3942809ede6dace01af0ee80da8a0efb8f079b12a"},"schema_version":"1.0"},"canonical_sha256":"c686c3503c80429634e34286dd26eed8f390fe9e44447a91e65770344f39389b","source":{"kind":"arxiv","id":"2401.15425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.15425","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.15425v1","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15425","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"pith_short_12","alias_value":"Y2DMGUB4QBBJ","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"pith_short_16","alias_value":"Y2DMGUB4QBBJMNHD","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"pith_short_8","alias_value":"Y2DMGUB4","created_at":"2026-07-05T07:38:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Y2DMGUB4QBBJMNHDIKDN2JXO3D","target":"record","payload":{"canonical_record":{"source":{"id":"2401.15425","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-27T14:25:41Z","cross_cats_sorted":[],"title_canon_sha256":"255486e1561547a473e331f78fb566580b19373d089f17eb1c777abc50fa186f","abstract_canon_sha256":"b63c6bd4238ab71d0ffac5e3942809ede6dace01af0ee80da8a0efb8f079b12a"},"schema_version":"1.0"},"canonical_sha256":"c686c3503c80429634e34286dd26eed8f390fe9e44447a91e65770344f39389b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:15.768997Z","signature_b64":"GRS9WthCtt4tBOOqE3pD+jP7rvTiLAkD5KTi/Zu0MczXzhUma+ms0BuFctFmZ0PJiSbxj5GhL+fvFp15YjAnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c686c3503c80429634e34286dd26eed8f390fe9e44447a91e65770344f39389b","last_reissued_at":"2026-07-05T07:38:15.768646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:15.768646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.15425","source_version":1,"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-07-05T07:38:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRxxdcmkmOIwXm/lOB3BCL6S4GsPNRTFFbLMjPO4545z6WGtKazniePUxHCOB1HkDwzCITHfvWBuMKE8ogCJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:23:12.858657Z"},"content_sha256":"50411e255f7c460bbd9f860f2aa78420fbe3fa218526c8694f55ccbe18e46b84","schema_version":"1.0","event_id":"sha256:50411e255f7c460bbd9f860f2aa78420fbe3fa218526c8694f55ccbe18e46b84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Y2DMGUB4QBBJMNHDIKDN2JXO3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A robust regularized extreme learning machine for regression problems based on self-adaptive accelerated extra-gradient algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lateef O. Jolaoso, Mardiyyah Oduwole, Muideen Adegoke","submitted_at":"2024-01-27T14:25:41Z","abstract_excerpt":"The Extreme Learning Machine (ELM) technique is a machine learning approach for constructing feed-forward neural networks with a single hidden layer and their models. The ELM model can be constructed while being trained by concurrently reducing both the modeling errors and the norm of the output weights. Usually, the squared loss is widely utilized in the objective function of ELM, which can be treated as a LASSO problem and hence applying the fast iterative shrinkage thresholding algorithm (FISTA). However, in this paper, the minimization problem is solved from a variational inequalities pers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15425","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/2401.15425/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"},"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-07-05T07:38:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ld/IYF4Q87kvxuIaMjRGnx21f7wfNyAnmm2w6uUilqSuPY2vnShuNpjA6uquZsPL1GHKd21+m5Y6xUBCFzNIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:23:12.859697Z"},"content_sha256":"992cf03fb9ab9672644b7a6845d400e9e44f796b6fbb41446ad7985dd0f99807","schema_version":"1.0","event_id":"sha256:992cf03fb9ab9672644b7a6845d400e9e44f796b6fbb41446ad7985dd0f99807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D/bundle.json","state_url":"https://pith.science/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D/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-08-18T16:23:12Z","links":{"resolver":"https://pith.science/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D","bundle":"https://pith.science/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D/bundle.json","state":"https://pith.science/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2DMGUB4QBBJMNHDIKDN2JXO3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Y2DMGUB4QBBJMNHDIKDN2JXO3D","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":"b63c6bd4238ab71d0ffac5e3942809ede6dace01af0ee80da8a0efb8f079b12a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-27T14:25:41Z","title_canon_sha256":"255486e1561547a473e331f78fb566580b19373d089f17eb1c777abc50fa186f"},"schema_version":"1.0","source":{"id":"2401.15425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.15425","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.15425v1","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15425","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"pith_short_12","alias_value":"Y2DMGUB4QBBJ","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"pith_short_16","alias_value":"Y2DMGUB4QBBJMNHD","created_at":"2026-07-05T07:38:15Z"},{"alias_kind":"pith_short_8","alias_value":"Y2DMGUB4","created_at":"2026-07-05T07:38:15Z"}],"graph_snapshots":[{"event_id":"sha256:992cf03fb9ab9672644b7a6845d400e9e44f796b6fbb41446ad7985dd0f99807","target":"graph","created_at":"2026-07-05T07:38:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.15425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Extreme Learning Machine (ELM) technique is a machine learning approach for constructing feed-forward neural networks with a single hidden layer and their models. The ELM model can be constructed while being trained by concurrently reducing both the modeling errors and the norm of the output weights. Usually, the squared loss is widely utilized in the objective function of ELM, which can be treated as a LASSO problem and hence applying the fast iterative shrinkage thresholding algorithm (FISTA). However, in this paper, the minimization problem is solved from a variational inequalities pers","authors_text":"Lateef O. Jolaoso, Mardiyyah Oduwole, Muideen Adegoke","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-27T14:25:41Z","title":"A robust regularized extreme learning machine for regression problems based on self-adaptive accelerated extra-gradient algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15425","kind":"arxiv","version":1},"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:50411e255f7c460bbd9f860f2aa78420fbe3fa218526c8694f55ccbe18e46b84","target":"record","created_at":"2026-07-05T07:38:15Z","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":"b63c6bd4238ab71d0ffac5e3942809ede6dace01af0ee80da8a0efb8f079b12a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-27T14:25:41Z","title_canon_sha256":"255486e1561547a473e331f78fb566580b19373d089f17eb1c777abc50fa186f"},"schema_version":"1.0","source":{"id":"2401.15425","kind":"arxiv","version":1}},"canonical_sha256":"c686c3503c80429634e34286dd26eed8f390fe9e44447a91e65770344f39389b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c686c3503c80429634e34286dd26eed8f390fe9e44447a91e65770344f39389b","first_computed_at":"2026-07-05T07:38:15.768646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:15.768646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRS9WthCtt4tBOOqE3pD+jP7rvTiLAkD5KTi/Zu0MczXzhUma+ms0BuFctFmZ0PJiSbxj5GhL+fvFp15YjAnBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:15.768997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.15425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50411e255f7c460bbd9f860f2aa78420fbe3fa218526c8694f55ccbe18e46b84","sha256:992cf03fb9ab9672644b7a6845d400e9e44f796b6fbb41446ad7985dd0f99807"],"state_sha256":"89cd84b4024ba36b1e5c4c9d2c8ab9b3238a1bbede0a1d8f7ae81cc64094875f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQufDOq/oKj/7qYDQtq/+I+GB1oIrNvPKwAztXzrQM3t7VfCjQPBSHIu6ZJwvUX+c3ep5KduLv/4UxGnh5WyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:23:12.867994Z","bundle_sha256":"17b569fd47745e26685564cf00dc285a43de248c3cb32064c608e7a46c349f77"}}