{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001568358,0.0001840472,0.0002005831,0.00006699791,0.00008293943,0.0003603955,0.001916835,0.0001463874,0.0001226941],"category_scores_gemma":[0.00002313607,0.0001717961,0.0001570514,0.000190445,0.00004633142,0.000115066,0.003299679,0.0004043133,0.0001228005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002670054,"about_ca_system_score_gemma":0.00008877777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004503732,"about_ca_topic_score_gemma":0.00004562046,"domain_scores_codex":[0.9987081,0.00003600627,0.0002079642,0.0005490079,0.0002634994,0.0002354752],"domain_scores_gemma":[0.9985154,0.0001323574,0.00007889513,0.001153188,0.00006173656,0.00005839408],"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.000001498976,0.0002263962,0.0003716161,0.00009019389,0.00004360158,0.0000678285,0.0001620018,0.0007732525,0.00001897912,0.6586197,0.09243869,0.2471863],"study_design_scores_gemma":[0.0001459641,0.00002150759,0.006436787,0.0000426956,0.000006160962,0.00001074948,0.000002617656,0.1695262,0.0003805213,0.7745832,0.04830205,0.0005416159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008155626,0.0001704093,0.8564914,0.001250577,0.0011758,0.000125668,0.000005914231,0.0006455956,0.1393191],"genre_scores_gemma":[0.04485397,0.00001580325,0.9425737,0.0006565331,0.0003198959,0.00002419058,0.000008303196,0.00001296347,0.01153464],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2466446,"threshold_uncertainty_score":0.7005643,"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."}}