{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"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":"1c8c85d5c961","filters":{"venue":"Journal of Discrete Mathematics"}},"results":[{"id":"W1988825410","doi":"10.1155/2013/625912","title":"On Maximum Lee Distance Codes","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Singleton; Algorithm; Combinatorics; Computer science; Mathematics","authors":[{"name":"T. L. Alderson","is_ca":true},{"name":"Svenja Huntemann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01171327731571704,"gpt":0.2345302972822507,"spread":0.2228170199665336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018506,0.0001182198,0.0002268005,0.0001143823,0.00007601018,0.0002185683,0.0008368128,0.00003362668,0.00007212825],"category_scores_gemma":[0.0001006626,0.00008059955,0.0001731209,0.000211511,0.00005158855,0.0004535893,0.00007649466,0.0001772194,0.00007216616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000173664,"about_ca_system_score_gemma":0.00002022629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.274091e-7,"about_ca_topic_score_gemma":4.397763e-7,"domain_scores_codex":[0.9989464,0.00004262938,0.0003935508,0.00009553203,0.0003490816,0.0001727576],"domain_scores_gemma":[0.9987521,0.000271358,0.0003820269,0.0003687573,0.0001230321,0.0001027718],"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.000006851289,0.0001278995,0.00006644097,0.00004584457,0.00004285461,0.0000142982,0.001104828,0.00005197053,0.0004749523,0.9892272,0.003464349,0.005372447],"study_design_scores_gemma":[0.0002120086,0.0002671485,0.000209637,0.0001776628,0.00001226218,0.00006564747,0.0001530349,0.004625422,0.0006842362,0.992838,0.0006302532,0.0001247268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09573937,0.00007198164,0.8964471,0.001054687,0.0002446724,0.00008004883,0.000001208489,0.00003126958,0.006329672],"genre_scores_gemma":[0.8799495,0.00002069786,0.1196055,0.0002273444,0.00006559938,0.000002596867,1.280846e-7,0.000009321625,0.0001193343],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7842101,"threshold_uncertainty_score":0.3286754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}