{"id":"W7091495435","doi":"10.5281/zenodo.17356358","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":"Graph Theory and Algorithms","field":"Computer Science","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"],"consensus_categories":[],"category_scores_codex":[0.0002581731,0.0003896837,0.0003517062,0.0003294016,0.0008501502,0.0007172018,0.001301757,0.0001436992,0.0006394167],"category_scores_gemma":[0.00021669,0.0004197427,0.00007633844,0.0003825676,0.0000569732,0.0001235291,0.001147242,0.0003255653,0.00008672077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002320043,"about_ca_system_score_gemma":0.00002815511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002218093,"about_ca_topic_score_gemma":0.0001375644,"domain_scores_codex":[0.9976021,0.0001642572,0.0003013256,0.0009297213,0.0004585237,0.0005440803],"domain_scores_gemma":[0.9985355,0.0001587882,0.0001774669,0.0007280633,0.0001655735,0.0002346546],"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.00003479925,0.0002600009,0.000003437162,0.0001525551,0.0002067485,0.00004616826,0.0007399783,0.001849802,0.0008795466,0.000943203,0.588496,0.4063878],"study_design_scores_gemma":[0.0005537652,0.0003399691,0.00001347536,0.0003444156,0.0000187505,0.000006356489,0.0001003663,0.03718374,0.001542207,0.0001078268,0.9593214,0.0004677018],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0003955326,0.0003390537,0.9617697,0.0001300008,0.001426592,0.001177122,0.001890475,0.002012584,0.03085897],"genre_scores_gemma":[0.2245574,0.001033068,0.2062142,0.005903448,0.009141834,0.000009449912,0.02634239,0.05539424,0.471404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7555555,"threshold_uncertainty_score":0.9998254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01220415500266563,"score_gpt":0.2059788549591027,"score_spread":0.1937746999564371,"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."}}