{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870167,0.000164469,0.0006341081,0.0001666431,0.00004525706,0.00008331587,0.001747541,0.00005865575,0.0000312331],"category_scores_gemma":[0.00007574573,0.0001168493,0.0001250683,0.0003622518,0.00007091605,0.0001810583,0.0004217974,0.000217972,0.00001837868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001358839,"about_ca_system_score_gemma":0.0001026773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004645364,"about_ca_topic_score_gemma":5.851118e-7,"domain_scores_codex":[0.9980893,0.00002880181,0.0009528795,0.0001811751,0.0005586584,0.0001892556],"domain_scores_gemma":[0.9972802,0.000300025,0.001361993,0.0006802068,0.0002621326,0.0001154543],"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.0000117394,0.0002831507,0.00003758771,0.0001532652,0.0000564918,0.000002447272,0.001314689,0.0003192349,0.06367596,0.9319515,0.0001137388,0.002080166],"study_design_scores_gemma":[0.001547323,0.00067565,0.000214654,0.001142985,0.00005731595,0.00004356304,0.0004580146,0.003740387,0.05334316,0.9384897,0.00003470754,0.0002525524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8574087,0.00009393615,0.1271461,0.0003935954,0.0002574447,0.0005434204,0.000009826208,0.00001614902,0.01413085],"genre_scores_gemma":[0.9105932,0.00002025332,0.08919286,0.00006728132,0.000003027563,0.000002584207,7.444191e-7,0.00001278374,0.0001073245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05318442,"threshold_uncertainty_score":0.4764978,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647764,0.0001799687,0.0005238309,0.00009635161,0.0003972525,0.00003901759,0.002639054,0.00005459611,0.0002831974],"category_scores_gemma":[0.0002189169,0.0001011817,0.0002781412,0.0005460731,0.0002336075,0.00007210726,0.0007664829,0.0006314208,0.000002166715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003319578,"about_ca_system_score_gemma":0.0001466807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020825,"about_ca_topic_score_gemma":0.00001329733,"domain_scores_codex":[0.9976847,0.0001766403,0.001017372,0.0001331192,0.0007953705,0.0001927747],"domain_scores_gemma":[0.9954666,0.001383804,0.002086501,0.0008967994,0.000106161,0.00006007394],"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.0001078424,0.0004670765,0.00003572403,0.00006403141,0.0001194558,0.000001447814,0.001694232,0.00008849918,0.006951863,0.9885602,0.001811396,0.00009824984],"study_design_scores_gemma":[0.000659594,0.0001574499,0.0001526652,0.0001076977,0.0001732506,0.00006092125,0.004048503,0.0000348311,0.01242193,0.981841,0.0002190939,0.000123084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9621077,0.00002016139,0.001167629,0.0009393085,0.00009358414,0.001059255,0.00009022329,0.000006996939,0.03451515],"genre_scores_gemma":[0.9948176,0.000009881691,0.004845284,0.00005843742,0.00002516711,0.00006637283,0.000001085271,0.00003087929,0.0001452797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03436987,"threshold_uncertainty_score":0.4904063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}