{"id":"W4415353339","doi":"10.1109/isit63088.2025.11195708","title":"On the Information-Theoretic Limit of Subgraph Alignment","year":2025,"lang":"","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Aarhus Universitets Forskningsfond","keywords":"Limit (mathematics); Sequence (biology); Set (abstract data type); Point (geometry)","routes":{"ca_aff":true,"ca_fund":true,"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.008756345,0.001407594,0.004641742,0.005726966,0.004862749,0.009422247,0.007359232,0.006046476,0.01367818],"category_scores_gemma":[0.08209982,0.001948734,0.001599597,0.006142879,0.01019405,0.02986718,0.009635804,0.007959547,0.002004102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004038216,"about_ca_system_score_gemma":0.002898904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002334774,"about_ca_topic_score_gemma":0.00155896,"domain_scores_codex":[0.9921292,0.003195497,0.0003367772,0.001557409,0.001895982,0.0008850216],"domain_scores_gemma":[0.9198917,0.06110954,0.00460682,0.006313607,0.003628489,0.004449845],"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.0001504616,0.00008040219,0.0004290763,0.0001230065,0.00002558128,0.00009342192,0.0002616102,0.009275924,0.00045733,0.9801381,0.002716596,0.006248457],"study_design_scores_gemma":[0.00001793886,0.00002015282,0.00009400345,0.00002792434,0.00001012213,0.00008238528,0.00004827857,0.03367505,0.0001920029,0.9652168,0.0006022278,0.00001320043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2755025,0.005460631,0.588412,0.01774587,0.0006163396,0.0001811456,0.001509143,0.001508589,0.1090638],"genre_scores_gemma":[0.9076926,0.003139762,0.06640654,0.003013021,0.001479193,0.0004511767,0.001304346,0.00091668,0.01559668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01367818,"threshold_uncertainty_score":0.04630852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006128830713763188,"score_gpt":0.207283209633056,"score_spread":0.2011543789192928,"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."}}