{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K2HEKIDG7DZFJ5FIB7EBFAF374","short_pith_number":"pith:K2HEKIDG","schema_version":"1.0","canonical_sha256":"568e452066f8f254f4a80fc81280bbff06f258230332a5dc7158bb34cfb01ef4","source":{"kind":"arxiv","id":"1805.00873","version":1},"attestation_state":"computed","paper":{"title":"A Hybrid Q-Learning Sine-Cosine-based Strategy for Addressing the Combinatorial Test Suite Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.AI","authors_text":"Bestoun S. Ahmed, Fakhrud Din, Kamal Z. Zamli, Miroslav Bures","submitted_at":"2018-04-27T12:44:04Z","abstract_excerpt":"The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strateg"},"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":"1805.00873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-04-27T12:44:04Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"efd6ee86650f7394022ad8db5b21058269a30057b035da44181d5cd4c3225059","abstract_canon_sha256":"e93057c82b085da0149b01591e3d3d0fcd480d4ca2cb8c65682a552777b84dd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:57.383404Z","signature_b64":"1NUxFkWDkS0lpB26pWk/1EIXGXSxqGuHY21RaTfEL+MLUE/UfEEoSwxxLuCILCI5+QFXr9Obfrujp3m2w+SJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"568e452066f8f254f4a80fc81280bbff06f258230332a5dc7158bb34cfb01ef4","last_reissued_at":"2026-05-18T00:16:57.382658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:57.382658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid Q-Learning Sine-Cosine-based Strategy for Addressing the Combinatorial Test Suite Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.AI","authors_text":"Bestoun S. Ahmed, Fakhrud Din, Kamal Z. Zamli, Miroslav Bures","submitted_at":"2018-04-27T12:44:04Z","abstract_excerpt":"The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00873","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":"1805.00873","created_at":"2026-05-18T00:16:57.382794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00873v1","created_at":"2026-05-18T00:16:57.382794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00873","created_at":"2026-05-18T00:16:57.382794+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2HEKIDG7DZF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2HEKIDG7DZFJ5FI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2HEKIDG","created_at":"2026-05-18T12:32:33.847187+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/K2HEKIDG7DZFJ5FIB7EBFAF374","json":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374.json","graph_json":"https://pith.science/api/pith-number/K2HEKIDG7DZFJ5FIB7EBFAF374/graph.json","events_json":"https://pith.science/api/pith-number/K2HEKIDG7DZFJ5FIB7EBFAF374/events.json","paper":"https://pith.science/paper/K2HEKIDG"},"agent_actions":{"view_html":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374","download_json":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374.json","view_paper":"https://pith.science/paper/K2HEKIDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00873&json=true","fetch_graph":"https://pith.science/api/pith-number/K2HEKIDG7DZFJ5FIB7EBFAF374/graph.json","fetch_events":"https://pith.science/api/pith-number/K2HEKIDG7DZFJ5FIB7EBFAF374/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374/action/storage_attestation","attest_author":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374/action/author_attestation","sign_citation":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374/action/citation_signature","submit_replication":"https://pith.science/pith/K2HEKIDG7DZFJ5FIB7EBFAF374/action/replication_record"}},"created_at":"2026-05-18T00:16:57.382794+00:00","updated_at":"2026-05-18T00:16:57.382794+00:00"}