{"meta":{"query_hash":"285351b47482","filters":{"venue":"Electronic colloquium on computational complexity"},"cohort_total":18,"direct_labels_cover":0,"predictions_cover":18,"exported":18,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/285351b47482","api":"https://metacan.xera.ac/api/v1/cohort?venue=Electronic+colloquium+on+computational+complexity"},"results":[{"id":"W11888698","doi":"10.1016/s0378-1135(01)00499-0","title":"Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Lemma (botany); Simple (philosophy); Pebble; Resolution (logic); Mathematics; Argument (complex analysis); Reduction (mathematics); Combinatorics; Computer science; Geometry; Philosophy; Artificial intelligence; Biology; Epistemology","score_opus":0.06241613730404857,"score_gpt":0.2656478985926266,"score_spread":0.20323176128857803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11888698","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046649316,0.0022677581,0.001944415,0.48258573,0.38281253,0.00039322863,0.0026826758,0.0022123943,0.124634765],"genre_scores_gemma":[0.005907167,0.0035559235,0.0029223235,0.31789097,0.15789045,0.0004710395,0.0030860459,0.0022843787,0.50599164],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99387205,0.0008226199,0.0006543248,0.0006692229,0.0031956814,0.0007860581],"domain_scores_gemma":[0.9713567,0.0062805098,0.0009607244,0.0028519698,0.016494408,0.0020557616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007271078,0.0014325706,0.0014852739,0.0017101299,0.0034197418,0.006011657,0.004853362,0.02311453,0.20618443],"category_scores_gemma":[0.053396087,0.0005866966,0.0018978836,0.0018977012,0.0016711885,0.0048386524,0.0021137302,0.015611947,0.2062316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017974395,0.000010464663,0.000023197352,0.000028738485,0.0000017892039,0.000057165184,0.0000099485715,0.000018562747,0.000053873202,0.0007355028,0.9965063,0.0025364528],"study_design_scores_gemma":[0.000006580573,0.00000879429,0.000097677075,0.000043970107,0.000001967263,0.000025527188,0.000017929286,0.000039365943,0.00006169388,0.0004068149,0.9992804,0.000009190128],"about_ca_topic_score_codex":0.011921918,"about_ca_topic_score_gemma":0.010218362,"teacher_disagreement_score":0.20618443,"about_ca_system_score_codex":0.0042399783,"about_ca_system_score_gemma":0.004348206,"threshold_uncertainty_score":0.6897557},"labels":[],"label_agreement":null},{"id":"W172422417","doi":"","title":"Polynomial Time with Restricted Use of Randomness","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Turing machine; Time complexity; Focus (optics); Hierarchy; Computer science; Stack (abstract data type); Polynomial hierarchy; Computation; Time hierarchy theorem; Binary logarithm; DTIME; Discrete mathematics; Random number generation; PSPACE; Theoretical computer science; Mathematics; Algorithm; Computational complexity theory; Universal Turing machine; Statistics","score_opus":0.02529183199500784,"score_gpt":0.24338374597036094,"score_spread":0.2180919139753531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172422417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20649871,0.0006668122,0.753258,0.0034183154,0.00006143849,0.00018670408,0.0007086978,0.0015086083,0.03369278],"genre_scores_gemma":[0.9328526,0.0004869777,0.059058513,0.00032018402,0.00017141312,0.0003119824,0.00041631726,0.00024302407,0.0061390055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934036,0.0019864526,0.00034519273,0.0014654238,0.0014907903,0.0013084626],"domain_scores_gemma":[0.96649486,0.022872701,0.0020342602,0.006826992,0.000822309,0.0009489021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037746315,0.0009896524,0.0016114493,0.001087533,0.001476573,0.005438979,0.0027024676,0.0014541175,0.004302208],"category_scores_gemma":[0.016250774,0.000712684,0.0020486396,0.0014993508,0.0043225265,0.010647503,0.003907254,0.0044483035,0.00071532954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023653284,0.00004860581,0.000859552,0.00012521737,0.00005125959,0.000091997346,0.00021690513,0.08258239,0.0026225494,0.90173334,0.001364693,0.010066892],"study_design_scores_gemma":[0.000059674734,0.000061129685,0.00032620458,0.000017440294,0.00003625145,0.00011174905,0.00004282155,0.24509846,0.0025001972,0.74882245,0.0028962397,0.000027334921],"about_ca_topic_score_codex":0.0013132015,"about_ca_topic_score_gemma":0.0012769452,"teacher_disagreement_score":0.005438979,"about_ca_system_score_codex":0.0035011603,"about_ca_system_score_gemma":0.0025111744,"threshold_uncertainty_score":0.025402844},"labels":[],"label_agreement":null},{"id":"W2041058635","doi":"","title":"Towards deterministic tree code constructions.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Computation; Code (set theory); Bounded function; Product (mathematics); Mathematics; K-ary tree; Interval tree; Discrete mathematics; Construct (python library); Theoretical computer science; Computer science; Operator (biology); Algorithm; Tree structure; Binary tree; Combinatorics","score_opus":0.07038306872289203,"score_gpt":0.2931564632101951,"score_spread":0.2227733944873031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041058635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011542203,0.00035626104,0.982451,0.00030683982,0.000066364526,0.000056109784,0.000083394785,0.00036465246,0.00477304],"genre_scores_gemma":[0.289592,0.0010381872,0.70059973,0.00044920546,0.00014774306,0.00056572276,0.00031675393,0.0004224798,0.0068681226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969164,0.00083545275,0.00012369618,0.0004115807,0.0013779339,0.00033490275],"domain_scores_gemma":[0.9898997,0.0052732243,0.00074524403,0.0026208535,0.0011689261,0.00029207245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024482603,0.0007327997,0.000676871,0.0011460263,0.0013225197,0.0015867861,0.0018097784,0.0015701004,0.0026620177],"category_scores_gemma":[0.011700065,0.0008088632,0.0010604989,0.0012437139,0.00335729,0.0037223662,0.0049842154,0.004225574,0.0013317271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058806334,0.00003536207,0.00036814544,0.00015737646,0.000018822468,0.00010014405,0.00028363147,0.027532406,0.0076536373,0.9378319,0.0018783254,0.024081428],"study_design_scores_gemma":[0.00003818251,0.00007856374,0.00018546174,0.00008244756,0.000026257574,0.00033018613,0.000051435778,0.20926766,0.017990313,0.7556311,0.016253466,0.00006499704],"about_ca_topic_score_codex":0.00095909607,"about_ca_topic_score_gemma":0.0010809529,"teacher_disagreement_score":0.0026620177,"about_ca_system_score_codex":0.0016223289,"about_ca_system_score_gemma":0.0017324167,"threshold_uncertainty_score":0.012947798},"labels":[],"label_agreement":null},{"id":"W2135134090","doi":"","title":"Uniform Hardness Amplification in NP via Monotone Codes","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Mathematics; Decoding methods; Lemma (botany); Code (set theory); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.019169918269632977,"score_gpt":0.25568251152468274,"score_spread":0.23651259325504975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135134090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16212122,0.0008232406,0.7902309,0.003622302,0.00012132186,0.00023122343,0.00053893036,0.0016617955,0.040649127],"genre_scores_gemma":[0.8898072,0.0006289134,0.099350706,0.0008172281,0.0003379909,0.00044397105,0.0004427432,0.0003946276,0.0077766315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99246466,0.0015350905,0.00025978242,0.0014743679,0.0029952016,0.0012709586],"domain_scores_gemma":[0.96987027,0.022375684,0.0011057524,0.0045703975,0.0013825243,0.0006953151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029323674,0.0013010987,0.0014913233,0.0015114285,0.0014394115,0.0033733149,0.0027842592,0.0016250329,0.006072147],"category_scores_gemma":[0.02701009,0.00084368116,0.001674005,0.0014833256,0.0045355484,0.010160979,0.0068004234,0.0077375695,0.0010046364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006484613,0.00022883281,0.0024206573,0.0005935318,0.000097206466,0.00045242617,0.0009293665,0.17516933,0.016943067,0.7296311,0.0045527285,0.068333134],"study_design_scores_gemma":[0.00006268809,0.00014736922,0.00048018966,0.000047320944,0.000038387578,0.0003419562,0.0001079766,0.35432813,0.01160844,0.6278724,0.00491664,0.0000483969],"about_ca_topic_score_codex":0.0011648184,"about_ca_topic_score_gemma":0.0007905342,"teacher_disagreement_score":0.006072147,"about_ca_system_score_codex":0.0030892675,"about_ca_system_score_gemma":0.0013135073,"threshold_uncertainty_score":0.022414267},"labels":[],"label_agreement":null},{"id":"W2220261014","doi":"","title":"Making Hard Problems Harder","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Randomness; Boolean function; Mathematics; Combinatorics; Advice (programming); Function (biology); Discrete mathematics; String (physics); Space (punctuation); Exponential function; Computer science; Statistics; Mathematical analysis","score_opus":0.03360477641972189,"score_gpt":0.27194757508390716,"score_spread":0.23834279866418526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220261014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022198562,0.0018386699,0.8873796,0.024462154,0.00078775105,0.00037723497,0.0004643872,0.0012800297,0.06121161],"genre_scores_gemma":[0.43606725,0.0035883512,0.49984014,0.011315977,0.0035991108,0.001513189,0.0012446204,0.0017289585,0.041102443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859287,0.0046756747,0.000723327,0.0039130184,0.0034710327,0.0012882198],"domain_scores_gemma":[0.9183776,0.05909809,0.0024173106,0.01641384,0.0023983205,0.001294756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009946477,0.0018602269,0.0018537061,0.0019467893,0.0030308792,0.0073602875,0.005148389,0.0039457385,0.02603082],"category_scores_gemma":[0.05701617,0.0018985955,0.0040054545,0.0018523602,0.012898149,0.02522802,0.011758483,0.015439447,0.0035238822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006866902,0.00007367047,0.0003708192,0.00032536566,0.000053394328,0.0000831722,0.00036869835,0.014325897,0.0009885477,0.9500631,0.006768885,0.026509881],"study_design_scores_gemma":[0.000031347692,0.000043127748,0.00011575866,0.000059610866,0.000017479244,0.00007459756,0.00008593483,0.018971905,0.0010168642,0.9610287,0.01853694,0.000017803419],"about_ca_topic_score_codex":0.0010391001,"about_ca_topic_score_gemma":0.001138693,"teacher_disagreement_score":0.02603082,"about_ca_system_score_codex":0.00460321,"about_ca_system_score_gemma":0.0022707896,"threshold_uncertainty_score":0.08708173},"labels":[],"label_agreement":null},{"id":"W2394568608","doi":"","title":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Parity (physics); Electronic circuit; Binary number; Algorithm; Boolean circuit; Boolean function; Correlation; Constant (computer programming); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Physics","score_opus":0.03848540810114379,"score_gpt":0.27544994856066984,"score_spread":0.23696454045952606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394568608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0563213,0.001944987,0.9055988,0.0031054434,0.0001670643,0.0002777246,0.0006796778,0.0025688792,0.029336073],"genre_scores_gemma":[0.64869475,0.001673663,0.32762998,0.0031861519,0.00058638386,0.0012417027,0.0023550536,0.0016389404,0.012993388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911299,0.002731244,0.0003663246,0.001709393,0.0025442338,0.0015188976],"domain_scores_gemma":[0.9108474,0.072055034,0.004390238,0.008362629,0.0031380358,0.0012066684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066902265,0.0021703423,0.0017446447,0.0024424829,0.0022959055,0.0045879516,0.00578401,0.0026765424,0.014191646],"category_scores_gemma":[0.052811183,0.0016588579,0.0035081396,0.0046178894,0.0040296274,0.013312778,0.0046796477,0.0082290005,0.0030333702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013101287,0.0008035974,0.007507139,0.00087278883,0.00036912374,0.0003894721,0.00055401254,0.18658358,0.017349403,0.63191354,0.022311307,0.13003588],"study_design_scores_gemma":[0.00011318747,0.00015634923,0.0016653276,0.00012026897,0.00017674244,0.00028742876,0.00006880189,0.6428296,0.014364677,0.33358097,0.006579404,0.00005729135],"about_ca_topic_score_codex":0.003348504,"about_ca_topic_score_gemma":0.004219517,"teacher_disagreement_score":0.014191646,"about_ca_system_score_codex":0.007153672,"about_ca_system_score_gemma":0.0052710935,"threshold_uncertainty_score":0.051903784},"labels":[],"label_agreement":null},{"id":"W2396953629","doi":"","title":"An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas.","year":2013,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Constructive; struct; Running time; Deterministic algorithm; Discrete mathematics; Computational complexity theory; Random variable; Combinatorics; Computer science; Statistics","score_opus":0.022861646840508044,"score_gpt":0.2770429379744798,"score_spread":0.25418129113397175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396953629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009537929,0.00016448165,0.9835597,0.00036671796,0.000074841606,0.00016738316,0.00020134539,0.0026512304,0.0032763705],"genre_scores_gemma":[0.13515869,0.00017051991,0.8581742,0.00042992877,0.00009146723,0.0003971471,0.0010653262,0.0004291034,0.0040835384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691474,0.0006340271,0.00023075074,0.00063321256,0.0013377883,0.0002494411],"domain_scores_gemma":[0.99338806,0.003112988,0.00033262983,0.0020630022,0.0009956486,0.00010761426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019869448,0.0008848508,0.0009824033,0.0011671503,0.00089593994,0.0013124945,0.002907715,0.0010042064,0.0064852205],"category_scores_gemma":[0.01129123,0.000852096,0.0017798158,0.001506873,0.0012795397,0.0034902275,0.003442374,0.0024690456,0.0024059422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005981116,0.00029245878,0.002557239,0.0004478367,0.00020063168,0.00023139032,0.00032167122,0.090671904,0.033497427,0.1221183,0.021914274,0.7271487],"study_design_scores_gemma":[0.00023116574,0.00019904428,0.00086046645,0.00004763637,0.00015898231,0.00041399847,0.00006407601,0.82833123,0.03053601,0.118139744,0.020953864,0.00006381501],"about_ca_topic_score_codex":0.002678521,"about_ca_topic_score_gemma":0.005037392,"teacher_disagreement_score":0.0064852205,"about_ca_system_score_codex":0.0013736999,"about_ca_system_score_gemma":0.002478526,"threshold_uncertainty_score":0.021695256},"labels":[],"label_agreement":null},{"id":"W2397518487","doi":"","title":"Nonuniform catalytic space and the direct sum for space","year":2015,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Boolean function; Branching (polymer chemistry); Computation; Space (punctuation); Function (biology); Mathematics; Discrete mathematics; Literal (mathematical logic); Binary decision diagram; Combinatorics; Property (philosophy); Computer science; Algorithm; Biology","score_opus":0.03804816408237615,"score_gpt":0.2734843221984433,"score_spread":0.23543615811606716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397518487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2604603,0.0010883309,0.6971858,0.0018758486,0.00010552862,0.00010534983,0.00034262886,0.0006359961,0.03820022],"genre_scores_gemma":[0.91454,0.00055947766,0.072163895,0.00035390793,0.00011211622,0.00018714239,0.00025947235,0.00025213545,0.011571887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745065,0.00071290176,0.00013328028,0.0006239704,0.0006970911,0.00038201082],"domain_scores_gemma":[0.9927832,0.003960217,0.00037107232,0.0021816997,0.00037494904,0.00032888484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019178467,0.0006841681,0.0011324611,0.00074899883,0.0012621087,0.0029244702,0.0023462353,0.0011563766,0.008555349],"category_scores_gemma":[0.010032387,0.00053465285,0.0014821875,0.0013517889,0.0042179488,0.009068564,0.0037942661,0.0025178576,0.00083513046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092658076,0.00002255094,0.00036410266,0.000061049526,0.0000133878,0.00007366901,0.00012930275,0.023226997,0.0011527806,0.9644239,0.00066592597,0.009773786],"study_design_scores_gemma":[0.000022980106,0.000057167897,0.00010744117,0.000013496701,0.000019240906,0.00014706013,0.000044147415,0.12097292,0.0022087102,0.8730202,0.0033710718,0.00001562557],"about_ca_topic_score_codex":0.0010213602,"about_ca_topic_score_gemma":0.0008304652,"teacher_disagreement_score":0.008555349,"about_ca_system_score_codex":0.0018207429,"about_ca_system_score_gemma":0.0013682676,"threshold_uncertainty_score":0.028620481},"labels":[],"label_agreement":null},{"id":"W2398812037","doi":"","title":"Is the Valiant-Vazirani Isolation Lemma Improvable?","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Combinatorics; Witness; Mathematics; Isolation (microbiology); Time complexity; Polynomial; Discrete mathematics; Computer science; Botany; Biology","score_opus":0.0715601453350734,"score_gpt":0.2694981997654061,"score_spread":0.19793805443033272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398812037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062176995,0.001221142,0.90090764,0.0085018305,0.00037955312,0.00018550816,0.00022465207,0.0017045856,0.024698028],"genre_scores_gemma":[0.8264758,0.00085105596,0.15904887,0.0032626141,0.00076889317,0.0006385093,0.0003942635,0.0006487982,0.00791128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98479444,0.004896841,0.00054034474,0.0030205816,0.0043000197,0.0024478114],"domain_scores_gemma":[0.91838306,0.05893421,0.0037388743,0.0140941115,0.0036800096,0.0011697896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010368637,0.00083403854,0.0017518064,0.0009990323,0.0022643805,0.003513481,0.00430467,0.0028137942,0.009049986],"category_scores_gemma":[0.052587066,0.0010463792,0.0023454474,0.001030352,0.008500618,0.010444037,0.007406999,0.008690557,0.0016776506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061198015,0.00019273107,0.0018558503,0.00030250236,0.00013050316,0.00032087616,0.00044460385,0.027920203,0.005356567,0.90930396,0.010051987,0.043508306],"study_design_scores_gemma":[0.00020506723,0.00017684461,0.0006951624,0.00009966063,0.00007448535,0.00034353175,0.00015993835,0.1436791,0.01286034,0.83058625,0.011051829,0.000067762536],"about_ca_topic_score_codex":0.00088231254,"about_ca_topic_score_gemma":0.0006196561,"teacher_disagreement_score":0.010368637,"about_ca_system_score_codex":0.0024131644,"about_ca_system_score_gemma":0.0020032618,"threshold_uncertainty_score":0.0548352},"labels":[],"label_agreement":null},{"id":"W2402863327","doi":"","title":"Non-commutative circuits and the sum-of-squares problem.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Commutative property; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematical proof; Polynomial; Integer (computer science); Mathematical analysis","score_opus":0.01641980183737616,"score_gpt":0.2615900276857136,"score_spread":0.24517022584833745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402863327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16375968,0.0040001185,0.7358416,0.01874638,0.0007935787,0.00033881745,0.0022661027,0.0018388089,0.07241501],"genre_scores_gemma":[0.77805156,0.002432132,0.17922534,0.003308141,0.0014813764,0.0006670804,0.0021818294,0.00090029585,0.031752173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947174,0.0011406709,0.00025515686,0.001406081,0.0017723978,0.00070821133],"domain_scores_gemma":[0.9428846,0.045671098,0.0020330956,0.0065148096,0.0019149348,0.000981362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046300567,0.0012253136,0.0014741844,0.0010377736,0.0022336086,0.004680456,0.004201408,0.0018881767,0.018098822],"category_scores_gemma":[0.025337229,0.00097188394,0.002968449,0.001671035,0.0051584463,0.024964018,0.005186339,0.008219856,0.0021496804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045722726,0.000099652505,0.0012395268,0.00054290326,0.00007910944,0.00014630798,0.0003685642,0.014360674,0.0054754154,0.9385723,0.0072775865,0.031380642],"study_design_scores_gemma":[0.00006232551,0.000071064496,0.0003346606,0.00004231969,0.000050415823,0.00017380767,0.00007780829,0.026731322,0.0070570703,0.95746744,0.007908245,0.000023517465],"about_ca_topic_score_codex":0.0011675206,"about_ca_topic_score_gemma":0.0015136653,"teacher_disagreement_score":0.018098822,"about_ca_system_score_codex":0.0039059864,"about_ca_system_score_gemma":0.0028835724,"threshold_uncertainty_score":0.060546637},"labels":[],"label_agreement":null},{"id":"W2403413752","doi":"","title":"Fourier Concentration from Shrinkage.","year":2013,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Exponent; Combinatorics; Degree (music); Fourier series; Fourier transform; Mathematics; Connection (principal bundle); Function (biology); Shrinkage; Physics; Mathematical analysis; Statistics; Geometry","score_opus":0.020873283734668135,"score_gpt":0.24878093146319655,"score_spread":0.22790764772852842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403413752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16797137,0.008711598,0.51042825,0.008795574,0.0009997191,0.00016396973,0.0011441174,0.0010430998,0.30074227],"genre_scores_gemma":[0.88343793,0.003225325,0.047438547,0.002931957,0.0022322878,0.000305274,0.0007957456,0.00083182065,0.05880113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803966,0.00043142555,0.00007356773,0.0005440289,0.00062195404,0.00028937618],"domain_scores_gemma":[0.99530494,0.0025326582,0.0005480461,0.0007066162,0.000559658,0.0003480929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018179424,0.0012068052,0.001052179,0.0023209355,0.0015031835,0.0029087355,0.0012384558,0.0015591237,0.015699139],"category_scores_gemma":[0.012341446,0.00059300236,0.0012551902,0.0011187643,0.004890279,0.0071038906,0.0041527483,0.0037910196,0.002400751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048974554,0.000012518565,0.00041712975,0.00006494525,0.000012140505,0.00007280755,0.00017983215,0.0014825228,0.0014261946,0.9838938,0.002816863,0.00957217],"study_design_scores_gemma":[0.000020476726,0.000043315464,0.00082889193,0.000045398203,0.000020499938,0.0003681544,0.00009056987,0.01781984,0.0022795226,0.9650092,0.013446215,0.000027843831],"about_ca_topic_score_codex":0.0013407941,"about_ca_topic_score_gemma":0.00076971314,"teacher_disagreement_score":0.015699139,"about_ca_system_score_codex":0.0022182951,"about_ca_system_score_gemma":0.00065537734,"threshold_uncertainty_score":0.052518904},"labels":[],"label_agreement":null},{"id":"W2406984000","doi":"","title":"Lower Bounds against Weakly Uniform Circuits.","year":2012,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Succinctness; Connection (principal bundle); Boolean circuit; Mathematics; Electronic circuit; Discrete mathematics; Circuit complexity; Polynomial; Relaxation (psychology); Boolean function; Combinatorics; Pigeonhole principle; Time complexity; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.024397094283383106,"score_gpt":0.2601159559057044,"score_spread":0.2357188616223213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406984000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1532794,0.005982105,0.75316966,0.008200714,0.00064643216,0.00044488927,0.0040071015,0.0050611193,0.06920857],"genre_scores_gemma":[0.8467444,0.0021473675,0.12569693,0.0025966947,0.0011042458,0.0008333747,0.0041698907,0.0010908388,0.015616176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99174607,0.0020209197,0.0005168455,0.0020047876,0.0022844223,0.0014267921],"domain_scores_gemma":[0.9324646,0.054549035,0.0023076944,0.006798324,0.0023430565,0.0015372778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004840351,0.002120873,0.0021267666,0.0025014088,0.0024507619,0.0057800603,0.004706029,0.002221286,0.01425642],"category_scores_gemma":[0.04063443,0.0014074417,0.0024525824,0.002511263,0.003910655,0.016014954,0.0067291474,0.005331429,0.0023565162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019309117,0.00028350437,0.004463978,0.001274981,0.0002541843,0.0003851156,0.0009181357,0.09122304,0.011882464,0.7814178,0.017688105,0.088277936],"study_design_scores_gemma":[0.00011955892,0.00019019491,0.00059563783,0.00013426572,0.00014850585,0.0002724614,0.000077756195,0.1678836,0.0064225267,0.8171341,0.006977436,0.000043971944],"about_ca_topic_score_codex":0.001275178,"about_ca_topic_score_gemma":0.0018195411,"teacher_disagreement_score":0.01425642,"about_ca_system_score_codex":0.003840015,"about_ca_system_score_gemma":0.0016335975,"threshold_uncertainty_score":0.047692478},"labels":[],"label_agreement":null},{"id":"W2407080619","doi":"","title":"Low uniform versions of NC1.","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Characterization (materials science); Logarithm; Power (physics); Electronic circuit; Mathematics; Computer science; Value (mathematics); Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Topology (electrical circuits); Geometry; Physics; Mathematical analysis","score_opus":0.03610587064497138,"score_gpt":0.24498704681168648,"score_spread":0.2088811761667151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407080619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36413637,0.0008570411,0.53697115,0.002694703,0.0002423903,0.00029257836,0.0038598382,0.0021439272,0.08880197],"genre_scores_gemma":[0.92369974,0.00024697094,0.057793777,0.0010194599,0.00018777561,0.00025638705,0.0023076045,0.00033507554,0.014153112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670166,0.00043038267,0.00024253233,0.0012367645,0.0008495162,0.00053913397],"domain_scores_gemma":[0.9860869,0.0077549377,0.0009825459,0.0029597261,0.0015111981,0.000704714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013583868,0.0005161131,0.00061071396,0.0008989427,0.0015329155,0.0035126614,0.0016084893,0.0008279257,0.007801946],"category_scores_gemma":[0.01115558,0.0003892664,0.0010948704,0.0011387488,0.00206701,0.006434044,0.0021220522,0.002934656,0.00078618637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035803916,0.0000749882,0.0030479305,0.00027244183,0.00004413764,0.00016759126,0.0005406431,0.010020267,0.00692173,0.95172805,0.0047786636,0.022045504],"study_design_scores_gemma":[0.000055508237,0.0001246779,0.0022855818,0.000046169425,0.000068388974,0.0005548519,0.0002286397,0.06493055,0.0139968,0.8944061,0.023249479,0.00005319134],"about_ca_topic_score_codex":0.0031646972,"about_ca_topic_score_gemma":0.003291687,"teacher_disagreement_score":0.007801946,"about_ca_system_score_codex":0.0033506462,"about_ca_system_score_gemma":0.0013223893,"threshold_uncertainty_score":0.0261001},"labels":[],"label_agreement":null},{"id":"W2408470475","doi":"","title":"The Power of Super-logarithmic Number of Players.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Logarithm; Combinatorics; Block (permutation group theory); Randomness; Mathematics; Communication complexity; Discrete mathematics; Function (biology); Boolean function; Matrix (chemical analysis); Mathematical analysis","score_opus":0.02921431922958444,"score_gpt":0.323155116604116,"score_spread":0.29394079737453155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408470475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06972101,0.0027851358,0.81790483,0.0119124,0.0008692417,0.00024069742,0.0005816683,0.0015240973,0.094460905],"genre_scores_gemma":[0.83891916,0.0014428641,0.12087779,0.00209847,0.00074939796,0.00071642187,0.00035923757,0.00053393765,0.034302734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99264914,0.0028512054,0.00023551422,0.0016280513,0.001911835,0.000724336],"domain_scores_gemma":[0.9611627,0.025293536,0.0012847905,0.010213238,0.0010776029,0.00096811325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059949374,0.0012179316,0.0015728837,0.00066255033,0.0014173303,0.004203968,0.0037407225,0.0022430206,0.010613114],"category_scores_gemma":[0.028657025,0.000926772,0.0012006686,0.0009286427,0.0053167855,0.01677682,0.006212154,0.006796315,0.0030150325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006688033,0.000097345895,0.0006821868,0.0003032019,0.00006374457,0.00022241786,0.00025474787,0.02157772,0.00717668,0.9338615,0.008080771,0.027010875],"study_design_scores_gemma":[0.00011248846,0.00010866424,0.00018904898,0.000059804588,0.000038092312,0.00028717975,0.00005448838,0.16506441,0.0054927897,0.81438875,0.01417261,0.000031744174],"about_ca_topic_score_codex":0.00048924395,"about_ca_topic_score_gemma":0.0004534908,"teacher_disagreement_score":0.010613114,"about_ca_system_score_codex":0.0019096842,"about_ca_system_score_gemma":0.0016855852,"threshold_uncertainty_score":0.0355044},"labels":[],"label_agreement":null},{"id":"W2610939548","doi":"","title":"Communication Complexity of Set-Disjointness for All Probabilities.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Characterization (materials science); Mathematics; Class (philosophy); Bounded function; Complexity class; Set (abstract data type); Upper and lower bounds; Discrete mathematics; Simple (philosophy); Combinatorics; Structural complexity theory; Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.058259513247356814,"score_gpt":0.3010568026989903,"score_spread":0.2427972894516335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610939548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34937003,0.0010909578,0.617035,0.008117673,0.00015440583,0.00032556546,0.0012273117,0.0005113894,0.022167679],"genre_scores_gemma":[0.95745194,0.00047944547,0.035688538,0.00062672194,0.00027905332,0.00042173744,0.0004859557,0.00016001106,0.004406597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903583,0.0036662184,0.00036110246,0.0019782102,0.002190852,0.0014453165],"domain_scores_gemma":[0.9045138,0.08013954,0.0052533904,0.0067321607,0.0015587265,0.0018024332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005460844,0.0012453384,0.0015857213,0.0012816467,0.0017755192,0.004641608,0.0040636,0.0028851975,0.006622441],"category_scores_gemma":[0.044251733,0.00073421485,0.0024296886,0.0015988202,0.005092558,0.014097533,0.005474818,0.008940887,0.0006198206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003690036,0.00016347246,0.0019156886,0.00024387777,0.00012947829,0.00017685688,0.0005356801,0.108650245,0.002478076,0.8696096,0.0031802545,0.0125477845],"study_design_scores_gemma":[0.00005709489,0.00005493161,0.00044438688,0.00002097093,0.00003856144,0.00010523122,0.000066672816,0.28900295,0.001561414,0.7073177,0.0013044297,0.000025653966],"about_ca_topic_score_codex":0.0014334666,"about_ca_topic_score_gemma":0.0008622524,"teacher_disagreement_score":0.006622441,"about_ca_system_score_codex":0.0051070964,"about_ca_system_score_gemma":0.0021693625,"threshold_uncertainty_score":0.037054718},"labels":[],"label_agreement":null},{"id":"W32072441","doi":"10.1007/s11060-020-03434-7","title":"Efficient Communication Using Partial Information.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Computer science; Bounded function; Protocol (science); Theoretical computer science; Computational complexity theory; Discrete mathematics; Communications protocol; Mathematics; Algorithm; Computer network","score_opus":0.0231787037010444,"score_gpt":0.27372607558373924,"score_spread":0.2505473718826948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32072441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0470354,0.0015076422,0.9200969,0.0034222174,0.00040312274,0.00025306753,0.0022157207,0.0016749952,0.02339095],"genre_scores_gemma":[0.8089951,0.0012569707,0.17024076,0.0006692144,0.0004198218,0.0005354042,0.0025059762,0.00035517447,0.015021583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960373,0.0013347848,0.00035149255,0.000645321,0.0008415809,0.0007895911],"domain_scores_gemma":[0.9696381,0.020286962,0.0013917048,0.0066216514,0.0014960116,0.0005655796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028268315,0.0012333356,0.001945679,0.0014677899,0.0018270679,0.0031924192,0.0025523761,0.0017979556,0.010140214],"category_scores_gemma":[0.024057124,0.00085085793,0.0011691817,0.0026063852,0.0014955613,0.00778044,0.0046691233,0.0019819029,0.0025545657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022600656,0.00031569114,0.0020193418,0.00090611115,0.00030335123,0.00041757923,0.00067532616,0.3386664,0.0067299376,0.3143268,0.047123663,0.28625575],"study_design_scores_gemma":[0.00013484163,0.00014095801,0.00037472803,0.00006128595,0.000086654334,0.00023359637,0.000116097384,0.6490185,0.0031719988,0.33997023,0.0066512963,0.000039784103],"about_ca_topic_score_codex":0.0022392685,"about_ca_topic_score_gemma":0.003245288,"teacher_disagreement_score":0.010140214,"about_ca_system_score_codex":0.0015682874,"about_ca_system_score_gemma":0.0029939404,"threshold_uncertainty_score":0.033922374},"labels":[],"label_agreement":null},{"id":"W39832950","doi":"","title":"An Exponential Time/Space Speedup For Resolution","year":2007,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); DPLL algorithm; Satisfiability; Speedup; Heuristics; Bottleneck; PSPACE; Mathematical proof; Heuristic; Proof complexity; Space (punctuation); Computer science; Mathematics; Algorithm; Conjunctive normal form; Automated theorem proving; Exponential function; Discrete mathematics; Computational complexity theory; Mathematical optimization; Parallel computing; Artificial intelligence","score_opus":0.02567232214564987,"score_gpt":0.29772534194865613,"score_spread":0.2720530198030063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39832950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08143615,0.0066167885,0.81236964,0.023329623,0.0011960781,0.00033548824,0.0019019104,0.010499927,0.062314413],"genre_scores_gemma":[0.3931162,0.0029320787,0.579157,0.0030988476,0.0008932293,0.0003934788,0.0018132783,0.0018545847,0.016741348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350476,0.0011872161,0.000364182,0.0015607371,0.0022279972,0.0011550966],"domain_scores_gemma":[0.98729634,0.0077242046,0.0004888545,0.0034326378,0.00078079547,0.00027715374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039284993,0.0021440163,0.001340002,0.001406935,0.0012258132,0.0039609117,0.0032797938,0.0033266465,0.029736113],"category_scores_gemma":[0.016282776,0.0010502132,0.0026445452,0.0023694534,0.0022276465,0.013776273,0.003449769,0.0058489847,0.005825638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024866345,0.00085241755,0.0022365577,0.0021708575,0.00023126802,0.0006029153,0.000509236,0.07881025,0.06091848,0.34548867,0.061891995,0.44380075],"study_design_scores_gemma":[0.0005220829,0.00032581444,0.0009639492,0.0002322875,0.00021166161,0.0013688917,0.0003316258,0.4233636,0.037223432,0.49405771,0.04133477,0.00006417545],"about_ca_topic_score_codex":0.0016627659,"about_ca_topic_score_gemma":0.0025422922,"teacher_disagreement_score":0.029736113,"about_ca_system_score_codex":0.0028874853,"about_ca_system_score_gemma":0.0026261602,"threshold_uncertainty_score":0.09947717},"labels":[],"label_agreement":null},{"id":"W96496641","doi":"","title":"Black-White Pebbling is PSPACE-Complete","year":2007,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; PH; White (mutation); Completeness (order theory); Complexity class; Computational complexity theory; Computation; Discrete mathematics; Mathematics; Bounded function; Structural complexity theory; Combinatorics; Computer science; Model of computation; Theoretical computer science; Time complexity; Algorithm; Quantum complexity theory; Quantum computer; Physics","score_opus":0.03925007688016794,"score_gpt":0.290956658325877,"score_spread":0.25170658144570907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96496641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27392304,0.0018992155,0.51915485,0.013140445,0.0005238249,0.00067809154,0.0025974663,0.0023568268,0.18572627],"genre_scores_gemma":[0.8746204,0.0020015284,0.07776812,0.002511322,0.00033669162,0.0004941371,0.0031130677,0.00047332566,0.03868152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973236,0.00038851038,0.00013830468,0.0006821796,0.00075821043,0.00070932537],"domain_scores_gemma":[0.99038976,0.0073945015,0.00051912,0.00055828365,0.00065250054,0.00048582396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182272,0.0011745817,0.0017284901,0.0006343821,0.0025810834,0.005760697,0.0016195709,0.0029163945,0.011087897],"category_scores_gemma":[0.008331487,0.000848594,0.0016626179,0.0014340114,0.0039516143,0.007130048,0.003480246,0.0053262855,0.0020131357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072399696,0.00054786983,0.0014720995,0.0011297844,0.00019349228,0.0011009041,0.00084859785,0.111703776,0.015053161,0.79447114,0.025648963,0.04710615],"study_design_scores_gemma":[0.00012691187,0.00004979096,0.00020834923,0.000028111377,0.000025870706,0.00023553804,0.00012864493,0.06689877,0.004000353,0.9219548,0.0063166064,0.000026312115],"about_ca_topic_score_codex":0.004269189,"about_ca_topic_score_gemma":0.005100895,"teacher_disagreement_score":0.011087897,"about_ca_system_score_codex":0.0022085547,"about_ca_system_score_gemma":0.0036891233,"threshold_uncertainty_score":0.037092686},"labels":[],"label_agreement":null}]}