{"id":"W2120324771","doi":"10.1016/j.tcs.2011.04.019","title":"A linear time and space algorithm for detecting path intersection in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Intersection (aeronautics); Initialization; Algorithm; Path (computing); Dimension (graph theory); Mathematics; Linear space; Data structure; Time complexity; Computer science; Discrete mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.002991626,0.0007006718,0.000313507,0.0005462575,0.001315036,0.003085828,0.00320811,0.001074705,0.01815139],"category_scores_gemma":[0.001109713,0.001156251,0.0007189353,0.001553835,0.003958316,0.00316442,0.004181802,0.00126948,0.0005216905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002411152,"about_ca_system_score_gemma":0.001158563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005373493,"about_ca_topic_score_gemma":0.0001140949,"domain_scores_codex":[0.9923183,0.0002627807,0.001326717,0.002093455,0.001886845,0.002111857],"domain_scores_gemma":[0.9947294,0.001160599,0.001095198,0.001890032,0.0002399815,0.0008847608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000698012,0.0002600997,0.000004592538,0.0004713399,0.0001963373,0.0007460234,0.00325595,0.0002792247,0.001371448,0.9620827,0.004804261,0.02582997],"study_design_scores_gemma":[0.0007488928,0.00146525,0.00002319317,0.0007352664,0.0001591343,0.00113376,0.0002032497,0.5716051,0.4218365,0.001309504,0.0001009054,0.0006792271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4686755,0.0002781347,0.3491828,0.0005062585,0.002346915,0.00008925112,0.00009673442,0.0004865062,0.1783379],"genre_scores_gemma":[0.8685398,0.00009062399,0.1290465,0.0007160537,0.0008502218,0.0003729866,0.0000693229,0.0002568742,0.00005758642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9607732,"threshold_uncertainty_score":0.9999851,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01786933341249639,"score_gpt":0.2459524861509343,"score_spread":0.2280831527384379,"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."}}