{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065604,0.002681535,0.001402263,0.002073429,0.000656573,0.002111742,0.004074098,0.00155038,0.2605993],"category_scores_gemma":[0.009900129,0.001551674,0.001643335,0.003206273,0.0006325627,0.003034928,0.003020241,0.001797441,0.16088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045397,"about_ca_system_score_gemma":0.002254955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0131475,"about_ca_topic_score_gemma":0.01823357,"domain_scores_codex":[0.9988642,0.0001401078,0.0001003449,0.0002164898,0.0005633781,0.000115575],"domain_scores_gemma":[0.9965833,0.001430201,0.00008869103,0.0008747833,0.0008947958,0.0001282321],"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.0001351669,0.00004691786,0.0001921735,0.0004232503,0.00003342526,0.00003186539,0.00003235214,0.002724106,0.0007643657,0.005786245,0.93357,0.05626015],"study_design_scores_gemma":[0.0004911034,0.00008420577,0.0009409029,0.0002642819,0.00005021806,0.0002054188,0.000026635,0.03745543,0.004205655,0.02784329,0.9283702,0.00006261533],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.001705286,0.00123418,0.3219294,0.001366349,0.001439207,0.00039931,0.1529575,0.4592291,0.05973965],"genre_scores_gemma":[0.02506902,0.001941279,0.2295439,0.001037208,0.0003809012,0.001426585,0.4971941,0.1166559,0.1267511],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.2605993,"threshold_uncertainty_score":0.8717915,"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."}}