{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AWT4LWBHY477WEYQBAA2PJB4EA","short_pith_number":"pith:AWT4LWBH","schema_version":"1.0","canonical_sha256":"05a7c5d827c73ffb13100801a7a43c20398bde9b1906a8b3ab4ddd4787cf3272","source":{"kind":"arxiv","id":"1303.0462","version":1},"attestation_state":"computed","paper":{"title":"Distributed Evolutionary Computation: A New Technique for Solving Large Number of Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Gazi Abdullah Shahriar, M. M. A. Hashem, Moslema Jahan","submitted_at":"2013-03-03T05:38:41Z","abstract_excerpt":"Evolutionary computation techniques have mostly been used to solve various optimization and learning problems successfully. Evolutionary algorithm is more effective to gain optimal solution(s) to solve complex problems than traditional methods. In case of problems with large set of parameters, evolutionary computation technique incurs a huge computational burden for a single processing unit. Taking this limitation into account, this paper presents a new distributed evolutionary computation technique, which decomposes decision vectors into smaller components and achieves optimal solution in a s"},"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":"1303.0462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-03-03T05:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"306e43ee25324f340245f62ac3e115e16ae4aa974b396b43d990689f0f026333","abstract_canon_sha256":"8a09ad0cdea1bd6f05b56db59953c3e6fe7e3fa9d2b4612aeea831ceca24ed52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:55.951533Z","signature_b64":"xs8O5dFkoU2lspqi8tE0MWptAAiRMOSrzJzCTOsPLDK8RZT6ZEuW4xr+mEW/Pfx8v9D7/v1Wy9sSLsd0t3SeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a7c5d827c73ffb13100801a7a43c20398bde9b1906a8b3ab4ddd4787cf3272","last_reissued_at":"2026-05-18T03:31:55.950895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:55.950895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Evolutionary Computation: A New Technique for Solving Large Number of Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Gazi Abdullah Shahriar, M. M. A. Hashem, Moslema Jahan","submitted_at":"2013-03-03T05:38:41Z","abstract_excerpt":"Evolutionary computation techniques have mostly been used to solve various optimization and learning problems successfully. Evolutionary algorithm is more effective to gain optimal solution(s) to solve complex problems than traditional methods. In case of problems with large set of parameters, evolutionary computation technique incurs a huge computational burden for a single processing unit. Taking this limitation into account, this paper presents a new distributed evolutionary computation technique, which decomposes decision vectors into smaller components and achieves optimal solution in a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0462","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":"1303.0462","created_at":"2026-05-18T03:31:55.950983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0462v1","created_at":"2026-05-18T03:31:55.950983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0462","created_at":"2026-05-18T03:31:55.950983+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWT4LWBHY477","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWT4LWBHY477WEYQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWT4LWBH","created_at":"2026-05-18T12:27:38.830355+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/AWT4LWBHY477WEYQBAA2PJB4EA","json":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA.json","graph_json":"https://pith.science/api/pith-number/AWT4LWBHY477WEYQBAA2PJB4EA/graph.json","events_json":"https://pith.science/api/pith-number/AWT4LWBHY477WEYQBAA2PJB4EA/events.json","paper":"https://pith.science/paper/AWT4LWBH"},"agent_actions":{"view_html":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA","download_json":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA.json","view_paper":"https://pith.science/paper/AWT4LWBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0462&json=true","fetch_graph":"https://pith.science/api/pith-number/AWT4LWBHY477WEYQBAA2PJB4EA/graph.json","fetch_events":"https://pith.science/api/pith-number/AWT4LWBHY477WEYQBAA2PJB4EA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA/action/storage_attestation","attest_author":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA/action/author_attestation","sign_citation":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA/action/citation_signature","submit_replication":"https://pith.science/pith/AWT4LWBHY477WEYQBAA2PJB4EA/action/replication_record"}},"created_at":"2026-05-18T03:31:55.950983+00:00","updated_at":"2026-05-18T03:31:55.950983+00:00"}