{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777238,0.001026939,0.001053319,0.002544309,0.001285387,0.002174503,0.001781761,0.001250786,0.006367875],"category_scores_gemma":[0.01179764,0.0004862654,0.0007221496,0.002421529,0.002354972,0.004467358,0.003422946,0.002827774,0.001752474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001916455,"about_ca_system_score_gemma":0.0008888202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000888534,"about_ca_topic_score_gemma":0.001458455,"domain_scores_codex":[0.9980318,0.000403666,0.0001145585,0.0003202338,0.0006363929,0.0004933747],"domain_scores_gemma":[0.9902864,0.00594106,0.000876851,0.001263106,0.001014312,0.0006182864],"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.0005772999,0.000085696,0.001901995,0.0004647901,0.00005658378,0.0004324846,0.0005519075,0.05592738,0.01096888,0.8710699,0.005965593,0.05199753],"study_design_scores_gemma":[0.00003558478,0.0001965391,0.001265027,0.0001788728,0.00003707017,0.0007103653,0.0003078056,0.1157518,0.01069741,0.8616018,0.009097771,0.0001198991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3316624,0.009823844,0.496055,0.002283511,0.0004575504,0.0001058696,0.001193381,0.0007404131,0.1576781],"genre_scores_gemma":[0.9404122,0.003035752,0.03799289,0.0004864421,0.0003654708,0.0001413494,0.0008231645,0.0001600871,0.01658257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006367875,"threshold_uncertainty_score":0.02130264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}