{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59225416,0.0013372342,0.07699268,0.07291657,0.002054913,0.005039364,0.0009232214,0.00087388395,0.24760798],"genre_scores_gemma":[0.99204963,0.0000061005594,0.0009181599,0.004678504,0.00024622108,0.000044217508,0.00018929642,0.000026591206,0.0018412845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713606,0.0001785569,0.001010357,0.00073615066,0.00023760785,0.0007012845],"domain_scores_gemma":[0.99815667,0.0003127545,0.0007451576,0.00059084536,0.00009500217,0.00009957404],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001905242,0.0003241482,0.0005069199,0.0002037489,0.0007428004,0.00014461995,0.000507918,0.00009960285,0.00034303236],"category_scores_gemma":[0.00008422666,0.00031125644,0.00022771714,0.00045538062,0.00013413609,0.00013164706,0.000049956725,0.00052314275,0.00081514247],"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.0002357511,0.00033984915,0.00046593693,0.000010079948,0.00007871774,0.000007321489,0.00029968718,0.00933873,0.000011555012,0.97704774,0.01172472,0.00043989476],"study_design_scores_gemma":[0.0010734209,0.0011450811,0.024216399,0.0000440103,0.000009053539,0.00007220339,0.00002173891,0.036283296,0.000027731301,0.84976816,0.086942576,0.00039631227],"about_ca_topic_score_codex":0.0000910975,"about_ca_topic_score_gemma":0.000021069533,"teacher_disagreement_score":0.39979547,"about_ca_system_score_codex":0.00065424846,"about_ca_system_score_gemma":0.00011762307,"threshold_uncertainty_score":0.99996287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34730992,0.00010519808,0.6432467,0.004265829,0.0002495873,0.0011045737,0.00006400563,0.0006314967,0.0030226777],"genre_scores_gemma":[0.95602274,0.0000035098622,0.042968433,0.000658159,0.0000792304,0.000011037528,0.00005645116,0.000012169485,0.00018825287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721605,0.00021513981,0.00048656945,0.0006117116,0.00084303756,0.00062748493],"domain_scores_gemma":[0.9979414,0.0007091219,0.0002769142,0.0005803923,0.00035292277,0.0001392669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025539042,0.00031390475,0.0004883913,0.00034972245,0.00031633954,0.0001777918,0.0009227353,0.000074157084,0.000065004235],"category_scores_gemma":[0.00006087243,0.00028863474,0.0001621771,0.0014817455,0.00022929892,0.00049583544,0.00011376509,0.00038004498,0.000025480149],"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.002978732,0.0016277224,0.00017327484,0.000017322907,0.00022093207,0.000041730145,0.0002634248,0.07432887,0.0008958659,0.8845422,0.012075799,0.022834098],"study_design_scores_gemma":[0.007892749,0.005416599,0.0630618,0.000093291594,0.000038990576,0.00014952746,0.000005954333,0.72541004,0.0010563796,0.18590617,0.009975722,0.0009927509],"about_ca_topic_score_codex":0.000044408822,"about_ca_topic_score_gemma":0.0000213396,"teacher_disagreement_score":0.69863605,"about_ca_system_score_codex":0.00018799237,"about_ca_system_score_gemma":0.0006232584,"threshold_uncertainty_score":0.9999566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037980214,0.000046256195,0.90899664,0.00047835946,0.00071450125,0.0004872274,0.00001934233,0.0017233556,0.04955412],"genre_scores_gemma":[0.8381563,0.0000027749845,0.1610062,0.000544849,0.00006535305,0.000061417006,0.000014409755,0.000023355517,0.00012537769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711114,0.00022534921,0.0004981615,0.00078736705,0.00064065395,0.0007372982],"domain_scores_gemma":[0.9982884,0.00028561277,0.00024385996,0.0007061212,0.00030871312,0.0001673192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000489768,0.0003443513,0.000348727,0.0003176127,0.00045852584,0.00012127385,0.0013981239,0.00010090141,0.0001426589],"category_scores_gemma":[0.00012345635,0.0003725837,0.0001712515,0.0007889284,0.0002914649,0.00030949956,0.00031201882,0.00052180095,0.00014169725],"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.000059835867,0.0002252966,0.00028066896,0.000009237538,0.000042772965,0.000019352256,0.00040257655,0.00024322652,0.000051959007,0.9778945,0.0011316575,0.019638933],"study_design_scores_gemma":[0.0006744458,0.0012070471,0.021417309,0.00003165595,0.000019287447,0.0003439723,0.000026644877,0.1646006,0.0016166859,0.8067749,0.002668779,0.000618667],"about_ca_topic_score_codex":0.000117312826,"about_ca_topic_score_gemma":0.00032074703,"teacher_disagreement_score":0.8001761,"about_ca_system_score_codex":0.000516586,"about_ca_system_score_gemma":0.0009136642,"threshold_uncertainty_score":0.9998726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06804111,0.0001221786,0.92437935,0.0026918051,0.00037494831,0.0005906581,0.000025755955,0.00037754056,0.0033966678],"genre_scores_gemma":[0.9703081,0.000005503134,0.028534552,0.00051095895,0.00013602289,0.00008913966,0.00019385434,0.000020418249,0.0002014427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664867,0.00020896793,0.0006617025,0.0008427028,0.0007893735,0.00084859575],"domain_scores_gemma":[0.9984716,0.00034926855,0.00023011243,0.00061268866,0.00023475857,0.00010152444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068023504,0.0003556739,0.00040208566,0.00050717266,0.00043686866,0.00024323892,0.0011884348,0.000103338825,0.000055125925],"category_scores_gemma":[0.000024700981,0.00039737942,0.00015344383,0.0016942087,0.00022277974,0.000470084,0.00022316769,0.00051193516,0.00010218499],"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.000052667885,0.0005127116,0.000635098,0.000012083298,0.00001713077,0.000008171767,0.00006579532,0.04185895,0.000123256,0.9523449,0.000854122,0.0035151343],"study_design_scores_gemma":[0.00070975476,0.00016399659,0.045006473,0.000012968741,0.0000032735043,0.000027271168,0.000005333489,0.38570896,0.00019410218,0.56434035,0.0035191816,0.00030831216],"about_ca_topic_score_codex":0.00067317707,"about_ca_topic_score_gemma":0.001302467,"teacher_disagreement_score":0.902267,"about_ca_system_score_codex":0.0006826065,"about_ca_system_score_gemma":0.0003928824,"threshold_uncertainty_score":0.9998478},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0717002,0.00023718347,0.9155627,0.005078232,0.0005076333,0.00048247966,0.0000141155715,0.0008463853,0.005571111],"genre_scores_gemma":[0.9258376,0.0000010871321,0.07231485,0.0009933059,0.0003527694,0.000027779288,0.000043972967,0.00002707754,0.00040158434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967229,0.00017910358,0.00047025146,0.0008582953,0.00082576653,0.00094371324],"domain_scores_gemma":[0.9987049,0.00028443366,0.000210858,0.00051410025,0.00019966956,0.000086006934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046304215,0.00036104763,0.00033151542,0.00024349078,0.00065113825,0.00037830073,0.001081758,0.00008010868,0.000054313943],"category_scores_gemma":[0.000022371456,0.00035517808,0.00018822325,0.00082075887,0.00012830424,0.00020026803,0.00029691093,0.00056148955,0.00013828087],"study_design_candidate":"simulation_or_modeling","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.000013504079,0.00017025408,0.00011902618,0.0000125796805,0.000023682389,0.000008736723,0.000060412196,0.41747752,0.000059973147,0.5749088,0.0032267247,0.0039188303],"study_design_scores_gemma":[0.0004630379,0.00022425732,0.0128183905,0.000029156286,0.0000040064,0.0000545285,0.0000016678412,0.6186252,0.000041846175,0.35360512,0.013822528,0.00031025344],"about_ca_topic_score_codex":0.00006317925,"about_ca_topic_score_gemma":0.0000661796,"teacher_disagreement_score":0.85413736,"about_ca_system_score_codex":0.0002993174,"about_ca_system_score_gemma":0.00040528143,"threshold_uncertainty_score":0.99989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013435676,0.00013587176,0.98130554,0.002093939,0.000635891,0.0006899668,0.000035353547,0.00035179063,0.0013159824],"genre_scores_gemma":[0.8580963,0.000007832383,0.1393363,0.0014688766,0.0003674046,0.00010267864,0.00013230287,0.00003186267,0.00045647056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970234,0.00021423335,0.0005002804,0.00092986476,0.00053968857,0.0007925084],"domain_scores_gemma":[0.99649143,0.0022354093,0.00023122794,0.00049331604,0.00034698882,0.00020164163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010096227,0.00037220545,0.00042127754,0.00019999147,0.00088758994,0.00029444916,0.00079787755,0.00012662179,0.000025110057],"category_scores_gemma":[0.0002703708,0.00040644337,0.00018844439,0.0006333804,0.00026049683,0.00029417983,0.0002425245,0.00042948924,0.000030965235],"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.00004189825,0.00017047496,0.00014045875,0.00002933945,0.00005216633,0.0000010145329,0.00015747479,0.010851914,0.000020528923,0.94962513,0.00053377775,0.03837582],"study_design_scores_gemma":[0.0009847746,0.0006168113,0.005784041,0.000014287481,0.000010140485,0.000025916226,0.000004907436,0.55450743,0.000024222694,0.42805272,0.009696822,0.00027791815],"about_ca_topic_score_codex":0.000026896614,"about_ca_topic_score_gemma":0.0000791904,"teacher_disagreement_score":0.8446606,"about_ca_system_score_codex":0.00024234796,"about_ca_system_score_gemma":0.00033344573,"threshold_uncertainty_score":0.99983877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026684482,0.000038955724,0.97080225,0.0005862289,0.000254211,0.0010878382,0.00008206454,0.0003357124,0.00012823624],"genre_scores_gemma":[0.52897805,0.0000018500689,0.46915257,0.0009769755,0.00020282615,0.0002505354,0.00030895608,0.000029257726,0.00009895131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719536,0.00013742468,0.00044122458,0.0008237348,0.0003763766,0.0010258886],"domain_scores_gemma":[0.9979271,0.00045834857,0.00020115581,0.00070834835,0.00038279354,0.00032223022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004149379,0.000352487,0.0003404012,0.00016513988,0.0006156443,0.00050185865,0.001444481,0.000110433684,0.000066941255],"category_scores_gemma":[0.000044487973,0.0003445511,0.00014689079,0.00034196652,0.000097596174,0.0006759173,0.0002501634,0.00030905995,0.00007874432],"study_design_candidate":"simulation_or_modeling","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.00012261396,0.0015195352,0.00010533185,0.000065130924,0.00015029636,0.000012242823,0.00047161028,0.013576011,0.0031061633,0.32574788,0.0045054844,0.6506177],"study_design_scores_gemma":[0.0009161096,0.0011790413,0.0033884428,0.00001042078,0.000008419945,0.000031604523,0.000009558727,0.77366346,0.000286406,0.21880548,0.0013698089,0.00033126207],"about_ca_topic_score_codex":0.00016701914,"about_ca_topic_score_gemma":0.00006780518,"teacher_disagreement_score":0.76008743,"about_ca_system_score_codex":0.00044743504,"about_ca_system_score_gemma":0.0007388256,"threshold_uncertainty_score":0.99990064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108787,0.00094564253,0.9309195,0.036869366,0.00091723306,0.0020768035,0.000072838535,0.000488346,0.016831545],"genre_scores_gemma":[0.9650875,0.000011977195,0.032811087,0.0010264046,0.0002013546,0.00012827953,0.00004914809,0.00002251129,0.0006617951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973492,0.0002010341,0.00034570822,0.0006757715,0.0006932154,0.00073506474],"domain_scores_gemma":[0.9970249,0.0016139374,0.00018579217,0.0005827416,0.00036464765,0.00022799443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015418015,0.0003232334,0.00043232727,0.00017023596,0.000670858,0.0003477178,0.0010542438,0.000066575136,0.0000063811576],"category_scores_gemma":[0.00023828782,0.00025750892,0.00018331442,0.00072394306,0.0005921192,0.00030854277,0.0003932951,0.00035697094,0.000027301734],"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.0002655428,0.000094563955,0.000028700506,0.0000132861,0.000060702307,0.0000019843171,0.00042625383,0.004731922,0.00000188217,0.98854315,0.0042848103,0.001547174],"study_design_scores_gemma":[0.0028057552,0.00037744286,0.00052020664,0.000011128837,0.000014978314,0.000037720147,0.000038764658,0.42729968,0.00004706355,0.54985064,0.018752644,0.00024399045],"about_ca_topic_score_codex":0.00015330846,"about_ca_topic_score_gemma":0.0002302324,"teacher_disagreement_score":0.95420873,"about_ca_system_score_codex":0.0003287669,"about_ca_system_score_gemma":0.0007274291,"threshold_uncertainty_score":0.9999877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025911335,0.00018817058,0.95036685,0.006767227,0.0008960779,0.0009011829,0.000036497782,0.000570214,0.014362447],"genre_scores_gemma":[0.9536381,0.000009222523,0.04230213,0.0033616228,0.00016442117,0.000057704045,0.000025971947,0.000024474792,0.00041637517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966104,0.00028136247,0.0005298936,0.0008253413,0.00087669777,0.0008762923],"domain_scores_gemma":[0.9979702,0.00040067462,0.000259184,0.0009187916,0.00031222007,0.00013891066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082330196,0.0003755762,0.00031076832,0.00021715244,0.0010965131,0.00024520265,0.0019556344,0.00009642491,0.00045986564],"category_scores_gemma":[0.000040955194,0.00031459887,0.0002830304,0.0012233267,0.0003071435,0.0004989419,0.00038345152,0.00063416484,0.00027184602],"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.00006891422,0.00025019702,0.00018040904,0.000009262045,0.00008068812,0.000005012236,0.0010664852,0.00058721256,0.000039130464,0.9885446,0.0037899176,0.005378188],"study_design_scores_gemma":[0.0005914355,0.00051122624,0.017944656,0.000013570681,0.000013672042,0.000047106398,0.000028462871,0.31740776,0.00037302804,0.6553384,0.007371546,0.00035914997],"about_ca_topic_score_codex":0.00021014603,"about_ca_topic_score_gemma":0.00011801964,"teacher_disagreement_score":0.92772675,"about_ca_system_score_codex":0.00025851172,"about_ca_system_score_gemma":0.00047449203,"threshold_uncertainty_score":0.9999306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31283796,0.00033545552,0.657463,0.01187861,0.00092340127,0.0021129686,0.00005906296,0.00035226086,0.014037255],"genre_scores_gemma":[0.98023343,0.000008187467,0.019020561,0.0005011875,0.000081212405,0.00006444074,0.000017536824,0.000013973367,0.000059452694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975211,0.00022593777,0.00048086964,0.00055312493,0.00067453197,0.0005444537],"domain_scores_gemma":[0.9971589,0.0015372781,0.0002824414,0.0005864732,0.00032412,0.00011082963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011104767,0.00028872394,0.0004324559,0.00019884715,0.00064807956,0.00018757735,0.0013376927,0.00007823911,0.00004382607],"category_scores_gemma":[0.00007987823,0.00022743765,0.00016824962,0.0008073707,0.0012497973,0.00027120038,0.00042319935,0.0008988097,0.00001527212],"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.00006295944,0.00014753234,0.00013643704,0.000018622055,0.000065291875,0.0000019793483,0.0008816976,0.0010741062,0.00013426547,0.98777413,0.00028255302,0.009420438],"study_design_scores_gemma":[0.0018870293,0.0003155049,0.010955897,0.000018222081,0.00001133341,0.000046935664,0.000031482436,0.23069954,0.0003316256,0.754218,0.0012424792,0.0002419847],"about_ca_topic_score_codex":0.00014180694,"about_ca_topic_score_gemma":0.0003281179,"teacher_disagreement_score":0.6673955,"about_ca_system_score_codex":0.000058742666,"about_ca_system_score_gemma":0.0004485192,"threshold_uncertainty_score":0.9274638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19982992,0.00014494985,0.7876142,0.005914511,0.0007555832,0.001085533,0.000026478117,0.0006765468,0.0039522434],"genre_scores_gemma":[0.908786,0.0000037889617,0.08864657,0.0017965462,0.0003153534,0.000120873956,0.00013896507,0.000024161096,0.00016777434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566764,0.0003813717,0.0006481607,0.0011709519,0.0011357698,0.0009961003],"domain_scores_gemma":[0.99707687,0.000964907,0.00025161635,0.00091641524,0.0005133664,0.000276811],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043034868,0.00043879548,0.00044441255,0.00013154373,0.00047267906,0.00059761823,0.0014929742,0.00012912095,0.0010158708],"category_scores_gemma":[0.00010478435,0.0004528625,0.00020596274,0.00079771754,0.00022152248,0.00082665944,0.00044913136,0.0005725298,0.0011057912],"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.00004386664,0.0006788865,0.0011035731,0.000011314809,0.0001374986,0.00001144802,0.00042079279,0.032508958,0.00030887173,0.91721815,0.0087149,0.03884173],"study_design_scores_gemma":[0.00065404776,0.0002728584,0.03907922,0.00000767491,0.000005650531,0.000008831315,0.000007753129,0.5110617,0.00015131103,0.44620585,0.0022214917,0.0003235852],"about_ca_topic_score_codex":0.0005013103,"about_ca_topic_score_gemma":0.000101510945,"teacher_disagreement_score":0.70895606,"about_ca_system_score_codex":0.0007807377,"about_ca_system_score_gemma":0.00068364176,"threshold_uncertainty_score":0.99989736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34563404,0.00071300793,0.60181934,0.003101949,0.002303344,0.0006761107,0.000039102895,0.0012451141,0.04446801],"genre_scores_gemma":[0.99098146,0.000007918373,0.0051145395,0.0030423824,0.0003522075,0.000031256244,0.00007509538,0.000028105844,0.00036701682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677664,0.00017220309,0.00042479462,0.00054347864,0.0008108139,0.0012720658],"domain_scores_gemma":[0.9983406,0.00038543757,0.0001888349,0.0006411338,0.00015950842,0.00028448057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089662184,0.00035069018,0.0003268652,0.0002197928,0.0005418014,0.00025130814,0.0011803245,0.000098125696,0.00014946412],"category_scores_gemma":[0.00004384968,0.0003525688,0.00019246594,0.0008163589,0.0001679115,0.0008321911,0.0002950906,0.00046140666,0.00049136946],"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.000020362471,0.00041947412,0.00018291514,0.000008894641,0.000050889896,0.0000043427913,0.00019104815,0.002564255,0.0001611511,0.98361707,0.0031235097,0.009656082],"study_design_scores_gemma":[0.0015246433,0.00082045345,0.032282196,0.000048887792,0.000020164456,0.00011335888,0.00004817809,0.30001685,0.0005416526,0.5749617,0.08837258,0.0012493023],"about_ca_topic_score_codex":0.00001489654,"about_ca_topic_score_gemma":0.000014554974,"teacher_disagreement_score":0.6453474,"about_ca_system_score_codex":0.0006434981,"about_ca_system_score_gemma":0.0005011288,"threshold_uncertainty_score":0.99989265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27240106,0.00008327604,0.7008375,0.0006045246,0.00044347454,0.00039788656,0.000033526885,0.0004086433,0.02479009],"genre_scores_gemma":[0.97591114,0.0000037759428,0.023508692,0.00039607292,0.000031567877,0.000009714684,0.000022208806,0.000010799847,0.000106049774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00009921326,0.00033283085,0.00038446652,0.0004576951,0.00045479386],"domain_scores_gemma":[0.99884164,0.00024572306,0.00017984075,0.0004636642,0.00016708141,0.000102051265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036153276,0.0001858332,0.00024497972,0.00018342941,0.00020651871,0.000030759067,0.0010121171,0.00005447955,0.0002602531],"category_scores_gemma":[0.00002670189,0.00018344689,0.00013618289,0.00059526274,0.00016392382,0.00026052992,0.00023760596,0.00022347727,0.00010528005],"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.000051330717,0.0003281586,0.0000639142,0.000010874009,0.000036077483,0.000003983512,0.0003356503,0.0011483562,0.00011891523,0.9949296,0.0006422161,0.0023308853],"study_design_scores_gemma":[0.00080868846,0.0008370461,0.0141458465,0.00003364967,0.000009362141,0.000023503728,0.000040538038,0.1765891,0.004096986,0.80205685,0.0010519683,0.00030644634],"about_ca_topic_score_codex":0.000050082013,"about_ca_topic_score_gemma":0.000024189194,"teacher_disagreement_score":0.70351005,"about_ca_system_score_codex":0.00017180585,"about_ca_system_score_gemma":0.00041103183,"threshold_uncertainty_score":0.74807465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9363021,0.00004743016,0.045412377,0.0011978946,0.00009445939,0.0005650285,0.000051538576,0.000041817304,0.016287304],"genre_scores_gemma":[0.99499977,0.000004948985,0.0045810123,0.00005189471,0.00003832072,0.00002989054,0.000013140025,0.000014520719,0.00026648148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985223,0.000126018,0.00045460445,0.00018846813,0.00043223528,0.00027636427],"domain_scores_gemma":[0.99676186,0.0023800412,0.0002746597,0.00030705013,0.0002353304,0.00004106608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006442666,0.00013309845,0.00027945486,0.000043231194,0.00024181769,0.000019083698,0.00032899124,0.00004507426,0.00020583037],"category_scores_gemma":[0.0001587612,0.00010170708,0.00014052622,0.00028667296,0.00022123444,0.00003449101,0.000051095154,0.00017845951,0.00003112793],"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.00010736323,0.00016364713,0.00019820426,0.000016348167,0.000048324073,6.176202e-8,0.00008367185,0.0006120663,0.000066024855,0.9966091,0.0016645666,0.0004306187],"study_design_scores_gemma":[0.0010960419,0.00019641033,0.004216708,0.000012824164,0.000023729,0.000008464567,0.00004318196,0.016804716,0.00033409536,0.9679475,0.009193505,0.00012283913],"about_ca_topic_score_codex":0.000025714384,"about_ca_topic_score_gemma":0.000067937224,"teacher_disagreement_score":0.05869764,"about_ca_system_score_codex":0.00007391191,"about_ca_system_score_gemma":0.00016154708,"threshold_uncertainty_score":0.41474944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028199654,0.00012396698,0.9617241,0.0048902994,0.0003112033,0.0013284313,0.00011422952,0.00036779512,0.002940301],"genre_scores_gemma":[0.85056984,0.0000058834294,0.14806944,0.0007450297,0.00008193373,0.00015371609,0.0002709433,0.000024944498,0.00007828942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962212,0.00052649016,0.0008517771,0.0008011122,0.000788268,0.00081116165],"domain_scores_gemma":[0.9956894,0.001692167,0.0004822678,0.0012761968,0.0006980473,0.00016194498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016264502,0.0003960337,0.0006433728,0.00028120127,0.00057373976,0.00014932259,0.002104777,0.0001132326,0.000055641834],"category_scores_gemma":[0.00022380026,0.00042598223,0.00034603884,0.0007301868,0.00093041523,0.00037041283,0.0004744448,0.00042360928,0.000018316934],"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.00010492743,0.0004008588,0.00004623594,0.00008760615,0.00007610844,1.8784469e-7,0.00034852407,0.008178433,0.00004154479,0.9858613,0.0011981786,0.0036561044],"study_design_scores_gemma":[0.0009640239,0.00061239925,0.0021228476,0.000030872532,0.000011756185,0.000008985464,0.000017802087,0.37271434,0.0002555748,0.61565703,0.0073188026,0.00028556935],"about_ca_topic_score_codex":0.000105191844,"about_ca_topic_score_gemma":0.00023197889,"teacher_disagreement_score":0.8223702,"about_ca_system_score_codex":0.00033799122,"about_ca_system_score_gemma":0.00042759976,"threshold_uncertainty_score":0.9998192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2487932,0.00003411879,0.74528176,0.0018242621,0.0007152013,0.00043212168,0.00002364302,0.00039284155,0.0025028232],"genre_scores_gemma":[0.8833115,0.0000013859926,0.11573027,0.0007525316,0.000092606395,0.000024869167,0.000062278596,0.000009784198,0.0000147323735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750054,0.0001725643,0.00052141433,0.00039062768,0.00078580616,0.00062906835],"domain_scores_gemma":[0.9979696,0.00037007497,0.00025712792,0.0008807792,0.00036435688,0.00015806021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072586234,0.0002672683,0.00024795756,0.00030832237,0.0009686218,0.00039066837,0.0014528645,0.00009777907,0.00013250402],"category_scores_gemma":[0.000090430214,0.00028820845,0.0001544581,0.00093031314,0.00028563372,0.00046857478,0.00042699388,0.0008688385,0.00014941269],"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.000022748214,0.00016024646,0.00004217824,0.0000055657338,0.000021476006,8.2272186e-7,0.00018740752,0.12410786,0.00009598219,0.8724174,0.00027283758,0.0026654922],"study_design_scores_gemma":[0.00054613134,0.00010803208,0.0022085607,0.000010651063,0.000005383162,0.000041168118,0.000011144016,0.80398685,0.00014339427,0.18479821,0.007869296,0.00027117485],"about_ca_topic_score_codex":0.00008101202,"about_ca_topic_score_gemma":0.000066903995,"teacher_disagreement_score":0.68761915,"about_ca_system_score_codex":0.00021213341,"about_ca_system_score_gemma":0.0006097011,"threshold_uncertainty_score":0.999957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062372103,0.0001177262,0.9306779,0.0006882351,0.00050513475,0.00060427445,0.000014390477,0.000413134,0.0046070884],"genre_scores_gemma":[0.9468746,0.0000016206759,0.051410995,0.00033328804,0.000540793,0.000026644726,0.000149469,0.000023544733,0.000639011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997053,0.00015268744,0.0004025824,0.0007833542,0.0006029007,0.001005428],"domain_scores_gemma":[0.99814063,0.0005442111,0.0001999498,0.0004934194,0.00038495284,0.0002368266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014495085,0.00029299795,0.00029814968,0.00024136523,0.00064756273,0.00020947479,0.00096651254,0.000115695584,0.000075229895],"category_scores_gemma":[0.00008648864,0.00030675452,0.00018303457,0.0005851952,0.00013369069,0.00042103473,0.00012764448,0.00028436072,0.00019786083],"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.00030190492,0.0004343207,0.00005310603,0.000010530838,0.00003700155,0.0000045218253,0.00029384997,0.006876367,0.0010893103,0.9838764,0.0037864316,0.0032362696],"study_design_scores_gemma":[0.0017305942,0.0019605828,0.00909668,0.000014296432,0.000014996365,0.000040103856,0.000021655227,0.6824703,0.0014084517,0.2840766,0.01863533,0.0005304146],"about_ca_topic_score_codex":0.00002755483,"about_ca_topic_score_gemma":0.00017451613,"teacher_disagreement_score":0.88450253,"about_ca_system_score_codex":0.00059172866,"about_ca_system_score_gemma":0.00054086896,"threshold_uncertainty_score":0.9999384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06751897,0.00013024156,0.9150711,0.006811895,0.00077137933,0.0008243652,0.000035145848,0.00087481743,0.007962082],"genre_scores_gemma":[0.8985184,0.0000049402415,0.097060025,0.0033457559,0.00045681832,0.000019938354,0.00005683532,0.00004874912,0.00048856385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99313915,0.00029507498,0.0010341918,0.0017274673,0.0018165963,0.0019875],"domain_scores_gemma":[0.99589074,0.0012756007,0.00041120322,0.0012886445,0.0006840288,0.00044977976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002381581,0.00069298275,0.0007001459,0.0006313536,0.0008004265,0.00046188178,0.0023188419,0.00018536231,0.00033431652],"category_scores_gemma":[0.00013061125,0.00074752764,0.0004126614,0.0021730382,0.0004585689,0.00053262245,0.00083283253,0.0010273628,0.00060128124],"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.00022417739,0.0009066731,0.0015182176,0.00005160555,0.00018300634,0.00006602396,0.0018501944,0.05556965,0.00021385758,0.91861975,0.0067358473,0.014060984],"study_design_scores_gemma":[0.0013885397,0.0008239856,0.036801852,0.000025686435,0.000016115475,0.00009496859,0.000051091174,0.5944611,0.0002344148,0.346275,0.018933296,0.00089397386],"about_ca_topic_score_codex":0.000066661436,"about_ca_topic_score_gemma":0.00022401042,"teacher_disagreement_score":0.8309994,"about_ca_system_score_codex":0.0013281946,"about_ca_system_score_gemma":0.0008511275,"threshold_uncertainty_score":0.9994976},"labels":[],"label_agreement":null}]}