{"meta":{"query_hash":"bce70d653014","filters":{"venue":"International Conference on Concurrency Theory"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/bce70d653014","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13515281614284286,"score_gpt":0.4384656416520773,"score_spread":0.30331282550923444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000360140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005822988,0.00028589802,0.98548996,0.0006599959,0.0002785804,0.00011778761,0.00007137104,0.00085302,0.0064203073],"genre_scores_gemma":[0.22314219,0.00050647935,0.7647692,0.0011839638,0.0011810835,0.0005386647,0.00033129472,0.001060838,0.007286226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9828666,0.004531016,0.001866255,0.0033529378,0.006272466,0.0011108456],"domain_scores_gemma":[0.9691584,0.014422744,0.0015127414,0.009381055,0.004211458,0.0013134556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106960535,0.0015009857,0.0014614599,0.0035640022,0.0030969882,0.006991923,0.0042437403,0.0025382447,0.006139413],"category_scores_gemma":[0.02850893,0.0023851877,0.0043960726,0.0021593547,0.009946397,0.021487474,0.010775242,0.010191203,0.0016819055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011459949,0.0000920882,0.00032042532,0.00023207272,0.000062864725,0.00019923116,0.0007768372,0.0026808346,0.006461575,0.96234107,0.0011609801,0.025557311],"study_design_scores_gemma":[0.00008173156,0.00012784886,0.00015371329,0.00011375745,0.00017962768,0.00048796626,0.00014463266,0.028401801,0.013168213,0.93287885,0.024178648,0.00008314716],"about_ca_topic_score_codex":0.0006090292,"about_ca_topic_score_gemma":0.0007892554,"teacher_disagreement_score":0.0106960535,"about_ca_system_score_codex":0.0014243666,"about_ca_system_score_gemma":0.0025851312,"threshold_uncertainty_score":0.056566834},"labels":[],"label_agreement":null}]}