{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":807,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":807,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"f1d7e4ccf1b5","filters":{"topic":"Graph Labeling and Dimension Problems"}},"results":[{"id":"W2037298352","doi":"10.1016/s0166-218x(00)00198-0","title":"Resolvability in graphs and the metric dimension of a graph","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":982,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Connectivity; Dimension (graph theory); Discrete mathematics; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.009040591071365865,"gpt":0.2191411440438341,"spread":0.2101005529724683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086744,0.0001323104,0.0003044335,0.0001819302,0.0000735526,0.0000382903,0.0003832671,0.00005314098,0.000009761005],"category_scores_gemma":[0.0000432623,0.00007995146,0.00006803658,0.001161729,0.0002890164,0.00007196876,0.0001230813,0.0001227984,0.000006553396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005104479,"about_ca_system_score_gemma":0.00001206103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003402992,"about_ca_topic_score_gemma":0.000004613852,"domain_scores_codex":[0.9987776,0.00004286912,0.0004394946,0.0002697421,0.0002785386,0.0001917239],"domain_scores_gemma":[0.9987454,0.0003722379,0.0001131401,0.0006914442,0.00002891906,0.00004889424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002221571,0.00007817009,0.00006933053,0.00006373533,0.00001011556,5.684969e-7,0.001999602,0.0001460566,0.0005937528,0.9920346,0.00003190645,0.004949997],"study_design_scores_gemma":[0.001123051,0.00002218766,0.0003179737,0.00003579391,0.00001371323,0.000003066993,0.0001396951,0.02115169,0.001139938,0.9759241,0.00001835725,0.000110447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9804764,0.0005442077,0.009080304,0.0004059855,0.00003258125,0.0005957548,0.000002002773,0.00009731455,0.008765465],"genre_scores_gemma":[0.9449857,0.0001161616,0.05475171,0.00008799192,7.393643e-7,0.00002946079,8.300761e-7,0.000006945546,0.00002040643],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04567141,"threshold_uncertainty_score":0.3260326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122198415","doi":"10.1112/blms/bdq096","title":"Base size, metric dimension and other invariants of groups and graphs","year":2011,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":264,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Permutation group; Base (topology); Metric dimension; Terminology; Wreath product; Association scheme; Metric (unit); Dimension (graph theory); Combinatorics; Graph isomorphism; Isomorphism (crystallography); Discrete mathematics; Graph; Product (mathematics); Permutation (music); Chordal graph; Line graph; 1-planar graph; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0207337016087963,"gpt":0.2077608670719031,"spread":0.1870271654631067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095562,0.0001234695,0.0002605054,0.00002784847,0.00008517249,0.0000161808,0.0003496882,0.00008196968,0.00008919264],"category_scores_gemma":[0.000245903,0.00007532589,0.0001452168,0.0003076609,0.0003010338,0.00002701385,0.0004628937,0.0001045975,0.000006715507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003624455,"about_ca_system_score_gemma":0.000009168939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005522803,"about_ca_topic_score_gemma":2.911874e-7,"domain_scores_codex":[0.9989151,0.00008842684,0.0003274033,0.0002362722,0.0002701772,0.00016264],"domain_scores_gemma":[0.9987736,0.0004433837,0.0001885755,0.0004531632,0.0000620172,0.00007920194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001763476,0.0004576599,0.003131705,0.0004371123,0.00009333614,0.000001105608,0.003617649,0.000002419786,0.006066192,0.9801326,0.005102939,0.0009395889],"study_design_scores_gemma":[0.001162809,0.0001709996,0.004003376,0.0002656723,0.00007309332,0.00002995949,0.0001784726,0.005106345,0.0170368,0.9713868,0.0003474426,0.0002382306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9825227,0.000943768,0.01192984,0.001737478,0.0001120293,0.0004067724,0.000005317438,0.00007119463,0.002270882],"genre_scores_gemma":[0.8477661,0.00004396719,0.1514002,0.0006539212,0.000001736924,0.000004453036,5.776303e-8,0.000009420175,0.0001201653],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1394703,"threshold_uncertainty_score":0.3071701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385397173","doi":"10.61091/jcmcc","title":"Journal of Combinatorial Mathematics and Combinatorial Computing","year":2023,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02095889035569519,"gpt":0.2673314439731945,"spread":0.2463725536174993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.009793662,0.001811613,0.005377069,0.001964208,0.001138852,0.002174058,0.003800961,0.001639488,0.00002423883],"category_scores_gemma":[0.002550555,0.001646076,0.00120573,0.001976629,0.000628108,0.001015406,0.002718778,0.004107635,0.00008475455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003733216,"about_ca_system_score_gemma":0.001575034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003799644,"about_ca_topic_score_gemma":5.052622e-7,"domain_scores_codex":[0.9853705,0.0007197948,0.007246118,0.001119835,0.003960617,0.001583194],"domain_scores_gemma":[0.9760698,0.004692884,0.01215048,0.001346535,0.004556599,0.001183713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002169495,0.002170629,0.00002567829,0.002407372,0.00125692,0.0003284626,0.004593848,0.0002397892,0.0005550354,0.9433678,0.0426275,0.002210015],"study_design_scores_gemma":[0.01961644,0.004521449,0.00001645032,0.006691088,0.0009138865,0.00176212,0.0008163682,0.01685684,0.000860217,0.9373853,0.008458775,0.002101094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"editorial","genre_gemma":"empirical","genre_scores_codex":[0.2709365,0.01138342,0.04636216,0.001151985,0.6604633,0.002655672,0.00007345036,0.0004882478,0.006485266],"genre_scores_gemma":[0.9002227,0.002942671,0.07964531,0.0001859893,0.01568645,0.00001127658,0.00003744916,0.0008232378,0.0004449027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6447768,"threshold_uncertainty_score":0.9996566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078743813","doi":"10.1016/j.dam.2011.12.018","title":"A survey of Nordhaus–Gaddum type relations","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Graph; Combinatorics; Windmill graph; Complement (music); Chromatic scale; Petersen graph; Discrete mathematics; Line graph; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03774536950012889,"gpt":0.2634281414588022,"spread":0.2256827719586733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144947,0.0001161166,0.0001996835,0.0000787756,0.00007227022,0.00002678427,0.0003638462,0.00006438437,0.0000246558],"category_scores_gemma":[0.0001042198,0.00009633029,0.00003699962,0.0006097024,0.00005153816,0.0001409908,0.000159219,0.00009349909,0.0002054371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008705138,"about_ca_system_score_gemma":0.00003353817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002424793,"about_ca_topic_score_gemma":0.000005002616,"domain_scores_codex":[0.9990017,0.00002135167,0.0003351376,0.0001429912,0.0002451709,0.0002536539],"domain_scores_gemma":[0.9987857,0.0002077316,0.0001755126,0.0006097276,0.0001195328,0.0001018049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002055567,0.0001336046,0.001254186,0.00004188931,0.00002213792,1.388317e-7,0.001639592,0.00005385434,0.002488914,0.9926009,0.001264808,0.0004979324],"study_design_scores_gemma":[0.002084816,0.000270639,0.06161675,0.0002619387,0.0001970613,0.0000280612,0.000726323,0.1110619,0.02422497,0.7949843,0.002511242,0.002032058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2582674,0.0006784663,0.6819796,0.0002020959,0.0007047052,0.0006092923,0.00002489724,0.0004306387,0.05710292],"genre_scores_gemma":[0.8335834,0.000005235548,0.1661889,0.00004060925,0.000004371062,0.000007796152,0.00001229022,0.00001133069,0.0001460929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.575316,"threshold_uncertainty_score":0.3928235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086552038","doi":"10.1016/j.dam.2006.06.009","title":"The strong metric dimension of graphs and digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Distance; Discrete mathematics; Neighbourhood (mathematics); Graph; Bound graph; Shortest path problem; Graph power; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.008347250750734546,"gpt":0.2142126271217022,"spread":0.2058653763709677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065869,0.000145959,0.0002004624,0.000146301,0.0002293745,0.00009992599,0.0003833493,0.0000476237,7.318373e-7],"category_scores_gemma":[0.00001820578,0.00009072653,0.00006469782,0.0006811886,0.0001628526,0.00007724256,0.0001975061,0.00008535998,0.000004098014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004385972,"about_ca_system_score_gemma":0.00001181664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000188791,"about_ca_topic_score_gemma":0.000004086372,"domain_scores_codex":[0.9988104,0.0000131402,0.0003789237,0.0002308565,0.0003290013,0.0002377329],"domain_scores_gemma":[0.9988213,0.0002925954,0.0002101083,0.0005715071,0.00005430104,0.00005023105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001579415,0.00003525169,0.00006343639,0.00003226613,0.00001227161,4.649173e-7,0.0001389879,0.00006636246,0.004935469,0.9928786,0.0002095798,0.001625742],"study_design_scores_gemma":[0.0002842816,0.00003318073,0.0002894914,0.00002532455,0.00002354155,0.000004639927,0.0001796919,0.01681616,0.007935799,0.9741502,0.0001068233,0.000150814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6925774,0.003601594,0.2745395,0.0005425427,0.0002767977,0.0009538907,0.000008588398,0.0004828445,0.0270168],"genre_scores_gemma":[0.9306274,0.00005750842,0.06922115,0.00001886789,0.000002201849,0.00001522582,0.000002079149,0.00001031646,0.00004526764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2380499,"threshold_uncertainty_score":0.3699721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561296992","doi":"","title":"Searching and sweeping graphs: A brief survey","year":2006,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Variety (cybernetics); Graph; Term (time); Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01700946714837675,"gpt":0.2289722551929002,"spread":0.2119627880445235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006028163,0.00006950036,0.00008078577,0.0001078608,0.0001436034,0.0001996564,0.0001983645,0.00002460043,0.00000256412],"category_scores_gemma":[0.00002683213,0.00005879921,0.00002149091,0.0003451165,0.00003934938,0.0002056284,0.0001495337,0.00007333529,0.000006841889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002241391,"about_ca_system_score_gemma":0.00001529421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005438515,"about_ca_topic_score_gemma":0.0003109096,"domain_scores_codex":[0.9991681,0.0000854742,0.0001294448,0.0002636333,0.0001488864,0.0002044675],"domain_scores_gemma":[0.9995226,0.0001270516,0.00002491831,0.0002321906,0.00003468867,0.00005854834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000115501,0.00002319907,0.02179791,0.000005883568,0.000004137092,0.000004953175,0.00008169589,0.0001023198,0.002742954,0.9660909,0.0007088868,0.008435956],"study_design_scores_gemma":[0.0005800077,0.00006532351,0.3132893,0.0000362478,0.000002796508,0.00003575425,0.000009640711,0.06563607,0.002815399,0.6166213,0.0005566144,0.0003515897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8132925,0.0004658535,0.1720015,0.0007088168,0.0001545725,0.00009403723,8.273581e-7,0.0004062263,0.01287569],"genre_scores_gemma":[0.9700805,0.000006883054,0.02940271,0.0003099705,0.000002561874,0.000001473373,0.000001720216,0.00000385054,0.0001903603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3494697,"threshold_uncertainty_score":0.8221444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055120783","doi":"10.1016/j.jctb.2005.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Vertex (graph theory); Graph; Edge coloring; Mathematics; Scroll; Combinatorics; Algorithm; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01303425814486328,"gpt":0.2276126112042378,"spread":0.2145783530593746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003267499,0.000472975,0.0003633133,0.0001717591,0.001319211,0.001412263,0.001775999,0.000507179,0.0007461085],"category_scores_gemma":[0.00123622,0.0005097427,0.0007277389,0.0005565927,0.0005251939,0.001447507,0.0008383782,0.001089694,0.0006035693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004368086,"about_ca_system_score_gemma":0.000592258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008883815,"about_ca_topic_score_gemma":0.00001715442,"domain_scores_codex":[0.9952109,0.0004202127,0.00125286,0.0006043679,0.00157857,0.0009330475],"domain_scores_gemma":[0.9956917,0.001042065,0.001481848,0.001098096,0.0002521696,0.0004341912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006166212,0.0003010777,0.000005315101,0.0001379755,0.0003998851,0.000263666,0.002897115,0.0003133361,0.0007265059,0.9780723,0.01514173,0.001124469],"study_design_scores_gemma":[0.005548268,0.003643219,0.00008586237,0.002921598,0.0008767057,0.004029308,0.001962497,0.2502629,0.1596322,0.5325967,0.03650763,0.001933055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785516,0.0004947809,0.0006978294,0.001414942,0.007053411,0.00006054145,0.00002594987,0.0001486694,0.0115523],"genre_scores_gemma":[0.9948043,0.0001902437,0.002103257,0.001644208,0.0009325395,0.00005668965,0.00001424661,0.0001274381,0.0001270321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4454756,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124994312","doi":"10.1016/j.dam.2007.05.059","title":"Degree constrained subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0241343793073814,"gpt":0.2471114268951056,"spread":0.2229770475877242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008169932,0.0001913725,0.0002236704,0.0001549806,0.0001379594,0.0001038543,0.0006299773,0.00008674746,0.0000172551],"category_scores_gemma":[0.00002970857,0.0001586197,0.00008627707,0.00050116,0.0001299362,0.00009794553,0.000159968,0.0001396051,0.0001404818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001161238,"about_ca_system_score_gemma":0.00002983649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003244769,"about_ca_topic_score_gemma":0.000004446068,"domain_scores_codex":[0.9984644,0.000005917614,0.0004162467,0.0003237906,0.0003542163,0.0004354054],"domain_scores_gemma":[0.9987121,0.0001785478,0.0001442662,0.0007356959,0.00006008585,0.0001693667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002228802,0.00005086129,0.00001203732,0.00003131196,0.00001567744,0.000008721487,0.0007015106,0.000006867921,0.01031417,0.9823195,0.0002926216,0.006244473],"study_design_scores_gemma":[0.0006786647,0.00004359539,0.0001218821,0.000039871,0.00002107838,0.00003853304,0.0004175286,0.006020466,0.02154964,0.9699855,0.0006447687,0.0004385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02133064,0.00005957402,0.8734045,0.0001678492,0.0001401779,0.0002406553,0.000001989264,0.0004589438,0.1041956],"genre_scores_gemma":[0.591892,0.000003997419,0.407764,0.0002332923,0.000006363715,0.000008259903,0.000003122313,0.00001275289,0.00007624157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5705613,"threshold_uncertainty_score":0.6468325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073490544","doi":"10.1016/j.disc.2005.09.015","title":"The metric dimension of Cayley digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Cayley graph; Vertex (graph theory); Discrete mathematics; Connectivity; Graph; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.008927144760715572,"gpt":0.2222670857452978,"spread":0.2133399409845822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004873976,0.0001181398,0.0001688062,0.0001240933,0.0001936546,0.00009024906,0.0005763717,0.000040359,0.000001688322],"category_scores_gemma":[0.000076191,0.00006897772,0.0001091598,0.000824007,0.00009814854,0.0001035158,0.000166667,0.00007415148,0.00001943438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006768238,"about_ca_system_score_gemma":0.00001799864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000519155,"about_ca_topic_score_gemma":0.000006808973,"domain_scores_codex":[0.998789,0.00003455896,0.0003947009,0.0001792899,0.0003808541,0.0002215806],"domain_scores_gemma":[0.9985949,0.0003147422,0.0002076212,0.0007330565,0.0001092861,0.00004033031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.04664e-7,0.00005548719,0.0001717878,0.00002720067,0.00001116066,0.000001516034,0.000209384,0.0001946062,0.001810053,0.9955533,0.001028925,0.0009357012],"study_design_scores_gemma":[0.000251583,0.00006238661,0.0003596073,0.00006098839,0.00002180285,0.00001029252,0.0001221574,0.07670529,0.01328238,0.9081832,0.000753527,0.0001868481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4733408,0.005197824,0.4886785,0.002016814,0.0009606002,0.0007618027,0.00001078443,0.0006059289,0.02842697],"genre_scores_gemma":[0.9450737,0.0000301659,0.05449637,0.00002873386,0.000005231292,0.000006929189,0.000001875583,0.000009547899,0.0003474238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4717329,"threshold_uncertainty_score":0.281283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005117665","doi":"10.1007/s00493-007-0041-6","title":"Vertex-Colouring Edge-Weightings","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008634628087088286,"gpt":0.2209593519140212,"spread":0.212324723826933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006455652,0.0001271087,0.0001408406,0.0001547117,0.0002261679,0.00009031363,0.0007240601,0.00007194352,0.000008732624],"category_scores_gemma":[0.00007169175,0.0001179317,0.0000648182,0.0007090719,0.00003539945,0.0002138531,0.0002686653,0.0001717643,0.0002052926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004928097,"about_ca_system_score_gemma":0.00003357191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504274,"about_ca_topic_score_gemma":6.30595e-7,"domain_scores_codex":[0.9986801,0.00002181594,0.0002394398,0.0003480694,0.0002812766,0.0004293713],"domain_scores_gemma":[0.9989561,0.0001351911,0.00007741354,0.0005378476,0.0001123273,0.000181072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000257324,0.0001060412,0.001029968,0.000007622697,0.000007824154,0.00004204517,0.0002533266,0.000002624418,0.001348594,0.9784638,0.005196632,0.01353901],"study_design_scores_gemma":[0.001134917,0.000212972,0.004943012,0.00005181597,0.000009461482,0.00004318994,0.00002361358,0.003186622,0.0269895,0.9203276,0.04257058,0.000506721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7437551,0.002243392,0.145215,0.002860804,0.008947708,0.0004003305,5.249224e-7,0.0024001,0.09417707],"genre_scores_gemma":[0.9911656,0.000009221741,0.007836455,0.000416423,0.00000685636,0.000003379687,4.570421e-7,0.00001004108,0.0005515236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2474105,"threshold_uncertainty_score":0.4809116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063812540","doi":"10.1016/j.jctb.2005.01.001","title":"Vertex colouring edge partitions","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multiset; Vertex (graph theory); Mathematics; Partition (number theory); Graph; Frequency partition of a graph; Neighbourhood (mathematics); Multiplicity (mathematics); Discrete mathematics; Graph power; Line graph; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009189915335832617,"gpt":0.2250058690006218,"spread":0.2158159536647892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139252,0.0001084737,0.0002141887,0.0001329693,0.0001931757,0.0001346676,0.0005883366,0.00006001185,0.00005006082],"category_scores_gemma":[0.0001790806,0.00009083906,0.0001293675,0.0002592521,0.00009078553,0.001070673,0.0001092733,0.0002281982,0.00003217922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892286,"about_ca_system_score_gemma":0.000114288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.28161e-7,"about_ca_topic_score_gemma":4.268971e-7,"domain_scores_codex":[0.9987762,0.0001619755,0.000438325,0.0001141455,0.0003015607,0.0002078239],"domain_scores_gemma":[0.9988322,0.0001691832,0.0002826937,0.0002684343,0.0003005311,0.0001469516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006653398,0.0001131077,0.00002756781,0.000003352778,0.00002894372,0.00001474527,0.0003815399,0.0002019315,0.001058971,0.9920909,0.00348082,0.002531525],"study_design_scores_gemma":[0.0008518331,0.0003521595,0.00005429943,0.00004059676,0.00001415649,0.0001402983,0.00004831447,0.0001078356,0.008116319,0.9483622,0.04179934,0.0001126206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8836869,0.003047117,0.03435901,0.01436943,0.04368235,0.0003107999,0.00000408065,0.0003855992,0.02015472],"genre_scores_gemma":[0.9926975,0.00004756168,0.006550557,0.0002339422,0.0001804319,0.000001684333,2.137291e-7,0.000007761967,0.0002803497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1090106,"threshold_uncertainty_score":0.3704309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244068002","doi":"10.1090/crmp/043","title":"Additive Combinatorics","year":2007,"lang":"en","type":"book","venue":"CRM proceedings & lecture notes","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Algebraic combinatorics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01178130846305454,"gpt":0.2244651793479022,"spread":0.2126838708848477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910135,0.0006810419,0.0006207503,0.0005797975,0.000315027,0.0004423033,0.001397804,0.0009764642,0.00003226752],"category_scores_gemma":[0.0003762328,0.0006115625,0.0002565543,0.000657302,0.0001694166,0.0003219343,0.0004176461,0.001327182,0.0002056661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000200951,"about_ca_system_score_gemma":0.0003900452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006611721,"about_ca_topic_score_gemma":0.00000163816,"domain_scores_codex":[0.9967851,0.000007462409,0.0004925633,0.001144289,0.0008440062,0.0007265754],"domain_scores_gemma":[0.9974394,0.0002950842,0.000481373,0.0004088738,0.001095566,0.0002796673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005831081,0.00003851415,0.00001343742,0.00009260624,0.00005341561,0.00001961333,0.0005972697,0.000003396638,0.0001322694,0.9714144,0.01588061,0.01174857],"study_design_scores_gemma":[0.0002510206,0.0001727633,0.0000101321,0.0003096833,0.00004663261,0.00004569005,0.000003542004,0.0002574585,0.003510752,0.8786361,0.1161118,0.0006444358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0000770913,0.003224998,0.04366089,0.0009367037,0.001716837,0.0004858215,0.00001765859,0.001207531,0.9486725],"genre_scores_gemma":[0.8896567,0.0009992076,0.01445421,0.01428326,0.001630636,0.00018336,0.000397656,0.0007277566,0.07766727],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8895795,"threshold_uncertainty_score":0.9996336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1798981749","doi":"10.37236/999","title":"On the Quantum Chromatic Number of a Graph","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Bristol","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Critical graph; Windmill graph; Friendship graph; Graph; Clique number; Quantum; Brooks' theorem; Graph power; Line graph; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008306689640085747,"gpt":0.2395849130024391,"spread":0.2312782233623534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004197172,0.0001137388,0.0002022474,0.0001059106,0.0001501233,0.00003480129,0.001269704,0.00004196768,0.000006957782],"category_scores_gemma":[0.0001452229,0.00005611205,0.0001576924,0.0008714646,0.00008845272,0.0001039618,0.00006680362,0.0005843178,0.00001211689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006609964,"about_ca_system_score_gemma":0.0002115191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006279655,"about_ca_topic_score_gemma":0.000001207918,"domain_scores_codex":[0.9982278,0.0001415607,0.000495997,0.00008926017,0.0006106902,0.0004346424],"domain_scores_gemma":[0.9978218,0.0008295997,0.0005523761,0.0004793568,0.0002602292,0.00005664049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001485363,0.000118249,0.00006357295,0.000004716468,0.00004723609,0.000004082195,0.0002861521,0.0000372082,0.0003953392,0.9981318,0.0006973477,0.0001995072],"study_design_scores_gemma":[0.0003790825,0.0004605622,0.0001681784,0.0000456509,0.00001927776,0.0001880179,0.00004643217,0.0006698661,0.003135105,0.9946373,0.0001840219,0.00006650636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9095691,0.001405405,0.08478937,0.002544449,0.0006063349,0.0000965058,1.054804e-7,0.00002025026,0.0009685017],"genre_scores_gemma":[0.9994851,0.0001373822,0.00006141346,0.0002501386,0.000008492238,6.107051e-7,4.240193e-8,0.000007520905,0.00004925486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08991607,"threshold_uncertainty_score":0.2538603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W621909926","doi":"10.1007/b98891","title":"Recent Advances in Algorithms and Combinatorics","year":2003,"lang":"en","type":"book","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Algebraic combinatorics; Algorithm; Combinatorics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01286487714708759,"gpt":0.232213525745062,"spread":0.2193486485979744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000272014,0.0001915875,0.0002498562,0.0001966235,0.0000445332,0.00007445315,0.0003167883,0.000169343,0.00001592845],"category_scores_gemma":[0.00001724123,0.0001654312,0.0000270423,0.000215173,0.00004611584,0.0002113236,0.0001424113,0.000253142,0.00002455579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005172885,"about_ca_system_score_gemma":0.0001703547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001700812,"about_ca_topic_score_gemma":0.000005549167,"domain_scores_codex":[0.9987912,0.00003310643,0.0002512928,0.0004704499,0.0002402058,0.0002137165],"domain_scores_gemma":[0.9993069,0.00005943414,0.00008685677,0.000374359,0.00008234789,0.00009007262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[4.059142e-7,0.00002637513,0.00001502997,0.00002031258,0.000003071648,0.00001504076,0.00003019198,0.000007772386,4.160367e-7,0.8561866,0.02163375,0.1220611],"study_design_scores_gemma":[0.0001682099,0.00003116707,0.000001986813,0.00004119826,0.0000015281,0.000006922839,0.000001108898,0.000661393,0.000006999644,0.4961777,0.5027621,0.0001396775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000004132314,0.1069637,0.006738504,0.0003810191,0.001200476,0.000185961,0.0000012875,0.0001390748,0.8843859],"genre_scores_gemma":[0.00001490624,0.104717,0.02390131,0.0008567914,0.000006178785,0.00001195878,0.000007358985,0.00002097376,0.8704636],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4811284,"threshold_uncertainty_score":0.6746087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W109448701","doi":"","title":"Bounds on the metric and partition dimensions of a graph","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Metric dimension; Partition (number theory); Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Connectivity; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.02084863889451242,"gpt":0.2219481832698964,"spread":0.201099544375384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775687,0.00008269055,0.0001133197,0.0001571224,0.0002796215,0.00002351088,0.0002319969,0.00003611481,0.000002864904],"category_scores_gemma":[0.00008505263,0.00004956477,0.00004482631,0.0008966834,0.0001341579,0.0001039635,0.00009697896,0.0000960249,0.00001324602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006175957,"about_ca_system_score_gemma":0.0000245805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000029645,"about_ca_topic_score_gemma":6.482221e-7,"domain_scores_codex":[0.9991878,0.00007344842,0.0001602524,0.000195803,0.0002394151,0.0001432815],"domain_scores_gemma":[0.9991166,0.0002440377,0.00007482942,0.0004201517,0.000084415,0.00005994862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002123759,0.00008043086,0.001378374,0.000002278654,0.000009574785,0.000003540517,0.0002107965,0.000009847911,0.0005232171,0.9949957,0.002607191,0.0001769803],"study_design_scores_gemma":[0.0003354608,0.0002007701,0.005740981,0.00001938577,0.000006061301,0.00001505595,0.00001059577,0.000953759,0.003781006,0.9885336,0.0003194424,0.00008384288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972481,0.000359698,0.0001155696,0.0009136621,0.0005398315,0.00009155778,6.826787e-7,0.0000624567,0.0006684284],"genre_scores_gemma":[0.9990218,0.0001293902,0.0005146813,0.0002670821,4.261869e-7,0.000008982067,5.78241e-7,0.00000420827,0.00005281687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006462005,"threshold_uncertainty_score":0.215065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017934789","doi":"10.1007/s11464-008-0041-x","title":"On vertex-coloring 13-edge-weighting","year":2008,"lang":"en","type":"article","venue":"Frontiers of Mathematics in China","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Weighting; Vertex (graph theory); Edge coloring; Conjecture; Graph coloring; Fractional coloring; Graph; Discrete mathematics; Line graph; Graph power; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0159756246671084,"gpt":0.2171309885767455,"spread":0.2011553639096371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004256971,0.0001357105,0.0002810038,0.0002488423,0.0001038349,0.00001776577,0.0006019513,0.00006397572,0.000003295834],"category_scores_gemma":[0.0001922393,0.0001197527,0.00007235372,0.0003599456,0.00007041118,0.0001546545,0.0001301529,0.0001796819,0.00001602651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000309351,"about_ca_system_score_gemma":0.00003393142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001561349,"about_ca_topic_score_gemma":0.000002380891,"domain_scores_codex":[0.9987823,0.00002804262,0.0003867082,0.0002459798,0.0003162685,0.0002406725],"domain_scores_gemma":[0.9991144,0.0001086464,0.0001671229,0.0005166747,0.00003545373,0.00005771428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001373109,0.001190301,0.01012215,0.0002349953,0.00005993147,0.0001014637,0.01819567,0.003884125,0.0008886441,0.9193743,0.04234943,0.003585256],"study_design_scores_gemma":[0.0007461634,0.0001548669,0.002397165,0.0002765785,0.000006273149,0.00002932785,0.0001197515,0.1829656,0.005324681,0.8075942,0.0001037763,0.000281613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8980385,0.0003711892,0.09189581,0.0001932811,0.0008629446,0.0001394579,7.900501e-7,0.000106893,0.008391134],"genre_scores_gemma":[0.7270536,0.00003639092,0.2726933,0.00003877176,0.000003169382,0.000005313504,4.070761e-7,0.000009644573,0.0001593083],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1807975,"threshold_uncertainty_score":0.4883374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295838866","doi":"10.1080/00029890.2007.11920471","title":"The Map-Coloring Game","year":2007,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Passion; Habilitation; Championship; Mathematics; Graph; Mathematics education; Art; Psychology; Combinatorics; Humanities; History","retraction":null,"screen_n_in":null,"score":{"opus":0.009838390673122718,"gpt":0.2432806390205084,"spread":0.2334422483473857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022617,0.0001301994,0.0001831821,0.00005393396,0.0002106183,0.0001504758,0.0007581018,0.00002457298,0.000006042158],"category_scores_gemma":[0.0001878514,0.00008092987,0.000082625,0.0004529968,0.0003596943,0.0001146996,0.0001987469,0.0001530339,0.0003550843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002152137,"about_ca_system_score_gemma":0.00002027851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002880157,"about_ca_topic_score_gemma":0.000006894568,"domain_scores_codex":[0.9985144,0.00003723938,0.0003353042,0.0002667199,0.0003508726,0.0004954331],"domain_scores_gemma":[0.9980983,0.0008630158,0.0001235114,0.0006771056,0.00005988093,0.0001782398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004606087,0.00004690884,0.00005268251,0.000006175983,0.0000126609,0.00001471792,0.0003271428,0.00002559424,0.0002498309,0.9820892,0.0006308198,0.01653971],"study_design_scores_gemma":[0.0001295993,0.0001325701,0.0007163651,0.00002535122,0.000006446006,0.000008888585,0.0001913652,0.01592492,0.0008055361,0.9744175,0.007459441,0.0001820287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07790744,0.0005373644,0.7541492,0.009290097,0.0006956029,0.0004732533,0.000001311227,0.001027748,0.155918],"genre_scores_gemma":[0.9208014,0.000005076426,0.07812051,0.0006360915,0.00001529361,0.00001362024,2.331731e-7,0.00001192852,0.0003958408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.842894,"threshold_uncertainty_score":0.4564009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W170650356","doi":"","title":"On Super Edge-Magic Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01560607092974055,"gpt":0.2119787918245898,"spread":0.1963727208948493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001980883,0.0001640681,0.000156376,0.0001692902,0.0001565165,0.0001207441,0.0006808446,0.00007411416,0.0001146178],"category_scores_gemma":[0.00005015408,0.0001456575,0.00009233774,0.0006170268,0.0000576093,0.0002376605,0.0001267398,0.0001900812,0.001579998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001754058,"about_ca_system_score_gemma":0.00000962064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297994,"about_ca_topic_score_gemma":5.039985e-7,"domain_scores_codex":[0.9986405,0.0000619811,0.0001984513,0.0004229467,0.0003356839,0.0003404621],"domain_scores_gemma":[0.9988181,0.0001073854,0.00004715777,0.0007922302,0.00008538531,0.0001497512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000106107,0.0001654653,0.0002876546,0.000003030475,0.000008343818,0.00001446001,0.0001609977,0.00001212674,0.0001743454,0.9589726,0.03862611,0.001573802],"study_design_scores_gemma":[0.0006225397,0.0001696204,0.0002661975,0.00001907162,0.00000377555,0.000008071514,0.000003386717,0.004953458,0.0007693412,0.9908631,0.002122619,0.0001987593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9592425,0.0008009368,0.0001646835,0.002352239,0.005670792,0.0001788157,0.000001088614,0.0006325501,0.03095635],"genre_scores_gemma":[0.9969797,0.00003185096,0.0009145671,0.001158328,0.000001024106,0.000007414106,9.388417e-7,0.00001232102,0.0008939112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0377371,"threshold_uncertainty_score":0.9991974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W641613623","doi":"10.1090/fim/027","title":"Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization","year":2010,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Linear programming; Semidefinite embedding; Maximum cut; Combinatorial optimization; Mathematical optimization; Optimization problem; Mathematics; Parallels; Matrix (chemical analysis); Computer science; Quadratically constrained quadratic program; Theoretical computer science; Graph; Quadratic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01369692103195572,"gpt":0.2853098953425187,"spread":0.271612974310563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00112234,0.0003977957,0.0007655073,0.00009952738,0.0001463009,0.0002528084,0.0005449415,0.0003840273,0.000009432229],"category_scores_gemma":[0.000122857,0.0003607782,0.0002618907,0.0001763348,0.0008622172,0.00008839753,0.0004716076,0.001034196,0.000009662783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007271396,"about_ca_system_score_gemma":0.0002430944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002773302,"about_ca_topic_score_gemma":0.000001245127,"domain_scores_codex":[0.9976735,0.0001394189,0.0006185218,0.0006829203,0.0004023908,0.0004832295],"domain_scores_gemma":[0.9979727,0.0006773911,0.000414847,0.0006212936,0.00009169849,0.0002221214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003661012,0.00007985538,0.000006778469,0.0001777562,0.00006493985,0.000006538207,0.002241669,0.00003926463,0.0001410567,0.9130119,0.0008134244,0.08341315],"study_design_scores_gemma":[0.0005480659,0.0001753565,0.000002189859,0.0002631441,0.00005124413,0.00002713108,0.00007265493,0.08405159,0.00006263739,0.9077898,0.006325322,0.0006309111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001636832,0.0001781004,0.8748952,0.0003852533,0.0005309383,0.0008381632,0.00000400639,0.0005346135,0.1224701],"genre_scores_gemma":[0.0001639756,0.00001799064,0.9826965,0.0004480832,0.00003411774,0.00006008807,0.000008260858,0.00005111335,0.01651989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1078013,"threshold_uncertainty_score":0.9998844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017914065","doi":"10.1016/j.dam.2005.04.001","title":"On the b-dominating coloring of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Edge coloring; Chromatic scale; Graph; Existential quantification; Perfect graph; Discrete mathematics; Induced subgraph; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01573717360601393,"gpt":0.2282554170461791,"spread":0.2125182434401652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005140384,0.0001170448,0.0001628102,0.00006922925,0.0001278426,0.00004751798,0.0005746269,0.00003476724,0.00001112837],"category_scores_gemma":[0.0000599623,0.00007342955,0.00006487125,0.0002967274,0.00006730016,0.00006066935,0.0001451965,0.0001125998,0.00004444944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008672863,"about_ca_system_score_gemma":0.00001252415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001243892,"about_ca_topic_score_gemma":6.931946e-7,"domain_scores_codex":[0.9990272,0.00001137923,0.0003039688,0.0001773801,0.000292759,0.0001873464],"domain_scores_gemma":[0.9987198,0.0004441704,0.0001830045,0.0005755154,0.00003812863,0.00003934685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000132029,0.00004516506,0.000001441805,0.0000240147,0.00001013216,2.476599e-7,0.001238409,0.000374337,0.00752934,0.9883359,0.0002260682,0.00221364],"study_design_scores_gemma":[0.0002478142,0.00003631361,0.000009042307,0.00007310137,0.00001048246,0.000002390112,0.0002659962,0.06255598,0.05373892,0.8828055,0.0001114798,0.0001429795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6716329,0.00008658326,0.2313071,0.002171094,0.000146064,0.0006699752,0.000003188916,0.000302765,0.09368028],"genre_scores_gemma":[0.842609,0.000003535218,0.1570835,0.0002262543,0.000003808682,0.00002614076,4.270119e-7,0.0000086258,0.00003869892],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1709761,"threshold_uncertainty_score":0.299437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135716534","doi":"10.46298/dmtcs.532","title":"On the metric dimension of Grassmann graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Linear subspace; Vertex (graph theory); Metric dimension; Dimension (graph theory); Graph; Subspace topology; Metric (unit); Grassmannian; Discrete mathematics; Pure mathematics; Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01632379254665654,"gpt":0.2504834117644909,"spread":0.2341596192178344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003854329,0.0002501023,0.0003056233,0.0004159646,0.0004726486,0.0002156907,0.002438671,0.00005826936,0.0000274123],"category_scores_gemma":[0.0004061882,0.000138603,0.0001625439,0.002802943,0.002311803,0.0004580448,0.001010774,0.0002363072,0.00008301363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001870463,"about_ca_system_score_gemma":0.00004347796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001707385,"about_ca_topic_score_gemma":5.086089e-8,"domain_scores_codex":[0.9968661,0.0001430464,0.0004950776,0.0004609268,0.00131654,0.0007183183],"domain_scores_gemma":[0.9964482,0.001296309,0.0002172034,0.001502355,0.0002350729,0.0003009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002001417,0.0001708968,0.00004927981,0.00001588871,0.00000816542,8.070961e-7,0.0009174141,0.00007292807,0.0008824537,0.9969203,0.0001271971,0.0008327051],"study_design_scores_gemma":[0.0000963752,0.0001223383,0.0001043956,0.00006523843,0.00001073957,0.00001258548,0.00002922019,0.2637992,0.006276274,0.7293163,0.000007169629,0.0001601469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1713472,0.00009829734,0.8226206,0.001048086,0.0006439723,0.0002745003,0.000001638509,0.0001402747,0.003825415],"genre_scores_gemma":[0.8503352,0.000004462734,0.1491932,0.0004324976,0.00001094338,0.000008300214,4.20384e-7,0.00001012034,0.000004773696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6789881,"threshold_uncertainty_score":0.8517933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2609109031","doi":"10.1090/crmm/013/08","title":"Hulls of aperiodic solids and gap labeling theorems","year":2000,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Aperiodic graph; Hull; Mathematics; Environmental science; Materials science; Combinatorics; Composite material","retraction":null,"screen_n_in":null,"score":{"opus":0.01689712500396351,"gpt":0.2093794853660456,"spread":0.1924823603620821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002746174,0.0004631,0.0006249421,0.0005344132,0.000243276,0.0002091568,0.0006387145,0.0003521759,0.00008821126],"category_scores_gemma":[0.000008626164,0.0004196903,0.0002400577,0.0001670541,0.0008779597,0.0003491503,0.0002573269,0.0003344564,0.00002259883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006253164,"about_ca_system_score_gemma":0.00006522236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001850382,"about_ca_topic_score_gemma":0.000006663377,"domain_scores_codex":[0.9980319,0.00002720775,0.0005793017,0.0006636627,0.0003469683,0.0003509767],"domain_scores_gemma":[0.9984328,0.00007256167,0.0002944202,0.0009036033,0.0001417062,0.0001549495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001950224,0.00001496768,0.00005005333,0.00008199941,0.0000867886,0.00001285361,0.0009364695,0.00001539506,0.0004157181,0.9844505,0.0002348286,0.01368099],"study_design_scores_gemma":[0.0002668713,0.0002456482,0.00001909631,0.0004297548,0.00005724207,0.00004862083,0.00003530136,0.0001363202,0.0006833554,0.9684107,0.02913162,0.0005354078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01745344,0.04922659,0.001986902,0.0009579908,0.001542332,0.0009609316,0.00009461989,0.001153917,0.9266233],"genre_scores_gemma":[0.6463296,0.07529231,0.1028086,0.002817441,0.0002657152,0.0001389529,0.0001849886,0.0006121178,0.1715503],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.755073,"threshold_uncertainty_score":0.9998255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003367147","doi":"10.1016/j.disc.2007.03.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-Total labelling of graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of the Fraser Valley","funders":"Centre National de la Recherche Scientifique","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01925580421664802,"gpt":0.2429960172408542,"spread":0.2237402130242062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.005533184,0.002158303,0.001391466,0.001194741,0.002508725,0.002410016,0.00439582,0.003072662,0.000853144],"category_scores_gemma":[0.001806844,0.003046439,0.003074587,0.002940771,0.002424108,0.002024145,0.003431346,0.002926781,0.002295562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006967842,"about_ca_system_score_gemma":0.001326131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00131506,"about_ca_topic_score_gemma":0.0004364034,"domain_scores_codex":[0.9820583,0.0005743497,0.004729338,0.003407198,0.004952708,0.004278116],"domain_scores_gemma":[0.9863195,0.002714445,0.00440863,0.003880925,0.0007368414,0.001939632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006034171,0.001094089,0.00003512239,0.002775506,0.001977776,0.0008466803,0.007583351,0.003705433,0.004990359,0.9651089,0.007892749,0.003386615],"study_design_scores_gemma":[0.003595067,0.002736455,0.00003248011,0.004600937,0.002416731,0.001613053,0.005116016,0.5822244,0.2529734,0.1396261,0.001429296,0.003636132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9765527,0.003074758,0.009106807,0.000565014,0.003117129,0.0003072186,0.0008091589,0.0008103389,0.005656907],"genre_scores_gemma":[0.9677074,0.001341034,0.02678723,0.001079056,0.000833076,0.0004515423,0.0006250496,0.0009439224,0.0002317245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8254828,"threshold_uncertainty_score":0.9993735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066705994","doi":"10.1016/j.disc.2014.06.023","title":"On the strong metric dimension of Cartesian and direct products of graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Cartesian product; Discrete mathematics; Packing dimension; Dimension (graph theory); Graph; Chordal graph; Minkowski–Bouligand dimension; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01435913185574652,"gpt":0.2223091152755292,"spread":0.2079499834197827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195244,0.0001061004,0.0002234539,0.0001431743,0.00006321397,0.00002311946,0.0002848053,0.00002835204,0.000001327001],"category_scores_gemma":[0.0004036028,0.00006097199,0.0000462768,0.0005654968,0.00009857264,0.00005846929,0.0001107749,0.00006149409,0.000002060076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002668166,"about_ca_system_score_gemma":0.00001044189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008639173,"about_ca_topic_score_gemma":6.204402e-7,"domain_scores_codex":[0.9990462,0.00007226156,0.000269289,0.0001921138,0.0002900966,0.0001300193],"domain_scores_gemma":[0.9985629,0.0004501911,0.0002068159,0.0006440493,0.00009879704,0.00003722326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001317541,0.00004920949,0.00009060211,0.0001149727,0.00001545036,1.798611e-7,0.000809813,0.000075524,0.003577427,0.9943898,0.0001259631,0.0007497282],"study_design_scores_gemma":[0.0004067923,0.0005265481,0.0005156219,0.000407637,0.00006111252,0.00000605668,0.000249123,0.1703449,0.1008979,0.7262759,0.00004566391,0.0002627481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691797,0.0003246742,0.02358453,0.0008269878,0.0001374352,0.0003411998,0.000003869367,0.00006965694,0.005531922],"genre_scores_gemma":[0.9787663,0.000008854081,0.02115127,0.00003077036,0.000001782441,0.000003591417,6.135345e-7,0.000006971027,0.00002980879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2681139,"threshold_uncertainty_score":0.2486366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028483249","doi":"10.1007/s00010-005-2800-z","title":"The partition dimension of Cayley digraphs","year":2006,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Cayley graph; Vertex (graph theory); Metric dimension; Conjecture; Dimension (graph theory); Discrete mathematics; Abelian group; Graph; Chordal graph","retraction":null,"screen_n_in":null,"score":{"opus":0.00950302882682094,"gpt":0.2121605023997894,"spread":0.2026574735729685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005112329,0.00008218612,0.0001093547,0.00005962057,0.0002239883,0.00006796053,0.0002783294,0.00003030807,0.000005609211],"category_scores_gemma":[0.00007946594,0.00005244271,0.00006207533,0.0003476927,0.0000784228,0.0001842072,0.00005992129,0.00004084177,0.00007415712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006123489,"about_ca_system_score_gemma":0.00001732303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004400005,"about_ca_topic_score_gemma":0.00001570248,"domain_scores_codex":[0.9989614,0.00005195817,0.0003703334,0.0001573932,0.0003084408,0.0001504298],"domain_scores_gemma":[0.9987899,0.0003534966,0.0001898272,0.0004973516,0.0001436449,0.00002579026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001389426,0.00005822479,0.00008878193,0.00001270091,0.000004923302,3.457765e-7,0.0001167775,0.0001533155,0.003602926,0.9939213,0.0007770266,0.001262276],"study_design_scores_gemma":[0.0001406129,0.00002845828,0.0009953085,0.00003621643,0.000008135782,0.000004006104,0.00002026334,0.02901282,0.009825822,0.9595882,0.0002611366,0.00007906102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3544486,0.0008082948,0.6330347,0.003667954,0.0004159258,0.000455164,0.000001973598,0.0003442091,0.006823136],"genre_scores_gemma":[0.9819155,0.0000122147,0.01781114,0.00003815041,0.000005378034,0.00002182663,0.000003440935,0.000005204889,0.0001871094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6274669,"threshold_uncertainty_score":0.2138552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408690479","doi":"","title":"Total edge irregularity strength of strong product of two paths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Geometry; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01552113693698124,"gpt":0.245013723919636,"spread":0.2294925869826548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966035,0.0001311957,0.0002481917,0.0000922512,0.00005463073,0.00001662725,0.0004449778,0.00004202431,0.000007654946],"category_scores_gemma":[0.00006631642,0.0001204499,0.00008389672,0.0004007841,0.00009119429,0.00037949,0.0002615996,0.0001267527,0.000008581365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001468975,"about_ca_system_score_gemma":0.0000598015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008512143,"about_ca_topic_score_gemma":9.196693e-7,"domain_scores_codex":[0.9986683,0.0000883726,0.0003373066,0.000247395,0.0003369186,0.0003217805],"domain_scores_gemma":[0.9986832,0.00006046628,0.0002017517,0.0007511207,0.0001817473,0.0001217681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002857786,0.000420471,0.01695305,0.00002849731,0.00001991725,5.793185e-7,0.0003763572,0.00001363745,0.004150051,0.9749185,0.0003622484,0.002753809],"study_design_scores_gemma":[0.001875321,0.000276798,0.02769492,0.00008858561,0.0000349423,0.00001432778,0.0000435756,0.002133054,0.1551002,0.8122148,0.0001420436,0.0003814267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954938,0.0007535324,0.0002052994,0.00007480277,0.002428101,0.0001276705,0.000003639711,0.0000678817,0.0008452307],"genre_scores_gemma":[0.9946188,0.000003777357,0.005296368,0.000009756531,0.000003741433,0.000004468381,0.000002511561,0.000007872228,0.00005268625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1627037,"threshold_uncertainty_score":0.4911803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400382429","doi":"","title":"A Note on Strongly Graceful Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01117670606602096,"gpt":0.2383382808877684,"spread":0.2271615748217474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002365498,0.0001616897,0.0001641863,0.0001261271,0.0001457652,0.0001199413,0.000651316,0.00007349411,0.000007454001],"category_scores_gemma":[0.00004270132,0.000144943,0.00008061057,0.0004479802,0.00002771785,0.0002194914,0.00006592875,0.0001907274,0.0002371613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000301545,"about_ca_system_score_gemma":0.00004233737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001169247,"about_ca_topic_score_gemma":0.000001703533,"domain_scores_codex":[0.9986718,0.00004997499,0.0001995592,0.0004038879,0.0003401494,0.0003346555],"domain_scores_gemma":[0.9988973,0.00006464414,0.00007297952,0.0007456332,0.00007482179,0.0001446893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005951636,0.0001642277,0.00008401376,9.508553e-7,0.00000405428,0.000015711,0.0001293191,0.00009372458,0.0006192056,0.9822001,0.003984763,0.01269794],"study_design_scores_gemma":[0.0008404882,0.0005875151,0.003421618,0.00002437805,0.000004087268,0.000004994744,0.000003347902,0.004431768,0.001923899,0.9868729,0.001684688,0.0002003347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714348,0.000251112,0.001453173,0.006577601,0.003791229,0.0002537934,0.000001532343,0.0008740697,0.01536273],"genre_scores_gemma":[0.9956524,0.000006382868,0.003080219,0.0009788912,0.000001784197,0.000003914612,0.000001534506,0.000006949993,0.0002679105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02421766,"threshold_uncertainty_score":0.5910604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1588217500","doi":"10.37236/2639","title":"Metric Dimension for Random Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research; National Science Foundation","keywords":"Metric dimension; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Packing dimension; Graph; Discrete mathematics; Metric (unit); Random graph; Minkowski–Bouligand dimension; Chordal graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.006990342412215714,"gpt":0.2153006784157689,"spread":0.2083103360035532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819593,0.0001318012,0.0002598322,0.0002846039,0.0002145824,0.0001168868,0.001028405,0.00005300035,0.000003431396],"category_scores_gemma":[0.000183779,0.00007734321,0.0002210743,0.001067468,0.00003936643,0.0003638247,0.00007914743,0.0003840514,0.00001324361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007541386,"about_ca_system_score_gemma":0.0002099536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008999205,"about_ca_topic_score_gemma":3.493123e-7,"domain_scores_codex":[0.9983733,0.0001202251,0.0004389278,0.0001321626,0.0004163698,0.0005190169],"domain_scores_gemma":[0.9979149,0.0005530646,0.0004081026,0.0003692942,0.0006590566,0.00009557977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001824659,0.00007549295,0.00005154088,0.000004507628,0.00005286435,5.582942e-7,0.00007987514,0.0001286835,0.0008012035,0.9944354,0.002507013,0.001844667],"study_design_scores_gemma":[0.002230198,0.0006777635,0.00006632039,0.00001307441,0.00003270206,0.00008360064,0.00002021699,0.004911378,0.002044093,0.988647,0.0011728,0.0001008001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4002733,0.01594268,0.5749079,0.005950332,0.001978229,0.0006420271,2.479426e-7,0.00007606761,0.0002292229],"genre_scores_gemma":[0.9986233,0.0004558061,0.0005453469,0.0001981322,0.00001273604,0.00001088709,2.150046e-7,0.00001058324,0.0001430179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.59835,"threshold_uncertainty_score":0.3153965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983401788","doi":"10.1016/j.ejc.2010.08.002","title":"Vertex-coloring 2-edge-weighting of graphs","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"Nankai University","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Vertex (graph theory); Weighting; Discrete mathematics; Complete coloring; Graph coloring; Fractional coloring; Edge cover; Graph; Graph power; Line graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.00992254455779144,"gpt":0.2044921355836255,"spread":0.1945695910258341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118876,0.0001231738,0.0002359384,0.0002895947,0.0001067121,0.00007361083,0.001122213,0.00002690473,0.0000052421],"category_scores_gemma":[0.0002447789,0.0001033579,0.0001525823,0.0006100083,0.0000637044,0.000337928,0.0001972077,0.000555515,0.00001489643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008458482,"about_ca_system_score_gemma":0.00006210604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.205651e-7,"about_ca_topic_score_gemma":1.475867e-7,"domain_scores_codex":[0.9983832,0.0001859772,0.0006523269,0.000144312,0.0004253886,0.0002088404],"domain_scores_gemma":[0.9980981,0.000127941,0.000660483,0.0003958672,0.0005477521,0.0001698942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007699593,0.0001706491,0.002979332,0.0000199971,0.00003269963,0.0001769316,0.000493783,0.00004314332,0.03176776,0.9551285,0.001021921,0.008157575],"study_design_scores_gemma":[0.005006416,0.002291063,0.02068373,0.0004609533,0.00008625041,0.0009663643,0.000103379,0.003830481,0.06816186,0.8789701,0.01859514,0.0008443004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9762799,0.0003078025,0.008919479,0.0002402712,0.005107155,0.00003864762,2.615006e-7,0.00004630709,0.009060155],"genre_scores_gemma":[0.989942,0.00003429885,0.009887708,0.00005558848,0.0000143147,1.205235e-7,1.021101e-7,0.00001551594,0.00005038029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07615845,"threshold_uncertainty_score":0.4214811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1149759637","doi":"10.1016/j.laa.2015.08.007","title":"Proof of a conjectured lower bound on the chromatic number of a graph","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Graph; Friendship graph; Upper and lower bounds; Windmill graph; Discrete mathematics; Voltage graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02254437193042452,"gpt":0.2594626552656268,"spread":0.2369182833352023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001993291,0.00007346059,0.0001193923,0.00004010518,0.00006433973,0.00001893647,0.0002587623,0.00003590725,0.000008273788],"category_scores_gemma":[0.00003935554,0.00004636744,0.00003629976,0.0003962386,0.00008432843,0.00005256644,0.00006145526,0.00006224553,0.00001774999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002657164,"about_ca_system_score_gemma":0.00004640243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000915872,"about_ca_topic_score_gemma":0.000001283343,"domain_scores_codex":[0.999351,0.00002781632,0.0002016179,0.0001618424,0.0001670593,0.00009071094],"domain_scores_gemma":[0.9991614,0.0001011562,0.0001116034,0.0003976056,0.0001654416,0.00006283936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004564407,0.0001667634,0.00006599048,0.00002789934,0.00002223661,1.636089e-7,0.000618962,0.00004283242,0.001946752,0.9953126,0.0009218656,0.0008694227],"study_design_scores_gemma":[0.0009513558,0.0003335465,0.0003678707,0.000104235,0.00004633013,0.00002359394,0.0001069691,0.0360684,0.05899505,0.8965885,0.006139812,0.0002743404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9455144,0.0007276965,0.04606748,0.003058919,0.00009075019,0.000981348,0.00001389727,0.00008034921,0.00346521],"genre_scores_gemma":[0.9962599,0.000007918096,0.003298081,0.0002485346,0.00000672776,0.00007524267,0.000001920942,0.000004762202,0.00009691394],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09872406,"threshold_uncertainty_score":0.1890809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2219595186","doi":"","title":"On the metric dimension of Mobius ladders","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Dimension (graph theory); Cardinality (data modeling); Metric space; Constant (computer programming); Packing dimension; Discrete mathematics; Graph; Minkowski–Bouligand dimension; Chordal graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01537372741380224,"gpt":0.2279979475346106,"spread":0.2126242201208083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000683434,0.0001041631,0.0001280631,0.0001440024,0.0001180106,0.00002487437,0.0004932463,0.00004841012,0.00001212051],"category_scores_gemma":[0.0001512093,0.0000667583,0.00006608884,0.0008888042,0.00005214474,0.0001751108,0.0001578017,0.0001246609,0.00009974811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357082,"about_ca_system_score_gemma":0.00001830897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002311793,"about_ca_topic_score_gemma":1.370401e-7,"domain_scores_codex":[0.9989439,0.0001031045,0.0001813897,0.0001636088,0.0003403678,0.000267589],"domain_scores_gemma":[0.9986597,0.0004297711,0.0001024901,0.0006377904,0.00008116398,0.00008911193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002261102,0.0001376648,0.0007799721,0.000002975172,0.00001201191,5.108094e-7,0.0002179016,0.00002686954,0.0008366142,0.9925016,0.004895266,0.000586348],"study_design_scores_gemma":[0.0003821448,0.0001521899,0.001295022,0.00002329735,0.000009327016,0.000003101735,0.00003726051,0.001665208,0.0163855,0.9795818,0.000335704,0.000129479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.99301,0.0005874152,0.0001859024,0.000675962,0.002507028,0.0001303269,4.483421e-7,0.0000916418,0.002811237],"genre_scores_gemma":[0.9988919,0.00001021973,0.0006378704,0.0003846471,0.000001010832,0.000007067069,4.893465e-7,0.000006900184,0.00005986934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01554889,"threshold_uncertainty_score":0.2722324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013391382","doi":"10.1016/j.disc.2008.12.022","title":"Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Simple graph; Chromatic scale; Connectivity; Edge coloring; Discrete mathematics; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01801609321117861,"gpt":0.2497679224066043,"spread":0.2317518291954256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342243,0.0001883738,0.0002635843,0.00004860159,0.0004296976,0.0003447656,0.0006538742,0.00006176162,0.00001929969],"category_scores_gemma":[0.0001374936,0.00008915421,0.0001083376,0.0003709301,0.0001597262,0.0001232707,0.0001052222,0.0001714137,0.00002831357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001042593,"about_ca_system_score_gemma":0.00003148116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006925031,"about_ca_topic_score_gemma":4.856537e-7,"domain_scores_codex":[0.9985976,0.0000997521,0.0003152578,0.0002686199,0.000385258,0.0003335587],"domain_scores_gemma":[0.9978892,0.001079257,0.0001094165,0.0007715034,0.00007765189,0.00007297695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001816364,0.00005569206,0.0000235748,0.00004095013,0.00002528419,0.000001035395,0.001538742,0.00004831137,0.00005387325,0.9970345,0.0007851034,0.0003747194],"study_design_scores_gemma":[0.001194263,0.00006097333,0.00004084545,0.00008132016,0.00002001221,0.00002420902,0.0001671901,0.2609887,0.0001546482,0.7371075,0.00004838558,0.0001119181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05406484,0.0003781334,0.8971581,0.01322036,0.0002425709,0.002217008,0.00001141468,0.0002611557,0.03244635],"genre_scores_gemma":[0.9635867,0.00001319022,0.03478413,0.001121649,0.00001189479,0.00005836831,0.000002395808,0.00001371626,0.0004079225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9095219,"threshold_uncertainty_score":0.3635603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066522339","doi":"10.1006/jctb.2000.2003","title":"Chromatic Number and the 2-Rank of a Graph","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Chromatic scale; Combinatorics; Graph; Rank (graph theory); Friendship graph; Adjacency matrix; Mathematics; Windmill graph; Discrete mathematics; Line graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.006015949863867088,"gpt":0.2158930395992454,"spread":0.2098770897353783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245939,0.00009841083,0.0003127985,0.00007555349,0.0001091208,0.00007326641,0.0005131003,0.00004412036,0.0000229514],"category_scores_gemma":[0.0002207252,0.00005676023,0.000124321,0.0003410582,0.0004010946,0.0004463756,0.0001040389,0.0001599098,0.000002245197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005915741,"about_ca_system_score_gemma":0.00005057125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004293792,"about_ca_topic_score_gemma":2.130516e-7,"domain_scores_codex":[0.9986598,0.0003315441,0.0004738424,0.00008521704,0.0003199154,0.0001297161],"domain_scores_gemma":[0.9985287,0.0004261986,0.0004541674,0.0002755815,0.0002469716,0.0000683605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003910064,0.00005026155,0.0001744851,0.00001107223,0.00005446239,0.00001276153,0.001003201,0.000008491044,0.0003354827,0.9969829,0.0002304802,0.0007454404],"study_design_scores_gemma":[0.002595677,0.0002046645,0.0001238794,0.00005953948,0.00002698439,0.0005077641,0.0001195321,0.00005348201,0.0008668986,0.9942819,0.001093673,0.00006602892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806479,0.001434926,0.006948226,0.002301503,0.005051951,0.0001449515,5.060138e-7,0.00003079852,0.00343919],"genre_scores_gemma":[0.9978619,0.0002651983,0.001644408,0.0001017822,0.00004183247,0.000001140682,5.62106e-8,0.000005215292,0.00007848535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01721393,"threshold_uncertainty_score":0.2314615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106653152","doi":"10.1016/j.disc.2005.04.024","title":"Labeling trees with a condition at distance two","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Span (engineering); Graph; Integer (computer science); Edge-graceful labeling; Discrete mathematics; Graph power; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008680740982188557,"gpt":0.2300537654908175,"spread":0.2213730245086289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001642799,0.0001500547,0.000168543,0.00005748559,0.0001868431,0.000130673,0.0002931935,0.00002909533,0.00001224882],"category_scores_gemma":[0.00001149322,0.0001078436,0.00004489483,0.0002705476,0.00007280863,0.0002007357,0.00009563875,0.00006568961,0.0000665914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002764967,"about_ca_system_score_gemma":0.00001550915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002662588,"about_ca_topic_score_gemma":0.0001105545,"domain_scores_codex":[0.9989193,0.00001936683,0.0002493629,0.000264721,0.0003054226,0.0002418339],"domain_scores_gemma":[0.9991814,0.00007251836,0.0001436751,0.0004804711,0.00006860965,0.00005335097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003689306,0.00007166016,0.0004250796,0.00004690115,0.00001210414,0.00001576248,0.0004723743,0.001465664,0.003425083,0.9930887,0.0007976271,0.0001753298],"study_design_scores_gemma":[0.001431985,0.0001305472,0.000283475,0.0003540324,0.00004149857,0.00008447872,0.0001083235,0.2203101,0.01065912,0.7647636,0.001247201,0.0005856623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2721273,0.0002669634,0.7174869,0.0004901484,0.00009455164,0.0002027778,0.00001155589,0.0004127973,0.008907033],"genre_scores_gemma":[0.8170575,0.000002974954,0.1817879,0.00007804813,0.000009205074,0.00001597348,0.00001691797,0.00001428784,0.001017097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5449303,"threshold_uncertainty_score":0.4397736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037787135","doi":"10.1016/j.laa.2008.10.032","title":"Magic square spectra","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Manitoba","funders":"","keywords":"Magic square; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Diagonal; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01826439901277731,"gpt":0.2314869489308074,"spread":0.2132225499180301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005921815,0.00008494397,0.00008487223,0.00006337754,0.0002637303,0.00002980177,0.0002482608,0.00003885748,0.0000196981],"category_scores_gemma":[0.000007416982,0.00007526977,0.00003103676,0.0003639097,0.00004239171,0.0001385882,0.00007803411,0.00008644135,0.0003603017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003901453,"about_ca_system_score_gemma":0.0000257433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005510065,"about_ca_topic_score_gemma":8.37447e-7,"domain_scores_codex":[0.9992971,0.00001195668,0.0001391471,0.000283761,0.0001147792,0.0001532154],"domain_scores_gemma":[0.9994177,0.00003293569,0.00003623204,0.0003410466,0.00006625582,0.0001058014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[5.22253e-7,0.00006809345,0.0002256035,0.000008146436,0.000005476268,0.000002436391,0.0002055444,0.00001374247,0.001369847,0.9946868,0.001106302,0.002307463],"study_design_scores_gemma":[0.001534013,0.0002665919,0.0127003,0.000043551,0.00003810625,0.0005868873,0.000072161,0.1305754,0.01983447,0.5601044,0.2730337,0.001210543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3640722,0.007532205,0.5943769,0.01076647,0.0002474088,0.001298949,0.00002143627,0.001454533,0.02022994],"genre_scores_gemma":[0.9652548,0.0004113608,0.03222698,0.0006932688,0.00003666004,0.00005959782,0.000008352497,0.000009436087,0.001299513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6011826,"threshold_uncertainty_score":0.463107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034442645","doi":"10.1016/j.jctb.2007.02.009","title":"Triangular embeddings of complete graphs from graceful labellings of paths","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Path (computing); Discrete mathematics; Order (exchange); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01058511172727138,"gpt":0.2303838003841483,"spread":0.2197986886568769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004152855,0.0002005759,0.0007046291,0.0003703289,0.00009225676,0.0000458785,0.001029851,0.0001348593,0.00002975347],"category_scores_gemma":[0.0003187725,0.0001676555,0.0003438954,0.0006830616,0.0002933245,0.0005880187,0.000149901,0.0003072382,0.000002083136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001987721,"about_ca_system_score_gemma":0.00009930255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002586229,"about_ca_topic_score_gemma":8.815987e-7,"domain_scores_codex":[0.9972081,0.0002366143,0.001350171,0.0001984185,0.000724283,0.0002824294],"domain_scores_gemma":[0.9960237,0.0007421268,0.001668263,0.0004644458,0.0009310116,0.0001704218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007895025,0.0002008918,0.0002781251,0.00002280081,0.0001309296,0.00003607719,0.001633453,0.00002752491,0.04539838,0.9497404,0.0002143517,0.001527582],"study_design_scores_gemma":[0.001997417,0.0008795833,0.0001661175,0.0001417949,0.00004590805,0.0000280578,0.0002464679,0.00003323368,0.1090882,0.8854771,0.001748342,0.0001478566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9583733,0.001519757,0.03260369,0.0001998053,0.006699378,0.0001246059,0.00001237174,0.00003675541,0.0004303445],"genre_scores_gemma":[0.9843501,0.00009809409,0.01537297,0.00006362414,0.00006575217,4.393817e-7,0.00000140221,0.00001485156,0.00003272833],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06426334,"threshold_uncertainty_score":0.6836794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3009498706","doi":"10.1109/focs46700.2020.00060","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Adjacency list; Planar graph; Vertex (graph theory); Mathematics; Bounded function; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02590588498453407,"gpt":0.2247835507269642,"spread":0.1988776657424301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118233,0.00008181635,0.0000997384,0.0000405055,0.0001117284,0.00007204591,0.000250711,0.00003353411,0.000005703512],"category_scores_gemma":[0.00002636763,0.0000672453,0.00003823293,0.0002197766,0.00002145943,0.000146321,0.00005568215,0.00005283866,0.00001660548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001477785,"about_ca_system_score_gemma":0.00001422145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007308756,"about_ca_topic_score_gemma":0.000001381171,"domain_scores_codex":[0.9992774,0.00001072872,0.0001335164,0.0003037773,0.00009989331,0.0001747574],"domain_scores_gemma":[0.999553,0.00006991952,0.0000296655,0.000154718,0.00004481754,0.0001478975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003363767,0.00001028906,0.0001798511,0.00001710305,0.000007503295,0.000001519418,0.0004408233,0.00002130193,0.003244417,0.9857544,0.005812656,0.004506785],"study_design_scores_gemma":[0.0009548048,0.0003421164,0.00005839067,0.00001375457,0.00001191752,0.000006657595,0.00007212586,0.1300944,0.008979705,0.8492958,0.009853208,0.000317178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0433232,0.001826723,0.9152406,0.03104213,0.0003932508,0.0004227382,0.000006547642,0.0009764254,0.006768394],"genre_scores_gemma":[0.5740572,0.00009073439,0.4135431,0.012038,0.000008999979,0.00001619565,0.00000343746,0.00001137895,0.0002309111],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.530734,"threshold_uncertainty_score":0.2742184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2321141083","doi":"10.4153/cmb-2016-015-5","title":"The Metric Dimension of the Total Graph of a Finite Commutative Ring","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Commutative ring; Graph; Dimension (graph theory); Commutative property; Pure mathematics; Ring (chemistry); Discrete mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01082692082253708,"gpt":0.204817375359755,"spread":0.1939904545372179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006404417,0.00009644647,0.0001693339,0.0001303955,0.0001961868,0.00002427515,0.0006648616,0.0000444216,0.00009179618],"category_scores_gemma":[0.001000196,0.00004184103,0.0001104148,0.0005628071,0.0003061629,0.00002619965,0.0001572691,0.00008784068,0.0001760732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002684935,"about_ca_system_score_gemma":0.0001057541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000458809,"about_ca_topic_score_gemma":0.0001167456,"domain_scores_codex":[0.998866,0.0001310781,0.0003283235,0.0001512588,0.0002599106,0.0002634615],"domain_scores_gemma":[0.9972435,0.001681992,0.0001424008,0.0006302417,0.0001338315,0.0001680414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003409408,0.00003289204,0.00007971555,0.00003205508,0.00003185925,0.000003170468,0.0005538163,0.00007330201,0.001689736,0.9907009,0.002146214,0.004652919],"study_design_scores_gemma":[0.0007867196,0.0001596971,0.001405748,0.000783024,0.00003518979,0.00003333964,0.0002075205,0.006643892,0.01670974,0.9701409,0.00278926,0.0003050117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8170164,0.001278989,0.09454842,0.07045832,0.0007100353,0.00109735,0.00004737879,0.0001153919,0.01472771],"genre_scores_gemma":[0.9965317,0.000006800995,0.002855245,0.0001445295,0.000002152643,0.000007515954,1.031977e-7,0.000006296316,0.0004456264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1795153,"threshold_uncertainty_score":0.2263124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401313454","doi":"","title":"On Some Metric Properties of the Sierpinski Graphs S(n, k).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Sierpinski triangle; Metric (unit); Combinatorics; Discrete mathematics; Mathematical analysis; Fractal; Business; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.01289290419295852,"gpt":0.2076399068931017,"spread":0.1947470027001432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002734138,0.0001234309,0.0001607484,0.0001929888,0.0001439534,0.0000482752,0.0009319362,0.00005385474,0.000001509102],"category_scores_gemma":[0.0001184293,0.00007561471,0.0001110719,0.001253687,0.0000658772,0.0002008588,0.0001100404,0.0001451531,0.00001968415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001510635,"about_ca_system_score_gemma":0.0000452702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001303782,"about_ca_topic_score_gemma":2.277061e-7,"domain_scores_codex":[0.9988212,0.00007801314,0.0002280399,0.0002524732,0.0004037004,0.0002165563],"domain_scores_gemma":[0.998894,0.00004601434,0.0001145939,0.0007828809,0.0001038361,0.0000586301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000371494,0.000154778,0.0001147366,0.000004958524,0.000007864171,9.154763e-7,0.0001201965,0.00004126827,0.00438157,0.9926825,0.0009911172,0.001496375],"study_design_scores_gemma":[0.0003545332,0.0002223401,0.001895048,0.0000556775,0.000005055456,0.000001892035,0.000003879093,0.0005620344,0.04369289,0.9530519,0.00005295523,0.0001017713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9946826,0.0009424484,0.00001396992,0.001491406,0.001675553,0.0001565938,3.583511e-7,0.0001154997,0.0009215758],"genre_scores_gemma":[0.9987328,0.00001791025,0.000230941,0.0009192526,4.611034e-7,0.000003878587,1.411619e-7,0.000004868528,0.00008974164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03963058,"threshold_uncertainty_score":0.3083479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984405480","doi":"10.1016/j.disc.2012.07.029","title":"Locating a robber on a graph","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"Environment and Climate Change Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02336983376868966,"gpt":0.2544704393853854,"spread":0.2311006056166958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337756,0.0001350635,0.0001416572,0.00009295237,0.0001168004,0.00008603805,0.0003747778,0.00004357546,0.00001313757],"category_scores_gemma":[0.00007455305,0.0001016615,0.00007499381,0.0003257647,0.00003294578,0.0002267414,0.0001269611,0.0001076998,0.000301999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000996182,"about_ca_system_score_gemma":0.00001077781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003694123,"about_ca_topic_score_gemma":3.612078e-7,"domain_scores_codex":[0.9989468,0.00002694526,0.0002261446,0.0001691895,0.0002733362,0.0003575113],"domain_scores_gemma":[0.9990286,0.0001024382,0.00009831532,0.0005956338,0.00003863432,0.0001363604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[5.773555e-7,0.0001179775,0.0001486501,0.0000432897,0.00001062852,0.000001074245,0.002823289,0.00007494925,0.0003686988,0.9943434,0.0006619678,0.001405478],"study_design_scores_gemma":[0.0006836453,0.0001889279,0.0003321135,0.000371699,0.00004155208,0.00006755015,0.0005706929,0.1026224,0.008423372,0.8841818,0.001641987,0.0008743133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.146564,0.0005613641,0.8082233,0.001234486,0.0008009101,0.000356364,0.000002870836,0.0007601192,0.04149655],"genre_scores_gemma":[0.8260798,0.000002973798,0.1732564,0.0003940694,0.00001399258,0.00001360161,0.00000124439,0.00001269248,0.0002252792],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6795158,"threshold_uncertainty_score":0.4145637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405045104","doi":"","title":"On Metric Dimension of Generalized Petersen Graphs P(n, 3).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Metric dimension; Mathematics; Combinatorics; Dimension (graph theory); Metric (unit); Constant (computer programming); Discrete mathematics; Graph; Chordal graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01014705084220965,"gpt":0.2227669476679483,"spread":0.2126198968257387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005597763,0.0001564494,0.0002598943,0.0004003762,0.0000982271,0.00003871318,0.0005430173,0.00007150623,0.000006337501],"category_scores_gemma":[0.0001562462,0.0001333028,0.0001145667,0.001061953,0.00005117174,0.0001313266,0.0001573578,0.0001145577,0.0000611592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001343578,"about_ca_system_score_gemma":0.00001991618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003973073,"about_ca_topic_score_gemma":4.962715e-7,"domain_scores_codex":[0.998491,0.0001633433,0.0003009115,0.000374849,0.0004175828,0.0002523166],"domain_scores_gemma":[0.9985269,0.0002409903,0.0001593392,0.0008036376,0.000151422,0.0001177141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000738527,0.0001126806,0.0003226181,0.000007740897,0.00001395134,0.000001777414,0.00006694727,0.0001881197,0.003736142,0.9926254,0.001537119,0.001380182],"study_design_scores_gemma":[0.001152437,0.0003774381,0.0006801642,0.00002873578,0.000009026757,0.000002727625,0.000002683657,0.0122895,0.01135604,0.9737365,0.0002028504,0.0001619504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9941009,0.0001268449,0.001113056,0.0002320351,0.002136989,0.0001150255,5.629187e-7,0.0001706018,0.002003947],"genre_scores_gemma":[0.9944101,0.00001267164,0.00514121,0.0003540134,7.27255e-7,0.000005720758,0.000002097634,0.00001133297,0.00006213776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01888888,"threshold_uncertainty_score":0.5435931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966038695","doi":"","title":"L(2,1)-labelling of graphs","year":2008,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Labelling; Graph; Mathematics; Conjecture; Bound graph; Discrete mathematics; Span (engineering); Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01518758808387933,"gpt":0.2026854209649761,"spread":0.1874978328810968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002564009,0.0001399774,0.0001950622,0.0001920754,0.0003357291,0.0000794698,0.001102271,0.00007410639,0.00002269639],"category_scores_gemma":[0.0003965589,0.0001390197,0.0001186307,0.0008514803,0.0002360192,0.0003028755,0.000317851,0.0001579388,0.00003237128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001253039,"about_ca_system_score_gemma":0.00009804264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003074757,"about_ca_topic_score_gemma":0.00005014105,"domain_scores_codex":[0.997346,0.001253956,0.0003816495,0.0004101029,0.0003560013,0.0002522558],"domain_scores_gemma":[0.9962896,0.0006422884,0.0002376798,0.001405856,0.001296254,0.0001283051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002056753,0.0002931607,0.002383453,0.00002051607,0.00001991454,0.000005537734,0.005040463,0.00004897064,0.01522848,0.9638909,0.0006230193,0.01244352],"study_design_scores_gemma":[0.001711198,0.000002147819,0.006254431,0.0009375537,0.00002495906,0.0001250889,0.00009659515,0.08702241,0.7182046,0.1774477,0.007383226,0.0007900954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4761104,0.001150485,0.4919439,0.004155108,0.0001615076,0.0001524694,0.000003137223,0.0003448246,0.02597812],"genre_scores_gemma":[0.8287662,0.0002609387,0.169427,0.00009253847,0.000001207701,0.000006463297,0.000007980372,0.00001035416,0.00142732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7864432,"threshold_uncertainty_score":0.566906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204812806","doi":"10.1145/3477542","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Adjacency list; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Pathwidth; Bounded function; Chordal graph; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02032145312571858,"gpt":0.2416427083824907,"spread":0.2213212552567721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000442851,0.00005614756,0.0001142443,0.00005021474,0.0001355219,0.00007327971,0.00104476,0.00002858778,0.000001867176],"category_scores_gemma":[0.0004797918,0.00003456344,0.000113069,0.0002067477,0.00002162741,0.0001435322,0.000252805,0.0001248019,0.000001046018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005389327,"about_ca_system_score_gemma":0.0000647468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001127302,"about_ca_topic_score_gemma":0.000001306874,"domain_scores_codex":[0.9993542,0.00003907019,0.0002172661,0.00009720707,0.0001744809,0.0001177144],"domain_scores_gemma":[0.9988095,0.0001596894,0.0001829653,0.0005807488,0.0002078871,0.00005927393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004181439,0.000221848,0.004984572,0.00008767762,0.0002344799,0.00009197432,0.002270524,0.0006005298,0.1039519,0.7865722,0.07722705,0.02371545],"study_design_scores_gemma":[0.0004551399,0.00006762652,0.0003770554,0.00006148644,0.00002120935,0.0002740352,0.00003863789,0.0007378879,0.01475211,0.9798019,0.003349387,0.00006351408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8731633,0.01517284,0.03089944,0.07596566,0.00403836,0.0001634935,0.000004684497,0.00004705456,0.0005452152],"genre_scores_gemma":[0.5361359,0.0005886453,0.4590572,0.003594862,0.00004325194,0.000001741265,3.290231e-7,0.00001260677,0.0005654777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4281578,"threshold_uncertainty_score":0.1941442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W49590405","doi":"","title":"Metric-Locating-Dominating Sets in Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Metric (unit); Combinatorics; Graph; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.0120076420325398,"gpt":0.2406084657575433,"spread":0.2286008237250035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237707,0.0001627637,0.0002067519,0.0004791788,0.0001374514,0.0001123371,0.0007058093,0.00008063671,0.000002777916],"category_scores_gemma":[0.0001723139,0.0001611904,0.00006630521,0.002368565,0.00004366778,0.0003459645,0.0002231826,0.0002337134,0.00006060545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007236142,"about_ca_system_score_gemma":0.00008292851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002434689,"about_ca_topic_score_gemma":0.00001344953,"domain_scores_codex":[0.9984031,0.00006570138,0.000350823,0.0004403066,0.0003436145,0.0003964205],"domain_scores_gemma":[0.9989914,0.0001272025,0.0001158983,0.000544219,0.0001065861,0.0001147091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001288665,0.0001324504,0.002432041,0.000008685207,0.000007173891,0.00002755171,0.0004798671,0.0004481508,0.000422711,0.9927307,0.00008051911,0.0032288],"study_design_scores_gemma":[0.001574447,0.00008442632,0.002750713,0.00006899278,0.000003438352,0.0000108938,0.00002873349,0.002008467,0.003582218,0.9896613,0.00002412002,0.0002022836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9943209,0.0004436653,0.0007306142,0.0007692918,0.001575671,0.0001609089,3.78545e-7,0.0002464213,0.001752117],"genre_scores_gemma":[0.9825901,0.00001171778,0.01708999,0.0002592954,4.728104e-7,0.00001731007,0.00000129032,0.00001170671,0.00001813641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01635938,"threshold_uncertainty_score":0.6573152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397663352","doi":"","title":"On vertex irregular total labelings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.007121993914556585,"gpt":0.2018209375120461,"spread":0.1946989435974895,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001958446,0.0001665649,0.0001642528,0.0001034492,0.0001600929,0.000200385,0.0005937546,0.00008416231,0.00007051692],"category_scores_gemma":[0.0000720046,0.0001467243,0.00007198956,0.0003847758,0.00004428728,0.0003548008,0.0001877387,0.0001743374,0.002057896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002530841,"about_ca_system_score_gemma":0.00003342049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000076951,"about_ca_topic_score_gemma":2.969072e-7,"domain_scores_codex":[0.9986179,0.00005100152,0.0002117282,0.0004128999,0.0003543425,0.0003521683],"domain_scores_gemma":[0.9987814,0.00009596498,0.00006394556,0.0007413257,0.0001487376,0.0001686525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001212484,0.0001029056,0.00007986816,0.000003578451,0.00001092642,0.000005159694,0.00009382031,0.00003147319,0.001323481,0.9749593,0.02062286,0.002765423],"study_design_scores_gemma":[0.0006073813,0.0001764929,0.0009016721,0.00002759813,0.000003267574,0.000007600839,0.000005720799,0.01073938,0.001937631,0.9851217,0.0002700881,0.0002014629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9905838,0.0001663444,0.0001848055,0.001344256,0.003480834,0.0001961927,4.638908e-7,0.0003939206,0.003649319],"genre_scores_gemma":[0.9960502,0.000004469531,0.002393547,0.0008479298,0.000001017743,0.00002611696,0.000001840285,0.00001326168,0.0006616581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02035277,"threshold_uncertainty_score":0.9987191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116562963","doi":"10.37236/1621","title":"Relaxed Graceful Labellings of Trees","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Bijection; Vertex (graph theory); Combinatorics; Mathematics; Upper and lower bounds; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0107111344842803,"gpt":0.1939844687147212,"spread":0.1832733342304409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271413,0.000117197,0.0002528263,0.0001460726,0.0001115382,0.00003704509,0.001201063,0.00005429836,0.00000916031],"category_scores_gemma":[0.00007699198,0.00007578597,0.0001464279,0.000780656,0.00007238019,0.000220535,0.00007637502,0.0005413182,0.00001051355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006014628,"about_ca_system_score_gemma":0.00009413613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004444009,"about_ca_topic_score_gemma":0.000001740579,"domain_scores_codex":[0.9983655,0.0001200009,0.000507171,0.0001112589,0.0004989106,0.0003971928],"domain_scores_gemma":[0.9983639,0.0002006114,0.0005905958,0.0004203272,0.0003561022,0.00006848817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006713487,0.000160836,0.0001288313,0.000004724521,0.00004913309,0.000004581917,0.0004796466,0.0001697242,0.0009951709,0.9948494,0.001895844,0.001255406],"study_design_scores_gemma":[0.0007705772,0.0007988713,0.00006335105,0.0000337493,0.00003110161,0.0001503343,0.0000244749,0.003962647,0.006789312,0.9841906,0.003082897,0.000102032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8398716,0.04916226,0.09658834,0.01065868,0.001617414,0.0001898738,5.013347e-7,0.0000919864,0.001819377],"genre_scores_gemma":[0.9970942,0.002101589,0.0002123303,0.00008973161,0.000009926517,5.93578e-7,5.752505e-8,0.000008621982,0.0004829323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1572226,"threshold_uncertainty_score":0.3090462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W118899274","doi":"10.1016/j.dam.2015.06.012","title":"The simultaneous metric dimension of graph families","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Intrinsic metric; Metric (unit); Discrete mathematics; Generator (circuit theory); Convex metric space; Graph; Metric space; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.01810128719100657,"gpt":0.2385904655551594,"spread":0.2204891783641528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676943,0.000161501,0.000239925,0.00014525,0.0001553673,0.00008232998,0.0007393855,0.00005819413,6.234502e-7],"category_scores_gemma":[0.000240604,0.00009721112,0.00007529447,0.0009107991,0.0001483914,0.00007017106,0.0002871913,0.0001039065,0.00003879355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001200167,"about_ca_system_score_gemma":0.0000427369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009120819,"about_ca_topic_score_gemma":0.000001905576,"domain_scores_codex":[0.9985177,0.00002068511,0.0004204376,0.000230822,0.0005489705,0.0002613907],"domain_scores_gemma":[0.9979368,0.0006844571,0.000229755,0.0008549211,0.0001720104,0.0001220353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006437534,0.00006712538,0.000006736672,0.00003823346,0.00002799393,0.000002857591,0.001876915,0.002736462,0.002858382,0.9865781,0.0005884565,0.005212268],"study_design_scores_gemma":[0.0005095373,0.0001001503,0.000003839681,0.00003298452,0.00003049496,0.00001010183,0.001799874,0.1386341,0.0120149,0.845865,0.0007551288,0.0002439554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1839868,0.002326638,0.7749028,0.000759181,0.0008030571,0.001122799,0.000008413114,0.0007238491,0.03536642],"genre_scores_gemma":[0.8775969,0.00006157051,0.1221728,0.00005864059,0.000004371862,0.00001565508,0.000001792093,0.00001320011,0.0000750348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6936101,"threshold_uncertainty_score":0.3964155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890013260","doi":"10.28924/2291-8639-16-2018-733","title":"Cubic Graphs with Application","year":2018,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Cartesian product; Cubic graph; Graph product; Mathematics; Indifference graph; Join (topology); Product (mathematics); Cubic form; Pathwidth; Cubic crystal system; Chordal graph; Cartesian coordinate system; Cubic function; Combinatorics; 1-planar graph; Graph; Geometry; Line graph; Physics; Condensed matter physics","retraction":null,"screen_n_in":null,"score":{"opus":0.005245315939358627,"gpt":0.2502525808095352,"spread":0.2450072648701765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002273553,0.00006366979,0.0001216138,0.0004974024,0.00008905004,0.0001193241,0.0005222709,0.00002187169,0.000008433849],"category_scores_gemma":[0.000005620018,0.00004590796,0.00008615819,0.0009486214,0.00009736924,0.0002163429,0.00005104337,0.00006292908,0.000008585867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001060936,"about_ca_system_score_gemma":0.00002958568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002102168,"about_ca_topic_score_gemma":0.00002081238,"domain_scores_codex":[0.9991748,0.00001535271,0.0002695712,0.0001538361,0.0003160948,0.000070296],"domain_scores_gemma":[0.998412,0.00003382606,0.0003013804,0.0002059447,0.0009721884,0.00007461955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001935419,0.0001803959,0.01564092,0.000002086144,0.001585151,0.000003407511,0.0002186692,0.0003325651,0.004697138,0.876309,0.0002929449,0.1007183],"study_design_scores_gemma":[0.002553067,0.0009058984,0.07282391,0.00007425033,0.002019561,0.0005841946,0.0002343622,0.09414237,0.01672931,0.7123514,0.09673222,0.0008494224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03813479,0.0001185149,0.9595053,0.001575597,0.00003893917,0.00004913552,0.000001791424,0.00001720232,0.000558735],"genre_scores_gemma":[0.9682092,0.00007026326,0.03138428,0.000236959,0.00004824853,0.00001095491,0.000003042112,0.000002695695,0.00003433203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9300745,"threshold_uncertainty_score":0.1872073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1930124199","doi":"10.26493/1855-3974.196.0df","title":"Gray code numbers for graphs","year":2011,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Gray code; Vertex (graph theory); Graph; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06167349681544703,"gpt":0.2536088075405026,"spread":0.1919353107250556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862397,0.0002012772,0.0003039095,0.0001250854,0.0001528263,0.00007176751,0.0007710471,0.00007480984,0.00003150461],"category_scores_gemma":[0.00009675308,0.00016547,0.0001861412,0.0002810607,0.0001043053,0.000289905,0.00008984809,0.00008471234,0.000142417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008255348,"about_ca_system_score_gemma":0.00004161703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003544429,"about_ca_topic_score_gemma":0.00001105392,"domain_scores_codex":[0.9985141,0.00004358344,0.0004409606,0.0004163636,0.0002324862,0.000352494],"domain_scores_gemma":[0.9985133,0.0001910458,0.000182234,0.000803874,0.0001499524,0.0001595435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001032071,0.0001399252,0.000139481,0.00007212693,0.000040265,0.00000762718,0.00265569,5.310366e-7,0.0006279692,0.9911196,0.004571015,0.0006154693],"study_design_scores_gemma":[0.0007114709,0.0001145694,0.00002537445,0.00006708618,0.00001713526,0.00002221865,0.00008673798,0.003218923,0.003392676,0.9908221,0.001272042,0.0002496208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07275771,0.0003951775,0.8319501,0.002199378,0.00121089,0.002064733,0.00002756271,0.001667572,0.08772683],"genre_scores_gemma":[0.8024287,0.000005527004,0.1964199,0.000444837,0.000002420175,0.0001023897,0.000002958375,0.0000207288,0.0005725297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.729671,"threshold_uncertainty_score":0.674767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W46767655","doi":"","title":"Vertex-distinguishing total coloring of graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Complete coloring; Brooks' theorem; Fractional coloring; Graph; 1-planar graph; Chordal graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01794874767751408,"gpt":0.2187151149053473,"spread":0.2007663672278333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002611829,0.0001207619,0.0002030547,0.0001210507,0.0002123131,0.0000307557,0.0005087006,0.00005704582,0.000004255677],"category_scores_gemma":[0.0001537409,0.0001206329,0.00008607742,0.0005725386,0.00009218779,0.0002456004,0.0002193175,0.000137468,0.000017835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000161563,"about_ca_system_score_gemma":0.00005848459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009072082,"about_ca_topic_score_gemma":7.536452e-7,"domain_scores_codex":[0.9988072,0.00004206587,0.0002827003,0.0002906099,0.0003164124,0.0002610396],"domain_scores_gemma":[0.9990281,0.0001173978,0.0001238263,0.0004706796,0.0001598992,0.0001000867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002771338,0.00007668768,0.006990734,0.00001021025,0.0000134227,0.00002824338,0.000532167,0.0000370452,0.001890186,0.9890825,0.000906097,0.0004299808],"study_design_scores_gemma":[0.0007932303,0.0001553023,0.008929724,0.00005495301,0.000006173178,0.00007228927,0.00001721615,0.003573068,0.008603927,0.9774676,0.0001078381,0.0002186905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9938357,0.0002319545,0.0001453391,0.0000838433,0.002438159,0.00007133111,6.370752e-7,0.0001907627,0.003002273],"genre_scores_gemma":[0.9959149,0.00001385691,0.003921763,0.00005198555,7.336604e-7,0.000005032918,9.675306e-7,0.000008683957,0.0000821202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01161487,"threshold_uncertainty_score":0.4919266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}