{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Gary Chartrand","is_ca":false},{"name":"Linda Eroh","is_ca":false},{"name":"Mark A. Johnson","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002830388,0.0008666104,0.001747946,0.004018077,0.002947607,0.006709273,0.003109323,0.003076405,0.004754462],"category_scores_gemma":[0.01751747,0.001152208,0.001504921,0.005058343,0.008471002,0.01226866,0.004058891,0.005606734,0.0004216318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002474595,"about_ca_system_score_gemma":0.0008351114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001441003,"about_ca_topic_score_gemma":0.001123432,"domain_scores_codex":[0.9971782,0.001233413,0.0001547898,0.0006230387,0.0005054814,0.0003050995],"domain_scores_gemma":[0.9621928,0.02890881,0.003248266,0.002522764,0.001113713,0.002013606],"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.00006625895,0.00002081215,0.0008340963,0.0000680913,0.0000207218,0.00003347411,0.0003170527,0.004757124,0.0004521341,0.9882618,0.0008364154,0.004331983],"study_design_scores_gemma":[0.00001170171,0.00001011043,0.0002859919,0.0000136867,0.000008798399,0.00005959683,0.00008989614,0.008150163,0.0002201203,0.990026,0.001110698,0.00001316089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6946725,0.004345561,0.2539615,0.01021025,0.0002638974,0.00007184892,0.001448273,0.0002836306,0.03474263],"genre_scores_gemma":[0.957445,0.002022298,0.0341343,0.0004133218,0.0005155718,0.0001179612,0.0007583766,0.0001057774,0.004487441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006709273,"threshold_uncertainty_score":0.01795453,"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","authors":[{"name":"R. A. Bailey","is_ca":true},{"name":"Peter J‎. Cameron","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348539,0.0007445985,0.0008588249,0.003659493,0.0015511,0.004023605,0.00151686,0.001284716,0.003979101],"category_scores_gemma":[0.007104116,0.0003297457,0.0005226727,0.004367338,0.007133938,0.01239297,0.002565176,0.00283931,0.000477402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001715601,"about_ca_system_score_gemma":0.0004330621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000680626,"about_ca_topic_score_gemma":0.0005563786,"domain_scores_codex":[0.9988083,0.0002694651,0.00008748074,0.0003214502,0.0003413178,0.0001719885],"domain_scores_gemma":[0.9936578,0.003445378,0.001010551,0.0008696861,0.0003286551,0.0006879256],"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.00002170999,0.00001960427,0.001009071,0.00004128292,0.000006714911,0.00002998614,0.0002804592,0.001313972,0.0005570191,0.9846698,0.001038255,0.01101224],"study_design_scores_gemma":[0.00000422365,0.00001790195,0.0008170108,0.0000135311,0.000006451817,0.00009243956,0.0001922047,0.002741079,0.0006396407,0.9898158,0.005642605,0.00001711053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6070524,0.01322,0.2480595,0.007725345,0.0008472596,0.00009729574,0.001263088,0.0004881451,0.121247],"genre_scores_gemma":[0.9542269,0.003382569,0.03158363,0.0003561989,0.001139162,0.0001345226,0.0004900676,0.0001447251,0.008542269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004023605,"threshold_uncertainty_score":0.01331139,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001661785,0.000824384,0.001689003,0.00369199,0.002253377,0.01137251,0.001110499,0.00137751,0.06896894],"category_scores_gemma":[0.008804207,0.00059099,0.0007106734,0.006214966,0.003249342,0.00453569,0.002454115,0.007594566,0.02769568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003259571,"about_ca_system_score_gemma":0.00531018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001644459,"about_ca_topic_score_gemma":0.001620893,"domain_scores_codex":[0.9966573,0.0005253323,0.0002261481,0.0005457622,0.00190584,0.0001396496],"domain_scores_gemma":[0.9937331,0.001928706,0.000327761,0.001213803,0.0022095,0.0005870463],"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":[0.00002414376,0.00005758907,0.0004677645,0.0004903121,0.00004981537,0.00007769415,0.0001300472,0.00103136,0.0006683588,0.5254198,0.3260957,0.1454874],"study_design_scores_gemma":[0.000008542303,0.00001519657,0.0006998785,0.0002058234,0.00001712945,0.0003196857,0.00006764032,0.002024658,0.0002051211,0.3035221,0.6928957,0.00001861428],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003706251,0.06198893,0.05699632,0.02639759,0.02861054,0.0002577399,0.002118998,0.0007617247,0.8191618],"genre_scores_gemma":[0.147341,0.1560369,0.08513825,0.01012076,0.04216246,0.0007245826,0.005496203,0.001936944,0.5510429],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.931031,"threshold_uncertainty_score":0.2307242,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002179185,0.0006567567,0.001443995,0.00400598,0.002813889,0.004175686,0.001725859,0.001580527,0.008878842],"category_scores_gemma":[0.00426121,0.0007844667,0.0008419352,0.01031212,0.003127736,0.01025941,0.002457567,0.003278296,0.001904899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002257593,"about_ca_system_score_gemma":0.001364343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001172075,"about_ca_topic_score_gemma":0.001374594,"domain_scores_codex":[0.9988449,0.0003408091,0.00009822896,0.0002998213,0.0003127154,0.0001035566],"domain_scores_gemma":[0.998055,0.001165597,0.0001419783,0.0002889003,0.0002267449,0.0001218364],"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.00002356977,0.0000320127,0.0003911183,0.0003056633,0.000009012959,0.0000294258,0.000151334,0.0007640895,0.0001952737,0.9391362,0.00669354,0.05226867],"study_design_scores_gemma":[0.00001049246,0.00002156473,0.0004237262,0.0001818762,0.00001485443,0.0002380262,0.0001082483,0.002063916,0.0002460316,0.9191232,0.0775422,0.00002591596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07106001,0.2860402,0.2890731,0.01609694,0.002994107,0.0001413288,0.001625832,0.0006157225,0.3323528],"genre_scores_gemma":[0.4652889,0.2426186,0.226509,0.006177722,0.007581132,0.0003065414,0.002730664,0.0007149897,0.04807244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008878842,"threshold_uncertainty_score":0.02970272,"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","authors":[{"name":"Ortrud R. Oellermann","is_ca":true},{"name":"Joel Peters-Fransen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688369,0.001043551,0.001781874,0.003822867,0.002729332,0.006597327,0.002269059,0.001868829,0.00383732],"category_scores_gemma":[0.01250422,0.001123137,0.001010265,0.004286325,0.007526846,0.01547529,0.004803407,0.004554444,0.0002883083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002529157,"about_ca_system_score_gemma":0.0008491396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001105829,"about_ca_topic_score_gemma":0.000948118,"domain_scores_codex":[0.9977661,0.0009426908,0.0001201659,0.0004630861,0.0004741727,0.0002337584],"domain_scores_gemma":[0.9835538,0.0102299,0.001737914,0.001530671,0.0009656781,0.001982189],"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.00003323353,0.00001160346,0.0005587839,0.00004345442,0.00001385152,0.00001730361,0.0001317817,0.001516655,0.0001853589,0.9932892,0.001143931,0.003054937],"study_design_scores_gemma":[0.000007843109,0.000008650916,0.0003185622,0.00001092676,0.000008701788,0.00004133893,0.0000601194,0.006273679,0.00009623375,0.991767,0.001396667,0.00001029144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5898884,0.008626578,0.3274596,0.018396,0.0007406167,0.00007554643,0.002008218,0.0002513888,0.0525537],"genre_scores_gemma":[0.9619127,0.002737206,0.0281888,0.0007716777,0.001020544,0.0001189801,0.0004984978,0.00007533502,0.004676186],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006597327,"threshold_uncertainty_score":0.01835042,"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","authors":[{"name":"Brian Alspach","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195706,0.001683025,0.001838699,0.004682507,0.001826592,0.003576988,0.002554094,0.002087687,0.007235357],"category_scores_gemma":[0.003260172,0.001562944,0.001722412,0.009536172,0.002536042,0.01002422,0.00238023,0.002618934,0.003394319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001858841,"about_ca_system_score_gemma":0.001214511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003446721,"about_ca_topic_score_gemma":0.002499681,"domain_scores_codex":[0.9985169,0.0003187264,0.0001117598,0.0004197306,0.0004654607,0.0001674416],"domain_scores_gemma":[0.9973648,0.00179907,0.0001356741,0.0003416565,0.0002413619,0.0001174341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000121701,0.0002841277,0.002392452,0.004861125,0.0001010664,0.0002361949,0.0007234095,0.02146491,0.002200898,0.2914488,0.03545488,0.6407104],"study_design_scores_gemma":[0.00003479565,0.0003438517,0.002710418,0.001560514,0.0001319697,0.002635525,0.0007051927,0.02780331,0.00299076,0.3973708,0.5635727,0.0001401001],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02129356,0.4417222,0.3958626,0.004497257,0.001524936,0.0002483568,0.001045708,0.001393721,0.1324117],"genre_scores_gemma":[0.1326355,0.6062301,0.2246348,0.002222793,0.003599187,0.0002544314,0.002681358,0.0009811802,0.02676065],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.007235357,"threshold_uncertainty_score":0.02420467,"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","authors":[{"name":"Hamed Hatami","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005208254,0.0008955137,0.0008133352,0.001571123,0.0008678226,0.004126047,0.002038993,0.001085758,0.51149],"category_scores_gemma":[0.003279058,0.0006711957,0.00053924,0.002874829,0.0006658629,0.00501944,0.00148984,0.002370452,0.3049635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651219,"about_ca_system_score_gemma":0.0007123129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004846771,"about_ca_topic_score_gemma":0.006669705,"domain_scores_codex":[0.9996927,0.0000456915,0.00001949894,0.0000683833,0.0001328829,0.00004085511],"domain_scores_gemma":[0.9984078,0.0006072253,0.0001009648,0.0004014378,0.0003305602,0.000152115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000790296,0.00004760392,0.0002523014,0.0001564416,0.000007129017,0.00004555772,0.00008494226,0.0005780645,0.001710761,0.07062168,0.8688717,0.05754473],"study_design_scores_gemma":[0.00006834718,0.00003191536,0.001637291,0.00008575591,0.00001147452,0.0002525622,0.00014483,0.007518118,0.007337857,0.1487145,0.8341426,0.00005485589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004750993,0.0004631611,0.1066846,0.008437116,0.001252031,0.0001687432,0.04398904,0.02980682,0.8044475],"genre_scores_gemma":[0.0853553,0.002307557,0.1088164,0.002447064,0.001168481,0.0004536952,0.0771561,0.03575648,0.6865389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.51149,"threshold_uncertainty_score":0.6968002,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Ketan Dalal","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004369354,0.0005817406,0.0007652069,0.001074487,0.001344181,0.002018748,0.001330754,0.00113862,0.01847664],"category_scores_gemma":[0.003734205,0.0005433648,0.0006426735,0.001647081,0.0009429052,0.00332765,0.001668229,0.002091995,0.001780509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009268753,"about_ca_system_score_gemma":0.0006484851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001092838,"about_ca_topic_score_gemma":0.001879528,"domain_scores_codex":[0.9993516,0.000179528,0.00002433153,0.0002350417,0.0001261713,0.00008339643],"domain_scores_gemma":[0.9973662,0.001202543,0.0002477544,0.0006338559,0.0003078415,0.0002418256],"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.00008947089,0.00006560842,0.001048758,0.0001585032,0.00002843839,0.0001003614,0.0001564177,0.008095589,0.003361744,0.9355302,0.01505714,0.03630775],"study_design_scores_gemma":[0.00001911331,0.00001217635,0.000737582,0.0000281642,0.00002143118,0.0001805557,0.0001060063,0.02625412,0.001959547,0.9514608,0.01921119,0.000009433736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2334094,0.001396822,0.5817018,0.00496909,0.0003190584,0.0003253451,0.005565271,0.0007620775,0.1715512],"genre_scores_gemma":[0.7633787,0.001288815,0.1527759,0.001356638,0.0003545121,0.0004145214,0.007794423,0.0005223412,0.07211406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01847664,"threshold_uncertainty_score":0.06181049,"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","authors":[{"name":"Melodie Fehr","is_ca":true},{"name":"Shonda Gosselin","is_ca":true},{"name":"Ortrud R. Oellermann","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109552,0.0006935869,0.001020425,0.002586215,0.001978365,0.004630624,0.001788491,0.001501851,0.003986643],"category_scores_gemma":[0.006975085,0.0007507732,0.000557816,0.003275759,0.003242123,0.007876006,0.002105288,0.002798838,0.0003478648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002278218,"about_ca_system_score_gemma":0.0007927246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002045627,"about_ca_topic_score_gemma":0.001914453,"domain_scores_codex":[0.9990764,0.0003412065,0.00004773602,0.0002026454,0.0002089347,0.0001230951],"domain_scores_gemma":[0.9930378,0.003986409,0.0009036442,0.0006019124,0.0004925862,0.000977813],"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.00004403866,0.00001621591,0.0008370375,0.00004834483,0.00001319962,0.00002315612,0.0001780274,0.00339623,0.0004141979,0.9875288,0.002067884,0.005432763],"study_design_scores_gemma":[0.00001020172,0.00000829623,0.000465919,0.00001264901,0.000007898369,0.0000415544,0.00007680003,0.01126964,0.0002085347,0.9858001,0.002085335,0.00001290197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7852811,0.004226471,0.1458612,0.007082487,0.0003591592,0.00005119861,0.001785829,0.0002480538,0.05510455],"genre_scores_gemma":[0.9700783,0.001816586,0.01969275,0.0004844686,0.0004174481,0.00007912851,0.0008190165,0.00007676014,0.006535476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004630624,"threshold_uncertainty_score":0.01652974,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Colin McDiarmid","is_ca":false},{"name":"Bruce A. Reed","is_ca":true},{"name":"Andrew Thomason","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150265,0.0008391612,0.001242197,0.002026446,0.0015616,0.002953416,0.002622696,0.001499009,0.0115543],"category_scores_gemma":[0.01211896,0.0006623416,0.000857993,0.004140111,0.001911483,0.006409242,0.002551286,0.002882798,0.001422284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660385,"about_ca_system_score_gemma":0.0008421487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395376,"about_ca_topic_score_gemma":0.002260739,"domain_scores_codex":[0.9984624,0.0005511274,0.00008258902,0.0003720874,0.0003206031,0.0002110803],"domain_scores_gemma":[0.991411,0.004398331,0.0004003388,0.002441591,0.0007334859,0.0006153072],"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.0001165158,0.0001081402,0.0007794355,0.0001457108,0.00002359079,0.0000357192,0.0001592013,0.0158349,0.002854022,0.8675222,0.008971318,0.1034492],"study_design_scores_gemma":[0.000021193,0.00001474462,0.0002150582,0.0000251615,0.00002559677,0.00006779057,0.00004969834,0.05672139,0.001801378,0.9334487,0.007592285,0.0000168855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019376,0.0006229888,0.8577277,0.001307791,0.0002231839,0.0001013224,0.0006096043,0.0007764801,0.03669327],"genre_scores_gemma":[0.5269099,0.0008543518,0.4407851,0.0006328381,0.0002376193,0.0002530195,0.001006539,0.0008739372,0.02844665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0115543,"threshold_uncertainty_score":0.03865302,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"R. E. L. Aldred","is_ca":false},{"name":"Ketan Dalal","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982966,0.0007005936,0.001071384,0.001441843,0.002591831,0.004795802,0.002010729,0.001995699,0.01577031],"category_scores_gemma":[0.00657508,0.0009323281,0.0009201904,0.001978939,0.001960022,0.005101284,0.002456384,0.002663603,0.001460442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001628493,"about_ca_system_score_gemma":0.0009537284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00173752,"about_ca_topic_score_gemma":0.002879967,"domain_scores_codex":[0.9987155,0.0003893042,0.00005722803,0.0003666782,0.0002005565,0.0002705963],"domain_scores_gemma":[0.9930878,0.00361928,0.0003821713,0.001706013,0.0005776782,0.0006270446],"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.0005479681,0.0002421241,0.002525927,0.000179589,0.00003430138,0.0001297614,0.000481363,0.01859721,0.007597958,0.8971931,0.01675212,0.05571866],"study_design_scores_gemma":[0.00006895886,0.00005079725,0.00124373,0.00005708522,0.00005182423,0.0002054083,0.0003124936,0.05289263,0.003925344,0.9317064,0.009456125,0.00002929723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6059786,0.0007317793,0.2483657,0.002718729,0.0004606124,0.0002246972,0.002161874,0.001126209,0.1382318],"genre_scores_gemma":[0.8520082,0.0004371091,0.1166504,0.0006581475,0.000177562,0.0001525441,0.002059799,0.0005366539,0.02731967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01577031,"threshold_uncertainty_score":0.05275697,"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","authors":[{"name":"Andrew Granville","is_ca":false},{"name":"Melvyn B. Nathanson","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918786,0.001024908,0.0008476885,0.002065219,0.001653951,0.003824424,0.001065437,0.0006241855,0.03996833],"category_scores_gemma":[0.000905233,0.0005518487,0.0007655917,0.002645025,0.002073044,0.004329286,0.002176414,0.003414334,0.01401598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001708112,"about_ca_system_score_gemma":0.0007302726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000745469,"about_ca_topic_score_gemma":0.0009628944,"domain_scores_codex":[0.9994475,0.00008497128,0.00002144967,0.0001147172,0.0002611291,0.00007021221],"domain_scores_gemma":[0.9996799,0.00008057187,0.00001859904,0.0001156006,0.00006917154,0.00003621974],"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.000008606851,0.00001230614,0.0000516002,0.00005418252,0.000005917456,0.00001581548,0.00007128546,0.000263619,0.0002171004,0.9400803,0.02721127,0.03200807],"study_design_scores_gemma":[0.000004728427,0.000006764708,0.0001446389,0.00003384736,0.00001101174,0.0001210352,0.00004765106,0.0005658763,0.0003846792,0.8384777,0.1601952,0.000006787695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.007446591,0.006778161,0.05302663,0.00269495,0.001374203,0.00002863479,0.0005653736,0.0007020503,0.9273834],"genre_scores_gemma":[0.2829955,0.01042083,0.03210067,0.001937255,0.002900253,0.0001655839,0.001729468,0.001185131,0.6665653],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.03996833,"threshold_uncertainty_score":0.1337074,"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","authors":[{"name":"Peter J‎. Cameron","is_ca":false},{"name":"Ashley Montanaro","is_ca":false},{"name":"Michael Newman","is_ca":false},{"name":"Simone Severini","is_ca":false},{"name":"Andreas Winter","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002028893,0.0006336467,0.0008061731,0.001918629,0.003001345,0.002599982,0.001561888,0.001529553,0.006166551],"category_scores_gemma":[0.00857051,0.0004842824,0.0006671883,0.001525327,0.008539109,0.008599585,0.00252942,0.00265192,0.0004422514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003810934,"about_ca_system_score_gemma":0.001426765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002712361,"about_ca_topic_score_gemma":0.002125941,"domain_scores_codex":[0.99841,0.000596464,0.00004364342,0.000378739,0.0002452908,0.0003257683],"domain_scores_gemma":[0.9890387,0.007521389,0.000975629,0.001178376,0.0004585902,0.0008272593],"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.00007602891,0.00002672539,0.0004897991,0.00003928876,0.00000927584,0.00003239893,0.0001734885,0.01167659,0.002007487,0.9823124,0.0007868719,0.002369635],"study_design_scores_gemma":[0.00003210983,0.0000326269,0.0004925271,0.00002377156,0.00001341442,0.00007071992,0.0001345832,0.05706206,0.001201523,0.9385074,0.002399192,0.00003005806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6707298,0.001138553,0.2529429,0.005696062,0.0001773188,0.0001544167,0.0006082891,0.000295945,0.0682567],"genre_scores_gemma":[0.9544798,0.0004973051,0.03925455,0.0004222336,0.0001463202,0.0001592801,0.0002117795,0.0001393687,0.004689387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006166551,"threshold_uncertainty_score":0.02765036,"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","authors":[{"name":"Bruce A. Reed","is_ca":true},{"name":"Cláudia Linhares Sales","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952893,0.002071237,0.002111602,0.00289792,0.001285915,0.004202599,0.002256609,0.001158456,0.04535632],"category_scores_gemma":[0.00250592,0.001131871,0.0008032156,0.01091191,0.001886173,0.007467652,0.001619936,0.004317194,0.03143856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329416,"about_ca_system_score_gemma":0.002165842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001934396,"about_ca_topic_score_gemma":0.003856224,"domain_scores_codex":[0.9993879,0.00009326179,0.00002708085,0.0001295654,0.0003150826,0.00004714218],"domain_scores_gemma":[0.9983712,0.0008891436,0.00006568653,0.0002818868,0.0002867893,0.0001052645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002809587,0.0000722072,0.0001227357,0.000867259,0.00001741676,0.00002926648,0.00007966249,0.002119567,0.000529207,0.1980718,0.4184888,0.379574],"study_design_scores_gemma":[0.00001109567,0.000008980625,0.0001467734,0.0001679221,0.00001592783,0.0001290081,0.00004035053,0.002925724,0.0002792363,0.1967189,0.7995436,0.0000125337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002458428,0.2029548,0.1786072,0.01101819,0.009949517,0.0001429196,0.001046722,0.003289668,0.5905327],"genre_scores_gemma":[0.02032395,0.2304267,0.1859087,0.003828559,0.009085294,0.0004314504,0.002399218,0.002103474,0.5454926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04535632,"threshold_uncertainty_score":0.151732,"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","authors":[{"name":"Glenn G. Chappell","is_ca":false},{"name":"John Gimbel","is_ca":false},{"name":"Chris Hartman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003300298,0.001815297,0.001770586,0.003634278,0.002066555,0.004211962,0.002278591,0.002294869,0.002886475],"category_scores_gemma":[0.02928195,0.001208755,0.00109407,0.003434665,0.004661749,0.01214126,0.005050482,0.004099519,0.000519122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003872769,"about_ca_system_score_gemma":0.0008644389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009902224,"about_ca_topic_score_gemma":0.001447356,"domain_scores_codex":[0.9950316,0.001570962,0.0002559322,0.001287972,0.00116909,0.0006843941],"domain_scores_gemma":[0.9602651,0.02654276,0.003084383,0.005591721,0.002061291,0.002454763],"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.0005300927,0.0001068966,0.01273608,0.0003702794,0.000192246,0.0002481834,0.0008951053,0.0975213,0.008041568,0.8323274,0.01027299,0.03675785],"study_design_scores_gemma":[0.0000413615,0.0001942573,0.007114071,0.0001196022,0.0000846632,0.0006591122,0.000331676,0.2270312,0.004407726,0.7471381,0.01272167,0.000156469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5381631,0.006527631,0.3916066,0.007548013,0.0003219208,0.0001236498,0.003415939,0.00106292,0.05123026],"genre_scores_gemma":[0.9260726,0.001574294,0.06803083,0.000427171,0.0003368946,0.0002031007,0.001004193,0.0002232555,0.002127703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004211962,"threshold_uncertainty_score":0.028099,"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","authors":[{"name":"Tao Wang","is_ca":false},{"name":"Qinglin Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139132,0.001275282,0.002044911,0.001785209,0.002014375,0.002436542,0.003643469,0.001661872,0.01003997],"category_scores_gemma":[0.01033524,0.0007725172,0.001016393,0.0044217,0.001914857,0.006027386,0.003306595,0.00257081,0.0009839442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002966887,"about_ca_system_score_gemma":0.002380085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008103118,"about_ca_topic_score_gemma":0.007884443,"domain_scores_codex":[0.9983353,0.0006098125,0.00005909504,0.0004292077,0.0002918193,0.0002747563],"domain_scores_gemma":[0.995032,0.002713332,0.0003196454,0.0009723143,0.0005414405,0.0004212015],"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.0003863114,0.0003144247,0.002019796,0.0003230534,0.00009565818,0.00009463718,0.0003945304,0.09592967,0.002310209,0.7495349,0.02047339,0.1281234],"study_design_scores_gemma":[0.00005281204,0.00003966409,0.0004932212,0.00003567938,0.00005381085,0.00006047947,0.0001311053,0.2414468,0.0006277566,0.7518572,0.005176227,0.00002523825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1913614,0.001286321,0.7607594,0.002096974,0.0002985981,0.0002740835,0.0009419002,0.0006413176,0.04234008],"genre_scores_gemma":[0.5682411,0.001304025,0.4001034,0.0008154894,0.0003228233,0.0003287769,0.001850096,0.000580347,0.02645392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01003997,"threshold_uncertainty_score":0.0335871,"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","authors":[{"name":"Tomasz Bartnicki","is_ca":false},{"name":"Jarosław Grytczuk","is_ca":false},{"name":"H. A. Kierstead","is_ca":false},{"name":"Xuding Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003340135,0.0007779425,0.0004777195,0.0004038479,0.001207916,0.00150614,0.001136749,0.001044137,0.07717574],"category_scores_gemma":[0.002618974,0.0002224615,0.0004279152,0.0003568674,0.0009212375,0.00221351,0.001692522,0.001283428,0.006102092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001193718,"about_ca_system_score_gemma":0.001142672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003776691,"about_ca_topic_score_gemma":0.004746252,"domain_scores_codex":[0.9994758,0.0001308774,0.00001966971,0.000110726,0.000128213,0.0001347588],"domain_scores_gemma":[0.9992058,0.000306331,0.00002619887,0.0001096202,0.00009822546,0.000253842],"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":[0.001573356,0.0008689439,0.00192723,0.0003117426,0.0000736724,0.000828526,0.000702153,0.02816549,0.01148377,0.6196318,0.1543025,0.1801309],"study_design_scores_gemma":[0.0005142617,0.000483466,0.001699949,0.00007938987,0.0000471196,0.0005118676,0.0005113433,0.2596296,0.006246234,0.5086232,0.2215586,0.00009496587],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1497121,0.000397496,0.2144908,0.007160191,0.001256794,0.001134735,0.003313202,0.005360233,0.6171745],"genre_scores_gemma":[0.7615032,0.0002585351,0.06987949,0.0009374078,0.0001445505,0.000720197,0.001778128,0.0005295713,0.1642489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07717574,"threshold_uncertainty_score":0.2581785,"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","authors":[{"name":"Ramón M. Figueroa-Centeno","is_ca":false},{"name":"Rikio Ichishima","is_ca":false},{"name":"Francesc A. Muntaner-Batle","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027294,0.0005788096,0.0007692746,0.002016243,0.002028089,0.002621658,0.001579959,0.001499489,0.01482996],"category_scores_gemma":[0.004453626,0.0005382138,0.0006361536,0.002605865,0.002459636,0.008294622,0.002898678,0.002757995,0.001835462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00163621,"about_ca_system_score_gemma":0.0007049382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521067,"about_ca_topic_score_gemma":0.003176632,"domain_scores_codex":[0.9989706,0.0003472818,0.00004480998,0.0002025924,0.0002275942,0.00020712],"domain_scores_gemma":[0.9961275,0.002243177,0.0003642658,0.0005939152,0.0002707747,0.0004003329],"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.00004782513,0.00002492533,0.0003619155,0.00009514139,0.000008932862,0.00003920049,0.0001092807,0.001907511,0.0005551639,0.9726712,0.008775023,0.01540388],"study_design_scores_gemma":[0.00001105483,0.000006715815,0.0002103088,0.00002687961,0.000006888208,0.00008286888,0.00009454189,0.006228698,0.0003903133,0.9854252,0.007509677,0.000007000212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2775422,0.005861848,0.3652454,0.008853268,0.0007813364,0.0001473661,0.002447303,0.0009765214,0.3381448],"genre_scores_gemma":[0.8140297,0.003546414,0.1230774,0.002098853,0.0006203968,0.0002311152,0.002544578,0.0003862273,0.05346533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01482996,"threshold_uncertainty_score":0.04961115,"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","authors":[{"name":"Levent Tunçel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000939737,0.002614104,0.001361021,0.001498617,0.0006459979,0.002226927,0.001494308,0.0009896415,0.02310005],"category_scores_gemma":[0.00184718,0.0009219298,0.001151967,0.003587149,0.002036446,0.002464386,0.001235561,0.004831455,0.01239987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141091,"about_ca_system_score_gemma":0.001133357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000873833,"about_ca_topic_score_gemma":0.001464042,"domain_scores_codex":[0.9991298,0.0002208024,0.00003993975,0.0001216915,0.0004487959,0.000039031],"domain_scores_gemma":[0.9991823,0.0005090121,0.00003573698,0.0001108767,0.000125921,0.00003613886],"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.00002512748,0.00009779391,0.00006811988,0.0007441078,0.00004566022,0.00008004835,0.00008859835,0.03998886,0.001276121,0.6401872,0.1369662,0.1804323],"study_design_scores_gemma":[0.00002555014,0.00003396639,0.0001287472,0.0003014738,0.00001645237,0.0002180921,0.00003542883,0.06108061,0.0007991278,0.5832433,0.3540822,0.00003506761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0008121092,0.02936631,0.7033125,0.001557063,0.001782039,0.0001201175,0.0004198771,0.0007452411,0.2618849],"genre_scores_gemma":[0.03757746,0.06901554,0.6870309,0.002594342,0.003206926,0.0008652204,0.001405763,0.001628306,0.1966756],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02310005,"threshold_uncertainty_score":0.07727736,"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","authors":[{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"Mekkia Kouider","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632936,0.001304632,0.001525062,0.002120388,0.00238203,0.00383134,0.002021525,0.001927559,0.006630872],"category_scores_gemma":[0.008776868,0.001197084,0.000926647,0.003623343,0.003926106,0.006398654,0.002807088,0.004026385,0.0009756409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002647164,"about_ca_system_score_gemma":0.00126064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004913881,"about_ca_topic_score_gemma":0.004062632,"domain_scores_codex":[0.9990013,0.0004504756,0.00003361773,0.0001876732,0.0001484149,0.0001785371],"domain_scores_gemma":[0.9904791,0.006629991,0.0006016109,0.0006466986,0.0005763739,0.00106637],"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.0002027321,0.00006932208,0.0009819677,0.0001773163,0.00002496035,0.00006396836,0.0003608715,0.01530606,0.001502447,0.947818,0.0148726,0.01861979],"study_design_scores_gemma":[0.00003352705,0.0000180295,0.0004228416,0.00003508144,0.00001227999,0.00006305501,0.0001188983,0.02702832,0.0002311501,0.9677969,0.004226977,0.00001281564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3753902,0.007972801,0.4714523,0.01557647,0.001310287,0.0001538097,0.001820056,0.0005686027,0.1257555],"genre_scores_gemma":[0.821946,0.007386068,0.1287871,0.003175566,0.001684928,0.0002525111,0.001901128,0.0005417778,0.03432506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006630872,"threshold_uncertainty_score":0.02218246,"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","authors":[{"name":"R. A. Bailey","is_ca":false},{"name":"Karen Meagher","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018811,0.0007382287,0.0009048807,0.003180888,0.002029912,0.00308664,0.0007961998,0.0007833738,0.003908481],"category_scores_gemma":[0.004958178,0.0005567325,0.0004981837,0.002726165,0.003856378,0.005021331,0.003020292,0.002672964,0.0006143721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002161608,"about_ca_system_score_gemma":0.0005320426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001332536,"about_ca_topic_score_gemma":0.00116596,"domain_scores_codex":[0.9989107,0.0002882581,0.00005748565,0.0002449826,0.0003057482,0.0001928374],"domain_scores_gemma":[0.9966815,0.001723433,0.000320252,0.0003090563,0.0003393563,0.0006264509],"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.00004954235,0.00002025171,0.0008652341,0.00007161283,0.00002050557,0.00005476825,0.0002857079,0.003448491,0.001063144,0.9659951,0.01436807,0.01375751],"study_design_scores_gemma":[0.000009940148,0.00002076012,0.001013488,0.00002959384,0.00001088856,0.00013425,0.0001034278,0.009382323,0.0005261164,0.9712577,0.01748093,0.00003063504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6098542,0.02667216,0.1481914,0.0268255,0.003146063,0.0001217647,0.002183879,0.000562386,0.1824427],"genre_scores_gemma":[0.956033,0.005411256,0.02397506,0.001314468,0.002193384,0.0001187064,0.0006436461,0.0001806438,0.01012979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003908481,"threshold_uncertainty_score":0.01568365,"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","authors":[{"name":"Michael Baake","is_ca":false},{"name":"Robert V. Moody","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003544664,0.0005757526,0.0008661762,0.001578414,0.001719069,0.002904935,0.0009351841,0.001108004,0.009617011],"category_scores_gemma":[0.001534596,0.0007892043,0.0007548749,0.001903156,0.002338869,0.005274555,0.002313523,0.003359403,0.001203678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001178069,"about_ca_system_score_gemma":0.0003637774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100841,"about_ca_topic_score_gemma":0.0008850857,"domain_scores_codex":[0.9996586,0.00005306134,0.00001749031,0.00009095485,0.0001239158,0.00005595385],"domain_scores_gemma":[0.9992673,0.0004337457,0.00005707777,0.0001115799,0.00006657024,0.00006378485],"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.00001483901,0.000006778907,0.0000411357,0.00003009122,0.000001427934,0.0000225983,0.0000816664,0.0008755453,0.0003490165,0.9908021,0.00176096,0.006013852],"study_design_scores_gemma":[0.000005298012,0.000004857354,0.00007058097,0.00001209801,0.000002651803,0.00004992689,0.0000772581,0.002854521,0.0003592493,0.9902822,0.006277243,0.000004093507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1917914,0.004523663,0.4043826,0.00289124,0.0006917199,0.00008750127,0.0009438025,0.0006721485,0.394016],"genre_scores_gemma":[0.8136166,0.003239183,0.0941148,0.0007007886,0.0005942186,0.0001827834,0.001098264,0.0005922192,0.08586112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009617011,"threshold_uncertainty_score":0.03217208,"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","authors":[{"name":"Frédéric Havet","is_ca":false},{"name":"Min‐Li Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006896381,0.001028783,0.0007968886,0.001903937,0.0009434879,0.004605981,0.002290852,0.001451421,0.4450425],"category_scores_gemma":[0.003969661,0.0008891743,0.0007382421,0.003259584,0.0006885867,0.005352017,0.002021085,0.002776742,0.3194176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002346203,"about_ca_system_score_gemma":0.001208854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00600731,"about_ca_topic_score_gemma":0.008347805,"domain_scores_codex":[0.9995046,0.0001048863,0.00004785851,0.00009387639,0.0001916631,0.00005699862],"domain_scores_gemma":[0.9982729,0.0005075005,0.0001107098,0.0004653028,0.00050658,0.0001370463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005994669,0.0000264495,0.000150199,0.0002003658,0.000007148067,0.00003954077,0.0001184788,0.0004272293,0.00130611,0.07012647,0.8782274,0.04931059],"study_design_scores_gemma":[0.00002757014,0.000009249894,0.0003610554,0.00005702074,0.000005546722,0.0001091262,0.00006400976,0.002658476,0.003801919,0.04710893,0.9457686,0.00002858127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.002422397,0.000361147,0.2685578,0.006655518,0.001303294,0.0002673129,0.09349537,0.09818438,0.5287527],"genre_scores_gemma":[0.0459476,0.001630187,0.2206762,0.002945776,0.0007043448,0.0006622947,0.1578466,0.08924015,0.4803469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4450425,"threshold_uncertainty_score":0.7915795,"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","authors":[{"name":"Juan A. Rodríguez‐Velázquez","is_ca":false},{"name":"Ismael G. Yero","is_ca":false},{"name":"Dorota Kuziak","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019371,0.001146962,0.002040393,0.003840595,0.003337446,0.006688658,0.002846073,0.002246719,0.005300107],"category_scores_gemma":[0.01670055,0.001385987,0.0012704,0.004879361,0.008770631,0.01973317,0.006937521,0.005422974,0.0004192854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002794605,"about_ca_system_score_gemma":0.001025373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001777558,"about_ca_topic_score_gemma":0.001491475,"domain_scores_codex":[0.9970006,0.001319587,0.0001752248,0.000611836,0.0005284944,0.0003642455],"domain_scores_gemma":[0.974637,0.01729647,0.002328134,0.001878516,0.001269507,0.00259033],"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.00006734068,0.00002118867,0.0007487844,0.0000494942,0.00001312513,0.0000227193,0.0002985454,0.00152851,0.0001997977,0.9929367,0.001018273,0.00309544],"study_design_scores_gemma":[0.00001379077,0.00001844378,0.0005040391,0.00001971761,0.00001393857,0.0000608204,0.00013407,0.007222409,0.0001511546,0.9903274,0.00151632,0.0000179536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6891646,0.006121308,0.240156,0.009878978,0.0003942639,0.00007258384,0.001342028,0.0002359542,0.05263428],"genre_scores_gemma":[0.9570451,0.001889781,0.03307509,0.0006578015,0.0005628493,0.0001062994,0.0006214961,0.0001203148,0.005921304],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006688658,"threshold_uncertainty_score":0.02125669,"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","authors":[{"name":"Melodie Fehr","is_ca":true},{"name":"Shonda Gosselin","is_ca":true},{"name":"Ortrud R. Oellermann","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220059,0.0008047479,0.001128838,0.003297402,0.002969236,0.006003143,0.001950011,0.001813808,0.006137641],"category_scores_gemma":[0.006001667,0.001124904,0.0007819597,0.003443313,0.004103498,0.007987118,0.002401558,0.00313108,0.0004141487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002931332,"about_ca_system_score_gemma":0.0007782785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002396466,"about_ca_topic_score_gemma":0.00265345,"domain_scores_codex":[0.9992181,0.0002627088,0.00003225679,0.0001881491,0.00014541,0.0001533214],"domain_scores_gemma":[0.9937727,0.004236553,0.000596627,0.0004585811,0.0002545259,0.0006811147],"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.00005750509,0.00001830485,0.0006709783,0.00004979423,0.00001293923,0.00002264591,0.0002677048,0.003194089,0.000442693,0.9898122,0.00185758,0.003593517],"study_design_scores_gemma":[0.00001985752,0.000008529568,0.0005165084,0.00001989469,0.00001421899,0.00004954536,0.000108908,0.01033261,0.0002977522,0.9869976,0.001621239,0.00001345076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8433448,0.003513435,0.08261134,0.004829555,0.0002906005,0.00005008755,0.00113251,0.0002238221,0.06400383],"genre_scores_gemma":[0.9730056,0.001607321,0.01326253,0.0005055596,0.000385188,0.00009401049,0.0006548857,0.0001017226,0.01038315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006137641,"threshold_uncertainty_score":0.02126837,"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","authors":[{"name":"Ali Ahmad","is_ca":false},{"name":"Martin Bača","is_ca":false},{"name":"Yasir Bashir","is_ca":false},{"name":"Muhammad Kamran Siddiqui","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559868,0.0004517178,0.0008294426,0.002273107,0.001770444,0.002677786,0.001351085,0.001095859,0.008709121],"category_scores_gemma":[0.008949172,0.000547221,0.0006162949,0.001462276,0.002051178,0.004539339,0.002324605,0.001653219,0.0007672438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009163303,"about_ca_system_score_gemma":0.000478484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005614311,"about_ca_topic_score_gemma":0.0005623702,"domain_scores_codex":[0.9986432,0.0004218353,0.00007416771,0.0003182088,0.0003179719,0.0002245796],"domain_scores_gemma":[0.9900233,0.005310215,0.00128142,0.001157735,0.0009703583,0.001256915],"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.0004126573,0.00007273471,0.005268564,0.0001898491,0.00006154798,0.0003143721,0.0003578278,0.008649303,0.005910838,0.9562641,0.003836048,0.01866212],"study_design_scores_gemma":[0.00005103331,0.0001066219,0.003333668,0.0000645375,0.0000971578,0.00080616,0.0004058755,0.05315398,0.005162709,0.9302127,0.006556317,0.00004919757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8313795,0.0006127364,0.1042326,0.00112065,0.0001707136,0.00006504862,0.0007706801,0.0002613753,0.06138671],"genre_scores_gemma":[0.9829063,0.0002060683,0.01138042,0.0001206523,0.00008232687,0.00004983135,0.0003086229,0.0000701579,0.004875669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008709121,"threshold_uncertainty_score":0.02913493,"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","authors":[{"name":"Bing Yao","is_ca":false},{"name":"Hui Cheng","is_ca":false},{"name":"Yao Ming","is_ca":false},{"name":"Meimei Zhao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784929,0.0009482666,0.000951785,0.001474172,0.002555999,0.003150698,0.00182321,0.001600855,0.01725872],"category_scores_gemma":[0.005825154,0.0006316153,0.001092736,0.002771139,0.004335319,0.009412888,0.00474729,0.007269692,0.003815795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002055536,"about_ca_system_score_gemma":0.001163739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002724306,"about_ca_topic_score_gemma":0.004350436,"domain_scores_codex":[0.998722,0.000365625,0.00005741908,0.0002939987,0.0003806985,0.0001801886],"domain_scores_gemma":[0.9954706,0.002839781,0.0001615669,0.0008604006,0.0002657551,0.0004019474],"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.00002799565,0.00002000793,0.0001481739,0.00009280648,0.000007054513,0.00007543415,0.0001390516,0.001042668,0.0004962249,0.956397,0.02503135,0.01652223],"study_design_scores_gemma":[0.000005017606,0.0000101624,0.0001301108,0.00003056688,0.000006647572,0.00008247612,0.00005133812,0.001650575,0.0002990241,0.947388,0.05033547,0.00001065306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03018262,0.0142554,0.3875914,0.04069439,0.008231443,0.0001344622,0.001557716,0.002046888,0.5153057],"genre_scores_gemma":[0.5169793,0.02596892,0.2616983,0.01704849,0.01089404,0.0004243322,0.001838477,0.002006817,0.1631414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01725872,"threshold_uncertainty_score":0.05773622,"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","authors":[{"name":"Béla Bollobás","is_ca":false},{"name":"Dieter Mitsche","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234725,0.001073758,0.001501782,0.003357992,0.001560558,0.003634191,0.001287622,0.001472272,0.00275329],"category_scores_gemma":[0.01511896,0.0005353714,0.0008535144,0.002720976,0.003530754,0.005892543,0.002459012,0.002355356,0.0004149776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0026384,"about_ca_system_score_gemma":0.0005565136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001101192,"about_ca_topic_score_gemma":0.0007067419,"domain_scores_codex":[0.9974446,0.001177143,0.0001156498,0.0004999978,0.0004868126,0.0002757796],"domain_scores_gemma":[0.9838594,0.01095264,0.001554233,0.001493032,0.0009094105,0.001231239],"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.00007883496,0.00002833626,0.00173745,0.0001610007,0.00006223602,0.00006013484,0.0002077532,0.01439374,0.001014554,0.9702899,0.0037782,0.008187843],"study_design_scores_gemma":[0.00001557403,0.00003948779,0.001334646,0.00003656453,0.00002146592,0.0001615544,0.00008775867,0.05252695,0.0004507027,0.9394442,0.005848685,0.00003231539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4119771,0.01842133,0.5102054,0.007709044,0.000429315,0.000185208,0.003659169,0.0005172126,0.0468962],"genre_scores_gemma":[0.9388409,0.005479979,0.04835487,0.0006961502,0.0007507964,0.0003080313,0.001404856,0.0001516132,0.004012864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003634191,"threshold_uncertainty_score":0.01914304,"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","authors":[{"name":"Hongliang Lu","is_ca":false},{"name":"Qinglin Yu","is_ca":true},{"name":"Cun‐Quan Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666302,0.0009819996,0.001326285,0.001781436,0.001216265,0.002439031,0.002512935,0.001317532,0.005255909],"category_scores_gemma":[0.007974883,0.0007784527,0.000777439,0.002685648,0.001112741,0.003493536,0.001937298,0.00159395,0.0006821316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001586296,"about_ca_system_score_gemma":0.0007838244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002473815,"about_ca_topic_score_gemma":0.003549934,"domain_scores_codex":[0.9986284,0.0005283871,0.00006711009,0.0002754652,0.0002581433,0.0002425782],"domain_scores_gemma":[0.9950447,0.002205593,0.0004953038,0.001136913,0.0005525179,0.0005649307],"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.0007235257,0.0004047124,0.007230715,0.0004920554,0.0001544421,0.0002137951,0.0005373373,0.1346569,0.01542024,0.656422,0.01543873,0.1683056],"study_design_scores_gemma":[0.0000520074,0.00006147701,0.001523443,0.00004034819,0.00006210571,0.0001649737,0.0001404853,0.2835532,0.004367365,0.7041999,0.005807159,0.00002747915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4387838,0.0007619894,0.5354197,0.0009419607,0.0001834769,0.0001372509,0.0008792348,0.000693296,0.02219922],"genre_scores_gemma":[0.7621334,0.0004270602,0.2185587,0.0003339548,0.000135793,0.000141332,0.001197185,0.0004466283,0.01662599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005255909,"threshold_uncertainty_score":0.01758277,"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","authors":[{"name":"Tsuyoshi Andô","is_ca":false},{"name":"Minghua Lin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00498712,0.004064693,0.003717791,0.005601916,0.003683686,0.009083054,0.00758142,0.00401161,0.04192469],"category_scores_gemma":[0.03704614,0.002508708,0.004323122,0.006800974,0.008641183,0.01280142,0.01149643,0.01905879,0.007384924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007217344,"about_ca_system_score_gemma":0.003935723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00565919,"about_ca_topic_score_gemma":0.006025252,"domain_scores_codex":[0.9940958,0.001153291,0.0002582181,0.001836361,0.001543593,0.00111277],"domain_scores_gemma":[0.9514182,0.03531683,0.001470058,0.005805412,0.003396671,0.002592976],"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.0008433893,0.0006923497,0.002844529,0.001632901,0.0002686803,0.0003769882,0.0009202722,0.02950027,0.008342488,0.8190538,0.09058618,0.04493823],"study_design_scores_gemma":[0.0001366351,0.00009409877,0.001314423,0.0002235544,0.0001110813,0.0002540153,0.0001814275,0.04816581,0.00237311,0.9282705,0.01875958,0.0001158704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08909248,0.005919317,0.6121877,0.05850383,0.005924784,0.0005426126,0.008952199,0.003861402,0.2150158],"genre_scores_gemma":[0.7064488,0.005057768,0.2196452,0.01662626,0.007666505,0.001641052,0.008799545,0.002010506,0.03210437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04192469,"threshold_uncertainty_score":0.1402521,"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","authors":[{"name":"Murtaza Ali","is_ca":false},{"name":"Gohar Ali","is_ca":false},{"name":"Muhammad Imran","is_ca":false},{"name":"Abdul Qudair Baig","is_ca":false},{"name":"Muhammad Kashif Shafiq","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833249,0.00057041,0.0005870507,0.002512577,0.001139583,0.001691031,0.0007075962,0.0006230085,0.003103403],"category_scores_gemma":[0.00297155,0.0003177132,0.0004937525,0.001496671,0.002625218,0.002623698,0.001823446,0.001133371,0.0003746883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244709,"about_ca_system_score_gemma":0.0003080824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001023041,"about_ca_topic_score_gemma":0.0006319209,"domain_scores_codex":[0.9993464,0.0001661507,0.00003263558,0.0001583031,0.0001441466,0.0001523397],"domain_scores_gemma":[0.9979284,0.0008797049,0.0003690576,0.0002019145,0.0002078118,0.0004131129],"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.0000867367,0.00003158734,0.00186101,0.00007487817,0.00001804924,0.000121403,0.0005041815,0.00308145,0.002544295,0.9813647,0.001502421,0.008809333],"study_design_scores_gemma":[0.00002415377,0.00007552623,0.002702861,0.00004382442,0.00001869395,0.0003300024,0.0002939065,0.01861948,0.001053678,0.9689146,0.007885315,0.0000378657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8931292,0.002267221,0.05291029,0.001207849,0.000160353,0.00003817325,0.0005232582,0.0001304335,0.04963323],"genre_scores_gemma":[0.9826229,0.001054796,0.01227256,0.0001546677,0.0001959815,0.00004378914,0.0002468236,0.00004168017,0.003366887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003103403,"threshold_uncertainty_score":0.01038194,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Damir Vukičević","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00139427,0.0005051816,0.001240933,0.001587629,0.001882494,0.001722697,0.001617697,0.001511735,0.008627245],"category_scores_gemma":[0.009195258,0.0005152475,0.0005826409,0.001843117,0.00211001,0.004116508,0.001827653,0.001862591,0.0007828574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00211506,"about_ca_system_score_gemma":0.0009204329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00312209,"about_ca_topic_score_gemma":0.008244512,"domain_scores_codex":[0.9994585,0.0002103175,0.00001878733,0.0001132982,0.0001072917,0.00009177625],"domain_scores_gemma":[0.9973543,0.001947739,0.0001667837,0.0002074743,0.0001679316,0.000155819],"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.0003871834,0.00009829672,0.001877239,0.0002897485,0.00007874018,0.00008061007,0.0001929137,0.08997326,0.001348659,0.8119971,0.02474713,0.0689292],"study_design_scores_gemma":[0.0001213359,0.00007600268,0.0007930046,0.00008159786,0.00004891124,0.00007821265,0.00009797974,0.1623022,0.0009595735,0.8262645,0.009141112,0.00003547918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2600691,0.01535307,0.5744116,0.01337463,0.001139282,0.000216478,0.001238446,0.0007383778,0.133459],"genre_scores_gemma":[0.7779011,0.003931334,0.1891455,0.001642399,0.0006886653,0.0002467004,0.0008719237,0.0004504424,0.02512203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008627245,"threshold_uncertainty_score":0.02886099,"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","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Gordon Royle","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403753,0.0007877268,0.001060197,0.004149482,0.00226949,0.005738939,0.002044613,0.001968961,0.01214968],"category_scores_gemma":[0.007590409,0.0007841346,0.000585242,0.002877612,0.004406326,0.007286124,0.001799458,0.002446271,0.0009711703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001987442,"about_ca_system_score_gemma":0.0009969396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321799,"about_ca_topic_score_gemma":0.003105115,"domain_scores_codex":[0.9988301,0.0003358895,0.00005589735,0.0002592765,0.0002457268,0.0002731242],"domain_scores_gemma":[0.98858,0.006609566,0.002112045,0.0007539775,0.0005937959,0.0013505],"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.0005743185,0.0001637011,0.006156643,0.0002023813,0.00005229567,0.0001695721,0.0007905863,0.01618445,0.005709951,0.9423093,0.009587476,0.01809932],"study_design_scores_gemma":[0.000104032,0.00008275726,0.003339645,0.00004663548,0.0000475206,0.0003697632,0.0003501392,0.04103542,0.001824884,0.9481837,0.004529535,0.00008605173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8986923,0.001256833,0.04123744,0.005767418,0.0002489976,0.00005876726,0.002026761,0.0003625729,0.05034905],"genre_scores_gemma":[0.9810626,0.0005238751,0.009576154,0.0002696012,0.0003872942,0.00005762475,0.000645317,0.00008917652,0.00738831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01214968,"threshold_uncertainty_score":0.04064476,"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","authors":[{"name":"Tiziana Calamoneri","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Rossella Petreschi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002213209,0.0006872657,0.001801464,0.001651582,0.003381325,0.005211563,0.002401433,0.00459152,0.01365773],"category_scores_gemma":[0.01929701,0.001030359,0.001188481,0.002590971,0.003806076,0.01304268,0.00464067,0.006617167,0.002119362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002521273,"about_ca_system_score_gemma":0.001805441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001600842,"about_ca_topic_score_gemma":0.001817648,"domain_scores_codex":[0.9972304,0.0007314218,0.0002185321,0.0007733885,0.0005355255,0.0005107885],"domain_scores_gemma":[0.9746902,0.01775134,0.001136309,0.003262551,0.001426573,0.001732922],"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.0005744005,0.0001628793,0.001180764,0.0002116371,0.00002201927,0.0001229278,0.0004832594,0.004086524,0.006961957,0.9458808,0.01260734,0.02770547],"study_design_scores_gemma":[0.00008570677,0.00005500015,0.000451486,0.00003978003,0.00002504017,0.0001730479,0.0002404675,0.01725057,0.004109651,0.9701409,0.007397163,0.0000311139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3625937,0.0008476348,0.5390951,0.01105942,0.0006722499,0.0002232382,0.002698761,0.001829366,0.08098053],"genre_scores_gemma":[0.7451622,0.0006964701,0.2257178,0.002613288,0.000582294,0.0003406651,0.00344115,0.0008105619,0.02063554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01365773,"threshold_uncertainty_score":0.04568964,"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","authors":[{"name":"P. D. Loly","is_ca":true},{"name":"Ian Cameron","is_ca":true},{"name":"Walter Trump","is_ca":false},{"name":"Daniel Schindel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902782,0.0004954365,0.0006825654,0.0016674,0.00189371,0.002458144,0.0008940425,0.00113942,0.01961946],"category_scores_gemma":[0.001891787,0.0003833701,0.0005044523,0.001441891,0.002139285,0.004636271,0.001779551,0.002703408,0.002169124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000827635,"about_ca_system_score_gemma":0.000493745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005672105,"about_ca_topic_score_gemma":0.0006754601,"domain_scores_codex":[0.9995638,0.00009242106,0.00001483456,0.0001489547,0.0001163231,0.00006381169],"domain_scores_gemma":[0.999193,0.0003053069,0.00008395867,0.0001382548,0.0001383775,0.0001410442],"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.00001308685,0.000007983683,0.00004885545,0.00001485388,0.000002162588,0.00001224734,0.0000479645,0.0001991248,0.0003666984,0.9913524,0.002665561,0.005268953],"study_design_scores_gemma":[0.000004685704,0.000002965134,0.0000548571,0.000003828341,0.000001859603,0.00003284235,0.00002708281,0.001402051,0.0002670478,0.9946014,0.003597207,0.000004206218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.199322,0.002829941,0.304925,0.007034778,0.001175451,0.00007515949,0.0008243189,0.000954583,0.4828588],"genre_scores_gemma":[0.8622013,0.001202084,0.0559209,0.001532369,0.001045103,0.0001116573,0.0006566957,0.000328645,0.0770013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01961946,"threshold_uncertainty_score":0.06563365,"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","authors":[{"name":"Luis Goddyn","is_ca":true},{"name":"R. Bruce Richter","is_ca":true},{"name":"Jozef Širáň","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876962,0.0008154421,0.0008143682,0.001320775,0.001405329,0.003925196,0.001597248,0.001571509,0.01094623],"category_scores_gemma":[0.004095304,0.0009383328,0.001239733,0.001376375,0.002440017,0.005310233,0.003152495,0.003099548,0.001357569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115978,"about_ca_system_score_gemma":0.0004813769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001385273,"about_ca_topic_score_gemma":0.002199549,"domain_scores_codex":[0.9992197,0.0001654111,0.00005503299,0.0002215067,0.000177191,0.0001611074],"domain_scores_gemma":[0.996653,0.001493114,0.000481628,0.0007912936,0.0002238473,0.0003571446],"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.0001240304,0.00005211538,0.000429931,0.00008058512,0.00001046556,0.0001309129,0.0006950861,0.005360767,0.002424702,0.9747362,0.002587487,0.01336771],"study_design_scores_gemma":[0.00001765395,0.00001451059,0.0002072434,0.00001599105,0.00001025624,0.0000680783,0.0001422084,0.01060318,0.0006671445,0.9855303,0.002710853,0.00001258693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5278034,0.0004568692,0.3958981,0.001051139,0.0002537361,0.0001719217,0.001495488,0.001205091,0.0716642],"genre_scores_gemma":[0.8884711,0.0005536118,0.08676632,0.0004726803,0.0002099877,0.0002136125,0.002396706,0.0008541437,0.02006178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01094623,"threshold_uncertainty_score":0.03661883,"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","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Louis Esperet","is_ca":false},{"name":"Cyril Gavoille","is_ca":false},{"name":"Gwenaël Joret","is_ca":false},{"name":"Piotr Micek","is_ca":false},{"name":"Pat Morin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004435674,0.0004060278,0.0003304352,0.0005944269,0.001088156,0.001218004,0.001004489,0.0006498809,0.007491298],"category_scores_gemma":[0.003868899,0.0002872295,0.0004049713,0.001279861,0.001198361,0.002820682,0.001567929,0.001167236,0.001478075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215406,"about_ca_system_score_gemma":0.0008681402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002215891,"about_ca_topic_score_gemma":0.002545632,"domain_scores_codex":[0.999405,0.0001422653,0.00001931159,0.0001669339,0.000156262,0.0001101146],"domain_scores_gemma":[0.9976418,0.001131388,0.0002869403,0.0006091128,0.0002105132,0.0001202961],"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.0001434991,0.00007518165,0.0009245399,0.0002524569,0.00001453379,0.00008839298,0.0003143627,0.05581344,0.01571206,0.7858784,0.009510144,0.1312728],"study_design_scores_gemma":[0.00002826704,0.0001038795,0.0008037242,0.0000424296,0.00003088515,0.0002430503,0.000167504,0.1587678,0.01037229,0.7965072,0.03289392,0.00003905605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1167635,0.0004707385,0.8396614,0.001114246,0.00009145607,0.00009085172,0.0005271056,0.001652584,0.03962823],"genre_scores_gemma":[0.5879918,0.0008257546,0.3939511,0.0004172936,0.00009198837,0.0001749062,0.001093038,0.0003264333,0.01512778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007491298,"threshold_uncertainty_score":0.02506089,"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","authors":[{"name":"David Dolžan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004959698,0.0002886532,0.0004373605,0.001918381,0.0008468949,0.001403575,0.0006192166,0.0003913536,0.002427629],"category_scores_gemma":[0.001577236,0.0002018392,0.0002914137,0.0009658824,0.001738598,0.00224968,0.0007516705,0.0004551837,0.0001367985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008472597,"about_ca_system_score_gemma":0.000341166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001113115,"about_ca_topic_score_gemma":0.001103851,"domain_scores_codex":[0.9997105,0.00008848491,0.00001202488,0.0000658197,0.00006425338,0.00005887894],"domain_scores_gemma":[0.9984988,0.0006357041,0.0002460957,0.0001255181,0.0001629707,0.0003308328],"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.0001238832,0.00002812693,0.003579557,0.00009576229,0.00003823898,0.0001268371,0.0003393145,0.01669301,0.005964321,0.9642507,0.001344727,0.007415522],"study_design_scores_gemma":[0.00002984048,0.00009305344,0.005778974,0.00002965251,0.0000443883,0.0003926852,0.0003566637,0.09032644,0.004745523,0.8936652,0.004488595,0.00004904915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9625921,0.0002677023,0.02652548,0.0003113223,0.00002968318,0.00001078444,0.0001838037,0.00005755732,0.01002142],"genre_scores_gemma":[0.9916848,0.0001846514,0.006340949,0.00003976141,0.00003910086,0.00001206557,0.0001471918,0.00002288258,0.001528509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002427629,"threshold_uncertainty_score":0.008121252,"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","authors":[{"name":"Daniele Parisse","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014831,0.0006519812,0.0007421704,0.002817965,0.001763154,0.00311193,0.001227019,0.001267333,0.00650556],"category_scores_gemma":[0.006972622,0.0004459604,0.0006067002,0.002772936,0.002558087,0.005416499,0.001911299,0.00194503,0.0008396739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564601,"about_ca_system_score_gemma":0.0005923637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001432276,"about_ca_topic_score_gemma":0.001936476,"domain_scores_codex":[0.9991189,0.0003214423,0.00005508383,0.000147636,0.0002014871,0.0001554455],"domain_scores_gemma":[0.9949882,0.002740377,0.0008541013,0.0003592818,0.0003756428,0.0006823749],"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.00006023248,0.00003338328,0.001050851,0.00009095128,0.00001508438,0.00007918618,0.000188727,0.003227765,0.001007494,0.97943,0.004615394,0.01020092],"study_design_scores_gemma":[0.00001759482,0.00003897355,0.001903333,0.00003829829,0.000017378,0.0002757056,0.0002404123,0.01382697,0.000628553,0.976683,0.006297347,0.00003248409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6560091,0.005472433,0.1485402,0.005573258,0.0004191606,0.0001314334,0.002399796,0.0004476194,0.1810071],"genre_scores_gemma":[0.9604867,0.001852331,0.02568839,0.0005525115,0.0003619574,0.0001434245,0.001082387,0.0001276741,0.00970471],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00650556,"threshold_uncertainty_score":0.02176321,"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","authors":[{"name":"Suzanne M. Seager","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594542,0.001109985,0.00180534,0.00197729,0.002575612,0.002693454,0.002709285,0.004496465,0.009943124],"category_scores_gemma":[0.005404162,0.001032657,0.0009127859,0.002027561,0.002440046,0.006635736,0.003394776,0.001717782,0.001656537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001313768,"about_ca_system_score_gemma":0.000974403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004023254,"about_ca_topic_score_gemma":0.004397035,"domain_scores_codex":[0.9989997,0.0002513639,0.00004234122,0.0003760274,0.0001436121,0.000186935],"domain_scores_gemma":[0.996709,0.002090906,0.0003511829,0.000393028,0.0001605243,0.0002952973],"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.000941632,0.0003985714,0.004851937,0.0008575063,0.0001416088,0.001254152,0.001252779,0.3280098,0.01587534,0.5414003,0.01366611,0.09135037],"study_design_scores_gemma":[0.00008858702,0.0001469533,0.001323023,0.0001073599,0.00006240489,0.0005669422,0.001241157,0.4841733,0.007568324,0.4952214,0.009438681,0.00006188254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3740084,0.0004902266,0.5859928,0.002910071,0.0001484373,0.000219664,0.001058493,0.0008366561,0.03433532],"genre_scores_gemma":[0.6539686,0.0004675992,0.3228131,0.000210564,0.0000724355,0.0001545487,0.001022162,0.0003015749,0.02098944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009943124,"threshold_uncertainty_score":0.03326309,"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","authors":[{"name":"Muhammad Imran","is_ca":false},{"name":"Abdul Qudair Baig","is_ca":false},{"name":"Muhammad Kashif Shafiq","is_ca":false},{"name":"Ioan Tomescu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862686,0.0004252696,0.0003718121,0.001543684,0.001337853,0.001264621,0.0005476001,0.0007879437,0.002197141],"category_scores_gemma":[0.002158621,0.0002622831,0.0003124886,0.001208829,0.001971851,0.002571302,0.00128051,0.0009411568,0.0002005902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009559738,"about_ca_system_score_gemma":0.0002867677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007644264,"about_ca_topic_score_gemma":0.000691853,"domain_scores_codex":[0.9995708,0.0001201848,0.00001504809,0.0001065369,0.00009035002,0.00009717911],"domain_scores_gemma":[0.9983853,0.0008245354,0.0003460438,0.0001349044,0.0000994933,0.0002096597],"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.0001233807,0.00004208835,0.004401574,0.0001063164,0.00002938422,0.0002043575,0.0005836199,0.008220056,0.00379202,0.9660351,0.002199824,0.01426239],"study_design_scores_gemma":[0.00002156349,0.00006865148,0.004162083,0.00003009711,0.00002400304,0.0005941464,0.0003715767,0.02595559,0.002550886,0.9581478,0.008037137,0.00003641938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9234059,0.001303112,0.04293064,0.001381514,0.0001063773,0.00002871937,0.0003119627,0.00007042596,0.03046134],"genre_scores_gemma":[0.9879416,0.0005465479,0.009035693,0.0001625114,0.0001002579,0.00002312465,0.0002046841,0.00001730576,0.001968347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002197141,"threshold_uncertainty_score":0.007350206,"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","authors":[{"name":"Frédéric Havet","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Jean‐Sébastien Sereni","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727329,0.0009100495,0.001646003,0.001974501,0.002834344,0.005341665,0.002469779,0.003511015,0.01029964],"category_scores_gemma":[0.008545183,0.001249293,0.001527068,0.002935651,0.002999817,0.005986944,0.002972226,0.004147998,0.001843981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003653278,"about_ca_system_score_gemma":0.001320918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002716259,"about_ca_topic_score_gemma":0.003387598,"domain_scores_codex":[0.9974111,0.001125464,0.0001301068,0.0006911602,0.0002770253,0.0003652342],"domain_scores_gemma":[0.9861264,0.008855218,0.001359747,0.001822056,0.000790478,0.001046194],"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.0004057257,0.000159352,0.001779187,0.0005718328,0.00003643826,0.0001567783,0.0008537483,0.01971146,0.005270842,0.9049143,0.01767132,0.04846909],"study_design_scores_gemma":[0.00004304906,0.00002474355,0.0006757253,0.00004798166,0.00001550579,0.0001115903,0.0001612617,0.02834084,0.001428493,0.9637685,0.005360118,0.00002221625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3520621,0.001303294,0.5654972,0.006963774,0.0004158216,0.0002141607,0.003988913,0.001558154,0.06799658],"genre_scores_gemma":[0.6312146,0.0009616957,0.3171532,0.002457755,0.0005359845,0.0004898585,0.006459171,0.001146246,0.0395816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01029964,"threshold_uncertainty_score":0.03445578,"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","authors":[{"name":"EsperetLouis","is_ca":false},{"name":"MorinPat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003267278,0.0003138121,0.0002880539,0.0005251492,0.001002718,0.001064648,0.0008301531,0.0005412063,0.005771394],"category_scores_gemma":[0.003220163,0.000233439,0.0003097751,0.001031311,0.001124614,0.002326122,0.001487967,0.001036186,0.001074061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009083876,"about_ca_system_score_gemma":0.0006330126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001671017,"about_ca_topic_score_gemma":0.001884639,"domain_scores_codex":[0.9995598,0.0001071921,0.00001614209,0.000111838,0.0001240487,0.00008101353],"domain_scores_gemma":[0.9982252,0.0008144338,0.0002270404,0.0004613103,0.0001825489,0.00008956115],"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.0001174835,0.00005338752,0.0007440015,0.000208533,0.00001128561,0.00009682713,0.000273211,0.04345078,0.01807395,0.8251806,0.006567616,0.1052222],"study_design_scores_gemma":[0.00001851264,0.00008240071,0.0005746249,0.00003396797,0.00002212362,0.0002450578,0.0001453022,0.121427,0.009774224,0.8412416,0.02640367,0.00003145187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1349722,0.0005504345,0.8202918,0.00122666,0.00009823206,0.00007448517,0.000431604,0.001431214,0.04092338],"genre_scores_gemma":[0.6639266,0.0008098314,0.3221421,0.000374185,0.00008936493,0.0001241218,0.000689414,0.0002667089,0.0115777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005771394,"threshold_uncertainty_score":0.01930726,"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","authors":[{"name":"Michael A. Henning","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001966911,0.00083638,0.001406831,0.001820767,0.002043809,0.004133786,0.002186592,0.002145114,0.006902426],"category_scores_gemma":[0.01275491,0.0007761318,0.0007935876,0.00326418,0.002415464,0.007910434,0.003156873,0.002609465,0.001432537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002926011,"about_ca_system_score_gemma":0.001154363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149998,"about_ca_topic_score_gemma":0.001767782,"domain_scores_codex":[0.9978101,0.0008015006,0.0001495991,0.0005178399,0.0004110339,0.0003098956],"domain_scores_gemma":[0.9909196,0.005795097,0.0008027772,0.001181278,0.0005653697,0.0007358675],"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.0002173927,0.0001142085,0.001770891,0.0005416741,0.00007395949,0.0001167982,0.0003902432,0.01767663,0.00220263,0.8987896,0.02376162,0.05434428],"study_design_scores_gemma":[0.00003965344,0.00005404911,0.000645395,0.00006539231,0.00004601477,0.0004262797,0.00035812,0.02514388,0.001844928,0.956732,0.01461871,0.00002546679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2514412,0.009338003,0.6042835,0.01305496,0.0009400683,0.0003551019,0.004443184,0.001338292,0.1148057],"genre_scores_gemma":[0.8123201,0.00363433,0.1550096,0.001272923,0.0005549342,0.0002910469,0.002689378,0.0003168932,0.02391076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006902426,"threshold_uncertainty_score":0.0230909,"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","authors":[{"name":"Ali Ahmad","is_ca":false},{"name":"Martin Bača","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305294,0.0007264657,0.0009066439,0.00230294,0.00226663,0.004053212,0.001561297,0.00135748,0.0139894],"category_scores_gemma":[0.007391845,0.0005860486,0.000891873,0.003656998,0.002751775,0.008103655,0.003166826,0.002833402,0.002260055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002388568,"about_ca_system_score_gemma":0.0008221411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0018924,"about_ca_topic_score_gemma":0.002976426,"domain_scores_codex":[0.9987429,0.0003794874,0.00007152643,0.000277364,0.0002898381,0.0002389709],"domain_scores_gemma":[0.9943385,0.003233368,0.0004769456,0.001086622,0.0004331922,0.0004313997],"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.00004986572,0.00002856113,0.000498839,0.00009604577,0.00001226941,0.00004000463,0.0001611098,0.00355548,0.0003494082,0.9649437,0.01074086,0.01952381],"study_design_scores_gemma":[0.00001117395,0.000008134162,0.0002224172,0.00002763597,0.000008771882,0.000089407,0.0001184193,0.008354736,0.0002474861,0.981709,0.009195094,0.000007608159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2622179,0.003943065,0.4149177,0.007312366,0.0007572009,0.0001741514,0.004064115,0.001474175,0.3051395],"genre_scores_gemma":[0.7925254,0.003439805,0.1241192,0.001735576,0.0008412723,0.0003185109,0.005251287,0.000888148,0.07088072],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.0139894,"threshold_uncertainty_score":0.04679918,"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","authors":[{"name":"Frank Van Bussel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00176482,0.0006773749,0.0007784483,0.00119479,0.001637392,0.002435329,0.001784502,0.00116698,0.003882491],"category_scores_gemma":[0.01047574,0.0006701474,0.001157018,0.001592557,0.002397487,0.005455918,0.002919783,0.002440353,0.0006388909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634976,"about_ca_system_score_gemma":0.000676634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00237467,"about_ca_topic_score_gemma":0.002944492,"domain_scores_codex":[0.9973661,0.0007183994,0.0001876475,0.0006790659,0.0005703163,0.0004784378],"domain_scores_gemma":[0.9916855,0.003390115,0.0009723848,0.002533291,0.0006540313,0.0007648209],"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.000531366,0.00007888151,0.002174872,0.0001990421,0.00004348866,0.0002281111,0.001509746,0.06871396,0.01103618,0.8572167,0.004606127,0.05366164],"study_design_scores_gemma":[0.00003082847,0.00009187641,0.0008468504,0.00004387069,0.00003291649,0.0001921441,0.0002806135,0.08108331,0.004372713,0.9035863,0.009391618,0.0000469896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4737597,0.00108269,0.4901664,0.001249355,0.000122763,0.0001522444,0.001556769,0.001206335,0.03070385],"genre_scores_gemma":[0.8351345,0.0006032467,0.1515081,0.000400652,0.0001328233,0.0001820516,0.001629209,0.0003530909,0.01005634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003882491,"threshold_uncertainty_score":0.01298827,"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","authors":[{"name":"Yunior Ramírez-Cruz","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true},{"name":"Juan A. Rodríguez‐Velázquez","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003599893,0.00121215,0.00230228,0.004147863,0.003343895,0.006964881,0.003989242,0.002800079,0.00676279],"category_scores_gemma":[0.02069645,0.001825939,0.001806707,0.004465706,0.006373881,0.02028386,0.006602851,0.005486768,0.0004300884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00316203,"about_ca_system_score_gemma":0.001080795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00161323,"about_ca_topic_score_gemma":0.001266727,"domain_scores_codex":[0.9961749,0.001480783,0.0001947239,0.0008840812,0.0008230396,0.000442294],"domain_scores_gemma":[0.974474,0.01627676,0.002441162,0.002406895,0.001500707,0.002900515],"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.00005354166,0.00002270506,0.0006805591,0.0000651322,0.00002136384,0.0000315713,0.0002140523,0.00310309,0.0003813508,0.989725,0.001377098,0.004324615],"study_design_scores_gemma":[0.00001467121,0.00001395857,0.0004950984,0.00001733178,0.00001682952,0.0000839709,0.0001321549,0.01752837,0.0002707333,0.9799329,0.001475442,0.00001853533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6163658,0.003248632,0.3229061,0.008693837,0.0003997289,0.00008584011,0.001520515,0.0003127773,0.04646681],"genre_scores_gemma":[0.9528638,0.001468463,0.03745482,0.0004784621,0.0006753658,0.0001682097,0.0006020798,0.0001552535,0.006133381],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006964881,"threshold_uncertainty_score":0.02294219,"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","authors":[{"name":"Sheikh Rashid","is_ca":false},{"name":"Naveed Yaqoob","is_ca":false},{"name":"Muhammad Akram","is_ca":false},{"name":"Muhammad Gulistan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004586321,0.0006321225,0.0005329954,0.001348746,0.001966564,0.00172988,0.0009148385,0.0008482182,0.01782294],"category_scores_gemma":[0.003099127,0.0003041844,0.000833434,0.002698584,0.001796525,0.00250095,0.003389266,0.002913242,0.002945339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001810099,"about_ca_system_score_gemma":0.001138813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005871489,"about_ca_topic_score_gemma":0.005138207,"domain_scores_codex":[0.9990315,0.000194583,0.00004447742,0.0002494048,0.0003356628,0.0001444795],"domain_scores_gemma":[0.9986153,0.0004135729,0.0000860384,0.0002676403,0.0004831366,0.0001343835],"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.00001233844,0.0000117615,0.0001029281,0.000075656,0.000003818545,0.0000570886,0.000117404,0.002101597,0.000625182,0.9642183,0.00864966,0.02402432],"study_design_scores_gemma":[0.000006118139,0.000008627605,0.0001268019,0.00002164217,0.000005154083,0.0001746229,0.00008342196,0.008139261,0.0006534013,0.9099607,0.08080966,0.00001050544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03416427,0.003022752,0.5610939,0.003192017,0.001203754,0.0001648654,0.001533356,0.00128285,0.3943423],"genre_scores_gemma":[0.5639905,0.004115056,0.3484981,0.002233381,0.001018212,0.0003500631,0.00185902,0.0008710137,0.07706463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01782294,"threshold_uncertainty_score":0.05962372,"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","authors":[{"name":"Kelly Choo","is_ca":true},{"name":"Gary MacGillivray","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431715,0.0005896493,0.0004628991,0.002762437,0.001020209,0.002139468,0.0006068876,0.0009241535,0.00825364],"category_scores_gemma":[0.003578826,0.0002470573,0.0004057886,0.002142679,0.002212303,0.002364948,0.001364705,0.001972349,0.001403158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001951856,"about_ca_system_score_gemma":0.0005532212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673414,"about_ca_topic_score_gemma":0.001548112,"domain_scores_codex":[0.9995568,0.00009867175,0.00001918856,0.00009516239,0.0001336255,0.00009659887],"domain_scores_gemma":[0.9985393,0.0008048505,0.0001398631,0.0001637239,0.0001822681,0.0001700342],"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.00001718918,0.000006894501,0.0001817299,0.00003108344,0.000002662121,0.00003612284,0.00009954044,0.001678088,0.000687806,0.9845718,0.002915293,0.009771789],"study_design_scores_gemma":[0.000007356769,0.000008195549,0.0002123592,0.00002287294,0.000003306895,0.0000674652,0.00004422447,0.006198334,0.0004923758,0.9807214,0.01221192,0.00001024528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2761443,0.007361852,0.3613296,0.004867264,0.00120965,0.0001543449,0.001651092,0.001107461,0.3461745],"genre_scores_gemma":[0.8459671,0.003087799,0.1124905,0.001070597,0.0006155347,0.0002795907,0.0008701773,0.0002919244,0.0353268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00825364,"threshold_uncertainty_score":0.02761114,"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","authors":[{"name":"Zhang Zhong-fu","is_ca":false},{"name":"Pengxiang Qiu","is_ca":false},{"name":"Baogen Xu","is_ca":false},{"name":"Jingwen Li","is_ca":false},{"name":"Chen Xiang-en","is_ca":false},{"name":"Bing Yao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074707,0.0006226075,0.0006469103,0.001182706,0.001607939,0.002796264,0.001469412,0.001100258,0.007822355],"category_scores_gemma":[0.005118506,0.0005188262,0.0006564069,0.001801443,0.001913301,0.00442577,0.002217795,0.002201875,0.0009050533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002078557,"about_ca_system_score_gemma":0.001026024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001840423,"about_ca_topic_score_gemma":0.002907838,"domain_scores_codex":[0.9989495,0.0003269976,0.00005289213,0.000246031,0.0001924653,0.0002321758],"domain_scores_gemma":[0.9942826,0.003471873,0.0004110335,0.001024693,0.0003423749,0.000467323],"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.0001655242,0.00007799856,0.001778086,0.0001929599,0.00002791072,0.00006671175,0.0002555312,0.008570135,0.00219894,0.9405715,0.01612298,0.02997164],"study_design_scores_gemma":[0.00002937471,0.00002272384,0.0006586199,0.00002672339,0.00002267749,0.0001642888,0.0001572142,0.02205166,0.001613104,0.9671048,0.008135509,0.00001328674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4580607,0.002056567,0.3538412,0.005521644,0.0006007127,0.0001577906,0.003764724,0.001552503,0.1744441],"genre_scores_gemma":[0.901763,0.0007249442,0.06945182,0.0007198021,0.0002273284,0.00009571426,0.002474612,0.000297478,0.02424536],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007822355,"threshold_uncertainty_score":0.02616841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}