{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PJTCCXFPYSDPSJUISWPZRYIO6K","short_pith_number":"pith:PJTCCXFP","schema_version":"1.0","canonical_sha256":"7a66215cafc486f92688959f98e10ef2b8a7b23d5920759f80e6e8104172ef02","source":{"kind":"arxiv","id":"1406.3100","version":1},"attestation_state":"computed","paper":{"title":"Learning ELM network weights using linear discriminant analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Andr\\'e van Schaik, Jonathan Tapson, Philip de Chazal","submitted_at":"2014-06-12T02:08:31Z","abstract_excerpt":"We present an alternative to the pseudo-inverse method for determining the hidden to output weight values for Extreme Learning Machines performing classification tasks. The method is based on linear discriminant analysis and provides Bayes optimal single point estimates for the weight values."},"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":"1406.3100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-06-12T02:08:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"de50a3f35eea6b02e1cd45b48a95c07e4f49b648c12c8049a1116f18e90b778b","abstract_canon_sha256":"357186fb3c1a71e7a899f24a731c80b1a8e7523480ed61114ae52dabc34955c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.095582Z","signature_b64":"W7L/uGTXgkqrgE/A9VW4oiYx1cQwGxXmi/jE4EVxHTFVLdoBQAMCdVuE3BpFfhqJQPYFXnEIiNA+BLFXRAOtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a66215cafc486f92688959f98e10ef2b8a7b23d5920759f80e6e8104172ef02","last_reissued_at":"2026-05-18T02:49:53.094994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.094994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning ELM network weights using linear discriminant analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Andr\\'e van Schaik, Jonathan Tapson, Philip de Chazal","submitted_at":"2014-06-12T02:08:31Z","abstract_excerpt":"We present an alternative to the pseudo-inverse method for determining the hidden to output weight values for Extreme Learning Machines performing classification tasks. The method is based on linear discriminant analysis and provides Bayes optimal single point estimates for the weight values."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3100","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":""},"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":"1406.3100","created_at":"2026-05-18T02:49:53.095077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3100v1","created_at":"2026-05-18T02:49:53.095077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3100","created_at":"2026-05-18T02:49:53.095077+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJTCCXFPYSDP","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJTCCXFPYSDPSJUI","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJTCCXFP","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K","json":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K.json","graph_json":"https://pith.science/api/pith-number/PJTCCXFPYSDPSJUISWPZRYIO6K/graph.json","events_json":"https://pith.science/api/pith-number/PJTCCXFPYSDPSJUISWPZRYIO6K/events.json","paper":"https://pith.science/paper/PJTCCXFP"},"agent_actions":{"view_html":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K","download_json":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K.json","view_paper":"https://pith.science/paper/PJTCCXFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3100&json=true","fetch_graph":"https://pith.science/api/pith-number/PJTCCXFPYSDPSJUISWPZRYIO6K/graph.json","fetch_events":"https://pith.science/api/pith-number/PJTCCXFPYSDPSJUISWPZRYIO6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K/action/storage_attestation","attest_author":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K/action/author_attestation","sign_citation":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K/action/citation_signature","submit_replication":"https://pith.science/pith/PJTCCXFPYSDPSJUISWPZRYIO6K/action/replication_record"}},"created_at":"2026-05-18T02:49:53.095077+00:00","updated_at":"2026-05-18T02:49:53.095077+00:00"}