{"id":"W7084760000","doi":"10.5281/zenodo.17280144","title":"Software Artifact for \"On Computing Top-k Simple Shortest Paths from a Single Source. M. D'Emidio, G. Di Stefano\". SIAM 28th Symposium on Algorithm Engineering and Experiments (ALENEX 2026), Vancouver, Canada.","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Artifact (error); Simple (philosophy); Software; Key (lock); Algorithm design","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460671,0.003193913,0.001745771,0.002304794,0.0007588551,0.00246734,0.004897573,0.001760529,0.2834889],"category_scores_gemma":[0.009827109,0.001984648,0.001806693,0.003036817,0.0007389075,0.003273457,0.003090116,0.002419904,0.1913095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184121,"about_ca_system_score_gemma":0.00261689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01203393,"about_ca_topic_score_gemma":0.01908028,"domain_scores_codex":[0.9986736,0.0001562175,0.0001305421,0.0002855636,0.0006153877,0.0001387206],"domain_scores_gemma":[0.9967637,0.001463479,0.00009827477,0.0007079871,0.000821398,0.0001451374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000166073,0.0000548667,0.0001976706,0.0005186693,0.00005010366,0.00003495478,0.00003552508,0.00330988,0.0009785289,0.00545848,0.9316193,0.0575758],"study_design_scores_gemma":[0.0006690234,0.00007769105,0.001042673,0.000290612,0.00006608114,0.0002504547,0.0000382367,0.05290838,0.005964147,0.03019827,0.9084045,0.00008980438],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.001028867,0.0008321471,0.3030742,0.000697953,0.0008081755,0.0003054487,0.1285383,0.5331925,0.0315225],"genre_scores_gemma":[0.01878219,0.001382365,0.2950621,0.0007791558,0.0002214105,0.001498945,0.4306693,0.1681805,0.08342405],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.2834889,"threshold_uncertainty_score":0.948365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00868884238232841,"score_gpt":0.2196122477706101,"score_spread":0.2109234053882817,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}