{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ENDIM4NW3MWAMBNA6Q6KJLHNIC","short_pith_number":"pith:ENDIM4NW","schema_version":"1.0","canonical_sha256":"23468671b6db2c0605a0f43ca4aced408c1eace383100b691a0599a56917ff1c","source":{"kind":"arxiv","id":"2104.14677","version":1},"attestation_state":"computed","paper":{"title":"Search Algorithms for Automated Hyper-Parameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.PF"],"primary_cat":"cs.LG","authors_text":"Farid Ghareh Mohammadi, Leila Zahedi, Matthew W. Ohland, M. Hadi Amini, Shabnam Rezapour","submitted_at":"2021-04-29T22:11:52Z","abstract_excerpt":"Machine learning is a powerful method for modeling in different fields such as education. Its capability to accurately predict students' success makes it an ideal tool for decision-making tasks related to higher education. The accuracy of machine learning models depends on selecting the proper hyper-parameters. However, it is not an easy task because it requires time and expertise to tune the hyper-parameters to fit the machine learning model. In this paper, we examine the effectiveness of automated hyper-parameter tuning techniques to the realm of students' success. Therefore, we develop two "},"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":"2104.14677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-29T22:11:52Z","cross_cats_sorted":["cs.CY","cs.PF"],"title_canon_sha256":"3ca780342d71be7ee85e3085a79106cbd1048790fe60792519e78488819e318a","abstract_canon_sha256":"dd4a1d4f115a2fbfd8f1bd2454c485e95129fe1bc3d34a2638c775262d4af42d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:25.237181Z","signature_b64":"t2IgYt9GVfY8tT1D5dYE62LIIzRS5ifP/1buH7BIlTnvxV42DONL//f4bSWccUe0KeS5OEPQ29DPdqxZdYDYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23468671b6db2c0605a0f43ca4aced408c1eace383100b691a0599a56917ff1c","last_reissued_at":"2026-07-05T02:36:25.236799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:25.236799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search Algorithms for Automated Hyper-Parameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.PF"],"primary_cat":"cs.LG","authors_text":"Farid Ghareh Mohammadi, Leila Zahedi, Matthew W. Ohland, M. Hadi Amini, Shabnam Rezapour","submitted_at":"2021-04-29T22:11:52Z","abstract_excerpt":"Machine learning is a powerful method for modeling in different fields such as education. Its capability to accurately predict students' success makes it an ideal tool for decision-making tasks related to higher education. The accuracy of machine learning models depends on selecting the proper hyper-parameters. However, it is not an easy task because it requires time and expertise to tune the hyper-parameters to fit the machine learning model. In this paper, we examine the effectiveness of automated hyper-parameter tuning techniques to the realm of students' success. Therefore, we develop two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14677","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/2104.14677/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":"2104.14677","created_at":"2026-07-05T02:36:25.236863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14677v1","created_at":"2026-07-05T02:36:25.236863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14677","created_at":"2026-07-05T02:36:25.236863+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENDIM4NW3MWA","created_at":"2026-07-05T02:36:25.236863+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENDIM4NW3MWAMBNA","created_at":"2026-07-05T02:36:25.236863+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENDIM4NW","created_at":"2026-07-05T02:36:25.236863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17509","citing_title":"Graph Neural Network Approach to Predicting Magnetization in Quasi-One-Dimensional Ising Systems","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC","json":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC.json","graph_json":"https://pith.science/api/pith-number/ENDIM4NW3MWAMBNA6Q6KJLHNIC/graph.json","events_json":"https://pith.science/api/pith-number/ENDIM4NW3MWAMBNA6Q6KJLHNIC/events.json","paper":"https://pith.science/paper/ENDIM4NW"},"agent_actions":{"view_html":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC","download_json":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC.json","view_paper":"https://pith.science/paper/ENDIM4NW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14677&json=true","fetch_graph":"https://pith.science/api/pith-number/ENDIM4NW3MWAMBNA6Q6KJLHNIC/graph.json","fetch_events":"https://pith.science/api/pith-number/ENDIM4NW3MWAMBNA6Q6KJLHNIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC/action/storage_attestation","attest_author":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC/action/author_attestation","sign_citation":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC/action/citation_signature","submit_replication":"https://pith.science/pith/ENDIM4NW3MWAMBNA6Q6KJLHNIC/action/replication_record"}},"created_at":"2026-07-05T02:36:25.236863+00:00","updated_at":"2026-07-05T02:36:25.236863+00:00"}