{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"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"},"query_hash":"ba19c855b3c4","filters":{"venue":"AMW"}},"results":[{"id":"W2398876418","doi":"","title":"On Conditional Chase Termination.","year":2011,"lang":"en","type":"article","venue":"AMW","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Chase","retraction":null,"screen_n_in":null,"score":{"opus":0.03019440715763463,"gpt":0.2364884310248795,"spread":0.2062940238672449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004409591,0.00004085107,0.00003957991,0.00002963372,0.00005426115,0.000006948336,0.0001165254,0.00001163946,0.00009918311],"category_scores_gemma":[0.00001661908,0.00003439331,0.00001428206,0.00005338792,0.00002213974,0.0003354607,0.00003977277,0.00002809073,0.0002895846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007474212,"about_ca_system_score_gemma":0.0000122098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001155532,"about_ca_topic_score_gemma":0.000002264806,"domain_scores_codex":[0.9996479,0.00001002652,0.00006234108,0.0001190836,0.00008759823,0.00007301871],"domain_scores_gemma":[0.9996827,0.000022292,0.00002819587,0.0002134587,0.00002350534,0.00002989335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001197899,0.00002009134,0.00002639111,0.000001529079,0.000001444124,0.00001375348,0.0001685508,0.000001357906,0.0000648971,0.9943123,0.001862302,0.003526218],"study_design_scores_gemma":[0.00152962,0.0007261174,0.04846966,0.000113327,0.00000699408,0.000183134,0.0001511324,0.007074926,0.03479595,0.3940659,0.5119665,0.0009167337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005795144,0.00001420445,0.9712933,0.0001060196,0.000221777,0.00005051023,0.00002333066,0.00007887022,0.02241687],"genre_scores_gemma":[0.9479999,0.00000135376,0.05048975,0.0006082226,0.00004892424,0.00001681934,0.00001938998,0.00000314213,0.0008125064],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9422048,"threshold_uncertainty_score":0.3722121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403315168","doi":"","title":"On Axiomatization and Inference Complexity over a Hierarchy of Functional Dependencies.","year":2015,"lang":"en","type":"article","venue":"AMW","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Ontario Tech University","funders":"","keywords":"Functional dependency; Inference; Hierarchy; Tuple; Mathematics; Dependency theory (database theory); Rule of inference; Theoretical computer science; Metric (unit); Antecedent (behavioral psychology); Focus (optics); Extension (predicate logic); Computer science; Algorithm; Discrete mathematics; Data mining; Artificial intelligence; Relational database; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.5096816871169793,"gpt":0.448804435074362,"spread":0.06087725204261729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386389,0.00004551036,0.00009549293,0.00010479,0.00003743698,0.00006443902,0.0001690547,0.00001983601,0.0003362256],"category_scores_gemma":[0.002059468,0.00003399949,0.00001534276,0.0002306018,0.00008193972,0.0002729357,0.0001591781,0.00003324493,0.0001133353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002599013,"about_ca_system_score_gemma":0.00003418136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001809764,"about_ca_topic_score_gemma":0.0002240798,"domain_scores_codex":[0.9986101,0.00009396756,0.0002150474,0.0001660763,0.000847779,0.00006704942],"domain_scores_gemma":[0.9990174,0.0004464571,0.00009830738,0.0002412191,0.0001367603,0.00005989438],"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.00008635139,0.00009504585,0.006536738,0.000009931387,0.00001216267,0.000001408392,0.000715374,0.0002481298,0.00007464411,0.9065259,0.06323569,0.02245864],"study_design_scores_gemma":[0.0004735333,0.0001445823,0.1535102,0.00001340504,0.000004960712,0.000001053695,0.0004538113,0.004484445,0.0001079692,0.8271801,0.01354484,0.00008111555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8071691,0.00003812428,0.1652638,0.001356619,0.0003423884,0.0001745112,0.00007653163,0.0000287872,0.02555015],"genre_scores_gemma":[0.9981209,0.000002669551,0.0005233638,0.0004422995,0.00001364179,0.000002329647,0.00001724151,0.000001530841,0.000876006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1909518,"threshold_uncertainty_score":0.3681435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W56576261","doi":"","title":"Information Integration: a Vision for Integration Independence and Linking Open Data.","year":2010,"lang":"en","type":"article","venue":"AMW","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"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":"Independence (probability theory); Data integration; Information integration; Computer science; Data mining; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02859230865770166,"gpt":0.3279443309987999,"spread":0.2993520223410982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005514835,0.00007263022,0.0000855908,0.00004974153,0.0001709315,0.0004453312,0.0007204812,0.00005298478,0.000002716082],"category_scores_gemma":[0.0001914937,0.0000572906,0.000008550821,0.0001115879,0.00002156116,0.01159931,0.000897039,0.0001366675,0.00001036884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007289076,"about_ca_system_score_gemma":0.0000526167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001190039,"about_ca_topic_score_gemma":0.0007564207,"domain_scores_codex":[0.9993968,0.00001426027,0.0001941611,0.0001753755,0.0001270095,0.00009241013],"domain_scores_gemma":[0.9990234,0.00007155987,0.0001141022,0.0006260997,0.0001281398,0.00003666449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007143291,0.000005998451,0.00005049462,0.00001159872,0.000001513778,2.308766e-7,0.0008271974,0.000001980039,0.004142417,0.4533319,0.0005980708,0.5410215],"study_design_scores_gemma":[0.0008334453,0.0002196492,0.001916491,0.0002364724,0.00000745328,0.00005727681,0.0006861925,0.4510304,0.006843082,0.01527618,0.5225053,0.0003879726],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003668923,0.00001363714,0.9944078,0.0004570461,0.0004445919,0.0003744268,0.00004031533,0.00004673093,0.0005465712],"genre_scores_gemma":[0.4393257,0.000009830766,0.5597684,0.0002844812,0.00008561717,0.00004660035,0.0004275876,0.000003499357,0.00004825995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5406335,"threshold_uncertainty_score":0.8409221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579485143","doi":"","title":"Query Planning for Evaluating SPARQL Property Paths.","year":2016,"lang":"en","type":"article","venue":"AMW","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"SPARQL; Computer science; Query optimization; RDF; Query plan; Property (philosophy); RDF query language; Query language; Plan (archaeology); Graph; Information retrieval; Sargable; Web query classification; Theoretical computer science; Database; Search engine; Web search query; Semantic Web","retraction":null,"screen_n_in":null,"score":{"opus":0.1169284141350931,"gpt":0.3449422729405243,"spread":0.2280138588054312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003544096,0.00006633058,0.00009193765,0.00002596922,0.0000814672,0.00004769166,0.0003776098,0.00003035733,0.000005500084],"category_scores_gemma":[0.0003317687,0.00003036313,0.00003550378,0.00005218288,0.00002316668,0.00023557,0.0001072586,0.00002398921,0.00004157506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001578553,"about_ca_system_score_gemma":0.00004858599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001936404,"about_ca_topic_score_gemma":0.000003506603,"domain_scores_codex":[0.9993083,0.0000265154,0.000111912,0.0002187186,0.0001222222,0.0002122939],"domain_scores_gemma":[0.999346,0.0002520713,0.00004589844,0.0002765169,0.00005054222,0.00002897982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001514398,0.00002673727,0.0117276,0.00002533848,0.00001761514,0.0000140824,0.001049796,0.00001809514,0.01483585,0.01719372,0.01049681,0.9445792],"study_design_scores_gemma":[0.008246318,0.00331595,0.1727762,0.002058994,0.00008857605,0.000195024,0.001020748,0.2766765,0.1431379,0.1790665,0.2105526,0.002864699],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1102994,0.0002254485,0.8817103,0.003552547,0.0005820289,0.0002422778,0.000001164057,0.0002628064,0.003124076],"genre_scores_gemma":[0.9214218,0.00000373807,0.07650669,0.0004344082,0.00009963086,0.0000428298,3.026346e-7,0.00000569742,0.001484963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9417145,"threshold_uncertainty_score":0.1238173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402585642","doi":"","title":"GDE: General Data Exchange with Schema and Data Level Mappings.","year":2013,"lang":"en","type":"article","venue":"AMW","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Schema (genetic algorithms); Data exchange; Set (abstract data type); Theoretical computer science; Information retrieval; Knowledge base; Data mining; Database; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1849158307224279,"gpt":0.3045156726178656,"spread":0.1195998418954377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001577803,0.00008981994,0.0001081639,0.00002912205,0.00006442022,0.0002117268,0.002346887,0.00003177347,0.00003623042],"category_scores_gemma":[0.00003946248,0.00006299635,0.000004356365,0.0001046365,0.0000698318,0.001318594,0.002866343,0.0000592756,0.0001167445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003938497,"about_ca_system_score_gemma":0.00002437992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006189373,"about_ca_topic_score_gemma":0.0001061095,"domain_scores_codex":[0.9990609,0.00001621039,0.00008315658,0.0004980807,0.0001393714,0.0002022525],"domain_scores_gemma":[0.997501,0.00003248918,0.00003724554,0.002345367,0.00002908219,0.00005485225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004357622,0.0000622785,0.01795678,0.00007242752,0.00007170252,0.00005628802,0.0007045163,0.000001334252,0.0009335526,0.0107579,0.6861907,0.2831882],"study_design_scores_gemma":[0.001514592,0.0002025026,0.3479938,0.0001077104,0.00003857747,0.0003308417,0.0003347266,0.3671006,0.00112196,0.002998383,0.2772768,0.0009796027],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3026922,0.003050534,0.6682426,0.01547716,0.0005587629,0.0005440509,0.0001058453,0.0004232962,0.008905573],"genre_scores_gemma":[0.3988358,0.000185119,0.5950255,0.002086577,0.000271787,0.00001576692,0.0001465008,0.00001318951,0.003419806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4089139,"threshold_uncertainty_score":0.436114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}