{"id":"W6910408406","doi":"10.4230/lipics.esa.2022.59","title":"Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Path (computing); Matrix multiplication; Matrix (chemical analysis); Range query (database); Colored; Tree (set theory); Element (criminal law); Product (mathematics); Node (physics)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269412,0.001284149,0.001668469,0.0009278012,0.001013731,0.002105559,0.002721047,0.001068973,0.007351705],"category_scores_gemma":[0.007747923,0.000667973,0.001038559,0.002154409,0.0008342098,0.005552039,0.002552576,0.001475971,0.002143383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346993,"about_ca_system_score_gemma":0.002429567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007851731,"about_ca_topic_score_gemma":0.01445865,"domain_scores_codex":[0.9975369,0.0004141241,0.0001797785,0.000652126,0.0007841996,0.0004327494],"domain_scores_gemma":[0.9954619,0.002077705,0.0003519115,0.001204559,0.0006267575,0.0002771228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002024639,0.0007499165,0.00431023,0.0006820671,0.0001467128,0.0004903653,0.001162528,0.1900703,0.04031629,0.08990578,0.03993283,0.6302084],"study_design_scores_gemma":[0.0001472813,0.0001910001,0.0003063651,0.00001559188,0.00002607366,0.0001460471,0.0001728381,0.9258211,0.006658693,0.06166491,0.004820065,0.00003008135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07263384,0.0003506783,0.9100388,0.0006537981,0.0001293654,0.0002821106,0.0009111306,0.01063325,0.004367121],"genre_scores_gemma":[0.3418729,0.0001229521,0.6505983,0.0002932975,0.000102785,0.0002807684,0.001863277,0.0005114187,0.004354272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007851731,"threshold_uncertainty_score":0.02459389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01677952594851535,"score_gpt":0.2801010737661473,"score_spread":0.263321547817632,"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."}}