{"id":"W1503829033","doi":"","title":"Experiments with the Negotiated Boolean Queries of the TREC 2008 Legal Track","year":2008,"lang":"en","type":"article","venue":"Text REtrieval Conference","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Open Text (Canada)","funders":"","keywords":"Relevance (law); Task (project management); Computer science; Relevance feedback; Information retrieval; Recall; Standard Boolean model; Rank (graph theory); Boolean expression; Learning to rank; Boolean network; And-inverter graph; Theoretical computer science; Boolean function; Data mining; Artificial intelligence; Algorithm; Mathematics; Ranking (information retrieval); Combinatorics; Psychology; Cognitive psychology","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0119051,0.001926317,0.002209743,0.001337522,0.002068636,0.001995619,0.0022435,0.002416651,0.003809337],"category_scores_gemma":[0.04002263,0.000735289,0.0009949096,0.002422002,0.001084087,0.002851512,0.001763914,0.002137366,0.001631231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001887333,"about_ca_system_score_gemma":0.00156927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01432741,"about_ca_topic_score_gemma":0.01474274,"domain_scores_codex":[0.9843163,0.008304994,0.001367103,0.002150874,0.003229439,0.0006313056],"domain_scores_gemma":[0.9626464,0.02851802,0.001482786,0.002916577,0.003274839,0.001161329],"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.03236903,0.02388874,0.03836549,0.008505081,0.00380754,0.002405461,0.00586862,0.1216327,0.1625288,0.003208821,0.1005139,0.4969058],"study_design_scores_gemma":[0.008120317,0.03329992,0.117037,0.0003721862,0.001906527,0.003156762,0.003761257,0.5885445,0.1803715,0.004405428,0.05804318,0.0009815376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726173,0.002249887,0.009712175,0.0007292391,0.0003888877,0.0008673828,0.003192299,0.004077038,0.006165873],"genre_scores_gemma":[0.9373167,0.0004664112,0.04033968,0.0004498585,0.0004117449,0.0007778126,0.01403035,0.0006252815,0.00558226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01432741,"threshold_uncertainty_score":0.06296098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04573418768938414,"score_gpt":0.2495933093840824,"score_spread":0.2038591216946983,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}