{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BG5DFEYXPUPCUSVWUVQGRP3YZK","short_pith_number":"pith:BG5DFEYX","schema_version":"1.0","canonical_sha256":"09ba3293177d1e2a4ab6a56068bf78caa442725b7730fc2510e677f2a2e4cf6b","source":{"kind":"arxiv","id":"1705.05592","version":1},"attestation_state":"computed","paper":{"title":"Ensemble of heterogeneous flexible neural trees using multiobjective genetic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ajith Abraham, V\\'aclav Sn\\'a\\v{s}el, Varun Kumar Ojha","submitted_at":"2017-05-16T08:40:42Z","abstract_excerpt":"Machine learning algorithms are inherently multiobjective in nature, where approximation error minimization and model's complexity simplification are two conflicting objectives. We proposed a multiobjective genetic programming (MOGP) for creating a heterogeneous flexible neural tree (HFNT), tree-like flexible feedforward neural network model. The functional heterogeneity in neural tree nodes was introduced to capture a better insight of data during learning because each input in a dataset possess different features. MOGP guided an initial HFNT population towards Pareto-optimal solutions, where"},"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":"1705.05592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-05-16T08:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"ac1a4641f0e3b8acda6fdeafffb3b0f6fe02eda61bd178822033b940a8c970e0","abstract_canon_sha256":"161065dc6a69a5760dd11e2ac11a5c66d686dcab8c4313cfd40303fda83d1039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:22.343531Z","signature_b64":"Ho0WqzwLS1TmtP3CmfDn4AfMA9o1whAhVzakMtwG7Q32a3Qf5Z4XjY8/JpdYyDL+5jzv0njQNj6XfQGCFjzSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09ba3293177d1e2a4ab6a56068bf78caa442725b7730fc2510e677f2a2e4cf6b","last_reissued_at":"2026-05-18T00:44:22.343037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:22.343037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble of heterogeneous flexible neural trees using multiobjective genetic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ajith Abraham, V\\'aclav Sn\\'a\\v{s}el, Varun Kumar Ojha","submitted_at":"2017-05-16T08:40:42Z","abstract_excerpt":"Machine learning algorithms are inherently multiobjective in nature, where approximation error minimization and model's complexity simplification are two conflicting objectives. We proposed a multiobjective genetic programming (MOGP) for creating a heterogeneous flexible neural tree (HFNT), tree-like flexible feedforward neural network model. The functional heterogeneity in neural tree nodes was introduced to capture a better insight of data during learning because each input in a dataset possess different features. MOGP guided an initial HFNT population towards Pareto-optimal solutions, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05592","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":"1705.05592","created_at":"2026-05-18T00:44:22.343120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05592v1","created_at":"2026-05-18T00:44:22.343120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05592","created_at":"2026-05-18T00:44:22.343120+00:00"},{"alias_kind":"pith_short_12","alias_value":"BG5DFEYXPUPC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BG5DFEYXPUPCUSVW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BG5DFEYX","created_at":"2026-05-18T12:31:08.081275+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/BG5DFEYXPUPCUSVWUVQGRP3YZK","json":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK.json","graph_json":"https://pith.science/api/pith-number/BG5DFEYXPUPCUSVWUVQGRP3YZK/graph.json","events_json":"https://pith.science/api/pith-number/BG5DFEYXPUPCUSVWUVQGRP3YZK/events.json","paper":"https://pith.science/paper/BG5DFEYX"},"agent_actions":{"view_html":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK","download_json":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK.json","view_paper":"https://pith.science/paper/BG5DFEYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05592&json=true","fetch_graph":"https://pith.science/api/pith-number/BG5DFEYXPUPCUSVWUVQGRP3YZK/graph.json","fetch_events":"https://pith.science/api/pith-number/BG5DFEYXPUPCUSVWUVQGRP3YZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK/action/storage_attestation","attest_author":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK/action/author_attestation","sign_citation":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK/action/citation_signature","submit_replication":"https://pith.science/pith/BG5DFEYXPUPCUSVWUVQGRP3YZK/action/replication_record"}},"created_at":"2026-05-18T00:44:22.343120+00:00","updated_at":"2026-05-18T00:44:22.343120+00:00"}