{"id":"W7084384560","doi":"10.5281/zenodo.17252286","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":"Computational and Text Analysis Methods","field":"Social Sciences","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004136375,0.0002536669,0.0003162915,0.0002626871,0.00130053,0.0004714509,0.0005265749,0.0001280998,0.002759631],"category_scores_gemma":[0.000661743,0.0002777976,0.00007969035,0.0003757699,0.00007687389,0.00005893598,0.0004078867,0.0002200472,0.00006357882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004010477,"about_ca_system_score_gemma":0.00005152249,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.029112,"about_ca_topic_score_gemma":0.003425064,"domain_scores_codex":[0.9978501,0.0002990686,0.000265387,0.0006023232,0.0005779079,0.0004051662],"domain_scores_gemma":[0.9988075,0.0003169781,0.0001693514,0.0002666944,0.0002345467,0.0002049616],"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.00002824612,0.0001523093,0.00001096031,0.00006443676,0.0002207594,0.00001061812,0.001451103,0.002428606,0.0001862704,0.0003342622,0.5940062,0.4011062],"study_design_scores_gemma":[0.0002854681,0.0001078452,0.00003178731,0.0001619807,0.00003796407,5.676504e-7,0.0004950549,0.007636174,0.0001291778,0.00006449656,0.9907718,0.000277686],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001741981,0.0009440182,0.6302798,0.0007855427,0.002377089,0.002804511,0.004299479,0.002836983,0.3539306],"genre_scores_gemma":[0.1498428,0.0008934429,0.06310568,0.002111792,0.009390633,0.000003574721,0.02192288,0.02067906,0.7320501],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5671741,"threshold_uncertainty_score":0.9999996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02383316066613023,"score_gpt":0.2701412294883633,"score_spread":0.2463080688222331,"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."}}