{"id":"W4412876920","doi":"10.1145/3711896.3737233","title":"Hierarchical Lexical Graph for Enhanced Multi-Hop Retrieval","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Graph; Hop (telecommunications); Information retrieval; Artificial intelligence; Theoretical computer science; Computer network","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004263677,0.0002892651,0.0004206453,0.000208302,0.0001067697,0.0002055892,0.002102284,0.0004667595,0.00001879174],"category_scores_gemma":[0.0002629258,0.0002649278,0.0003511727,0.0002067506,0.00005481315,0.00009578033,0.002694713,0.0008019679,0.00001059712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006710567,"about_ca_system_score_gemma":0.0004058734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002929996,"about_ca_topic_score_gemma":0.00001401107,"domain_scores_codex":[0.9974704,0.00007703344,0.0004752308,0.001212423,0.0003298624,0.0004350602],"domain_scores_gemma":[0.9978977,0.0003135965,0.00009321462,0.001379554,0.0001701252,0.000145814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001280761,0.0003570408,0.00003817913,0.0006641587,0.0001841436,0.0000120657,0.001188542,0.007635133,0.002647014,0.8719162,0.002415433,0.112814],"study_design_scores_gemma":[0.0007192933,0.00004438361,0.00006502147,0.0001255719,0.00001614716,0.000001532913,0.000006620945,0.8659264,0.01213303,0.1185714,0.001943866,0.0004466487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00196035,0.00009021593,0.9885618,0.002414527,0.002169812,0.000710684,0.00001705313,0.0004698799,0.003605679],"genre_scores_gemma":[0.08977329,0.00002449787,0.9013923,0.0008470002,0.0002510654,0.00008290426,0.00001541699,0.00001079626,0.007602734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8582913,"threshold_uncertainty_score":0.9999803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05106226831373131,"score_gpt":0.3238981275221801,"score_spread":0.2728358592084488,"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."}}