{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7FX3LCOVQIYYE3OJALY6MNQTEI","short_pith_number":"pith:7FX3LCOV","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"},"canonical_sha256":"f96fb589d58231826dc902f1e63613220beb7ae479bad66393bce2285c06654b","source":{"kind":"arxiv","id":"2010.04524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.04524","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"2010.04524v2","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04524","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"7FX3LCOVQIYY","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"pith_short_16","alias_value":"7FX3LCOVQIYYE3OJ","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"pith_short_8","alias_value":"7FX3LCOV","created_at":"2026-07-05T03:58:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7FX3LCOVQIYYE3OJALY6MNQTEI","target":"record","payload":{"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"},"canonical_sha256":"f96fb589d58231826dc902f1e63613220beb7ae479bad66393bce2285c06654b","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"},"source_kind":"arxiv","source_id":"2010.04524","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-07-05T03:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ss1tTf8biy8PiU4X0+3oji6UC1cJ631LMUtUkO8seMAIuUvZjC6aydEBxTuSfNhYh8U9SBwVv8o03qNPI9LHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:51:51.507863Z"},"content_sha256":"e4646e475f597ac13c77b92a2e46f456a6d9f097d36b64ad4268e840e38dd723","schema_version":"1.0","event_id":"sha256:e4646e475f597ac13c77b92a2e46f456a6d9f097d36b64ad4268e840e38dd723"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7FX3LCOVQIYYE3OJALY6MNQTEI","target":"graph","payload":{"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"},"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-05T03:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoQKjgZ1XX99eNW52O8rvI8sj0SRIF/tv4ZVywlsN4dOOEjOLBDbsfOWQ1vWJRYRFkmb6SjIM41TwQOC7qrGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:51:51.508358Z"},"content_sha256":"1f2ad4530d580e948d42a7c7968bf51c649d64f9e87f8e6b8971d154dbf25304","schema_version":"1.0","event_id":"sha256:1f2ad4530d580e948d42a7c7968bf51c649d64f9e87f8e6b8971d154dbf25304"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/bundle.json","state_url":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/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-04T06:51:51Z","links":{"resolver":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI","bundle":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/bundle.json","state":"https://pith.science/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FX3LCOVQIYYE3OJALY6MNQTEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7FX3LCOVQIYYE3OJALY6MNQTEI","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":"bce6e3ec1d5c802407b5af2ebb95eb8a6113df3adb8f148ff7410776a04bd11a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2020-10-09T12:21:59Z","title_canon_sha256":"cdb8afdb0417e9faeefca250a888d3f2136eaa1d8524c38efd1f4aada0389289"},"schema_version":"1.0","source":{"id":"2010.04524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.04524","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"2010.04524v2","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04524","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"7FX3LCOVQIYY","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"pith_short_16","alias_value":"7FX3LCOVQIYYE3OJ","created_at":"2026-07-05T03:58:00Z"},{"alias_kind":"pith_short_8","alias_value":"7FX3LCOV","created_at":"2026-07-05T03:58:00Z"}],"graph_snapshots":[{"event_id":"sha256:1f2ad4530d580e948d42a7c7968bf51c649d64f9e87f8e6b8971d154dbf25304","target":"graph","created_at":"2026-07-05T03:58:00Z","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/2010.04524/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Giuseppe Nicosia, Varun Ojha","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2020-10-09T12:21:59Z","title":"Multi-Objective Optimisation of Multi-Output Neural Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04524","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:e4646e475f597ac13c77b92a2e46f456a6d9f097d36b64ad4268e840e38dd723","target":"record","created_at":"2026-07-05T03:58:00Z","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":"bce6e3ec1d5c802407b5af2ebb95eb8a6113df3adb8f148ff7410776a04bd11a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2020-10-09T12:21:59Z","title_canon_sha256":"cdb8afdb0417e9faeefca250a888d3f2136eaa1d8524c38efd1f4aada0389289"},"schema_version":"1.0","source":{"id":"2010.04524","kind":"arxiv","version":2}},"canonical_sha256":"f96fb589d58231826dc902f1e63613220beb7ae479bad66393bce2285c06654b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f96fb589d58231826dc902f1e63613220beb7ae479bad66393bce2285c06654b","first_computed_at":"2026-07-05T03:58:00.414310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:00.414310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"apmJA4rrLWNeJKTuoG9Ww99UCdh3TCJIcBuqvP0kISno5DFcJQQbFN1k2Nk3VRtOfAV9k62pjV0NIeP63XUtBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:00.414728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.04524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4646e475f597ac13c77b92a2e46f456a6d9f097d36b64ad4268e840e38dd723","sha256:1f2ad4530d580e948d42a7c7968bf51c649d64f9e87f8e6b8971d154dbf25304"],"state_sha256":"b18e3a1d1984d005d888d1636e9afd97a72182c5d9ef3d4d7f354950d70999a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T34Rn+Z19WQ+x4GJ9aZdp1FFlIZjIl47fGFKj4Rz1fP0q4exmmJWIiXMHdZs8xBkS8JmZFJzWXIDxrHIaw93CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:51:51.512576Z","bundle_sha256":"30517a837056b8dd613fdb68d1a2cae8952c5ee435756307fe3f6dbff9bb920e"}}