{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001411431,0.0001429751,0.0002011657,0.0001484877,0.0002382839,0.0002666954,0.001697205,0.00002369803,0.00002565673],"category_scores_gemma":[0.00004527243,0.0001028398,0.00003345854,0.001316867,0.002779722,0.001318764,0.0004835855,0.0001402616,0.00002202927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001958096,"about_ca_system_score_gemma":0.0001041313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005186438,"about_ca_topic_score_gemma":0.000001265927,"domain_scores_codex":[0.9978352,0.0001666352,0.0002374871,0.0005491602,0.0007368875,0.0004746488],"domain_scores_gemma":[0.9982763,0.0001688401,0.00006867145,0.0008100077,0.0003359454,0.0003402369],"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.000007025185,0.00006380834,0.0001511545,0.00000706111,0.000002461621,0.000003295648,0.0007587966,0.001324334,0.0001558051,0.9665596,0.000002991521,0.0309636],"study_design_scores_gemma":[0.0004333996,0.0006669736,0.0003391512,0.00006406736,0.000003791918,0.00007373205,0.00001658595,0.9186074,0.003469897,0.07586296,0.0001852857,0.0002767609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05785041,0.000002185997,0.931842,0.000302805,0.000166944,0.000119812,5.575396e-7,0.000147633,0.009567633],"genre_scores_gemma":[0.6615997,0.000003969337,0.3381767,0.000178939,0.00002599955,0.0000061502,3.268881e-7,0.000004909889,0.000003308055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9172831,"threshold_uncertainty_score":0.9999341,"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."}}