{"id":"W7084384618","doi":"10.5281/zenodo.17252287","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":"Reproductive Physiology in Livestock","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"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.00185134,0.002460157,0.001422276,0.001800168,0.0006942446,0.002311434,0.004631631,0.001633307,0.229816],"category_scores_gemma":[0.01066045,0.001398168,0.00150766,0.002707882,0.0008213014,0.002739557,0.003654985,0.001918243,0.1225515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001198587,"about_ca_system_score_gemma":0.00263902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01327321,"about_ca_topic_score_gemma":0.01956795,"domain_scores_codex":[0.9984847,0.0002098917,0.0001353183,0.0003416763,0.0007135367,0.0001148476],"domain_scores_gemma":[0.9959544,0.001720665,0.00009801394,0.000982345,0.001031113,0.000213442],"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.0001599698,0.00006786746,0.0001726617,0.0003397933,0.00004755403,0.00005045233,0.0000452792,0.003255205,0.001229791,0.01008662,0.8691233,0.1154215],"study_design_scores_gemma":[0.0004592754,0.00008147845,0.0005627447,0.0002056377,0.00004448746,0.000215568,0.00002914069,0.0546116,0.004486447,0.03311682,0.9061339,0.00005284322],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.001110244,0.0009539098,0.5720147,0.001444424,0.001457977,0.0002776451,0.0443218,0.3414224,0.03699677],"genre_scores_gemma":[0.02489948,0.001756248,0.5187057,0.001357269,0.0004856793,0.001251445,0.2072956,0.0996941,0.1445546],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.229816,"threshold_uncertainty_score":0.7688112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01764455445256038,"score_gpt":0.2095145310538658,"score_spread":0.1918699766013054,"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."}}