{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TYCLAYO56PFNTXX75WODOKSKC5","short_pith_number":"pith:TYCLAYO5","schema_version":"1.0","canonical_sha256":"9e04b061ddf3cad9deffed9c372a4a17428a82a306ca3d31346ec57c264ccbef","source":{"kind":"arxiv","id":"2007.12673","version":1},"attestation_state":"computed","paper":{"title":"Genetic Algorithm: Reviews, Implementations, and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Amit Dixit, Mohamed Benaida, Shamimul Qamar, Tanweer Alam","submitted_at":"2020-06-05T14:34:33Z","abstract_excerpt":"Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely"},"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":"2007.12673","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.OH","submitted_at":"2020-06-05T14:34:33Z","cross_cats_sorted":[],"title_canon_sha256":"17d98fdcbb973b50465d86eab4cacd2372aa4f0af8b8c63480f6afd149b95d64","abstract_canon_sha256":"77c22c3216e618038beb2c6dd97eceb980ab9152cf17c96c524d3b67e9c30d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:54.659887Z","signature_b64":"9dOKVqeUZWb4lYZkWXOdQfvoPLjbXP5ilDJPnxbUsgfRqU39KtS66U3dMGAQ9Xrtz0XQwokma/7Rewgqq+SzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e04b061ddf3cad9deffed9c372a4a17428a82a306ca3d31346ec57c264ccbef","last_reissued_at":"2026-07-05T01:21:54.659342Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:54.659342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic Algorithm: Reviews, Implementations, and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Amit Dixit, Mohamed Benaida, Shamimul Qamar, Tanweer Alam","submitted_at":"2020-06-05T14:34:33Z","abstract_excerpt":"Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12673","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.12673/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":"2007.12673","created_at":"2026-07-05T01:21:54.659405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.12673v1","created_at":"2026-07-05T01:21:54.659405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12673","created_at":"2026-07-05T01:21:54.659405+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYCLAYO56PFN","created_at":"2026-07-05T01:21:54.659405+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYCLAYO56PFNTXX7","created_at":"2026-07-05T01:21:54.659405+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYCLAYO5","created_at":"2026-07-05T01:21:54.659405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08315","citing_title":"EvolKV: Evolutionary KV Cache Compression for LLM Inference","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5","json":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5.json","graph_json":"https://pith.science/api/pith-number/TYCLAYO56PFNTXX75WODOKSKC5/graph.json","events_json":"https://pith.science/api/pith-number/TYCLAYO56PFNTXX75WODOKSKC5/events.json","paper":"https://pith.science/paper/TYCLAYO5"},"agent_actions":{"view_html":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5","download_json":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5.json","view_paper":"https://pith.science/paper/TYCLAYO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.12673&json=true","fetch_graph":"https://pith.science/api/pith-number/TYCLAYO56PFNTXX75WODOKSKC5/graph.json","fetch_events":"https://pith.science/api/pith-number/TYCLAYO56PFNTXX75WODOKSKC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5/action/storage_attestation","attest_author":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5/action/author_attestation","sign_citation":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5/action/citation_signature","submit_replication":"https://pith.science/pith/TYCLAYO56PFNTXX75WODOKSKC5/action/replication_record"}},"created_at":"2026-07-05T01:21:54.659405+00:00","updated_at":"2026-07-05T01:21:54.659405+00:00"}