{"id":"W4300957756","doi":"10.48550/arxiv.1703.10731","title":"An analysis of budgeted parallel search on conditional Galton-Watson\\n trees","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Limit (mathematics); Overhead (engineering); Simple (philosophy); Set (abstract data type); Computer science; Tree (set theory); Process (computing); Mathematics; Combinatorics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002992044,0.0002681158,0.0005058191,0.0007401475,0.000290383,0.0001729543,0.003286365,0.0002206247,0.00008620582],"category_scores_gemma":[0.00001956963,0.0002761455,0.0003262623,0.0005021202,0.0001880011,0.0005552366,0.001618883,0.0004546037,0.00002862716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009977849,"about_ca_system_score_gemma":0.0002083242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005939766,"about_ca_topic_score_gemma":0.00009313416,"domain_scores_codex":[0.9979084,0.0001856988,0.0002120066,0.001156921,0.0002509303,0.0002860381],"domain_scores_gemma":[0.9963136,0.0001229631,0.0003582686,0.002724637,0.0002674911,0.0002130049],"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.00005637643,0.0002911268,0.005477918,0.00001769273,0.0005819389,0.0001567318,0.0001181672,0.87446,0.00005341807,0.1174205,0.0005371248,0.0008290277],"study_design_scores_gemma":[0.0003331199,0.0001082391,0.05332052,0.00004448942,0.0002190837,6.523639e-7,0.00002351515,0.9371164,0.0001093155,0.008156321,0.0002805055,0.0002877756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2271614,0.00002189307,0.7710677,0.00009760026,0.0001962954,0.0001479103,0.0003618514,0.00009460568,0.0008507682],"genre_scores_gemma":[0.9949275,0.0001073457,0.003793153,0.00007616656,0.00004055344,7.018427e-7,0.0006469139,0.000009683519,0.000397975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7677661,"threshold_uncertainty_score":0.9999691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09572846714589092,"score_gpt":0.2439817270328835,"score_spread":0.1482532598869926,"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."}}