{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3UN6JAGZ5OVQTAMSTTKJPLUCV4","short_pith_number":"pith:3UN6JAGZ","schema_version":"1.0","canonical_sha256":"dd1be480d9ebab0981929cd497ae82af012a556f88344261cd516a6f47339f0a","source":{"kind":"arxiv","id":"1304.2543","version":1},"attestation_state":"computed","paper":{"title":"A New Distributed Evolutionary Computation Technique for Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"G. M. Mashrur-E-Elahi, Md. Asadul Islam, M.M.A. Hashem","submitted_at":"2013-04-09T11:43:13Z","abstract_excerpt":"Now-a-days, it is important to find out solutions of Multi-Objective Optimization Problems (MOPs). Evolutionary Strategy helps to solve such real world problems efficiently and quickly. But sequential Evolutionary Algorithms (EAs) require an enormous computation power to solve such problems and it takes much time to solve large problems. To enhance the performance for solving this type of problems, this paper presents a new Distributed Novel Evolutionary Strategy Algorithm (DNESA) for Multi-Objective Optimization. The proposed DNESA applies the divide-and-conquer approach to decompose populati"},"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":"1304.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-04-09T11:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"06ac66f959210373074d035be7f2a81a7246aca6af93b8e6c536ab433a3394c3","abstract_canon_sha256":"acca728f5886bbf98271edd267de471c5e8ab23af479ef8296ee6712572f1436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.138341Z","signature_b64":"qAMuB9ZX2IXWdf44t6Nyyl0SNxCfqBIqv+HBkjLJfxTup9xwsFLZqizXYM1n8vgTvQ9Ykz+dfvavH6lDVn+LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd1be480d9ebab0981929cd497ae82af012a556f88344261cd516a6f47339f0a","last_reissued_at":"2026-05-18T00:59:04.137583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.137583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Distributed Evolutionary Computation Technique for Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"G. M. Mashrur-E-Elahi, Md. Asadul Islam, M.M.A. Hashem","submitted_at":"2013-04-09T11:43:13Z","abstract_excerpt":"Now-a-days, it is important to find out solutions of Multi-Objective Optimization Problems (MOPs). Evolutionary Strategy helps to solve such real world problems efficiently and quickly. But sequential Evolutionary Algorithms (EAs) require an enormous computation power to solve such problems and it takes much time to solve large problems. To enhance the performance for solving this type of problems, this paper presents a new Distributed Novel Evolutionary Strategy Algorithm (DNESA) for Multi-Objective Optimization. The proposed DNESA applies the divide-and-conquer approach to decompose populati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2543","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":"1304.2543","created_at":"2026-05-18T00:59:04.137714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2543v1","created_at":"2026-05-18T00:59:04.137714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2543","created_at":"2026-05-18T00:59:04.137714+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UN6JAGZ5OVQ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UN6JAGZ5OVQTAMS","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UN6JAGZ","created_at":"2026-05-18T12:27:32.513160+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/3UN6JAGZ5OVQTAMSTTKJPLUCV4","json":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4.json","graph_json":"https://pith.science/api/pith-number/3UN6JAGZ5OVQTAMSTTKJPLUCV4/graph.json","events_json":"https://pith.science/api/pith-number/3UN6JAGZ5OVQTAMSTTKJPLUCV4/events.json","paper":"https://pith.science/paper/3UN6JAGZ"},"agent_actions":{"view_html":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4","download_json":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4.json","view_paper":"https://pith.science/paper/3UN6JAGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2543&json=true","fetch_graph":"https://pith.science/api/pith-number/3UN6JAGZ5OVQTAMSTTKJPLUCV4/graph.json","fetch_events":"https://pith.science/api/pith-number/3UN6JAGZ5OVQTAMSTTKJPLUCV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4/action/storage_attestation","attest_author":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4/action/author_attestation","sign_citation":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4/action/citation_signature","submit_replication":"https://pith.science/pith/3UN6JAGZ5OVQTAMSTTKJPLUCV4/action/replication_record"}},"created_at":"2026-05-18T00:59:04.137714+00:00","updated_at":"2026-05-18T00:59:04.137714+00:00"}