{"id":"W2041241584","doi":"10.1016/j.tcs.2014.07.013","title":"Exploring an unknown dangerous graph with a constant number of tokens","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Asynchronous communication; Security token; Computer science; Constant (computer programming); Graph; Node (physics); Protocol (science); Theoretical computer science; Simple (philosophy); Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000622934,0.0007101849,0.0007981121,0.000950504,0.001370529,0.001002949,0.002309396,0.002308583,0.006167311],"category_scores_gemma":[0.006365733,0.0006745122,0.001144086,0.0006932271,0.001715303,0.003765362,0.002172859,0.002035138,0.0006202405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009353582,"about_ca_system_score_gemma":0.001272333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003732119,"about_ca_topic_score_gemma":0.005606406,"domain_scores_codex":[0.9995257,0.0001322311,0.00001626262,0.0001399148,0.00009501171,0.00009100835],"domain_scores_gemma":[0.9970644,0.002118073,0.0001548923,0.0002678281,0.0001442109,0.0002506777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00130866,0.0003416598,0.004431866,0.000433823,0.000122113,0.001949291,0.0004572886,0.8182605,0.009764086,0.1194863,0.005031737,0.03841266],"study_design_scores_gemma":[0.00006156717,0.00007444599,0.0002119586,0.00001854262,0.00003287201,0.000170577,0.0001383321,0.9030943,0.002229045,0.09256366,0.001389709,0.0000149487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5313666,0.0002263084,0.4490897,0.002467399,0.0001665727,0.0001598868,0.0006679168,0.001140445,0.0147151],"genre_scores_gemma":[0.7503092,0.0001261324,0.2419592,0.0002231008,0.00004106456,0.00008052305,0.0004864811,0.0003385044,0.006435827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006167311,"threshold_uncertainty_score":0.02063173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04097048809733495,"score_gpt":0.2704389198655607,"score_spread":0.2294684317682257,"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."}}