{"id":"W1971426115","doi":"10.1145/1146381.1146410","title":"Oracle size","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Oracle; Computer science; Dissemination; Node (physics); Broadcast communication network; Task (project management); Communication complexity; Computer network; Measure (data warehouse); Network topology; Telecommunications network; Time complexity; Distributed computing; Theoretical computer science; Data mining; Algorithm; Telecommunications","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.007871462,0.001913492,0.003359058,0.001886179,0.001609403,0.007967703,0.007367161,0.003664055,0.03874749],"category_scores_gemma":[0.08074261,0.001107682,0.00222574,0.002400858,0.003326529,0.02196546,0.004597356,0.005462038,0.004560627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003783811,"about_ca_system_score_gemma":0.003175998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001782898,"about_ca_topic_score_gemma":0.001290902,"domain_scores_codex":[0.9872255,0.003767173,0.0009543622,0.00307506,0.003194699,0.001783206],"domain_scores_gemma":[0.8762348,0.09899709,0.005028823,0.01178748,0.004319931,0.003631809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002044733,0.000539068,0.008414202,0.002255135,0.0003309173,0.0005047258,0.0007972175,0.1753545,0.007112909,0.568434,0.04753161,0.186681],"study_design_scores_gemma":[0.0002208825,0.000406986,0.001519824,0.0001959407,0.0001820893,0.0008503713,0.0002369823,0.3275105,0.005258427,0.643178,0.02035382,0.00008601314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08402198,0.004169997,0.8277264,0.01089516,0.0007584441,0.0005608303,0.004727258,0.004815471,0.06232456],"genre_scores_gemma":[0.7052349,0.002796605,0.2532383,0.002297691,0.001568974,0.0009645738,0.006503865,0.003083586,0.02431155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03874749,"threshold_uncertainty_score":0.1296233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02255457743138917,"score_gpt":0.2547799527737883,"score_spread":0.2322253753423992,"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."}}