{"id":"W3160973854","doi":"10.1016/j.jcss.2021.04.003","title":"Exploration of dynamic networks: Tight bounds on the number of agents","year":2021,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Computer science; Graph; Interval (graph theory); Upper and lower bounds; Mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics; Theoretical computer science","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.008275158,0.003053961,0.004386246,0.002878146,0.002443535,0.005268781,0.00489093,0.004529638,0.01230228],"category_scores_gemma":[0.08603258,0.002655644,0.002316359,0.00295852,0.00536636,0.01448609,0.008385102,0.007044614,0.001107209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003031568,"about_ca_system_score_gemma":0.003357004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002811399,"about_ca_topic_score_gemma":0.00532716,"domain_scores_codex":[0.9954457,0.00200714,0.000186666,0.000740729,0.0007604036,0.0008593205],"domain_scores_gemma":[0.8639355,0.1209348,0.004423125,0.00462628,0.002145967,0.003934414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001198528,0.0003558516,0.002742846,0.0007657654,0.0002437959,0.0002096611,0.0004684094,0.8121205,0.00229466,0.1344701,0.008688273,0.03644164],"study_design_scores_gemma":[0.00007914525,0.0001039109,0.000344326,0.0001277307,0.00005958084,0.0001247935,0.00009369968,0.8684056,0.000730505,0.1282393,0.001668684,0.00002268181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1493341,0.009354356,0.7677382,0.01240795,0.0004447806,0.0003732001,0.001117984,0.001231746,0.05799765],"genre_scores_gemma":[0.8408481,0.004950993,0.1339498,0.001474123,0.0005121576,0.000649219,0.0007753797,0.0009554849,0.01588479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01230228,"threshold_uncertainty_score":0.0437637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04424169529576408,"score_gpt":0.3022377106508853,"score_spread":0.2579960153551212,"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."}}