{"meta":{"query_hash":"1caef02c2311","filters":{"venue":"Journal of Combinatorics"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/1caef02c2311","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorics"},"results":[{"id":"W1981391255","doi":"10.4310/joc.2013.v4.n3.a2","title":"Complements of nearly perfect graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Hungarian Scientific Research Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Class (philosophy); Bounded function; Trivially perfect graph; Chordal graph; Indifference graph; Function (biology); Clique-sum","score_opus":0.018441708194938358,"score_gpt":0.28255513332557425,"score_spread":0.2641134251306359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981391255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8696059,0.0009819041,0.06969776,0.0006976938,0.00012763363,0.000077504264,0.0011467192,0.0002788878,0.057386033],"genre_scores_gemma":[0.9827474,0.00037622897,0.009943775,0.0001497132,0.000085329724,0.000069273476,0.001069647,0.000073718584,0.005484943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990306,0.00018887884,0.000039883107,0.00024065831,0.00030212992,0.00019789388],"domain_scores_gemma":[0.9967649,0.0012359646,0.0005599956,0.00034975805,0.00049471663,0.0005947089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072082324,0.0003934775,0.0006447315,0.001662739,0.0014201386,0.0026543152,0.0007772738,0.0006901675,0.005375711],"category_scores_gemma":[0.004194172,0.00043490177,0.00057455915,0.0010024074,0.0026170388,0.0035467967,0.0021023133,0.0009410931,0.00034801036],"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.00014849206,0.00002324249,0.0021728019,0.000056520068,0.000018865474,0.00022084925,0.0004032614,0.0046092896,0.0022294533,0.979427,0.001706843,0.008983334],"study_design_scores_gemma":[0.000028738063,0.00006205344,0.0041873413,0.00007208224,0.0000356241,0.00068011833,0.0008143166,0.030624019,0.0028648516,0.9423704,0.018221324,0.000039129078],"about_ca_topic_score_codex":0.0037254728,"about_ca_topic_score_gemma":0.0023029428,"teacher_disagreement_score":0.005375711,"about_ca_system_score_codex":0.0012577687,"about_ca_system_score_gemma":0.0006894262,"threshold_uncertainty_score":0.017983556},"labels":[],"label_agreement":null},{"id":"W2061413565","doi":"10.4310/joc.2012.v3.n2.a6","title":"Meyniel’s conjecture on the cop number: A survey","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.09291930515307462,"score_gpt":0.3474541012453438,"score_spread":0.2545347960922692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061413565","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09276263,0.42087772,0.11799537,0.04550217,0.003663455,0.00013255539,0.0011054702,0.00040373977,0.31755692],"genre_scores_gemma":[0.63846755,0.27464342,0.034966502,0.005920156,0.010593893,0.00027784167,0.0020201704,0.0003829373,0.03272751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982121,0.00023260263,0.00011162472,0.0007050736,0.0004790985,0.00025950282],"domain_scores_gemma":[0.99360126,0.004463285,0.00031294773,0.00047382075,0.00083203113,0.0003165557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030752644,0.0010064676,0.0019618631,0.0046249893,0.0023933437,0.0055576414,0.0019863758,0.0029741602,0.006963344],"category_scores_gemma":[0.010269931,0.001002374,0.0009014163,0.0067968527,0.0071637887,0.018439049,0.002922174,0.0045242743,0.0018066809],"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.0000687321,0.00006814391,0.0015007927,0.0007505763,0.000028699824,0.000113051836,0.00033562377,0.0031434407,0.00040757275,0.87806153,0.015968155,0.09955363],"study_design_scores_gemma":[0.000022055136,0.00006359956,0.0011760541,0.00039113316,0.00002267697,0.00037745998,0.00041251935,0.005766827,0.00086790544,0.8467316,0.14409465,0.0000734296],"about_ca_topic_score_codex":0.0034747813,"about_ca_topic_score_gemma":0.001409718,"teacher_disagreement_score":0.006963344,"about_ca_system_score_codex":0.0044924924,"about_ca_system_score_gemma":0.0020715452,"threshold_uncertainty_score":0.032595456},"labels":[],"label_agreement":null},{"id":"W2080401458","doi":"10.4310/joc.2013.v4.n4.a4","title":"A Sidon-type condition on set systems","year":2013,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lambda; Constant (computer programming); Combinatorics; Type (biology); Upper and lower bounds; Closure (psychology); Probabilistic logic; Set (abstract data type); Value (mathematics); Discrete mathematics; Physics; Statistics; Mathematical analysis; Computer science; Quantum mechanics","score_opus":0.05795207938737249,"score_gpt":0.3350437176936293,"score_spread":0.27709163830625677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080401458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5110801,0.0011572588,0.26337025,0.0053809243,0.00090105826,0.00024508176,0.0019436426,0.0011786316,0.21474306],"genre_scores_gemma":[0.9307368,0.00038282305,0.048814435,0.0007567676,0.00028599182,0.0003782483,0.0009332907,0.00016568058,0.017545963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749327,0.00041916204,0.00028503817,0.0006482043,0.0006373823,0.0005169847],"domain_scores_gemma":[0.9906533,0.004702603,0.0006089571,0.0013650982,0.0014429094,0.0012273247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028117797,0.0005649407,0.001308787,0.00185693,0.0037573336,0.0034390795,0.0013862725,0.0028421583,0.020387692],"category_scores_gemma":[0.013551068,0.00054562005,0.001317912,0.0016858068,0.0038175432,0.008548468,0.0040924326,0.0029962042,0.0018228352],"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.00011330342,0.000037926562,0.001138321,0.00009659898,0.0000104839155,0.00019429225,0.00023518312,0.0011934869,0.0026446336,0.9841495,0.0020722472,0.008114082],"study_design_scores_gemma":[0.00007472648,0.00013076863,0.00088816806,0.000070350354,0.000015956972,0.00067721994,0.0002962352,0.015668077,0.0045909625,0.9679387,0.009606764,0.00004199866],"about_ca_topic_score_codex":0.0010724978,"about_ca_topic_score_gemma":0.0011972277,"teacher_disagreement_score":0.020387692,"about_ca_system_score_codex":0.0020192272,"about_ca_system_score_gemma":0.0014374321,"threshold_uncertainty_score":0.06820357},"labels":[],"label_agreement":null},{"id":"W2125110392","doi":"10.4310/joc.2010.v1.n2.a4","title":"Distinguishing number and adjacency properties","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Graph","score_opus":0.009317139015940886,"score_gpt":0.2123947591885158,"score_spread":0.2030776201725749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125110392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8657907,0.00035616415,0.09084508,0.0011955654,0.000112351816,0.000044384182,0.00095125183,0.0004771481,0.040227287],"genre_scores_gemma":[0.98907346,0.000076494915,0.008519708,0.00008268242,0.000061798666,0.000034668654,0.0003526466,0.000027522708,0.0017710704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985361,0.0003075214,0.00008786302,0.0004903332,0.00036070973,0.0002175224],"domain_scores_gemma":[0.97785985,0.015843088,0.002107765,0.0020478042,0.000726164,0.001415297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958894,0.00037219338,0.0004365903,0.0017286909,0.00118709,0.0019636482,0.0010053009,0.0010711229,0.006325618],"category_scores_gemma":[0.009345784,0.0003321787,0.00046135357,0.0013386441,0.0030296505,0.0048332,0.0020709776,0.0015938872,0.0005512063],"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.0003035341,0.00007549007,0.006378202,0.00011721338,0.000019900226,0.00017727206,0.0003002978,0.010985606,0.008143553,0.9512058,0.0025808706,0.019712292],"study_design_scores_gemma":[0.000036817317,0.000057427074,0.0021935022,0.000017538589,0.000026284912,0.0004806614,0.000096900294,0.034625463,0.007676982,0.95072687,0.0040340754,0.000027470272],"about_ca_topic_score_codex":0.00029851776,"about_ca_topic_score_gemma":0.0003081791,"teacher_disagreement_score":0.006325618,"about_ca_system_score_codex":0.0011491304,"about_ca_system_score_gemma":0.00047416813,"threshold_uncertainty_score":0.021161377},"labels":[],"label_agreement":null},{"id":"W2224352238","doi":"10.4310/joc.2019.v10.n2.a5","title":"Fractional triangle decompositions of dense $3$-partite graphs","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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 Victoria","funders":"","keywords":"Combinatorics; Decomposition; Mathematics; Degree (music); Discrete mathematics; Physics","score_opus":0.01095973669627161,"score_gpt":0.22873226548772016,"score_spread":0.21777252879144854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224352238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79079354,0.00029140437,0.18366617,0.00039651195,0.000058101174,0.000041960084,0.0006107559,0.0003483897,0.023793256],"genre_scores_gemma":[0.96671057,0.00013095266,0.028829118,0.00006910335,0.000031967407,0.000031813364,0.0005765433,0.00007845685,0.0035414575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.00004156532,0.000010289581,0.00005698855,0.00006277523,0.000111379035],"domain_scores_gemma":[0.99875414,0.00056590786,0.00017787504,0.00021674586,0.00010453046,0.00018082184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028836634,0.00038228772,0.00048135433,0.0008394767,0.0007196574,0.0013504403,0.0006692309,0.0006263112,0.007527184],"category_scores_gemma":[0.0025129858,0.0003728047,0.00046981077,0.0006370057,0.00075115706,0.0013917437,0.0009002352,0.00088071666,0.00054627936],"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.0006469457,0.00014311477,0.005559454,0.00023479597,0.000045423498,0.0006901501,0.00084084744,0.33243766,0.03392544,0.5701287,0.0076753804,0.047672067],"study_design_scores_gemma":[0.000041419273,0.00008464435,0.0015229112,0.00003219841,0.00001924618,0.0003022121,0.00032998555,0.64192194,0.010443962,0.34141898,0.003863347,0.000019101411],"about_ca_topic_score_codex":0.0015730386,"about_ca_topic_score_gemma":0.0023792428,"teacher_disagreement_score":0.007527184,"about_ca_system_score_codex":0.0005606557,"about_ca_system_score_gemma":0.00022166141,"threshold_uncertainty_score":0.025180876},"labels":[],"label_agreement":null},{"id":"W2314945607","doi":"10.4310/joc.2012.v3.n1.a5","title":"Chipping away at the edges: How long does it take?","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Algorithms and Data Compression","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":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Mathematics; TRAC; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Telecommunications","score_opus":0.021216610707188912,"score_gpt":0.24872301482640446,"score_spread":0.22750640411921555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314945607","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.16787674,0.06608571,0.54335076,0.13388704,0.008819839,0.00028448668,0.001195258,0.0026392103,0.075861014],"genre_scores_gemma":[0.69466466,0.024337022,0.17221265,0.02360962,0.0024752652,0.00035988286,0.0018057707,0.0015236764,0.079011455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981084,0.0005494283,0.00008766556,0.0004137799,0.00043257794,0.00040804915],"domain_scores_gemma":[0.9890593,0.005836067,0.00056754734,0.0020390155,0.0018221568,0.000675858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002106064,0.0010527811,0.0018569378,0.0012018168,0.0023886722,0.0038878047,0.0017614806,0.003967313,0.013829811],"category_scores_gemma":[0.025695926,0.0008834415,0.0010918535,0.002256272,0.0031627975,0.010896472,0.0027911058,0.0052662524,0.0047949986],"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.0016379459,0.00038724983,0.008970133,0.000729018,0.00022632393,0.0006534165,0.0006770989,0.030674249,0.008224987,0.26895544,0.14585866,0.5330054],"study_design_scores_gemma":[0.00017908469,0.000322401,0.0023946792,0.00032889715,0.00024318589,0.0008689575,0.0019553408,0.14497155,0.012404455,0.7690697,0.066976435,0.00028530395],"about_ca_topic_score_codex":0.004219517,"about_ca_topic_score_gemma":0.006178465,"teacher_disagreement_score":0.013829811,"about_ca_system_score_codex":0.0015625278,"about_ca_system_score_gemma":0.001687325,"threshold_uncertainty_score":0.046265304},"labels":[],"label_agreement":null},{"id":"W2322988435","doi":"10.4310/joc.2014.v5.n1.a6","title":"Cops and Robbers playing on edges","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Michigan University","keywords":"Mathematics; Combinatorics","score_opus":0.02471838052824164,"score_gpt":0.2767811090525798,"score_spread":0.25206272852433814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322988435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65308535,0.00035980373,0.28297883,0.0010645047,0.00012925206,0.00017636026,0.00030526172,0.00022197104,0.061678685],"genre_scores_gemma":[0.95940053,0.00016665178,0.031272035,0.00017162849,0.0000412172,0.00013390183,0.00013495126,0.000088196495,0.008590866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814606,0.00055999163,0.00008677137,0.00051976874,0.00024823967,0.00043921435],"domain_scores_gemma":[0.99684286,0.0014287565,0.0005061289,0.00041735152,0.00017727276,0.0006276799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235212,0.00080147467,0.001104906,0.0008614931,0.0016952237,0.0022899332,0.0015733173,0.0018766632,0.00831966],"category_scores_gemma":[0.007993316,0.0005693595,0.0007016413,0.0005894104,0.003513775,0.0050105625,0.00195572,0.0018344449,0.00055634574],"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.0003783153,0.00007771641,0.0015156284,0.000090889414,0.000051162122,0.0003149034,0.00031327273,0.02582614,0.0046346374,0.95208806,0.0022261092,0.012483114],"study_design_scores_gemma":[0.00008161722,0.00020710223,0.0018456085,0.00005515602,0.00003714109,0.00051321054,0.00055712194,0.14954288,0.003898533,0.8359306,0.0072682295,0.00006281966],"about_ca_topic_score_codex":0.00097339676,"about_ca_topic_score_gemma":0.0008216434,"teacher_disagreement_score":0.00831966,"about_ca_system_score_codex":0.0011038186,"about_ca_system_score_gemma":0.00052486215,"threshold_uncertainty_score":0.027831972},"labels":[],"label_agreement":null},{"id":"W2519826203","doi":"10.4310/joc.2019.v10.n4.a1","title":"A proof of the 4-variable Catalan polynomial of the Delta conjecture","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Conjecture; Catalan; Combinatorics; Mathematics; Catalan number; Polynomial; Variable (mathematics); Nabla symbol; Physics; Mathematical analysis; Philosophy; Humanities; Quantum mechanics","score_opus":0.02443802459285362,"score_gpt":0.2838160518107053,"score_spread":0.2593780272178517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519826203","genre_codex":"other","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.31017724,0.0022680776,0.30278283,0.013257416,0.00269451,0.00016469722,0.0010954813,0.0008026588,0.36675718],"genre_scores_gemma":[0.903939,0.0010864271,0.05113274,0.0024922886,0.0009398665,0.00015584336,0.0007722156,0.00022997412,0.039251707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991744,0.00016463625,0.000028363333,0.00013637959,0.00035563565,0.00014056123],"domain_scores_gemma":[0.9981274,0.0008036022,0.00012825476,0.00030589066,0.0004007611,0.00023415503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014186895,0.0009815791,0.00082578097,0.0013115454,0.0017480945,0.0017047923,0.0014929582,0.0009871437,0.012688667],"category_scores_gemma":[0.005045079,0.00057624775,0.0012139439,0.0016698971,0.0037793953,0.0034146558,0.0046958043,0.0045017507,0.0021544225],"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.000047113284,0.00003192024,0.00040187442,0.00007451977,0.000009084559,0.00015563161,0.00020223354,0.0018254273,0.0009492046,0.9843312,0.0041415473,0.007830348],"study_design_scores_gemma":[0.000034602417,0.000023953517,0.0004301864,0.000035945115,0.000012979519,0.00009851071,0.000078876306,0.009073727,0.0009838927,0.97632504,0.012881683,0.000020631564],"about_ca_topic_score_codex":0.0031115587,"about_ca_topic_score_gemma":0.0031838722,"teacher_disagreement_score":0.012688667,"about_ca_system_score_codex":0.0021232914,"about_ca_system_score_gemma":0.0016017732,"threshold_uncertainty_score":0.042447805},"labels":[],"label_agreement":null},{"id":"W2567969683","doi":"10.4310/joc.2019.v10.n2.a1","title":"On the boundary of the region defined by homomorphism densities","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Boundary (topology); Differentiable function; Countable set; Combinatorics; Discrete mathematics; Algebraic number; Pure mathematics; Mathematical analysis","score_opus":0.02879365904522159,"score_gpt":0.2551754724325314,"score_spread":0.22638181338730984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567969683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850165,0.0013116869,0.09991458,0.0007250534,0.000036836598,0.00003738359,0.00040011137,0.00027364102,0.04713572],"genre_scores_gemma":[0.984098,0.00042462803,0.011056002,0.000108276574,0.000070807655,0.00006900012,0.00032151304,0.00008241601,0.003769345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.00022772014,0.000036250865,0.00020438571,0.00019871103,0.0001442636],"domain_scores_gemma":[0.99772674,0.001147953,0.00035032295,0.00017784328,0.00026964446,0.00032755057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326869,0.00030501053,0.0007374858,0.0019312882,0.0013699738,0.002663517,0.00077690533,0.00063213176,0.0032593466],"category_scores_gemma":[0.0047723996,0.00035859575,0.0005393388,0.0007514424,0.0035316213,0.004092722,0.0029284828,0.0013091505,0.00056673744],"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.00012678724,0.00002166459,0.0008911537,0.000058662205,0.000010617487,0.00014659126,0.0007237739,0.0015532587,0.003434115,0.9885387,0.00037418865,0.0041204724],"study_design_scores_gemma":[0.00006420245,0.000071142065,0.0024311936,0.00006795153,0.000025705007,0.00046086824,0.0005113353,0.016059183,0.0035784966,0.9728097,0.0038827641,0.00003747833],"about_ca_topic_score_codex":0.0011398873,"about_ca_topic_score_gemma":0.00045624824,"teacher_disagreement_score":0.0032593466,"about_ca_system_score_codex":0.0010594128,"about_ca_system_score_gemma":0.00041903567,"threshold_uncertainty_score":0.0109036565},"labels":[],"label_agreement":null},{"id":"W2588150890","doi":"10.4310/joc.2017.v8.n2.a2","title":"A linear time algorithm for finding a maximum independent set of a fullerene","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Fullerene Chemistry and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Algorithm; Fullerene; Computer science; Chemistry","score_opus":0.03006367243714537,"score_gpt":0.2987736975752472,"score_spread":0.2687100251381018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588150890","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.10099992,0.0009870316,0.8621365,0.0014632707,0.00020932028,0.0010768635,0.0026867504,0.0070780576,0.023362314],"genre_scores_gemma":[0.16453612,0.00022747953,0.8246334,0.0001968491,0.00006538801,0.00045440206,0.0030762674,0.0003296646,0.0064805266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907863,0.00010727238,0.000053813754,0.0003280094,0.0002805862,0.00015165881],"domain_scores_gemma":[0.99871457,0.000757445,0.00010084527,0.00020375325,0.00012635218,0.00009703912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066259794,0.0017134094,0.0018640078,0.0019912508,0.0018605492,0.002345906,0.0027912331,0.00201715,0.014831808],"category_scores_gemma":[0.0028671192,0.0010286415,0.0025619622,0.0032874718,0.00089795043,0.0029598272,0.0025862837,0.0017180641,0.0027147674],"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.0015167643,0.0007946969,0.002296801,0.0012703388,0.0004253175,0.00039624446,0.00047922044,0.13317782,0.032765,0.03211167,0.029804189,0.7649619],"study_design_scores_gemma":[0.00095557765,0.00049135403,0.002362225,0.00009321394,0.00031700553,0.00053426955,0.00044820015,0.82589686,0.020299824,0.1334445,0.015052465,0.00010446696],"about_ca_topic_score_codex":0.004982402,"about_ca_topic_score_gemma":0.009615921,"teacher_disagreement_score":0.014831808,"about_ca_system_score_codex":0.002134959,"about_ca_system_score_gemma":0.0030525706,"threshold_uncertainty_score":0.04961735},"labels":[],"label_agreement":null},{"id":"W2600215958","doi":"10.4310/joc.2016.v7.n2.a1","title":"Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"Danmarks Tekniske Universitet","keywords":"Combinatorics; Group (periodic table); Claw; Enhanced Data Rates for GSM Evolution; Mathematics; Planar; Computer science; Physics; Telecommunications; Engineering; Structural engineering; Computer graphics (images)","score_opus":0.013092982817670634,"score_gpt":0.27448150736668137,"score_spread":0.26138852454901074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600215958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8339665,0.001249977,0.13512515,0.0017076471,0.000098146025,0.00014287654,0.0006464237,0.0003616851,0.026701568],"genre_scores_gemma":[0.93633,0.0013393535,0.05407013,0.00040292848,0.00012255946,0.00014439273,0.0013363705,0.00012619092,0.0061281165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953234,0.00007050759,0.000026890651,0.00015506116,0.00009921643,0.00011588298],"domain_scores_gemma":[0.9970733,0.0014857175,0.00062309345,0.00026526712,0.00017792964,0.00037473327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042224696,0.0008207033,0.0005685206,0.0018425698,0.0012989944,0.0020522284,0.0010989363,0.0012420997,0.0051754564],"category_scores_gemma":[0.003073166,0.0008830732,0.0011082281,0.0020185807,0.0034816535,0.0034434947,0.0018767079,0.002765095,0.0005567457],"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.00043337425,0.00027553618,0.011402455,0.00056344626,0.00008192893,0.0009953004,0.0032318172,0.029166492,0.01727559,0.86563843,0.0061061126,0.06482942],"study_design_scores_gemma":[0.00007682689,0.00011456674,0.0056905905,0.000071420385,0.00009548176,0.0008231423,0.00082282367,0.021461148,0.004520893,0.9569765,0.009284179,0.00006248627],"about_ca_topic_score_codex":0.0029713688,"about_ca_topic_score_gemma":0.0031923265,"teacher_disagreement_score":0.0051754564,"about_ca_system_score_codex":0.0012587197,"about_ca_system_score_gemma":0.00051635643,"threshold_uncertainty_score":0.0173136},"labels":[],"label_agreement":null},{"id":"W2778252295","doi":"10.4310/joc.2019.v10.n3.a4","title":"Hypergraphic polytopes: combinatorial properties and antipode","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polytope; Bijection; Hypergraph; Interpretation (philosophy); Combinatorics; Characterization (materials science); Mathematics; Hopf algebra; Simple (philosophy); Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Physics","score_opus":0.03985582976514396,"score_gpt":0.2668436785381555,"score_spread":0.22698784877301154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778252295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348467,0.0012850936,0.23843548,0.00071526336,0.00025353982,0.00011859658,0.00042564448,0.00018416203,0.12373547],"genre_scores_gemma":[0.95253456,0.0010662884,0.027237885,0.00013236755,0.00019884239,0.00008569797,0.00024749117,0.000070440336,0.018426476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996642,0.00004568941,0.000019259978,0.00007864702,0.000114850234,0.00007730686],"domain_scores_gemma":[0.9992549,0.00018731541,0.000143577,0.00009667574,0.00014561284,0.00017199441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002553682,0.00025715545,0.00026172877,0.0012343685,0.0009323046,0.002178932,0.00030271497,0.00038333746,0.0062088757],"category_scores_gemma":[0.0009069666,0.0002808178,0.0003566118,0.0009301614,0.002127146,0.0022842991,0.0010330383,0.0010419958,0.0005433505],"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.000020386471,0.000013163311,0.00060572685,0.00003849249,0.0000048593556,0.00017238768,0.00019501937,0.0009646838,0.0027292422,0.9861458,0.0005537489,0.008556521],"study_design_scores_gemma":[0.000016840664,0.000038412,0.0021178578,0.000037097172,0.000015312407,0.00080482574,0.0005463443,0.0084482515,0.005203015,0.9608549,0.02188198,0.00003531367],"about_ca_topic_score_codex":0.0008196095,"about_ca_topic_score_gemma":0.00095158,"teacher_disagreement_score":0.0062088757,"about_ca_system_score_codex":0.0005932692,"about_ca_system_score_gemma":0.00032721536,"threshold_uncertainty_score":0.020770729},"labels":[],"label_agreement":null},{"id":"W2790566475","doi":"10.4310/joc.2018.v9.n2.a5","title":"Chains in shard intersection lattices and parabolic support posets","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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é du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Intersection (aeronautics); Star product; Combinatorics; Computer science; Mathematics; Geography; Cartography","score_opus":0.04024412573833556,"score_gpt":0.34575451424253767,"score_spread":0.3055103885042021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790566475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653198,0.00087431964,0.17874666,0.002064415,0.0005112586,0.00015850761,0.0020112316,0.0015883733,0.24872547],"genre_scores_gemma":[0.8980266,0.0005559791,0.029335296,0.0002156858,0.00020428297,0.00011094509,0.0016259786,0.00042057168,0.06950478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994747,0.00007379214,0.000032046762,0.00010523664,0.00015656934,0.00015770526],"domain_scores_gemma":[0.99929166,0.00018358935,0.00011503255,0.00008247516,0.000100535755,0.00022658113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026971666,0.00061469135,0.0006624805,0.0016722128,0.0027589865,0.0044864076,0.0007740157,0.00084441545,0.035184048],"category_scores_gemma":[0.0009212721,0.00077783654,0.0006869998,0.0023931412,0.0020921482,0.005807899,0.0033234989,0.0016958944,0.004612945],"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.00027512226,0.00006096044,0.0007487947,0.00009991739,0.000012344465,0.00034415547,0.00064983685,0.0021599054,0.0025200718,0.9741917,0.0039980854,0.014939107],"study_design_scores_gemma":[0.000052743082,0.00004826868,0.00042482858,0.000040200044,0.000016597707,0.0002645628,0.00091963995,0.00743618,0.0023093193,0.96575546,0.02270677,0.000025411222],"about_ca_topic_score_codex":0.001547508,"about_ca_topic_score_gemma":0.0018195411,"teacher_disagreement_score":0.035184048,"about_ca_system_score_codex":0.0008481757,"about_ca_system_score_gemma":0.00061494624,"threshold_uncertainty_score":0.117702365},"labels":[],"label_agreement":null},{"id":"W2798961559","doi":"10.4310/joc.2019.v10.n3.a5","title":"Independence posets","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Algebra and Logic","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Independence (probability theory); Combinatorics; Star product; Discrete mathematics; Statistics","score_opus":0.005086164802637531,"score_gpt":0.2180778302966756,"score_spread":0.21299166549403806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798961559","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.27522025,0.00082213676,0.45758048,0.0018143753,0.00038926315,0.00036012288,0.002945918,0.001259787,0.2596077],"genre_scores_gemma":[0.87950474,0.0005435936,0.06459853,0.00046803307,0.00041195846,0.00038891865,0.003385101,0.0001986263,0.050500486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986802,0.00024184576,0.00008979762,0.00035828474,0.00037335546,0.00025660516],"domain_scores_gemma":[0.9983203,0.0005874043,0.00021224783,0.00024401193,0.00029410337,0.0003419915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085767184,0.00070568663,0.00043587395,0.00159362,0.002117053,0.002293338,0.00080075214,0.00055903196,0.01817836],"category_scores_gemma":[0.0016546493,0.00051354145,0.0008731917,0.0010168396,0.0028378426,0.0052635632,0.0028014036,0.0020220128,0.001975698],"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.000029204435,0.00003187099,0.0004638425,0.000028994027,0.000007638256,0.00013447563,0.00029850632,0.0006170548,0.0013149331,0.98881245,0.001350543,0.0069104554],"study_design_scores_gemma":[0.000019308787,0.000032863092,0.000499077,0.000015488393,0.000013177337,0.000342405,0.00028829213,0.003931011,0.0021408042,0.97319454,0.019501336,0.00002177965],"about_ca_topic_score_codex":0.0009250569,"about_ca_topic_score_gemma":0.0011793509,"teacher_disagreement_score":0.01817836,"about_ca_system_score_codex":0.0009989252,"about_ca_system_score_gemma":0.0007073925,"threshold_uncertainty_score":0.06081271},"labels":[],"label_agreement":null},{"id":"W2898607378","doi":"10.4310/joc.2020.v11.n3.a3","title":"The probability of positivity in symmetric and quasisymmetric functions","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Université du Québec à Montréal","funders":"Canada Research Chairs; Centre de Recherches Mathématiques","keywords":"Mathematics; Basis (linear algebra); Vector space; Combinatorics; Infinity; Zero (linguistics); Function (biology); Space (punctuation); Symmetric function; Degree (music); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.0689131263917369,"score_gpt":0.3254925588122175,"score_spread":0.2565794324204806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898607378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8577921,0.0002445347,0.1316573,0.0008264064,0.000075801516,0.000034842516,0.0002516473,0.00022923389,0.008888178],"genre_scores_gemma":[0.99130815,0.00015703516,0.0058276965,0.000081899314,0.0000743146,0.000046123758,0.00020272307,0.00007130174,0.0022307888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984463,0.0006051105,0.00006155109,0.00025806623,0.00033522674,0.00029382703],"domain_scores_gemma":[0.97592056,0.018021552,0.0017153478,0.0015502876,0.0013569258,0.0014353729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041850945,0.000569149,0.0007912393,0.0019661253,0.00071468326,0.0027636467,0.001293025,0.0010938774,0.0044557047],"category_scores_gemma":[0.02660115,0.00048429065,0.00058676844,0.00077127264,0.004413456,0.0041061235,0.0020120477,0.0013318793,0.00039273364],"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.00085052307,0.00012513874,0.024404746,0.00017022746,0.000057897207,0.0005256157,0.00036523514,0.08798976,0.008654663,0.84908026,0.0032865833,0.024489354],"study_design_scores_gemma":[0.00006645492,0.00014138421,0.007541329,0.00007521673,0.000034655986,0.00054647727,0.00024227859,0.48869148,0.009411284,0.4917157,0.0014051264,0.0001286059],"about_ca_topic_score_codex":0.000712125,"about_ca_topic_score_gemma":0.00047692735,"teacher_disagreement_score":0.0044557047,"about_ca_system_score_codex":0.0010504504,"about_ca_system_score_gemma":0.00056933996,"threshold_uncertainty_score":0.022133172},"labels":[],"label_agreement":null},{"id":"W2963489061","doi":"10.4310/joc.2012.v3.n3.a4","title":"Higher trivariate diagonal harmonics via generalized Tamari posets","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":83,"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é du Québec à Montréal","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.04701194548901836,"score_gpt":0.3067420525034614,"score_spread":0.25973010701444305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963489061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879308,0.00023377531,0.057571776,0.00029326804,0.00010473271,0.000045027926,0.00010825749,0.0002004642,0.053512048],"genre_scores_gemma":[0.9871974,0.00015345388,0.004341578,0.00007286414,0.00008817335,0.000020575533,0.00005659813,0.00003390857,0.0080355685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968827,0.00005326948,0.00001444881,0.000059804646,0.00008613109,0.00009814056],"domain_scores_gemma":[0.9996718,0.00006306666,0.00006573141,0.000038553346,0.00003762418,0.00012313208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036162834,0.00041516597,0.00035846926,0.0013936051,0.00072728796,0.0018087237,0.00046805918,0.00035264646,0.008512241],"category_scores_gemma":[0.00062667986,0.0002352365,0.000543177,0.0006390166,0.002135717,0.0031717133,0.0018904894,0.000860166,0.00077682285],"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.00002482664,0.000024861658,0.00034893508,0.000020302567,0.0000061703813,0.00019466305,0.00033789015,0.0009811209,0.0024239484,0.9901541,0.00033572796,0.005147507],"study_design_scores_gemma":[0.00002740799,0.00008866261,0.0010548639,0.000013481714,0.000012820067,0.00044021945,0.0004483434,0.008587625,0.0035527025,0.98202366,0.0037181245,0.000032148666],"about_ca_topic_score_codex":0.00048313357,"about_ca_topic_score_gemma":0.00069192785,"teacher_disagreement_score":0.008512241,"about_ca_system_score_codex":0.00056702783,"about_ca_system_score_gemma":0.00027489543,"threshold_uncertainty_score":0.028476238},"labels":[],"label_agreement":null},{"id":"W2963914152","doi":"10.4310/joc.2018.v9.n1.a2","title":"Teaching dimension, VC dimension, and critical sets in Latin squares","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"","keywords":"Mathematics; Dimension (graph theory); Latin square; Combinatorics; Packing dimension; Minkowski–Bouligand dimension; Mathematical analysis; Biology","score_opus":0.008669537047505128,"score_gpt":0.24530354476894012,"score_spread":0.236634007721435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963914152","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80263644,0.0017505653,0.1451687,0.0028233514,0.0001258946,0.000084032654,0.00061939436,0.000523065,0.04626855],"genre_scores_gemma":[0.976934,0.00044090353,0.019077886,0.00022389124,0.00013887652,0.000103633094,0.00024369355,0.00006630436,0.0027708157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989022,0.0002607722,0.00004462631,0.00025879443,0.00022449097,0.00030905302],"domain_scores_gemma":[0.980135,0.015202829,0.0014060921,0.0015890516,0.00063373125,0.0010333422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008536311,0.0005808934,0.0007334058,0.0016896961,0.0016829082,0.0027840543,0.001078377,0.0009812771,0.004955718],"category_scores_gemma":[0.012173312,0.0004991809,0.00064743275,0.0011720022,0.0049197273,0.004011371,0.0021146457,0.0022805769,0.00049782806],"study_design_candidate":"not_applicable","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.00031936858,0.00011951347,0.008205936,0.0002655465,0.000043588716,0.00020013115,0.00077746616,0.025379505,0.010583733,0.92031777,0.0051273145,0.028660147],"study_design_scores_gemma":[0.000054078664,0.000091017646,0.0032791176,0.000093585724,0.000037019676,0.0003563526,0.00024911464,0.08373786,0.009397791,0.897185,0.005458875,0.000060193655],"about_ca_topic_score_codex":0.0011706494,"about_ca_topic_score_gemma":0.0017354443,"teacher_disagreement_score":0.004955718,"about_ca_system_score_codex":0.0020417832,"about_ca_system_score_gemma":0.0008066288,"threshold_uncertainty_score":0.016578496},"labels":[],"label_agreement":null},{"id":"W2963917402","doi":"10.4310/joc.2012.v3.n3.a8","title":"Macdonald polynomials in superspace as eigenfunctions of commuting operators","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Conjecture; Eigenfunction; Symmetrization; Monomial; Macdonald polynomials; Symmetric function; Orthogonal polynomials; Invariant (physics); Combinatorics; Classical orthogonal polynomials; Eigenvalues and eigenvectors; Mathematical physics","score_opus":0.010756941265392197,"score_gpt":0.2823427095537012,"score_spread":0.27158576828830905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963917402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5585926,0.0010534059,0.38016364,0.0012707585,0.000491859,0.000111038644,0.00025828023,0.00032130466,0.057736997],"genre_scores_gemma":[0.9301416,0.0007117696,0.051692493,0.00035263924,0.00037171005,0.00011473364,0.00012920806,0.00016587654,0.01631994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903107,0.00028066142,0.000054359793,0.00014514924,0.00028435595,0.00020445892],"domain_scores_gemma":[0.9991209,0.00021356101,0.00017390608,0.00016751602,0.00016328726,0.00016086413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012502172,0.0006208461,0.00051735283,0.0015724098,0.0010098972,0.002042066,0.00089116284,0.0010390155,0.004365123],"category_scores_gemma":[0.00216593,0.00044173084,0.00095477625,0.0010589865,0.0030125827,0.0031557772,0.001509203,0.0017171565,0.000781883],"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.000014346118,0.000008458376,0.00008586175,0.000019116424,0.0000028920222,0.0001018815,0.00015602438,0.0011631156,0.0022552575,0.9938041,0.0003030866,0.0020858967],"study_design_scores_gemma":[0.000012914015,0.00001680464,0.00017464609,0.000014252858,0.000003216506,0.00015288204,0.00007900186,0.024325695,0.0010421709,0.9725453,0.0016156775,0.000017320262],"about_ca_topic_score_codex":0.00089155434,"about_ca_topic_score_gemma":0.0009581192,"teacher_disagreement_score":0.004365123,"about_ca_system_score_codex":0.0010768571,"about_ca_system_score_gemma":0.0010093873,"threshold_uncertainty_score":0.01460278},"labels":[],"label_agreement":null},{"id":"W3119325883","doi":"10.4310/joc.2021.v12.n1.a4","title":"Zero-forcing in random regular graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Mathematics; Zero (linguistics); Forcing (mathematics); Combinatorics; Random graph; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.015088871495038923,"score_gpt":0.2742597223041571,"score_spread":0.2591708508091182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119325883","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.2493398,0.0004732877,0.73816997,0.00064007344,0.000072508345,0.00012392082,0.00023198532,0.00065400125,0.010294439],"genre_scores_gemma":[0.90669227,0.00042492826,0.08553128,0.00020869983,0.0000744233,0.00021542655,0.00020694482,0.00020942876,0.0064365054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893874,0.00035693284,0.000042424734,0.00025551202,0.00020702218,0.00019942079],"domain_scores_gemma":[0.9866992,0.010238543,0.0008583638,0.0010237689,0.00053574983,0.00064422336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017366913,0.00054816384,0.00082579005,0.0017431132,0.0010766468,0.0014574697,0.0018276871,0.0009512745,0.00309015],"category_scores_gemma":[0.012543349,0.00059811556,0.0010277843,0.00070394226,0.0036841456,0.0024227593,0.0018748188,0.0014400491,0.0004943739],"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.00012728591,0.00004333238,0.0012084501,0.00011843301,0.000030929565,0.00025318173,0.00025289308,0.12076961,0.0039056332,0.8626868,0.001375829,0.009227599],"study_design_scores_gemma":[0.000032442844,0.000035920373,0.00034323268,0.000029656716,0.000015663549,0.00011218809,0.000050933173,0.45981747,0.0018894514,0.5364022,0.001245209,0.000025607633],"about_ca_topic_score_codex":0.0016810106,"about_ca_topic_score_gemma":0.0019177144,"teacher_disagreement_score":0.00309015,"about_ca_system_score_codex":0.0014457329,"about_ca_system_score_gemma":0.0009144694,"threshold_uncertainty_score":0.010489523},"labels":[],"label_agreement":null},{"id":"W3204189941","doi":"10.4310/joc.2023.v14.n4.a4","title":"Pursuit-evasion games on Latin square graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","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; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Circulant matrix; Upper and lower bounds; Dimension (graph theory); Square (algebra); Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.02611686496365846,"score_gpt":0.25391061871910264,"score_spread":0.2277937537554442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204189941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7619226,0.0008232601,0.19933017,0.0020448074,0.000095020856,0.00015547783,0.00042166168,0.00028572502,0.03492134],"genre_scores_gemma":[0.9677205,0.00050936686,0.023575846,0.00026183474,0.00004910439,0.00013511328,0.00025908358,0.000065788125,0.007423322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991416,0.00036556376,0.000027628499,0.00015791573,0.00011705781,0.00019016526],"domain_scores_gemma":[0.9937429,0.004212505,0.00085446937,0.00028598792,0.0002508573,0.000653259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073659496,0.0009802287,0.0009632807,0.000990187,0.0011514379,0.0019074298,0.0010723405,0.0012173807,0.0038416951],"category_scores_gemma":[0.0065478175,0.0004463507,0.00053776184,0.0010580311,0.0021595757,0.0029697262,0.0020073347,0.0012885083,0.0004925597],"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.0006455744,0.00015345462,0.002632875,0.00026967516,0.000098979726,0.0005101562,0.000687296,0.3164716,0.010545662,0.63917524,0.0055740727,0.023235463],"study_design_scores_gemma":[0.000082127524,0.00011861843,0.00058208517,0.000033197906,0.00001907341,0.00016512557,0.000291954,0.7250095,0.0020930879,0.26873004,0.0028420843,0.000033099146],"about_ca_topic_score_codex":0.0019835634,"about_ca_topic_score_gemma":0.0016506024,"teacher_disagreement_score":0.0038416951,"about_ca_system_score_codex":0.0019542389,"about_ca_system_score_gemma":0.0006541184,"threshold_uncertainty_score":0.0141791105},"labels":[],"label_agreement":null},{"id":"W4402305041","doi":"10.4310/joc.240906223550","title":"Toggling, rowmotion, and homomesy on interval-closed sets","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics","score_opus":0.011817660074200402,"score_gpt":0.2638531070008877,"score_spread":0.25203544692668733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402305041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650323,0.0013851271,0.23526342,0.0021804662,0.00028029864,0.000059087397,0.00051596126,0.00032463128,0.09495869],"genre_scores_gemma":[0.95477945,0.00041869457,0.02193796,0.0002375556,0.00012210952,0.00005743251,0.00025609718,0.000101367004,0.022089303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995484,0.00009239911,0.000028125714,0.00011981099,0.00009694756,0.00011424924],"domain_scores_gemma":[0.9986941,0.000576192,0.00016635464,0.00020520714,0.00016321096,0.00019496777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122801,0.0003882254,0.0007662117,0.0018947257,0.0021880725,0.0019823187,0.0008873474,0.0007918042,0.0097757485],"category_scores_gemma":[0.003259559,0.00037755026,0.0010554912,0.0015527465,0.0030023314,0.0051293857,0.0025756669,0.0018000621,0.00059355085],"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.000030343794,0.000009457177,0.00020064949,0.000014533295,0.0000039131464,0.000077414836,0.00027094464,0.0006638654,0.00047011246,0.9932929,0.0006555698,0.004310231],"study_design_scores_gemma":[0.000012427907,0.00001936804,0.0002528668,0.000009031972,0.000005360179,0.0001047275,0.00018526422,0.0037807797,0.00025723572,0.9931804,0.0021806832,0.000011798868],"about_ca_topic_score_codex":0.0017205316,"about_ca_topic_score_gemma":0.0013731355,"teacher_disagreement_score":0.0097757485,"about_ca_system_score_codex":0.00084613834,"about_ca_system_score_gemma":0.00047536698,"threshold_uncertainty_score":0.03270316},"labels":[],"label_agreement":null}]}