{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7FX3LCOVQIYYE3OJALY6MNQTEI","short_pith_number":"pith:7FX3LCOV","schema_version":"1.0","canonical_sha256":"f96fb589d58231826dc902f1e63613220beb7ae479bad66393bce2285c06654b","source":{"kind":"arxiv","id":"2010.04524","version":2},"attestation_state":"computed","paper":{"title":"Multi-Objective Optimisation of Multi-Output Neural Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Giuseppe Nicosia, Varun Ojha","submitted_at":"2020-10-09T12:21:59Z","abstract_excerpt":"We propose an algorithm and a new method to tackle the classification problems. We propose a multi-output neural tree (MONT) algorithm, which is an evolutionary learning algorithm trained by the non-dominated sorting genetic algorithm (NSGA)-III. Since evolutionary learning is stochastic, a hypothesis found in the form of MONT is unique for each run of evolutionary learning, i.e., each hypothesis (tree) generated bears distinct properties compared to any other hypothesis both in topological space and parameter-space. This leads to a challenging optimisation problem where the aim is to minimise"},"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":"2010.04524","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2020-10-09T12:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"cdb8afdb0417e9faeefca250a888d3f2136eaa1d8524c38efd1f4aada0389289","abstract_canon_sha256":"bce6e3ec1d5c802407b5af2ebb95eb8a6113df3adb8f148ff7410776a04bd11a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:00.414728Z","signature_b64":"apmJA4rrLWNeJKTuoG9Ww99UCdh3TCJIcBuqvP0kISno5DFcJQQbFN1k2Nk3VRtOfAV9k62pjV0NIeP63XUtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f96fb589d58231826dc902f1e63613220beb7ae479bad66393bce2285c06654b","last_reissued_at":"2026-07-05T03:58:00.414310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:00.414310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Objective Optimisation of Multi-Output Neural Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Giuseppe Nicosia, Varun Ojha","submitted_at":"2020-10-09T12:21:59Z","abstract_excerpt":"We propose an algorithm and a new method to tackle the classification problems. We propose a multi-output neural tree (MONT) algorithm, which is an evolutionary learning algorithm trained by the non-dominated sorting genetic algorithm (NSGA)-III. Since evolutionary learning is stochastic, a hypothesis found in the form of MONT is unique for each run of evolutionary learning, i.e., each hypothesis (tree) generated bears distinct properties compared to any other hypothesis both in topological space and parameter-space. This leads to a challenging optimisation problem where the aim is to minimise"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04524","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.04524/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.04524","created_at":"2026-07-05T03:58:00.414375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.04524v2","created_at":"2026-07-05T03:58:00.414375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04524","created_at":"2026-07-05T03:58:00.414375+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FX3LCOVQIYY","created_at":"2026-07-05T03:58:00.414375+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FX3LCOVQIYYE3OJ","created_at":"2026-07-05T03:58:00.414375+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FX3LCOV","created_at":"2026-07-05T03:58:00.414375+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/7FX3LCOVQIYYE3OJALY6MNQTEI","json":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI.json","graph_json":"https://pith.science/api/pith-number/7FX3LCOVQIYYE3OJALY6MNQTEI/graph.json","events_json":"https://pith.science/api/pith-number/7FX3LCOVQIYYE3OJALY6MNQTEI/events.json","paper":"https://pith.science/paper/7FX3LCOV"},"agent_actions":{"view_html":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI","download_json":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI.json","view_paper":"https://pith.science/paper/7FX3LCOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.04524&json=true","fetch_graph":"https://pith.science/api/pith-number/7FX3LCOVQIYYE3OJALY6MNQTEI/graph.json","fetch_events":"https://pith.science/api/pith-number/7FX3LCOVQIYYE3OJALY6MNQTEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/action/storage_attestation","attest_author":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/action/author_attestation","sign_citation":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/action/citation_signature","submit_replication":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/action/replication_record"}},"created_at":"2026-07-05T03:58:00.414375+00:00","updated_at":"2026-07-05T03:58:00.414375+00:00"}