{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001468592,0.002852,0.001503326,0.002276958,0.0007602659,0.002369111,0.00430152,0.001780913,0.2663442],"category_scores_gemma":[0.01257013,0.001785254,0.001835303,0.003392407,0.0006550733,0.003296294,0.003184172,0.00215367,0.1850936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089828,"about_ca_system_score_gemma":0.002812122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01410225,"about_ca_topic_score_gemma":0.02109797,"domain_scores_codex":[0.9984932,0.0001978772,0.0001548641,0.0002935742,0.0007154944,0.000144945],"domain_scores_gemma":[0.9954954,0.002055071,0.0001119075,0.0009873715,0.001189904,0.0001602367],"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.0001412182,0.0000504145,0.0002093471,0.0005086618,0.00004059869,0.00003247477,0.00003788388,0.00260899,0.0006294801,0.004922095,0.9431741,0.04764474],"study_design_scores_gemma":[0.0006049769,0.00007834133,0.001110984,0.0002890245,0.00005385578,0.000210472,0.00003486395,0.03777967,0.004064407,0.02990992,0.9257896,0.00007393943],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.001443891,0.001019615,0.2766844,0.001121476,0.001193195,0.0003833983,0.2001702,0.4757822,0.04220157],"genre_scores_gemma":[0.01813369,0.001366998,0.2196908,0.0009051414,0.0002677584,0.00142866,0.5470484,0.1331633,0.07799531],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.2663442,"threshold_uncertainty_score":0.89101,"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."}}