{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HSFWSVGOY224DOQOAAYHXLKUWF","short_pith_number":"pith:HSFWSVGO","schema_version":"1.0","canonical_sha256":"3c8b6954cec6b5c1ba0e00307bad54b168029115589302555e27be980a73bc70","source":{"kind":"arxiv","id":"2405.01765","version":3},"attestation_state":"computed","paper":{"title":"Early years of Biased Random-Key Genetic Algorithms: A systematic review","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Cartlos E. Andrade, Luciana S. Pessoa, Mariana A. Londe, Mauricio G.C. Resende","submitted_at":"2024-05-02T22:22:41Z","abstract_excerpt":"This paper presents a systematic literature review and bibliometric analysis focusing on Biased Random-Key Genetic Algorithms (BRKGA). BRKGA is a metaheuristic framework that uses random-key-based chromosomes with biased, uniform, and elitist mating strategies alongside a genetic algorithm. This review encompasses around~250 papers, covering a diverse array of applications ranging from classical combinatorial optimization problems to real-world industrial scenarios, and even non-traditional applications like hyperparameter tuning in machine learning and scenario generation for two-stage proble"},"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":"2405.01765","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-05-02T22:22:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6062f1c6d30fdd4c68d2ce640534591bdea143227dce3bc196ef0997fe432f44","abstract_canon_sha256":"4d9ad57b379c36e841a0157198b814cb62a02078efad64437244a071167560a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:43.922068Z","signature_b64":"nc2pLj1XPYv3Ag0w2XMKR+Gn9j85HtCk7x6yUJIo92LuGIdk9RWyXodlwIlcOaGXFrveMysz7Jaj65sob6+SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c8b6954cec6b5c1ba0e00307bad54b168029115589302555e27be980a73bc70","last_reissued_at":"2026-07-05T09:32:43.921552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:43.921552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Early years of Biased Random-Key Genetic Algorithms: A systematic review","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Cartlos E. Andrade, Luciana S. Pessoa, Mariana A. Londe, Mauricio G.C. Resende","submitted_at":"2024-05-02T22:22:41Z","abstract_excerpt":"This paper presents a systematic literature review and bibliometric analysis focusing on Biased Random-Key Genetic Algorithms (BRKGA). BRKGA is a metaheuristic framework that uses random-key-based chromosomes with biased, uniform, and elitist mating strategies alongside a genetic algorithm. This review encompasses around~250 papers, covering a diverse array of applications ranging from classical combinatorial optimization problems to real-world industrial scenarios, and even non-traditional applications like hyperparameter tuning in machine learning and scenario generation for two-stage proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01765","kind":"arxiv","version":3},"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/2405.01765/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":"2405.01765","created_at":"2026-07-05T09:32:43.921613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01765v3","created_at":"2026-07-05T09:32:43.921613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01765","created_at":"2026-07-05T09:32:43.921613+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSFWSVGOY224","created_at":"2026-07-05T09:32:43.921613+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSFWSVGOY224DOQO","created_at":"2026-07-05T09:32:43.921613+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSFWSVGO","created_at":"2026-07-05T09:32:43.921613+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14976","citing_title":"Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF","json":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF.json","graph_json":"https://pith.science/api/pith-number/HSFWSVGOY224DOQOAAYHXLKUWF/graph.json","events_json":"https://pith.science/api/pith-number/HSFWSVGOY224DOQOAAYHXLKUWF/events.json","paper":"https://pith.science/paper/HSFWSVGO"},"agent_actions":{"view_html":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF","download_json":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF.json","view_paper":"https://pith.science/paper/HSFWSVGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01765&json=true","fetch_graph":"https://pith.science/api/pith-number/HSFWSVGOY224DOQOAAYHXLKUWF/graph.json","fetch_events":"https://pith.science/api/pith-number/HSFWSVGOY224DOQOAAYHXLKUWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF/action/storage_attestation","attest_author":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF/action/author_attestation","sign_citation":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF/action/citation_signature","submit_replication":"https://pith.science/pith/HSFWSVGOY224DOQOAAYHXLKUWF/action/replication_record"}},"created_at":"2026-07-05T09:32:43.921613+00:00","updated_at":"2026-07-05T09:32:43.921613+00:00"}