{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"0d39ecb0fa88","filters":{"venue":"Open Journal of Discrete Applied Mathematics"}},"results":[{"id":"W2996927339","doi":"10.30538/psrp-odam2019.0021","title":"On graceful difference labelings of disjoint unions of circuits","year":2019,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bijection; Conjecture; Disjoint sets; Vertex (graph theory); Combinatorics; Mathematics; Arc (geometry); Electronic circuit; Graph; Set (abstract data type); Discrete mathematics; Computer science; Physics; Geometry","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Christophe Picouleau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01854687899141908,"gpt":0.2528436077341566,"spread":0.2342967287427375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574021,0.0006602287,0.0007491159,0.001470388,0.00158861,0.002584979,0.001422485,0.001254197,0.004958199],"category_scores_gemma":[0.008090029,0.0006929424,0.001003317,0.001436401,0.003472535,0.005379139,0.003120904,0.002238459,0.0005765395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002103559,"about_ca_system_score_gemma":0.000544088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001235188,"about_ca_topic_score_gemma":0.001074636,"domain_scores_codex":[0.9978714,0.0004440199,0.0001470651,0.0006687272,0.0004915883,0.0003772231],"domain_scores_gemma":[0.9911574,0.005194833,0.0009536903,0.001597185,0.0005125708,0.0005842485],"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.0002101097,0.00005438359,0.001218438,0.00008478324,0.00001328147,0.000139589,0.0006474467,0.01271618,0.004507486,0.957035,0.001247248,0.02212595],"study_design_scores_gemma":[0.00003265286,0.00004457391,0.0003275783,0.00002717565,0.00001569393,0.0001406114,0.0001228013,0.02841344,0.003333194,0.962827,0.004696244,0.00001917186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5658796,0.0009008763,0.3832003,0.001298852,0.000169755,0.0001136857,0.0007352188,0.001220834,0.04648095],"genre_scores_gemma":[0.9145935,0.000446152,0.07359961,0.000512753,0.0001912204,0.000163045,0.0008446397,0.0002911598,0.009357975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004958199,"threshold_uncertainty_score":0.0165869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406659047","doi":"10.30538/psrp-odam2022.0077","title":"On the largest real root of the independence polynomial of a unicyclic graph","year":2022,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Independence (probability theory); Root (linguistics); Graph; Combinatorics; Discrete mathematics; Computer science; Statistics; Linguistics; Philosophy","authors":[{"name":"Iain Beaton","is_ca":false},{"name":"Ben Cameron","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03516077578560541,"gpt":0.3020938802138552,"spread":0.2669331044282499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223471,0.0009387915,0.00125531,0.0024445,0.001106774,0.002300197,0.001679959,0.001153967,0.009510548],"category_scores_gemma":[0.01380075,0.0005434057,0.0007333995,0.002193007,0.004061414,0.0038607,0.001692863,0.004967291,0.001190276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001469058,"about_ca_system_score_gemma":0.0008874396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001830543,"about_ca_topic_score_gemma":0.001825874,"domain_scores_codex":[0.9990151,0.0003121173,0.00002379935,0.0002269764,0.0002300926,0.0001919152],"domain_scores_gemma":[0.9847327,0.01209006,0.001110173,0.0005035312,0.0006185494,0.0009450453],"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.0006269307,0.0001734117,0.002096896,0.0004545193,0.0000559765,0.0004254234,0.0008724594,0.02540011,0.007364994,0.9193451,0.01027815,0.03290603],"study_design_scores_gemma":[0.00006867418,0.00006463068,0.001622746,0.00005224297,0.00003498968,0.0002910824,0.0001675478,0.04813766,0.001577507,0.9450333,0.002900977,0.00004862239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7386715,0.00251509,0.139432,0.006821561,0.0005530191,0.00008853504,0.001009827,0.0003746904,0.1105338],"genre_scores_gemma":[0.9797331,0.001111474,0.007667926,0.0003217421,0.000578163,0.00004836372,0.0004485966,0.0001455318,0.009945102],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009510548,"threshold_uncertainty_score":0.03181595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}