{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2619,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":2619,"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":"ba5119847aeb","filters":{"venue":"Ars Combinatoria"}},"results":[{"id":"W22292547","doi":"","title":"Norm Of Weighted Composition operators From Bloch Space to H infinity on the Unit Ball.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Bloch space; Norm (philosophy); Ball (mathematics); Pure mathematics; Infinity; Uniform norm; Mathematical analysis; Compact space","authors":[{"name":"Stevo Stević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04101186121649524,"gpt":0.2686199790499472,"spread":0.2276081178334519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003761743,0.0002048741,0.0003309161,0.00006887859,0.0002698557,0.00001782723,0.0003826969,0.0001253712,0.0003650382],"category_scores_gemma":[0.0001958947,0.000148759,0.00007615471,0.0003613593,0.0001349718,0.00006365,0.0001016551,0.0002847335,0.0002467531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005095133,"about_ca_system_score_gemma":0.00007326855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001247559,"about_ca_topic_score_gemma":0.00001020344,"domain_scores_codex":[0.9985995,0.0002658255,0.0003246971,0.000226251,0.0003630608,0.000220697],"domain_scores_gemma":[0.9980674,0.0008809341,0.0001058254,0.0006241521,0.0001924322,0.0001292466],"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.00008761437,0.0003556673,0.002567449,0.000008596005,0.000059992,0.00001917365,0.001814954,0.000003439607,0.003448467,0.9846076,0.00700237,0.00002469181],"study_design_scores_gemma":[0.001933559,0.0005273588,0.007477097,0.000187039,0.00007769401,0.00001233736,0.0006308457,0.0001445623,0.1427424,0.8424535,0.003307463,0.0005061522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9884415,0.00001875065,0.00003480153,0.000732871,0.0005197062,0.0003730051,0.00004222348,0.00007044122,0.009766662],"genre_scores_gemma":[0.9985643,0.0000118491,0.0005655269,0.0005127198,0.00001887361,0.00002127256,0.0000152089,0.000031193,0.0002590393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.142154,"threshold_uncertainty_score":0.6066216,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775687,0.00008269055,0.0001133197,0.0001571224,0.0002796215,0.00002351088,0.0002319969,0.00003611481,0.000002864904],"category_scores_gemma":[0.00008505263,0.00004956477,0.00004482631,0.0008966834,0.0001341579,0.0001039635,0.00009697896,0.0000960249,0.00001324602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006175957,"about_ca_system_score_gemma":0.0000245805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000029645,"about_ca_topic_score_gemma":6.482221e-7,"domain_scores_codex":[0.9991878,0.00007344842,0.0001602524,0.000195803,0.0002394151,0.0001432815],"domain_scores_gemma":[0.9991166,0.0002440377,0.00007482942,0.0004201517,0.000084415,0.00005994862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002123759,0.00008043086,0.001378374,0.000002278654,0.000009574785,0.000003540517,0.0002107965,0.000009847911,0.0005232171,0.9949957,0.002607191,0.0001769803],"study_design_scores_gemma":[0.0003354608,0.0002007701,0.005740981,0.00001938577,0.000006061301,0.00001505595,0.00001059577,0.000953759,0.003781006,0.9885336,0.0003194424,0.00008384288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972481,0.000359698,0.0001155696,0.0009136621,0.0005398315,0.00009155778,6.826787e-7,0.0000624567,0.0006684284],"genre_scores_gemma":[0.9990218,0.0001293902,0.0005146813,0.0002670821,4.261869e-7,0.000008982067,5.78241e-7,0.00000420827,0.00005281687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006462005,"threshold_uncertainty_score":0.215065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36680195","doi":"10.3390/v15010155","title":"Eigenvalues of the Discrete p-Laplacian for Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics","authors":[{"name":"S. Amghibech","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02646983396851626,"gpt":0.2914175538317178,"spread":0.2649477198632015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003345138,0.00008537697,0.0001321647,0.00002571202,0.0001670101,0.00000836362,0.0002202771,0.00004629057,0.00001868231],"category_scores_gemma":[0.0002695733,0.00006028341,0.00015111,0.0002115826,0.00009877131,0.00003422545,0.00001949716,0.00006172611,0.000003256144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007193452,"about_ca_system_score_gemma":0.00001994264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001472003,"about_ca_topic_score_gemma":0.000002122246,"domain_scores_codex":[0.9993854,0.00007652708,0.0001844404,0.0001160934,0.0001009703,0.0001366191],"domain_scores_gemma":[0.9990495,0.0003126505,0.0001136774,0.0004365832,0.00005710655,0.00003046114],"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.000004115997,0.00007111548,0.0008678836,0.00002644892,0.00002230364,3.996976e-8,0.0002095416,2.835588e-7,0.0005724691,0.9966717,0.001510833,0.00004326018],"study_design_scores_gemma":[0.0003223915,0.00002528077,0.0004361102,0.00001456994,0.00003869464,9.176739e-7,0.0001031036,0.000004656295,0.02372898,0.9720381,0.003214027,0.00007316212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9902866,0.0000484201,0.0001554932,0.0001800513,0.0004931874,0.0005562825,0.0000198395,0.0000348652,0.008225245],"genre_scores_gemma":[0.9982172,0.000003813151,0.001252682,0.00003249511,0.0000016812,0.00009487112,0.000001392343,0.00001501024,0.0003809023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0246336,"threshold_uncertainty_score":0.2458286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404127378","doi":"","title":"Radio Number for Square Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Statistics; Geometry","authors":[{"name":"Daphne Der‐Fen Liu","is_ca":false},{"name":"Melanie Xie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01060503079864784,"gpt":0.2571862683527507,"spread":0.2465812375541028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001213648,0.0001113016,0.0001130592,0.00000824845,0.0000839835,0.00001995975,0.0001549943,0.0001335406,0.00001249154],"category_scores_gemma":[0.00008132235,0.00009271209,0.0001031602,0.00005203139,0.0000219889,0.000001737555,0.00003622397,0.00005279386,0.00001690957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007945375,"about_ca_system_score_gemma":0.00001700149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000128396,"about_ca_topic_score_gemma":3.580246e-7,"domain_scores_codex":[0.9993097,0.00002535581,0.0001267584,0.0002519326,0.00005797188,0.0002283158],"domain_scores_gemma":[0.9996317,0.00001575462,0.00004162029,0.000188515,0.00006071952,0.00006169561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003470332,0.0006633173,0.02787535,0.00003754593,0.00009350957,0.00001507278,0.00007415121,0.00001684039,0.5399929,0.3029055,0.06568816,0.06229069],"study_design_scores_gemma":[0.004335893,0.003756652,0.03982483,0.0000411419,0.00004440972,0.00004190009,0.00006788209,0.000218312,0.2164943,0.4151842,0.3189203,0.001070203],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.995092,0.0001850188,0.0002132664,0.0002374819,0.0005413109,0.0001745395,0.000005623832,0.00002908254,0.003521623],"genre_scores_gemma":[0.9982395,0.00001600603,0.0006297178,0.0005703552,0.0000643774,0.000008410694,0.00007922555,0.000007940343,0.0003844983],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3234986,"threshold_uncertainty_score":0.3780689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W117706154","doi":"","title":"PI Index of Armchair Polyhex Nanotubes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pure mathematics; Computer science; World Wide Web","authors":[{"name":"Али Реза Ашрафи","is_ca":false},{"name":"Amir Loghman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01437029627748487,"gpt":0.2601400983097861,"spread":0.2457698020323012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001976591,0.0001097551,0.0001852223,0.00006926704,0.00007856883,0.000009340824,0.0002069379,0.00007715334,0.00006892707],"category_scores_gemma":[0.00004541977,0.0001065923,0.00008590676,0.0002740474,0.00008883858,0.00005299368,0.00004230217,0.00009686703,0.00003004674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001522746,"about_ca_system_score_gemma":0.00002153553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005427718,"about_ca_topic_score_gemma":0.000006816008,"domain_scores_codex":[0.9992142,0.00003784442,0.0002747145,0.0001471607,0.000157125,0.0001689677],"domain_scores_gemma":[0.9991706,0.0001997767,0.0001235456,0.0004019858,0.00006684332,0.00003723653],"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.000006517258,0.0003028881,0.002980603,0.00002388265,0.00001339889,9.785263e-7,0.00006302907,0.000001428583,0.002710645,0.9893924,0.004364473,0.0001397305],"study_design_scores_gemma":[0.000436957,0.00002548932,0.002914,0.00001649061,0.00001743454,0.000002374358,0.00003893352,0.00002207405,0.01831966,0.9764237,0.001673924,0.0001089497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9823533,0.00005920276,0.0001157098,0.0001326474,0.0002591238,0.0001735772,0.000008212503,0.00009080373,0.01680747],"genre_scores_gemma":[0.9987243,0.000002551364,0.0003806221,0.00002489584,0.000009197819,0.00002823129,0.000005272938,0.00001922535,0.0008056596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01637109,"threshold_uncertainty_score":0.4346707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W109780709","doi":"","title":"Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","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":"Stars; Mathematics; Star (game theory); Combinatorics; Group (periodic table); Astrophysics; Physics; Mathematical analysis","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Marc J. Lipman","is_ca":false},{"name":"Hyungju Park","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0131934177858298,"gpt":0.2291992926725596,"spread":0.2160058748867298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006515918,0.0001764918,0.0003056391,0.0001522524,0.0001566397,0.0001113046,0.0004522273,0.0000834464,0.00001418309],"category_scores_gemma":[0.00004745574,0.0001681612,0.00009964017,0.0004662858,0.00007468099,0.0005176751,0.0001910077,0.000170636,0.000004928937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000296341,"about_ca_system_score_gemma":0.00001669654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004714802,"about_ca_topic_score_gemma":0.00006718131,"domain_scores_codex":[0.9984602,0.0001541866,0.0003657193,0.0004206724,0.000284453,0.0003148053],"domain_scores_gemma":[0.9988807,0.0002351926,0.0001577176,0.0004771909,0.0001399777,0.0001092485],"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.000009895683,0.00008203344,0.03157636,0.00001908838,0.00003680229,0.00001825717,0.0005439396,0.00000962883,0.0005822725,0.9651698,0.000321475,0.001630451],"study_design_scores_gemma":[0.001797055,0.0005449432,0.03854625,0.0001398246,0.00001617714,0.0001367257,0.0003112472,0.03953938,0.0007770802,0.9155464,0.00213267,0.0005122765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932296,0.0002880893,0.002018095,0.00009809633,0.002730213,0.0001763661,0.000002150502,0.0001163123,0.001341128],"genre_scores_gemma":[0.9989883,0.00007508054,0.0007551534,0.00008358002,0.00001036569,0.00001187464,0.000001684415,0.00001256967,0.00006135867],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04962343,"threshold_uncertainty_score":0.6857415,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001980883,0.0001640681,0.000156376,0.0001692902,0.0001565165,0.0001207441,0.0006808446,0.00007411416,0.0001146178],"category_scores_gemma":[0.00005015408,0.0001456575,0.00009233774,0.0006170268,0.0000576093,0.0002376605,0.0001267398,0.0001900812,0.001579998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001754058,"about_ca_system_score_gemma":0.00000962064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297994,"about_ca_topic_score_gemma":5.039985e-7,"domain_scores_codex":[0.9986405,0.0000619811,0.0001984513,0.0004229467,0.0003356839,0.0003404621],"domain_scores_gemma":[0.9988181,0.0001073854,0.00004715777,0.0007922302,0.00008538531,0.0001497512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000106107,0.0001654653,0.0002876546,0.000003030475,0.000008343818,0.00001446001,0.0001609977,0.00001212674,0.0001743454,0.9589726,0.03862611,0.001573802],"study_design_scores_gemma":[0.0006225397,0.0001696204,0.0002661975,0.00001907162,0.00000377555,0.000008071514,0.000003386717,0.004953458,0.0007693412,0.9908631,0.002122619,0.0001987593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9592425,0.0008009368,0.0001646835,0.002352239,0.005670792,0.0001788157,0.000001088614,0.0006325501,0.03095635],"genre_scores_gemma":[0.9969797,0.00003185096,0.0009145671,0.001158328,0.000001024106,0.000007414106,9.388417e-7,0.00001232102,0.0008939112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0377371,"threshold_uncertainty_score":0.9991974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395452549","doi":"","title":"The Wiener Polarity Index of Graph Products.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Polarity (international relations); Index (typography); Graph; Statistics; Combinatorics; Chemistry; Computer science","authors":[{"name":"Jing Ma","is_ca":false},{"name":"Yongtang Shi","is_ca":false},{"name":"Jun Yue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01753218901229056,"gpt":0.2644962159810108,"spread":0.2469640269687202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780154,0.00008092324,0.0001300136,0.00003252105,0.0001520489,0.00001698951,0.0003147413,0.00004781073,0.000004526706],"category_scores_gemma":[0.0006318356,0.00005475694,0.00005740122,0.000294727,0.0001307502,0.00005578646,0.0000454285,0.0001192986,0.00001040378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006996019,"about_ca_system_score_gemma":0.00001863258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008842341,"about_ca_topic_score_gemma":0.000004342249,"domain_scores_codex":[0.9992762,0.0001064112,0.0002137138,0.0001176222,0.0001524562,0.0001336526],"domain_scores_gemma":[0.9985802,0.0004976264,0.0001552823,0.0005767004,0.0001559102,0.00003427982],"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.000007832375,0.0001107621,0.001534699,0.00001456371,0.00001790244,9.505251e-8,0.00009805111,2.101734e-7,0.0005750025,0.9953251,0.001854019,0.0004617283],"study_design_scores_gemma":[0.0002381561,0.0000334303,0.00255164,0.000007254187,0.00001936637,0.000001026294,0.00003088888,0.00001105998,0.003964701,0.9804858,0.012591,0.00006568305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9945451,0.00006013945,0.0001207853,0.0008497317,0.000515426,0.0001855083,0.000001686765,0.00004256467,0.003679031],"genre_scores_gemma":[0.9994525,0.000005178989,0.000261475,0.00004213666,0.0000113545,0.00001776735,8.755164e-7,0.00001134077,0.0001974036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01483934,"threshold_uncertainty_score":0.2232923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W94353364","doi":"","title":"On computing the dissociation number and the induced matching number of bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Combinatorics; 3-dimensional matching; Graph; Statistics","authors":[{"name":"Rodica Boliac","is_ca":false},{"name":"Kathie Cameron","is_ca":false},{"name":"Vadim Lozin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770208721375691,"gpt":0.2980210620098964,"spread":0.2803189747961394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485838,0.0000955861,0.0001530939,0.00001445976,0.0003345047,0.00003143128,0.0001587558,0.00004902548,0.00001087405],"category_scores_gemma":[0.0001533997,0.00005667213,0.00006938174,0.0002319711,0.0001243225,0.00004822305,0.0000502912,0.000178722,0.00001882551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001594101,"about_ca_system_score_gemma":0.00001065903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000453253,"about_ca_topic_score_gemma":0.000004365338,"domain_scores_codex":[0.9992436,0.0001305578,0.0002238294,0.0001160814,0.0001602571,0.0001256526],"domain_scores_gemma":[0.9983294,0.001131131,0.0001971051,0.0002737801,0.00004470881,0.00002385104],"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.00001434873,0.00008430325,0.001131793,0.00001035461,0.0000326506,1.632093e-7,0.002916099,0.000006733454,0.0001507049,0.9954766,0.00008551558,0.00009073169],"study_design_scores_gemma":[0.001083817,0.000007990755,0.003342974,0.00004778214,0.00003505993,0.000003205623,0.000314136,0.00001997108,0.0007814015,0.9942845,0.00001283574,0.00006638162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.996281,0.000007129398,0.0000491825,0.0008566335,0.0001694709,0.0002660555,0.000001997993,0.0000355633,0.002332983],"genre_scores_gemma":[0.999649,0.000004920636,0.0001751234,0.0001120263,0.000005139338,0.00001865785,0.000001508208,0.00001287206,0.00002070996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003368059,"threshold_uncertainty_score":0.2572773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402190177","doi":"","title":"A proof to the odd-gracefulness of all lobsters.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Marine and fisheries research","field":"Environmental Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","authors":[{"name":"Xiangqian Zhou","is_ca":false},{"name":"Bing Yao","is_ca":false},{"name":"Chen Xiang-en","is_ca":false},{"name":"Haixia Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01913491612644853,"gpt":0.25622921552363,"spread":0.2370942993971815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000380397,0.00007614725,0.00009588349,0.00001523157,0.00005906824,0.0000151391,0.000390474,0.00003448403,0.002651081],"category_scores_gemma":[0.00006824916,0.00005186468,0.00003464419,0.0002520598,0.00009640152,0.0001569598,0.0004944281,0.0001052642,0.0003638025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005037469,"about_ca_system_score_gemma":0.000004870673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003089323,"about_ca_topic_score_gemma":0.00003018041,"domain_scores_codex":[0.9990273,0.00005654633,0.0001239212,0.0001211409,0.0003418915,0.000329205],"domain_scores_gemma":[0.9994168,0.00005081727,0.00003289152,0.000357375,0.000009392998,0.0001326938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006696036,0.0004882842,0.8334821,0.00002793445,0.00003386809,0.000003695192,0.003339462,0.00001529801,0.001158106,0.04591188,0.05696152,0.05851084],"study_design_scores_gemma":[0.0004105321,0.0001892581,0.1003032,0.000004043548,0.00001154836,0.000004837132,0.0002326281,0.00007623476,0.007672017,0.01149182,0.879402,0.0002019238],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8471336,0.00001448329,0.0000184508,0.001277164,0.0005595192,0.0003392389,0.000001915338,0.00001245251,0.1506431],"genre_scores_gemma":[0.9976777,0.000001911768,0.00005730153,0.0002789568,0.000008649493,0.00004534443,0.000001635933,0.000008991021,0.001919514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8224404,"threshold_uncertainty_score":0.9982606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399012647","doi":"","title":"Hyperbolicity and parameters of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"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":"Junior Michel","is_ca":false},{"name":"José M. Rodrı́guez","is_ca":false},{"name":"José M. Sigarreta","is_ca":false},{"name":"María Villeta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03253293733379627,"gpt":0.2614451418722669,"spread":0.2289122045384707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002780507,0.00008773064,0.0001484148,0.0001201724,0.00005290622,0.00001486367,0.0006092971,0.00003908788,0.000005312098],"category_scores_gemma":[0.00005996055,0.00008223695,0.00004061082,0.0004168136,0.000205479,0.0002926859,0.0002718775,0.0001099599,0.000006807465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007433039,"about_ca_system_score_gemma":0.00001727034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004520238,"about_ca_topic_score_gemma":0.000001182441,"domain_scores_codex":[0.9991401,0.000079057,0.0001416721,0.0002363641,0.0001849692,0.0002177999],"domain_scores_gemma":[0.9991653,0.0001073939,0.00005818584,0.0004976172,0.00007110326,0.0001004165],"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.000009138933,0.0000569589,0.00882811,0.000007429056,0.00001168819,0.000004773634,0.0005674778,2.504019e-7,0.000622269,0.9848321,0.00002860541,0.005031189],"study_design_scores_gemma":[0.000283728,0.0001354788,0.01628587,0.000006737453,0.000002331942,0.000004190475,0.00001859249,0.000196234,0.01821155,0.9647339,0.00003275737,0.00008861406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9945921,0.0001169154,0.001916526,0.00002838848,0.0003688001,0.000104838,8.027759e-7,0.00005984775,0.002811754],"genre_scores_gemma":[0.9816675,0.00003068551,0.01823341,0.00003634937,4.530409e-7,0.000007096874,1.674586e-7,0.000006058015,0.00001832099],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02009819,"threshold_uncertainty_score":0.3353525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W58703409","doi":"","title":"All Cycles are Edge-Magic.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":44,"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; Astronomy; Computer science; Artificial intelligence; Physics","authors":[{"name":"Omer Berkman","is_ca":false},{"name":"Michal Parnas","is_ca":false},{"name":"Y. Roditty","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02086550752196746,"gpt":0.2653799760962254,"spread":0.244514468574258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000381438,0.0001429331,0.0001523547,0.00007938506,0.0001736652,0.0002531987,0.0008692071,0.00006808152,0.00001244365],"category_scores_gemma":[0.0001024902,0.000139143,0.00006972557,0.000290007,0.0000339973,0.0003088572,0.0002081256,0.0003225656,0.0003249151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003972416,"about_ca_system_score_gemma":0.00002364349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008010134,"about_ca_topic_score_gemma":0.000003726147,"domain_scores_codex":[0.9987364,0.0001208441,0.0001589413,0.0003581504,0.0002431113,0.0003825311],"domain_scores_gemma":[0.9990538,0.00009730345,0.0001004541,0.0005726203,0.0000478552,0.0001279965],"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.000005487544,0.000225995,0.05628581,0.00001078321,0.0000337115,0.0001660718,0.001776773,0.00005992896,0.0000434682,0.7076023,0.008362366,0.2254273],"study_design_scores_gemma":[0.0007324385,0.0001022874,0.04439834,0.00005174787,0.00001016898,0.00007413521,0.0001127797,0.002244037,0.00009232636,0.109071,0.842688,0.0004227942],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9555311,0.0007786293,0.02051094,0.006352392,0.005798921,0.0002050852,5.003279e-7,0.002038273,0.00878417],"genre_scores_gemma":[0.9899653,0.00001453193,0.008763921,0.0003955185,0.00002167071,0.00000627386,0.000001734373,0.0000144211,0.0008166687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8343256,"threshold_uncertainty_score":0.5674088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W129481463","doi":"","title":"Tribonacci sequences with certain indices and their sums","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","authors":[{"name":"Emrah Kılıç","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01155628825511641,"gpt":0.2380246911680908,"spread":0.2264684029129744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004112895,0.0001026924,0.0001363105,0.00001424691,0.0002115829,0.00001662907,0.00008938105,0.00001625082,0.0000644443],"category_scores_gemma":[0.000002899603,0.00006719401,0.00002202499,0.0001156522,0.0001496867,0.000097722,0.00002910306,0.00007519562,0.000009396598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005308932,"about_ca_system_score_gemma":0.00002083228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002882078,"about_ca_topic_score_gemma":6.520273e-7,"domain_scores_codex":[0.99955,0.00001204793,0.00009699032,0.0001420515,0.00005913953,0.0001398155],"domain_scores_gemma":[0.9995903,0.0001241866,0.00005533747,0.0001405486,0.00002592965,0.00006365454],"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.000004946352,0.00005175409,0.007013935,0.000003469573,0.00001920837,6.244745e-7,0.0003508168,0.000002601737,0.00007739711,0.9910711,0.00006804086,0.001336118],"study_design_scores_gemma":[0.0003424808,0.00004716355,0.0007924404,0.00001018556,0.000005574093,0.000003310774,0.0007659036,0.00003432584,0.001954469,0.9935198,0.002412662,0.0001116497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873651,0.00006058288,0.001604991,0.0001628034,0.00003767993,0.0001403164,0.00001154948,0.00003054893,0.01058648],"genre_scores_gemma":[0.9990221,0.000008599232,0.0006307521,0.0000208261,0.00001127579,0.00004833726,0.000008620044,0.000009336476,0.0002400986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01165711,"threshold_uncertainty_score":0.2740092,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966035,0.0001311957,0.0002481917,0.0000922512,0.00005463073,0.00001662725,0.0004449778,0.00004202431,0.000007654946],"category_scores_gemma":[0.00006631642,0.0001204499,0.00008389672,0.0004007841,0.00009119429,0.00037949,0.0002615996,0.0001267527,0.000008581365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001468975,"about_ca_system_score_gemma":0.0000598015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008512143,"about_ca_topic_score_gemma":9.196693e-7,"domain_scores_codex":[0.9986683,0.0000883726,0.0003373066,0.000247395,0.0003369186,0.0003217805],"domain_scores_gemma":[0.9986832,0.00006046628,0.0002017517,0.0007511207,0.0001817473,0.0001217681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002857786,0.000420471,0.01695305,0.00002849731,0.00001991725,5.793185e-7,0.0003763572,0.00001363745,0.004150051,0.9749185,0.0003622484,0.002753809],"study_design_scores_gemma":[0.001875321,0.000276798,0.02769492,0.00008858561,0.0000349423,0.00001432778,0.0000435756,0.002133054,0.1551002,0.8122148,0.0001420436,0.0003814267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954938,0.0007535324,0.0002052994,0.00007480277,0.002428101,0.0001276705,0.000003639711,0.0000678817,0.0008452307],"genre_scores_gemma":[0.9946188,0.000003777357,0.005296368,0.000009756531,0.000003741433,0.000004468381,0.000002511561,0.000007872228,0.00005268625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1627037,"threshold_uncertainty_score":0.4911803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962898528","doi":"","title":"The generalized connectivity of complete bipartite graphs","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Bipartite graph; Disjoint sets; Graph; Integer (computer science); Discrete mathematics; Computer science","authors":[{"name":"Shasha Li","is_ca":false},{"name":"Wei Li","is_ca":false},{"name":"Xueliang Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519056727110667,"gpt":0.2369342640556601,"spread":0.2217436967845535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889363,0.0001122746,0.0001952744,0.00004882871,0.0003076987,0.0001323389,0.0008163924,0.00006764025,0.00001102728],"category_scores_gemma":[0.00007631312,0.0000788247,0.0001169572,0.0003454509,0.0001116211,0.0001874788,0.0001504391,0.0002250306,0.00002315447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009859631,"about_ca_system_score_gemma":0.00003187473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000133116,"about_ca_topic_score_gemma":0.0001527603,"domain_scores_codex":[0.998844,0.0001584515,0.000296753,0.0002302,0.0002230563,0.0002475485],"domain_scores_gemma":[0.9984403,0.0003606355,0.0001736187,0.0007647563,0.0001906447,0.00007003805],"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.00000532945,0.0000295642,0.001596428,0.000003100432,0.00002042298,0.000001293633,0.0001229336,0.000009665198,0.006774751,0.9880568,0.0024431,0.0009366201],"study_design_scores_gemma":[0.0009811789,0.0001410646,0.006853165,0.00001552916,0.000006972952,0.00002688951,0.00002289083,0.04403117,0.005636231,0.8900211,0.05202245,0.0002413541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811924,0.00007670245,0.002891007,0.0005498268,0.01254097,0.0001744906,0.000001877643,0.00009652757,0.002476169],"genre_scores_gemma":[0.9993388,0.000009450341,0.0003858367,0.00007959222,0.00001811352,0.00001962966,7.108645e-7,0.000007208412,0.0001406811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09803569,"threshold_uncertainty_score":0.3214378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397563057","doi":"","title":"Weighted Composition Operators From Bloch-Type Spaces To Weighted-Type Spaces.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Composition (language); Pure mathematics; Linguistics; Geology","authors":[{"name":"Weifeng Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01893201615964881,"gpt":0.2739481385122142,"spread":0.2550161223525654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004083717,0.0004435045,0.0006175192,0.0001736839,0.0003119733,0.0002114291,0.0005167094,0.0003035595,0.0006342033],"category_scores_gemma":[0.0001387433,0.0004045804,0.0001050033,0.0008452081,0.00008377402,0.0002478215,0.0001021876,0.0004058672,0.001029344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499901,"about_ca_system_score_gemma":0.0001156787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007439763,"about_ca_topic_score_gemma":0.00001023217,"domain_scores_codex":[0.9976136,0.0002565283,0.000484966,0.0005897692,0.0005139642,0.0005411826],"domain_scores_gemma":[0.9979913,0.0002903735,0.000141467,0.0007998704,0.0003844512,0.0003925034],"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.0002655608,0.0006219855,0.001275806,0.00002074392,0.0001308271,0.0001026327,0.001728149,0.000003270484,0.01880559,0.9421416,0.034379,0.000524861],"study_design_scores_gemma":[0.001836766,0.0008678418,0.001108578,0.0002057228,0.0001366811,0.00001313661,0.0003449772,0.0002483115,0.04428259,0.9414645,0.008637425,0.0008535094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9904141,0.0003450034,0.00005774289,0.001545162,0.002702388,0.0005287678,0.00002319192,0.0003747267,0.004008861],"genre_scores_gemma":[0.9937825,0.0000460159,0.004179685,0.001134145,0.00009348492,0.000009310913,0.00007694221,0.00006492032,0.0006129828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02574158,"threshold_uncertainty_score":0.9998406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W29918265","doi":"","title":"Characterizations of arboricity of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Arboricity; Mathematics; Dense graph; Indifference graph; Pathwidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Bounding overwatch; Spanning tree; Trémaux tree; Cograph; Graph; Line graph; Planar graph; Computer science","authors":[{"name":"Ruth Haas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008007175654805906,"gpt":0.1794947977873769,"spread":0.171487622132571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001883638,0.0000517902,0.0001241642,0.00006461272,0.00001421469,0.000003080593,0.00006160451,0.00002929812,0.0001786278],"category_scores_gemma":[0.00001064841,0.00004894472,0.00004616877,0.00034684,0.00001652027,0.00006050247,0.000006889902,0.0000314256,0.000002798732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007089855,"about_ca_system_score_gemma":9.465733e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005851648,"about_ca_topic_score_gemma":4.843962e-7,"domain_scores_codex":[0.9996446,0.000006501756,0.0001665935,0.00004761631,0.00007570931,0.00005892721],"domain_scores_gemma":[0.9997661,0.0000121523,0.00004303397,0.0001069301,0.0000530509,0.00001875758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004785509,0.0001708584,0.04938291,0.0001996863,0.0003160321,0.000001536871,0.0009209824,0.04157899,0.08511505,0.8148834,0.001531922,0.005893807],"study_design_scores_gemma":[0.001082699,0.0001040216,0.2447855,0.00006038888,0.0001703995,0.000002133512,0.00004409004,0.5303177,0.120759,0.1017352,0.0004717119,0.0004671888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9975858,0.0001123141,0.0001343724,0.00001183946,0.0003235287,0.00003367563,0.000005494856,0.00003659327,0.001756422],"genre_scores_gemma":[0.9996442,0.0001393588,0.0001720512,0.000003270881,0.000001847836,0.000001561991,0.000008000206,0.000006491553,0.00002317363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7131482,"threshold_uncertainty_score":0.1995908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172950155","doi":"","title":"Radio Labelings of Cycles","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Plant Surface Properties and Treatments","field":"Agricultural and Biological Sciences","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","authors":[{"name":"Ping Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02339689257608252,"gpt":0.1922108546035047,"spread":0.1688139620274222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004032245,0.00006621941,0.0001081094,0.000003536829,0.00006469338,0.00001070373,0.0001100175,0.00003604328,0.0003894996],"category_scores_gemma":[0.00001245775,0.00002239907,0.00004136514,0.00009963162,0.00002394692,0.00005286258,0.00002689102,0.00003413637,0.00009232465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000776645,"about_ca_system_score_gemma":6.275027e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001617636,"about_ca_topic_score_gemma":0.00001291003,"domain_scores_codex":[0.9995456,0.00001762111,0.0001029106,0.0001058537,0.0001004636,0.00012759],"domain_scores_gemma":[0.9998115,0.00005030505,0.00004261654,0.00003208943,0.00002342209,0.0000400596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00006075268,0.001631716,0.367318,0.00002772737,0.0001786798,0.00004045391,0.000572201,0.000007292288,0.4237429,0.05012017,0.01314111,0.143159],"study_design_scores_gemma":[0.003248293,0.002374782,0.6096224,0.0002027206,0.000130977,0.00004804832,0.000544466,0.001332163,0.1592773,0.1413365,0.0805943,0.001288046],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9964737,0.0007864783,9.872276e-9,0.0003474445,0.0001873428,0.00005565063,0.00001493029,0.00003030506,0.002104105],"genre_scores_gemma":[0.9992969,0.0001742693,0.00002145469,0.00003161526,0.000003501051,0.00000272607,0.000007676148,4.173755e-7,0.0004614608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2644655,"threshold_uncertainty_score":0.4264747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403887512","doi":"","title":"The Harmonic Index on Unicyclic Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","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; Index (typography); Harmonic; Combinatorics; Statistics; Computer science; Acoustics; Physics; World Wide Web","authors":[{"name":"Lingping Zhong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0319056874760969,"gpt":0.2951569416950728,"spread":0.2632512542189759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550175,0.0001169091,0.0001050938,0.0000401887,0.0004321639,0.00003078784,0.0003174038,0.00006359928,0.00002751465],"category_scores_gemma":[0.0001141701,0.00008139486,0.00008530293,0.0002712528,0.00009651739,0.00007606471,0.00004877479,0.0002100065,0.0002020051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002196683,"about_ca_system_score_gemma":0.00001110409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002834753,"about_ca_topic_score_gemma":0.000001528666,"domain_scores_codex":[0.9991382,0.00009853285,0.0001682082,0.0001135354,0.0001612009,0.0003202768],"domain_scores_gemma":[0.9983867,0.0008054457,0.00008304594,0.0005979157,0.00002921343,0.00009762513],"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.000005937841,0.0001846722,0.001777137,0.000003146311,0.00002392495,1.884647e-7,0.0001343769,6.338092e-8,0.00006537778,0.9912043,0.005372252,0.001228655],"study_design_scores_gemma":[0.000261075,0.00002357252,0.004012501,0.000008060835,0.00001760308,0.000001934283,0.00007814869,0.000008703224,0.001144847,0.9778233,0.01651885,0.0001014182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9859647,0.0001718512,0.00001146179,0.0004645748,0.0007765111,0.0002225121,0.000001963994,0.0001069874,0.01227948],"genre_scores_gemma":[0.9990757,0.00003556707,0.0000478859,0.0001221746,0.00001100145,0.00008584813,0.000001552601,0.0000212188,0.0005991085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01338098,"threshold_uncertainty_score":0.3323899,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002365498,0.0001616897,0.0001641863,0.0001261271,0.0001457652,0.0001199413,0.000651316,0.00007349411,0.000007454001],"category_scores_gemma":[0.00004270132,0.000144943,0.00008061057,0.0004479802,0.00002771785,0.0002194914,0.00006592875,0.0001907274,0.0002371613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000301545,"about_ca_system_score_gemma":0.00004233737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001169247,"about_ca_topic_score_gemma":0.000001703533,"domain_scores_codex":[0.9986718,0.00004997499,0.0001995592,0.0004038879,0.0003401494,0.0003346555],"domain_scores_gemma":[0.9988973,0.00006464414,0.00007297952,0.0007456332,0.00007482179,0.0001446893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005951636,0.0001642277,0.00008401376,9.508553e-7,0.00000405428,0.000015711,0.0001293191,0.00009372458,0.0006192056,0.9822001,0.003984763,0.01269794],"study_design_scores_gemma":[0.0008404882,0.0005875151,0.003421618,0.00002437805,0.000004087268,0.000004994744,0.000003347902,0.004431768,0.001923899,0.9868729,0.001684688,0.0002003347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714348,0.000251112,0.001453173,0.006577601,0.003791229,0.0002537934,0.000001532343,0.0008740697,0.01536273],"genre_scores_gemma":[0.9956524,0.000006382868,0.003080219,0.0009788912,0.000001784197,0.000003914612,0.000001534506,0.000006949993,0.0002679105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02421766,"threshold_uncertainty_score":0.5910604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W179124857","doi":"","title":"Bounding the roots of independence polynomials","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Functional Equations Stability Results","field":"Mathematics","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; Bounding overwatch; Independence (probability theory); Combinatorics; Statistics; Artificial intelligence; Computer science","authors":[{"name":"Jason I. Brown","is_ca":false},{"name":"Richard J. Nowakowski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04643839219436271,"gpt":0.3094851366357045,"spread":0.2630467444413419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058022,0.00009677976,0.0001683057,0.0000515436,0.0001507877,0.00002605471,0.0002807346,0.00007232645,0.0001266286],"category_scores_gemma":[0.002309794,0.00007307326,0.00006796754,0.0003184731,0.0001020712,0.0001233288,0.00007489659,0.000155836,0.00004246614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008271033,"about_ca_system_score_gemma":0.00009245407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007813852,"about_ca_topic_score_gemma":0.00003826391,"domain_scores_codex":[0.998795,0.0001024895,0.0003451211,0.0001578297,0.0004291983,0.0001703993],"domain_scores_gemma":[0.9977072,0.001431303,0.0001672876,0.0004781717,0.000176742,0.00003923768],"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.0000382784,0.0001421908,0.007413805,0.00001898143,0.00002569099,0.00000181731,0.0002798099,0.00001023234,0.001301923,0.9890286,0.001443066,0.000295589],"study_design_scores_gemma":[0.0004562249,0.00004817699,0.008853371,0.00002376495,0.00001963125,0.00001159058,0.0001543882,0.0001236031,0.001479543,0.9877993,0.0009478573,0.00008247643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898183,0.00004823366,0.000113527,0.0006295322,0.0009659787,0.0002334373,0.000004593566,0.00004387826,0.008142483],"genre_scores_gemma":[0.998988,0.000006597048,0.0003675597,0.00003077513,0.00001323796,0.00001768191,0.000001923367,0.00001290345,0.0005613557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00916963,"threshold_uncertainty_score":0.2979841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400192545","doi":"","title":"Note on the generalized connectivity.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"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":"Hengzhe Li","is_ca":false},{"name":"Xueliang Li","is_ca":false},{"name":"Yaping Mao","is_ca":false},{"name":"Yuefang Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01472740028650004,"gpt":0.2350378933231593,"spread":0.2203104930366592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159235,0.0001198423,0.0001526439,0.0000403593,0.0002443755,0.000180299,0.0006891538,0.00006017528,0.00002331435],"category_scores_gemma":[0.0001328818,0.00007866667,0.00008097548,0.0002219783,0.00002685105,0.0001344597,0.000106794,0.0001615515,0.0002567905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003774525,"about_ca_system_score_gemma":0.00001653734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004634101,"about_ca_topic_score_gemma":0.000009318444,"domain_scores_codex":[0.9987648,0.0003496098,0.0001655955,0.0002744096,0.000220731,0.0002248163],"domain_scores_gemma":[0.9984939,0.0005760957,0.00007990615,0.0007216529,0.00007241841,0.00005604802],"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.000003230274,0.00002556197,0.00006682138,0.000001370403,0.000007295902,0.000001159161,0.0001600501,0.00008027569,0.0001159033,0.9860632,0.0117441,0.001731027],"study_design_scores_gemma":[0.0007338093,0.0002505861,0.000608022,0.00002943567,0.000003527735,0.00001256045,0.00001103328,0.2017384,0.002004846,0.7039761,0.09039301,0.0002386582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7828656,0.00004201015,0.1180573,0.01067381,0.02118821,0.0004407205,7.77847e-7,0.0004730633,0.06625845],"genre_scores_gemma":[0.9973305,0.000001858391,0.0001828997,0.001872274,0.00005321069,0.00002569225,4.039178e-7,0.000008796422,0.0005243896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2820871,"threshold_uncertainty_score":0.3300608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403011525","doi":"","title":"A note on the Kirchhoff index of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Resistance distance; Combinatorics; Generalization; Graph; Index (typography); Topological index; Discrete mathematics; Mathematical analysis; Graph power; Line graph; Computer science","authors":[{"name":"Lihua Feng","is_ca":false},{"name":"Guihai Yu","is_ca":false},{"name":"Kexiang Xu","is_ca":false},{"name":"Zhengtao Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02145331754269859,"gpt":0.2789878806951229,"spread":0.2575345631524243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532738,0.0001046121,0.0001570202,0.00006519437,0.000125151,0.00001123795,0.0003222787,0.00006245115,0.00005513207],"category_scores_gemma":[0.0003646456,0.00007213514,0.00009747643,0.0003138759,0.0001196744,0.00002679906,0.0000406412,0.0001612086,0.00006819306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007605666,"about_ca_system_score_gemma":0.00001023958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007386408,"about_ca_topic_score_gemma":0.000002057596,"domain_scores_codex":[0.9992117,0.0001309113,0.0002021762,0.0001385823,0.0001715016,0.0001451754],"domain_scores_gemma":[0.9978424,0.001302094,0.0001285912,0.0006378819,0.00004753246,0.00004154114],"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.000008713196,0.0001569332,0.0005108883,0.00001308861,0.00001513487,1.279634e-7,0.0001966972,5.01438e-7,0.0006804754,0.9956172,0.002340965,0.0004592585],"study_design_scores_gemma":[0.0002856777,0.00006093617,0.001434989,0.00002449048,0.00001707671,7.195516e-7,0.00002164549,0.00008009604,0.004692239,0.9904962,0.002804996,0.00008092718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9807018,0.000006286878,0.0000990588,0.0007673031,0.0002242225,0.0002213345,0.000003270636,0.00005528294,0.01792142],"genre_scores_gemma":[0.999467,0.000002643603,0.0001131379,0.0001837786,0.000004831721,0.00004877817,0.000001187736,0.00001639124,0.00016224],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01876519,"threshold_uncertainty_score":0.2941586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W168516241","doi":"","title":"Anti-Ramsey numbers for small complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Discrete mathematics; Graph; 1-planar graph; Chordal graph","authors":[{"name":"Maria Axenovich","is_ca":false},{"name":"Tao Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04241386506238429,"gpt":0.284002078138853,"spread":0.2415882130764687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000355857,0.0002520578,0.0003921256,0.0001040113,0.0003911707,0.00005166158,0.0003984459,0.0001457749,0.00002994429],"category_scores_gemma":[0.0002248084,0.0002248491,0.0002495958,0.0002455577,0.0001637527,0.00008915414,0.0001080044,0.0001867161,0.00001539942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004869999,"about_ca_system_score_gemma":0.00003576851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003025871,"about_ca_topic_score_gemma":0.00001705651,"domain_scores_codex":[0.9985971,0.00004741681,0.0003599321,0.0003310138,0.0002041015,0.000460376],"domain_scores_gemma":[0.9986963,0.0003394037,0.0001547333,0.0005560799,0.0001187837,0.0001346671],"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.00002605021,0.0001063193,0.001232685,0.00008082595,0.00009030645,0.000006331392,0.0006573724,0.000009462975,0.000300787,0.9958582,0.001467884,0.0001637742],"study_design_scores_gemma":[0.002124573,0.000115465,0.00103829,0.00004713353,0.00006331265,0.00001123469,0.00006872271,0.000014873,0.001365931,0.9904342,0.004415981,0.0003003068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927811,0.00009200851,0.0003901582,0.0002088091,0.002761116,0.0005439046,0.00003661603,0.0001987865,0.002987526],"genre_scores_gemma":[0.9910051,0.00001708207,0.008451103,0.0002690395,0.00002152955,0.00004849979,0.00001412977,0.00005793442,0.0001156255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008060945,"threshold_uncertainty_score":0.9169081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401964130","doi":"","title":"On The Global Asymptotic Behavior Of A System Of Two Nonlinear Difference Equations.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Nonlinear system; Applied mathematics; Mathematical analysis; Physics","authors":[{"name":"İbrahim Yalçınkaya","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02223837557010622,"gpt":0.2998731753405977,"spread":0.2776347997704914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005147842,0.00008614889,0.0003517772,0.00001714639,0.00004448542,0.000001413241,0.0001247505,0.0001191023,0.0001573506],"category_scores_gemma":[0.001128797,0.00004843172,0.00008769396,0.00009373132,0.0003829979,0.000009228413,0.00003575188,0.0002345567,0.00003439977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001334595,"about_ca_system_score_gemma":0.00003922652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001438141,"about_ca_topic_score_gemma":0.000002321758,"domain_scores_codex":[0.9992096,0.00008503372,0.0003290515,0.000117982,0.0001188036,0.000139562],"domain_scores_gemma":[0.9980128,0.001396664,0.0001111481,0.0003139225,0.00009326218,0.00007214923],"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.00004582555,0.0004373201,0.008912615,0.00008452587,0.00002857548,0.000002987061,0.00002220357,0.000001266754,0.0005130274,0.989856,0.000009798987,0.00008584956],"study_design_scores_gemma":[0.0008395907,0.0003635138,0.009160034,0.0001195716,0.0001549568,0.00001562137,0.00002211235,0.01432705,0.001238472,0.9737046,0.000001792748,0.00005266557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9920639,0.000007588627,0.0006125153,0.0004826945,0.0004328018,0.0002557141,0.000009114793,0.00001848034,0.006117144],"genre_scores_gemma":[0.9995354,6.88831e-7,0.0002658429,0.0001201892,0.000006033265,0.00002822164,0.00000355154,0.000004054967,0.00003596466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01615138,"threshold_uncertainty_score":0.1974988,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000683434,0.0001041631,0.0001280631,0.0001440024,0.0001180106,0.00002487437,0.0004932463,0.00004841012,0.00001212051],"category_scores_gemma":[0.0001512093,0.0000667583,0.00006608884,0.0008888042,0.00005214474,0.0001751108,0.0001578017,0.0001246609,0.00009974811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357082,"about_ca_system_score_gemma":0.00001830897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002311793,"about_ca_topic_score_gemma":1.370401e-7,"domain_scores_codex":[0.9989439,0.0001031045,0.0001813897,0.0001636088,0.0003403678,0.000267589],"domain_scores_gemma":[0.9986597,0.0004297711,0.0001024901,0.0006377904,0.00008116398,0.00008911193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002261102,0.0001376648,0.0007799721,0.000002975172,0.00001201191,5.108094e-7,0.0002179016,0.00002686954,0.0008366142,0.9925016,0.004895266,0.000586348],"study_design_scores_gemma":[0.0003821448,0.0001521899,0.001295022,0.00002329735,0.000009327016,0.000003101735,0.00003726051,0.001665208,0.0163855,0.9795818,0.000335704,0.000129479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.99301,0.0005874152,0.0001859024,0.000675962,0.002507028,0.0001303269,4.483421e-7,0.0000916418,0.002811237],"genre_scores_gemma":[0.9988919,0.00001021973,0.0006378704,0.0003846471,0.000001010832,0.000007067069,4.893465e-7,0.000006900184,0.00005986934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01554889,"threshold_uncertainty_score":0.2722324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W31298921","doi":"10.1164/rccm.201906-1275ed","title":"Braodcast Chromatic Numbers of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","authors":[{"name":"Wayne Goddard","is_ca":false},{"name":"Sandra M. Hedetniemi","is_ca":false},{"name":"Stephen T. Hedetniemi","is_ca":false},{"name":"John M. Harris","is_ca":false},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01929074242428957,"gpt":0.2675628570168777,"spread":0.2482721145925881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002704096,0.0001314938,0.0002276862,0.0001842045,0.0001517517,0.00001782764,0.00118106,0.00005182177,0.00002414138],"category_scores_gemma":[0.00009192481,0.0001296808,0.0001004592,0.001077286,0.0002832717,0.0004622974,0.0002755634,0.0001628785,0.00008492772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003068449,"about_ca_system_score_gemma":0.00007943057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001869626,"about_ca_topic_score_gemma":0.000001199039,"domain_scores_codex":[0.9985143,0.0001102725,0.0002572563,0.0002973369,0.0004779842,0.0003428362],"domain_scores_gemma":[0.9985964,0.0001973253,0.0001059482,0.0008445788,0.0001271832,0.0001285229],"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.000005361571,0.0001034871,0.004191742,0.00001831998,0.00001897204,0.00004302601,0.0005249781,0.00000831518,0.001254085,0.9923432,0.000725662,0.0007628227],"study_design_scores_gemma":[0.0006100998,0.0001341735,0.006883877,0.00002104021,0.000002320165,0.00007100368,0.00001995534,0.0006889321,0.008728703,0.9824569,0.0002251615,0.0001578909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891099,0.0001601597,0.003447348,0.0001213532,0.0007317617,0.0001813931,0.00000134116,0.0001515617,0.006095207],"genre_scores_gemma":[0.9941593,0.00003521132,0.005537364,0.00004424388,0.000002087449,0.0000118151,9.544385e-7,0.00001270622,0.0001962617],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009886384,"threshold_uncertainty_score":0.5288231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W145866003","doi":"","title":"A note on graphs with disjoint dominating and total dominating sets.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Dominating set; Combinatorics; Graph","authors":[{"name":"Michael A. Henning","is_ca":false},{"name":"Justin Southey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01371175746408366,"gpt":0.2653739001692003,"spread":0.2516621427051166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048042,0.0002328726,0.0002588134,0.0002232244,0.0005370858,0.00009449105,0.0005212037,0.00006136057,0.000003761858],"category_scores_gemma":[0.0001925428,0.00019463,0.00005539239,0.0007341676,0.0002862287,0.0005553147,0.0003765268,0.0003864817,0.00001683451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006147298,"about_ca_system_score_gemma":0.00005900734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000117598,"about_ca_topic_score_gemma":0.000002382923,"domain_scores_codex":[0.9979703,0.0001487069,0.0002230094,0.0005902629,0.0005587626,0.0005089905],"domain_scores_gemma":[0.9983881,0.0005731469,0.0001164748,0.0006087217,0.0001236919,0.0001898847],"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.00006259509,0.0001077821,0.001983496,0.00001735341,0.00001724588,0.0002346017,0.002286907,0.00004208625,0.0008154575,0.9797966,0.00004615921,0.01458971],"study_design_scores_gemma":[0.003200178,0.001163021,0.01387603,0.000142233,0.000006806617,0.0005042877,0.0001550866,0.01239756,0.0071099,0.9608309,0.00004750816,0.0005665448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9936198,0.00006924647,0.003167462,0.0002849731,0.000303135,0.0002744925,0.000001667234,0.0001578303,0.002121399],"genre_scores_gemma":[0.9828744,0.00001378787,0.01687387,0.00007615126,0.000003334353,0.00003530625,0.000001179839,0.0000234939,0.00009846276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01896576,"threshold_uncertainty_score":0.793678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W176713422","doi":"","title":"The Inverse Domination Number of a Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Graph; Combinatorics; Geometry","authors":[{"name":"Gayla S. Domke","is_ca":false},{"name":"Jean E. Dunbar","is_ca":false},{"name":"Lisa R. Markus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01253304782969812,"gpt":0.2847599724812493,"spread":0.2722269246515512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005412255,0.0000807793,0.00009440196,0.00006183052,0.0001928781,0.00004924932,0.0009473074,0.00003752281,0.000004122437],"category_scores_gemma":[0.0001412672,0.00006102598,0.0000641795,0.000763845,0.0001955615,0.0003671465,0.0002150553,0.0001340845,0.00006680221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004874397,"about_ca_system_score_gemma":0.00006895294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001800757,"about_ca_topic_score_gemma":0.00001278915,"domain_scores_codex":[0.9989755,0.00008733115,0.0001674462,0.0001887052,0.0003477354,0.0002333062],"domain_scores_gemma":[0.998856,0.0002222352,0.00008399229,0.0006077033,0.0001685362,0.00006150937],"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.000009248284,0.0000477062,0.0004663412,0.000003530733,0.000009439128,0.000004042389,0.0002789992,0.00003254475,0.0004304295,0.9961981,0.0001594258,0.002360219],"study_design_scores_gemma":[0.0007396191,0.00004235336,0.0007922965,0.000009732862,0.000001637296,0.000006675583,0.00003566895,0.0001684322,0.007077805,0.9904884,0.0005681704,0.00006925651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9708745,0.00009779784,0.01963158,0.00125861,0.001451769,0.0003107239,0.00000108421,0.0001187996,0.006255087],"genre_scores_gemma":[0.9955603,0.00003405563,0.004212432,0.0000383769,0.0000024158,0.00001768239,4.767411e-7,0.000006709108,0.0001274957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02468581,"threshold_uncertainty_score":0.2488567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W170988298","doi":"","title":"Twin Domination in Digraphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Physics","authors":[{"name":"Gary Chartrand","is_ca":false},{"name":"Peter Dankelmann","is_ca":false},{"name":"Michelle Schultz","is_ca":false},{"name":"Henda C. Swart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01347268203076609,"gpt":0.2752534278787934,"spread":0.2617807458480273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007527139,0.0001048232,0.0001255731,0.0002974697,0.00007036574,0.00006706825,0.0006377933,0.00005328722,0.00001513018],"category_scores_gemma":[0.0002520802,0.0001078331,0.0000434268,0.001298935,0.00005535793,0.0005626163,0.00009288691,0.000192401,0.00006792683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006628649,"about_ca_system_score_gemma":0.00004870832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007029226,"about_ca_topic_score_gemma":0.000005841832,"domain_scores_codex":[0.9986281,0.000236627,0.0001762263,0.0003225161,0.0002958893,0.0003406825],"domain_scores_gemma":[0.9990882,0.0001886642,0.0000426913,0.0005312376,0.00006860223,0.00008063105],"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.000003316045,0.0000779618,0.00470953,0.000003211705,0.00000270198,0.00001752541,0.0001993825,0.00001321727,0.0003899569,0.9916058,0.0001108939,0.002866496],"study_design_scores_gemma":[0.0007614531,0.00004885765,0.004995,0.000009012735,5.843788e-7,0.000005105434,0.00002193524,0.0005362632,0.005231512,0.9864886,0.001774193,0.0001274377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9519205,0.0003472051,0.01747464,0.0003773069,0.001663532,0.0004132807,6.29919e-7,0.0001959456,0.02760696],"genre_scores_gemma":[0.9959,0.00001439028,0.003788817,0.00006174918,0.000001192824,0.00002889782,6.377134e-7,0.000008508948,0.0001957855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04397952,"threshold_uncertainty_score":0.4397306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W67537369","doi":"","title":"Semisymmetric Cubic Graphs Constructed from Bi-Cayley Graphs of An.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Bipartite graph; Vertex-transitive graph; Combinatorics; Cubic graph; Vertex (graph theory); Symmetric graph; Graph; Foster graph; Discrete mathematics; Odd graph; Line graph; Voltage graph; 1-planar graph","authors":[{"name":"Zaiping Lu","is_ca":false},{"name":"Changqun Wang","is_ca":false},{"name":"Mingyao Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0255175707646788,"gpt":0.2851068964393023,"spread":0.2595893256746235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007336449,0.0002985758,0.0005719449,0.0007594838,0.0001233918,0.00005464251,0.0006882029,0.0002425969,0.0003526438],"category_scores_gemma":[0.0006357777,0.0002966339,0.0001913143,0.002333506,0.0003678209,0.0002243466,0.0001571205,0.0003873744,0.0000598371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005899881,"about_ca_system_score_gemma":0.00009363861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091885,"about_ca_topic_score_gemma":0.00003723312,"domain_scores_codex":[0.9971713,0.0003924706,0.0006769281,0.0004710265,0.0007617794,0.0005264948],"domain_scores_gemma":[0.9963464,0.001791592,0.0002927209,0.001058694,0.0003438981,0.0001666783],"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.00006796172,0.0005760176,0.02565884,0.00006437502,0.00008566213,0.00002731722,0.0001055436,8.414474e-7,0.008357746,0.9609107,0.003772357,0.0003726024],"study_design_scores_gemma":[0.001955817,0.0001787901,0.01053934,0.00004754369,0.00005969593,0.000008534003,0.0001574571,0.0001269118,0.02324748,0.963304,0.00008432797,0.0002901222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9902296,0.0002323045,0.00001561931,0.00002272698,0.0008294709,0.0003757678,0.0001024394,0.0001973741,0.007994677],"genre_scores_gemma":[0.9968117,0.00001167394,0.002773932,0.00001371719,0.00001288788,0.00002369662,0.00008503701,0.00007064832,0.0001966475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01511951,"threshold_uncertainty_score":0.9999486,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005597763,0.0001564494,0.0002598943,0.0004003762,0.0000982271,0.00003871318,0.0005430173,0.00007150623,0.000006337501],"category_scores_gemma":[0.0001562462,0.0001333028,0.0001145667,0.001061953,0.00005117174,0.0001313266,0.0001573578,0.0001145577,0.0000611592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001343578,"about_ca_system_score_gemma":0.00001991618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003973073,"about_ca_topic_score_gemma":4.962715e-7,"domain_scores_codex":[0.998491,0.0001633433,0.0003009115,0.000374849,0.0004175828,0.0002523166],"domain_scores_gemma":[0.9985269,0.0002409903,0.0001593392,0.0008036376,0.000151422,0.0001177141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000738527,0.0001126806,0.0003226181,0.000007740897,0.00001395134,0.000001777414,0.00006694727,0.0001881197,0.003736142,0.9926254,0.001537119,0.001380182],"study_design_scores_gemma":[0.001152437,0.0003774381,0.0006801642,0.00002873578,0.000009026757,0.000002727625,0.000002683657,0.0122895,0.01135604,0.9737365,0.0002028504,0.0001619504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9941009,0.0001268449,0.001113056,0.0002320351,0.002136989,0.0001150255,5.629187e-7,0.0001706018,0.002003947],"genre_scores_gemma":[0.9944101,0.00001267164,0.00514121,0.0003540134,7.27255e-7,0.000005720758,0.000002097634,0.00001133297,0.00006213776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01888888,"threshold_uncertainty_score":0.5435931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W171110949","doi":"","title":"The total number of generalized stable sets and kernels of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","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; Combinatorics","authors":[{"name":"Maria Kwaśnik","is_ca":false},{"name":"Iwona Włoch","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0120708156354744,"gpt":0.2810397959182403,"spread":0.2689689802827659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004659765,0.00009620301,0.000178587,0.00003771282,0.0001242348,0.00003958444,0.0006510869,0.00003899037,0.00006259545],"category_scores_gemma":[0.00003430226,0.00007249528,0.00005459281,0.0004589454,0.0002533785,0.0002643867,0.0001996641,0.0001045816,0.00001110159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009870761,"about_ca_system_score_gemma":0.00003689944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004108611,"about_ca_topic_score_gemma":0.000001110231,"domain_scores_codex":[0.9988248,0.0001454171,0.000225424,0.0002169114,0.0003218127,0.0002656882],"domain_scores_gemma":[0.9989039,0.0002544895,0.00007562646,0.0005849067,0.0001076939,0.00007333291],"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.00002977902,0.00004674901,0.002152929,0.000009192461,0.00002260383,0.000002416652,0.0002074691,0.00002368946,0.001008693,0.9863493,0.0001989895,0.009948214],"study_design_scores_gemma":[0.0006792197,0.00006059388,0.004344419,0.00001051034,0.00000296517,0.00001263631,0.00001354961,0.00121642,0.008168031,0.984998,0.0004086506,0.00008499956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9961613,0.0003570627,0.0001332945,0.0001006683,0.0002058673,0.0001355699,0.000003659587,0.00002647527,0.002876043],"genre_scores_gemma":[0.9971132,0.0001951641,0.001793807,0.00001221969,0.000001222662,0.000009366516,6.072916e-7,0.000008059277,0.0008663292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009863215,"threshold_uncertainty_score":0.2956272,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002734138,0.0001234309,0.0001607484,0.0001929888,0.0001439534,0.0000482752,0.0009319362,0.00005385474,0.000001509102],"category_scores_gemma":[0.0001184293,0.00007561471,0.0001110719,0.001253687,0.0000658772,0.0002008588,0.0001100404,0.0001451531,0.00001968415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001510635,"about_ca_system_score_gemma":0.0000452702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001303782,"about_ca_topic_score_gemma":2.277061e-7,"domain_scores_codex":[0.9988212,0.00007801314,0.0002280399,0.0002524732,0.0004037004,0.0002165563],"domain_scores_gemma":[0.998894,0.00004601434,0.0001145939,0.0007828809,0.0001038361,0.0000586301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000371494,0.000154778,0.0001147366,0.000004958524,0.000007864171,9.154763e-7,0.0001201965,0.00004126827,0.00438157,0.9926825,0.0009911172,0.001496375],"study_design_scores_gemma":[0.0003545332,0.0002223401,0.001895048,0.0000556775,0.000005055456,0.000001892035,0.000003879093,0.0005620344,0.04369289,0.9530519,0.00005295523,0.0001017713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9946826,0.0009424484,0.00001396992,0.001491406,0.001675553,0.0001565938,3.583511e-7,0.0001154997,0.0009215758],"genre_scores_gemma":[0.9987328,0.00001791025,0.000230941,0.0009192526,4.611034e-7,0.000003878587,1.411619e-7,0.000004868528,0.00008974164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03963058,"threshold_uncertainty_score":0.3083479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237707,0.0001627637,0.0002067519,0.0004791788,0.0001374514,0.0001123371,0.0007058093,0.00008063671,0.000002777916],"category_scores_gemma":[0.0001723139,0.0001611904,0.00006630521,0.002368565,0.00004366778,0.0003459645,0.0002231826,0.0002337134,0.00006060545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007236142,"about_ca_system_score_gemma":0.00008292851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002434689,"about_ca_topic_score_gemma":0.00001344953,"domain_scores_codex":[0.9984031,0.00006570138,0.000350823,0.0004403066,0.0003436145,0.0003964205],"domain_scores_gemma":[0.9989914,0.0001272025,0.0001158983,0.000544219,0.0001065861,0.0001147091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001288665,0.0001324504,0.002432041,0.000008685207,0.000007173891,0.00002755171,0.0004798671,0.0004481508,0.000422711,0.9927307,0.00008051911,0.0032288],"study_design_scores_gemma":[0.001574447,0.00008442632,0.002750713,0.00006899278,0.000003438352,0.0000108938,0.00002873349,0.002008467,0.003582218,0.9896613,0.00002412002,0.0002022836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9943209,0.0004436653,0.0007306142,0.0007692918,0.001575671,0.0001609089,3.78545e-7,0.0002464213,0.001752117],"genre_scores_gemma":[0.9825901,0.00001171778,0.01708999,0.0002592954,4.728104e-7,0.00001731007,0.00000129032,0.00001170671,0.00001813641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01635938,"threshold_uncertainty_score":0.6573152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397663352","doi":"","title":"On vertex irregular total labelings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001958446,0.0001665649,0.0001642528,0.0001034492,0.0001600929,0.000200385,0.0005937546,0.00008416231,0.00007051692],"category_scores_gemma":[0.0000720046,0.0001467243,0.00007198956,0.0003847758,0.00004428728,0.0003548008,0.0001877387,0.0001743374,0.002057896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002530841,"about_ca_system_score_gemma":0.00003342049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000076951,"about_ca_topic_score_gemma":2.969072e-7,"domain_scores_codex":[0.9986179,0.00005100152,0.0002117282,0.0004128999,0.0003543425,0.0003521683],"domain_scores_gemma":[0.9987814,0.00009596498,0.00006394556,0.0007413257,0.0001487376,0.0001686525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001212484,0.0001029056,0.00007986816,0.000003578451,0.00001092642,0.000005159694,0.00009382031,0.00003147319,0.001323481,0.9749593,0.02062286,0.002765423],"study_design_scores_gemma":[0.0006073813,0.0001764929,0.0009016721,0.00002759813,0.000003267574,0.000007600839,0.000005720799,0.01073938,0.001937631,0.9851217,0.0002700881,0.0002014629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9905838,0.0001663444,0.0001848055,0.001344256,0.003480834,0.0001961927,4.638908e-7,0.0003939206,0.003649319],"genre_scores_gemma":[0.9960502,0.000004469531,0.002393547,0.0008479298,0.000001017743,0.00002611696,0.000001840285,0.00001326168,0.0006616581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02035277,"threshold_uncertainty_score":0.9987191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407498472","doi":"","title":"On The Generalized Fibonacci And Pell Sequences By Hessenberg Matrices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Recurrence relation; Combinatorics; Pisano period; Lucas sequence; Lucas number; Sequence (biology); Fibonacci polynomials; Prime (order theory); Discrete mathematics; Arithmetic; Orthogonal polynomials","authors":[{"name":"Emrah Kılıç","is_ca":false},{"name":"Dursun Taşçı","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006300082100492631,"gpt":0.2459441925894685,"spread":0.2396441104889759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008728955,0.00009818735,0.0001022249,0.000008051718,0.0001892711,0.00004881784,0.0001490054,0.00002370782,0.0004894292],"category_scores_gemma":[0.00001190473,0.00006282374,0.00003229814,0.00008770046,0.00009506853,0.00005016654,0.00003932677,0.0001639581,0.0000526339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003119721,"about_ca_system_score_gemma":0.000009103053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000263471,"about_ca_topic_score_gemma":4.978193e-7,"domain_scores_codex":[0.9995134,0.00001536972,0.0001074905,0.0001446073,0.00008314345,0.0001360097],"domain_scores_gemma":[0.9993256,0.0003171549,0.00005729394,0.0002209557,0.00002322106,0.00005572796],"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.00000191722,0.00004550191,0.000128557,0.000002149965,0.000009074526,8.480415e-8,0.00003231103,7.767394e-7,0.002464899,0.9922676,0.004466385,0.0005807578],"study_design_scores_gemma":[0.0001765903,0.00001252486,0.00002018414,0.0000037155,0.000007742045,2.892898e-7,0.00006353122,0.00009140249,0.004789933,0.9800088,0.01473946,0.00008586837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9791358,0.0000399851,0.0004085837,0.001279411,0.0002074959,0.000181504,0.00002362138,0.00002573797,0.01869791],"genre_scores_gemma":[0.998599,0.000006477064,0.0004485567,0.00009818876,0.00001913002,0.00005420078,0.000008919444,0.00001014044,0.0007554086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01946322,"threshold_uncertainty_score":0.5358907,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002611829,0.0001207619,0.0002030547,0.0001210507,0.0002123131,0.0000307557,0.0005087006,0.00005704582,0.000004255677],"category_scores_gemma":[0.0001537409,0.0001206329,0.00008607742,0.0005725386,0.00009218779,0.0002456004,0.0002193175,0.000137468,0.000017835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000161563,"about_ca_system_score_gemma":0.00005848459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009072082,"about_ca_topic_score_gemma":7.536452e-7,"domain_scores_codex":[0.9988072,0.00004206587,0.0002827003,0.0002906099,0.0003164124,0.0002610396],"domain_scores_gemma":[0.9990281,0.0001173978,0.0001238263,0.0004706796,0.0001598992,0.0001000867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002771338,0.00007668768,0.006990734,0.00001021025,0.0000134227,0.00002824338,0.000532167,0.0000370452,0.001890186,0.9890825,0.000906097,0.0004299808],"study_design_scores_gemma":[0.0007932303,0.0001553023,0.008929724,0.00005495301,0.000006173178,0.00007228927,0.00001721615,0.003573068,0.008603927,0.9774676,0.0001078381,0.0002186905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9938357,0.0002319545,0.0001453391,0.0000838433,0.002438159,0.00007133111,6.370752e-7,0.0001907627,0.003002273],"genre_scores_gemma":[0.9959149,0.00001385691,0.003921763,0.00005198555,7.336604e-7,0.000005032918,9.675306e-7,0.000008683957,0.0000821202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01161487,"threshold_uncertainty_score":0.4919266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W180089728","doi":"","title":"Restricted edge-connectivity and minimum edge-degree.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","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":"Enhanced Data Rates for GSM Evolution; Degree (music); Mathematics; Computer science; Telecommunications; Physics","authors":[{"name":"Nicola Ueffing","is_ca":false},{"name":"Lutz Volkmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02030007296313182,"gpt":0.2329187095659705,"spread":0.2126186366028386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004474246,0.0001860162,0.000250846,0.0001104596,0.0002439329,0.0002234499,0.0003847125,0.0001308596,0.0000159436],"category_scores_gemma":[0.0002201374,0.0001768069,0.00006511484,0.000535021,0.00004952423,0.0003993147,0.0001182911,0.0002090083,0.00005516687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005777497,"about_ca_system_score_gemma":0.00006583749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004665011,"about_ca_topic_score_gemma":0.00001105401,"domain_scores_codex":[0.998382,0.0002955438,0.0002730305,0.0004845865,0.0002109394,0.0003539028],"domain_scores_gemma":[0.9987242,0.0002748908,0.0001102566,0.0005941836,0.0001409059,0.0001555643],"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.00000438622,0.00007300611,0.002345456,0.000009163157,0.00002002842,0.00001604157,0.0002614788,0.000004311141,0.0002971942,0.985198,0.009407981,0.002362925],"study_design_scores_gemma":[0.004093568,0.0008149928,0.03537433,0.000136127,0.00002923099,0.0003814695,0.0002348683,0.02509471,0.004203807,0.8431521,0.08516076,0.001324019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9395345,0.0005552376,0.0125916,0.0003977795,0.01230967,0.0003377023,0.000001190381,0.000337502,0.03393474],"genre_scores_gemma":[0.9983575,0.00001805771,0.0005605178,0.00013727,0.00002562309,0.00002072629,7.060341e-7,0.00001331751,0.0008662224],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1420459,"threshold_uncertainty_score":0.7209975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405098219","doi":"","title":"A Convolution Formula For Bernoulli Polynomials.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Bernoulli's principle; Convolution (computer science); Bernoulli polynomials; Pure mathematics; Orthogonal polynomials; Difference polynomials; Artificial intelligence; Computer science; Physics","authors":[{"name":"Yuan He","is_ca":false},{"name":"Wenpeng Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03461364176142281,"gpt":0.3070050632982418,"spread":0.2723914215368191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002003816,0.0001720339,0.0003066282,0.00005900143,0.0001331182,0.00007072579,0.0002063866,0.0001040787,0.0002183387],"category_scores_gemma":[0.0009727693,0.000160606,0.0001227819,0.00009010058,0.00007724852,0.0004115719,0.00007454573,0.00009495691,0.0002983002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001016121,"about_ca_system_score_gemma":0.00002757014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002903358,"about_ca_topic_score_gemma":0.000004355375,"domain_scores_codex":[0.9988478,0.00002421076,0.0003671524,0.0002060127,0.000194491,0.0003603257],"domain_scores_gemma":[0.99839,0.0008062931,0.0001482547,0.0003561321,0.00019807,0.0001012376],"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.000006070653,0.0001125306,0.00004194417,0.0001431694,0.00002637806,4.356411e-7,0.0001829188,3.463816e-7,0.0008258648,0.9711521,0.02731425,0.0001939517],"study_design_scores_gemma":[0.000887203,0.00007857917,0.00007909735,0.00004284375,0.00003510481,0.000003661293,0.000153419,0.0004735961,0.003228777,0.9935182,0.001305231,0.0001942722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9698927,0.0001604001,0.01299142,0.0007093909,0.001827646,0.002568884,0.00001874827,0.0004657827,0.011365],"genre_scores_gemma":[0.9639063,0.000008484906,0.02674517,0.00007217921,0.00002774329,0.0006195811,0.000008675703,0.0000624781,0.008549396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02600902,"threshold_uncertainty_score":0.6549321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W181220164","doi":"","title":"On the partition dimension and connected partition dimension of wheels","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Dimension (graph theory); Combinatorics","authors":[{"name":"Ioan Tomescu","is_ca":false},{"name":"Imran Javaid","is_ca":false},{"name":"Slamin Slamin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01299084395861121,"gpt":0.2261670760803161,"spread":0.2131762321217049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156993,0.0001420405,0.0001671687,0.0001104434,0.0002245323,0.00004632082,0.000201766,0.000085616,0.00001010671],"category_scores_gemma":[0.0001620431,0.0001014622,0.00004686892,0.0004232244,0.000105623,0.0001967827,0.0001240694,0.0001447566,0.00002541813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001903058,"about_ca_system_score_gemma":0.00001814107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002984687,"about_ca_topic_score_gemma":0.000004801042,"domain_scores_codex":[0.9986091,0.0001271192,0.0003289598,0.000323001,0.0003513433,0.0002605012],"domain_scores_gemma":[0.9984918,0.0005559793,0.0001716281,0.0005013663,0.0001821466,0.00009705277],"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.00002234349,0.0001134384,0.0004098062,0.000007958581,0.000009618917,0.000004466338,0.0002532571,0.00002144909,0.02783975,0.9693299,0.001247782,0.000740221],"study_design_scores_gemma":[0.0006686744,0.0003524495,0.004462121,0.0001195878,0.00001025774,0.000006314021,0.00002747074,0.003044325,0.08678794,0.904292,0.00008924057,0.0001395868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9962758,0.0001519799,0.000845126,0.001021638,0.0009354803,0.0002079301,9.74107e-7,0.0001197106,0.0004414016],"genre_scores_gemma":[0.9989938,0.00002271879,0.0005141657,0.0004296027,0.000001327479,0.000006604043,0.000004548847,0.000008659944,0.00001860603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06503788,"threshold_uncertainty_score":0.4137506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2394717430","doi":"","title":"Total edge irregularity strength of a categorical product of two paths.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Categorical variable; Enhanced Data Rates for GSM Evolution; Product (mathematics); Statistics; Geometry; Artificial intelligence; Computer science","authors":[{"name":"Ali Ahmad","is_ca":false},{"name":"Martin Bača","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01053064458863691,"gpt":0.229390639719757,"spread":0.2188599951311201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006036406,0.0001341044,0.0002983168,0.00009816623,0.00005487705,0.00002168802,0.0005396441,0.00004921589,0.000004128469],"category_scores_gemma":[0.000149502,0.0001191728,0.0000907914,0.0004966977,0.0001054951,0.0001519261,0.0002508887,0.0001378372,0.000009021298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001318446,"about_ca_system_score_gemma":0.00007038628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001507117,"about_ca_topic_score_gemma":0.000001881991,"domain_scores_codex":[0.9985465,0.000130296,0.0003684525,0.0003667933,0.0003548226,0.0002331424],"domain_scores_gemma":[0.9985321,0.0001019562,0.0001897355,0.0008322567,0.0002433997,0.0001005915],"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.000003793107,0.0003128137,0.002082206,0.00002927112,0.00001353428,0.000001398088,0.0001967119,0.00002385024,0.004195226,0.9882326,0.0004989569,0.004409617],"study_design_scores_gemma":[0.0009358578,0.0002368224,0.003210327,0.00002044491,0.00001132745,0.000008476442,0.000004696991,0.007134338,0.03480722,0.9533818,0.00009749991,0.0001512284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9958656,0.0001758154,0.001103112,0.0002177423,0.001674054,0.000122111,0.000001452251,0.00008659172,0.0007535605],"genre_scores_gemma":[0.9955977,0.00000281518,0.004310413,0.00002129537,0.000002685981,0.000005007973,0.000002165401,0.000007596383,0.00005036627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03485086,"threshold_uncertainty_score":0.4859726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W125103475","doi":"","title":"On the detour number and geodetic number of a graph","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","authors":[{"name":"Gary Chartrand","is_ca":false},{"name":"Garry L. Johns","is_ca":false},{"name":"Ping Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009437448856650828,"gpt":0.2281541060738885,"spread":0.2187166572172377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002858073,0.0001116173,0.0001303588,0.00003370603,0.0001218411,0.00005167014,0.0003792667,0.00004959661,0.00001697131],"category_scores_gemma":[0.00005419599,0.00007664058,0.00005267473,0.0003638974,0.0001017842,0.00009792684,0.0001303349,0.0001282336,0.0001041551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000979576,"about_ca_system_score_gemma":0.00003335283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008952594,"about_ca_topic_score_gemma":0.000001869199,"domain_scores_codex":[0.9991035,0.00005012625,0.000173533,0.0002394225,0.0002437969,0.000189643],"domain_scores_gemma":[0.9991183,0.0001613848,0.00007538743,0.0004993195,0.00007690332,0.00006875497],"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.000002664306,0.00008062404,0.001729456,0.00000495029,0.00001147763,0.000004161874,0.0002569887,0.00002464152,0.0001812833,0.997016,0.0004877241,0.0002000173],"study_design_scores_gemma":[0.0006047058,0.00004873606,0.00129178,0.00004296637,0.000005756372,0.00002163103,0.00001280211,0.0001346301,0.002133633,0.9955572,0.00004984404,0.00009625647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952314,0.00005054082,0.0002222308,0.001311269,0.0005723622,0.00009578175,5.582108e-7,0.00006347553,0.002452385],"genre_scores_gemma":[0.997921,0.0000139164,0.001548543,0.0004471924,5.390744e-7,0.000008169018,2.603956e-7,0.000007265381,0.00005309887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002689619,"threshold_uncertainty_score":0.3125312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W140290324","doi":"","title":"Generalized Steiner Triple Systems with Group Size g = 7, 8.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Group (periodic table); Steiner tree problem; Combinatorics; Pure mathematics; Physics","authors":[{"name":"Dianhua Wu","is_ca":false},{"name":"Gennian Ge","is_ca":false},{"name":"Lie Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004838672456518819,"gpt":0.1755905566206712,"spread":0.1707518841641524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002023756,0.0002273007,0.0003089786,0.00004461779,0.00008519555,0.00007252923,0.000203169,0.0001024749,0.0003213682],"category_scores_gemma":[0.00000547095,0.0001899774,0.00006583281,0.0003027579,0.00003439423,0.0001500785,0.000007801913,0.0001429641,0.0002129691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004153782,"about_ca_system_score_gemma":0.00000743255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005611817,"about_ca_topic_score_gemma":0.000004783023,"domain_scores_codex":[0.9988979,0.00009202262,0.0002614468,0.0002032792,0.0002105175,0.0003348595],"domain_scores_gemma":[0.9993675,0.00006092317,0.00002773286,0.0003987287,0.00002590756,0.0001192613],"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.0002024027,0.0001472732,0.001598545,0.0002726731,0.0003689413,0.00009396264,0.0005748043,0.01089573,0.003847098,0.9668992,0.01359771,0.001501728],"study_design_scores_gemma":[0.03807812,0.002055038,0.009421643,0.001133734,0.0004899885,0.0006079815,0.001209592,0.05195226,0.006317209,0.2078104,0.675039,0.005885048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9751483,0.0009926675,0.00001463849,0.000009828234,0.002362343,0.0003172395,0.000006982468,0.0005570005,0.02059096],"genre_scores_gemma":[0.995861,0.0000397399,0.00004165267,0.00002155966,0.0000309205,0.00009449906,0.000008728538,0.00006265489,0.003839273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7590888,"threshold_uncertainty_score":0.7747052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399769410","doi":"","title":"On Some Rational Difference Equations.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","authors":[{"name":"Bratislav Iričanin","is_ca":false},{"name":"Stevo Stević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02277129587057327,"gpt":0.292089862847564,"spread":0.2693185669769907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002311195,0.0001087607,0.0001038287,0.0001357994,0.0001875019,0.0001039655,0.0008424511,0.00004103634,0.00001781871],"category_scores_gemma":[0.0002515193,0.0001025576,0.00004291602,0.0004107545,0.00004469698,0.0004664242,0.00008310528,0.0001856087,0.0002151524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005519277,"about_ca_system_score_gemma":0.00006484506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.274775e-7,"about_ca_topic_score_gemma":1.842679e-7,"domain_scores_codex":[0.9987183,0.00009125465,0.0001429908,0.0003119093,0.0004674027,0.0002681356],"domain_scores_gemma":[0.9987533,0.0004449726,0.00004518677,0.0005625218,0.00009292222,0.0001010927],"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.000007072077,0.0001122499,0.00003322007,7.835407e-7,0.000002970115,0.000005376076,0.00005673544,0.00006247019,0.0008042451,0.9896626,0.0002913024,0.008960918],"study_design_scores_gemma":[0.0003659817,0.0002386973,0.004645067,0.000008028314,7.331284e-7,0.000001365543,0.000001881543,0.007261075,0.001472063,0.9858147,0.00007406338,0.0001163621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7337517,0.0002542117,0.2413553,0.0101727,0.002822748,0.0006677255,0.000005222229,0.0007432651,0.01022709],"genre_scores_gemma":[0.9968033,0.000005483382,0.001932392,0.0007841979,0.000005922879,0.00001291679,0.000003398565,0.000004549173,0.0004478332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2630516,"threshold_uncertainty_score":0.4182176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407807588","doi":"","title":"Essential Norms Of Weighted Composition Operators From The Bergman Space To Weighted-Type Spaces On The Unit Ball.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Unit sphere; Bergman space; Ball (mathematics); Composition (language); Type (biology); Space (punctuation); Pure mathematics; Arithmetic; Mathematical analysis; Computer science; Linguistics; Geology","authors":[{"name":"Stevo Stević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.018605445227476,"gpt":0.2670452597752822,"spread":0.2484398145478061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456537,0.0002842013,0.0003686374,0.00006091611,0.0003576024,0.00009444094,0.0006770704,0.0001447678,0.0003324497],"category_scores_gemma":[0.000128577,0.0001596675,0.0001022737,0.0005459392,0.0001304561,0.0001008986,0.00009009604,0.0003522949,0.000184124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004750822,"about_ca_system_score_gemma":0.00006347044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009729117,"about_ca_topic_score_gemma":0.00002273687,"domain_scores_codex":[0.9981689,0.0003785773,0.000365798,0.0003028105,0.0004810534,0.0003028762],"domain_scores_gemma":[0.9977854,0.0008865709,0.000156304,0.0008193934,0.0002296853,0.000122587],"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.0001582726,0.0003197277,0.0006024161,0.000005404922,0.00009041338,0.000009689919,0.001642344,0.000004185259,0.007263614,0.9772929,0.01249665,0.0001143828],"study_design_scores_gemma":[0.001113505,0.0006535497,0.002761156,0.0001897665,0.0001429638,0.00000371548,0.0009622532,0.000193079,0.08994126,0.9007971,0.002851811,0.0003898927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9886681,0.00006985267,0.00004344259,0.006536565,0.0009915567,0.0005385033,0.00002723917,0.00008197717,0.003042799],"genre_scores_gemma":[0.9981619,0.00002075442,0.0003636717,0.00109593,0.00006227034,0.00001031976,0.00002735041,0.00003271446,0.0002250512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08267765,"threshold_uncertainty_score":0.6511053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399806649","doi":"","title":"Minimum Metric Dimension of Silicate Networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Combinatorics","authors":[{"name":"Paul Manuel","is_ca":false},{"name":"Indra Rajasingh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02149264337678972,"gpt":0.222831616258776,"spread":0.2013389728819862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926606,0.000116867,0.0002228106,0.0001464612,0.00006641525,0.00002523116,0.0006107392,0.00008416499,0.00001906057],"category_scores_gemma":[0.000027046,0.0001029387,0.00009267191,0.0008095778,0.00003155404,0.0002258563,0.0001864883,0.0001052507,0.00003890981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002393635,"about_ca_system_score_gemma":0.00001747019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008371679,"about_ca_topic_score_gemma":0.00000193936,"domain_scores_codex":[0.9988704,0.00009754678,0.0003377931,0.0002728838,0.0001864607,0.0002349661],"domain_scores_gemma":[0.9989193,0.00009119363,0.0001769673,0.0005825476,0.0001499647,0.00008001077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001059951,0.0001298716,0.002500102,0.000008642867,0.00003025741,0.000007650816,0.000520986,0.0001167042,0.0001863282,0.990297,0.003723945,0.00246793],"study_design_scores_gemma":[0.002163794,0.001265389,0.01615888,0.0001586849,0.00004061147,0.00006325289,0.0001624247,0.6292328,0.01423191,0.3318878,0.003766281,0.0008682167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8602808,0.001043774,0.09184701,0.0001112101,0.0182322,0.0004474974,8.076577e-7,0.00034994,0.02768674],"genre_scores_gemma":[0.9988751,0.00001627325,0.0008309473,0.00006369188,0.00001380995,0.000008802725,6.472595e-7,0.000008893181,0.0001818784],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6584092,"threshold_uncertainty_score":0.4197719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406639167","doi":"","title":"Vulnerability Of Mycielski Graphs Via Residual Closeness.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Closeness; Mathematics; Residual; Statistics; Combinatorics; Algorithm","authors":[{"name":"Tufan Turacı","is_ca":false},{"name":"Mukaddes Ökten","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03400394482779249,"gpt":0.3046801913416691,"spread":0.2706762465138766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001740463,0.0001718782,0.0002940444,0.0001953197,0.00009687131,0.00004637082,0.001546081,0.0000949774,0.000008289967],"category_scores_gemma":[0.0004252096,0.000163644,0.00009082147,0.001148497,0.0002850549,0.0005981462,0.0005862461,0.0002834642,0.0000425979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006617112,"about_ca_system_score_gemma":0.0001899106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004564338,"about_ca_topic_score_gemma":0.000004399915,"domain_scores_codex":[0.9975391,0.00041004,0.0003556423,0.000489661,0.0007772603,0.0004283075],"domain_scores_gemma":[0.9974226,0.0003304091,0.0001298703,0.00134874,0.0004891807,0.0002791924],"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.00003536794,0.0001807669,0.005826631,0.0000151246,0.00001655079,0.00001384586,0.0003665982,0.00003761649,0.001105648,0.9879844,0.0007058867,0.003711609],"study_design_scores_gemma":[0.0008332407,0.0002707487,0.002758905,0.000009276143,0.000003339856,0.000008715563,0.00003424202,0.0006379266,0.01957219,0.9752886,0.000410783,0.0001720389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9786569,0.0003117466,0.01365735,0.000422529,0.001843093,0.0003136812,0.000004096954,0.0002168466,0.00457369],"genre_scores_gemma":[0.9945125,0.000006187515,0.00528626,0.00004552435,0.000006102744,0.00001868201,0.000002194453,0.00001403584,0.0001085303],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01846655,"threshold_uncertainty_score":0.667321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402033281","doi":"","title":"On the Wiener index of unicyclic graphs with given girth.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","authors":[{"name":"Guihai Yu","is_ca":false},{"name":"Lihua Feng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0144896464537898,"gpt":0.2546082013446283,"spread":0.2401185548908385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859682,0.000106683,0.0001328969,0.00005329381,0.0001243713,0.00001164164,0.0003234517,0.00006545636,0.00008958275],"category_scores_gemma":[0.00009763266,0.00006413273,0.00005599995,0.0003167651,0.0002033664,0.00003957283,0.00003289894,0.0002814776,0.00001736884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003816905,"about_ca_system_score_gemma":0.00001876483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009132754,"about_ca_topic_score_gemma":0.0000206178,"domain_scores_codex":[0.9993621,0.00005239187,0.0001474966,0.0001362536,0.0001679207,0.0001338682],"domain_scores_gemma":[0.9984339,0.0006681623,0.0001199081,0.0006690596,0.00006611234,0.00004281199],"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.00001386527,0.0001925468,0.0011784,0.00000640898,0.00002922113,5.558183e-7,0.0001712234,6.296415e-7,0.001420577,0.9957832,0.001059349,0.0001440186],"study_design_scores_gemma":[0.0003569586,0.00007384316,0.001654796,0.00001685228,0.00002065104,0.000002213574,0.00006878408,0.00002007099,0.005108654,0.9918233,0.0007678516,0.00008599011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9899836,0.000003575248,0.00001818821,0.0004490895,0.0001762583,0.0002287291,0.000004444521,0.00004033495,0.009095821],"genre_scores_gemma":[0.9994764,0.000001671012,0.0001768865,0.00007744545,0.000002938466,0.00005297836,0.000001448019,0.00001803589,0.0001922427],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009492794,"threshold_uncertainty_score":0.2615257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402513589","doi":"","title":"Decompositions of complete graphs into paths and cycles","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","authors":[{"name":"Tay Woei Shyu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005252879354272561,"gpt":0.2022782413432858,"spread":0.1970253619890132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001084055,0.00009128641,0.0001440228,0.00007352589,0.0000672085,0.0000144765,0.0001017158,0.00006044015,0.00001661788],"category_scores_gemma":[0.000007438158,0.00009386159,0.00004217345,0.0001191988,0.0000814025,0.00006854552,0.00002019784,0.0001370258,0.000008985704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003496367,"about_ca_system_score_gemma":0.000003218168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000192027,"about_ca_topic_score_gemma":0.00002144444,"domain_scores_codex":[0.9995544,0.00002131444,0.0001572453,0.00008790994,0.00006723581,0.0001118852],"domain_scores_gemma":[0.9996304,0.00006497785,0.00002381089,0.0001914288,0.00002622363,0.00006315058],"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.000002310821,0.00002081884,0.00418808,0.00005159111,0.00002619643,0.000001645752,0.0003448182,0.00001278252,0.1373897,0.8574007,0.0001389439,0.0004223815],"study_design_scores_gemma":[0.0003835428,0.00003618424,0.01625449,0.00002855753,0.00001562433,0.00001316146,0.00009462754,0.000679861,0.01104164,0.9703878,0.0009089218,0.000155618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9960687,0.000161335,0.00002137465,0.00001502988,0.001478338,0.00007901747,0.000008841624,0.0001071435,0.002060283],"genre_scores_gemma":[0.9997047,0.00001371414,0.0002363693,0.000006335602,0.000003888813,0.0000105795,0.000005443253,0.00001497565,0.000003954676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1263481,"threshold_uncertainty_score":0.3827565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}