{"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":"bce70d653014","filters":{"venue":"International Conference on Concurrency Theory"}},"results":[{"id":"W3000360140","doi":"10.4230/lipics.concur.2017.4","title":"A new notion of compositionality for concurrent program proofs","year":2017,"lang":"en","type":"article","venue":"International Conference on Concurrency Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Principle of compositionality; Mathematical proof; Programming language; Computer science; Theoretical computer science; Mathematics; Artificial intelligence","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Zachary Kincaid","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1351528161428429,"gpt":0.4384656416520773,"spread":0.3033128255092344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009433261,0.0001739243,0.0002085256,0.0001054767,0.0002136342,0.000335116,0.002331374,0.00007836631,0.0001343729],"category_scores_gemma":[0.0006311953,0.0001655967,0.0001332149,0.00004858489,0.0002016784,0.0008331891,0.0002055902,0.0001568204,0.0000286437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007121784,"about_ca_system_score_gemma":0.0002844954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001526624,"about_ca_topic_score_gemma":0.000003283001,"domain_scores_codex":[0.9983629,0.0001382859,0.0004278714,0.000421397,0.0004565036,0.000193052],"domain_scores_gemma":[0.9975279,0.000179943,0.0006711587,0.0007541859,0.0007716066,0.00009523816],"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.0000402614,0.0001110802,0.00006303747,0.00001415961,0.00002174192,2.65032e-7,0.00008961155,0.000002750876,0.0005709389,0.6078514,0.0001182382,0.3911165],"study_design_scores_gemma":[0.002048767,0.001005396,0.01363565,0.0003948735,0.0000252633,0.000009621977,0.00003116436,0.1317179,0.02596154,0.811371,0.01330012,0.0004987332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001318616,0.00003249005,0.9597237,0.001214576,0.003545991,0.0007809756,0.00008091064,0.0001131689,0.03318958],"genre_scores_gemma":[0.834237,0.00001459221,0.1649068,0.00005737222,0.0001670864,0.0001826197,0.0000443397,0.000007434682,0.0003828022],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8329184,"threshold_uncertainty_score":0.6752838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}