{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013186163,0.00003249005,0.9597237,0.0012145761,0.0035459911,0.0007809756,0.000080910635,0.000113168884,0.03318958],"genre_scores_gemma":[0.834237,0.000014592209,0.16490676,0.000057372217,0.00016708641,0.00018261968,0.0000443397,0.0000074346817,0.0003828022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983629,0.00013828592,0.00042787142,0.00042139695,0.0004565036,0.00019305204],"domain_scores_gemma":[0.9975279,0.00017994302,0.0006711587,0.0007541859,0.00077160663,0.00009523816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009433261,0.00017392432,0.00020852561,0.00010547666,0.0002136342,0.000335116,0.0023313744,0.000078366305,0.00013437288],"category_scores_gemma":[0.00063119526,0.00016559672,0.00013321493,0.000048584894,0.00020167841,0.00083318906,0.0002055902,0.00015682037,0.000028643703],"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.000040261395,0.000111080204,0.00006303747,0.000014159608,0.00002174192,2.6503204e-7,0.00008961155,0.0000027508759,0.00057093886,0.60785145,0.0001182382,0.39111647],"study_design_scores_gemma":[0.002048767,0.0010053955,0.013635648,0.00039487347,0.000025263302,0.000009621977,0.000031164356,0.13171788,0.02596154,0.81137097,0.013300122,0.0004987332],"about_ca_topic_score_codex":0.000015266236,"about_ca_topic_score_gemma":0.000003283001,"teacher_disagreement_score":0.8329184,"about_ca_system_score_codex":0.00007121784,"about_ca_system_score_gemma":0.00028449536,"threshold_uncertainty_score":0.6752838},"labels":[],"label_agreement":null}]}