{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167963,0.0002144708,0.0002121494,0.0003116577,0.0002953687,0.0002189016,0.001495393,0.00008039309,0.0005362582],"category_scores_gemma":[0.0001270195,0.0001334936,0.0002222254,0.001380079,0.0004550099,0.000473349,0.0003352975,0.0001911182,0.0001715977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002031409,"about_ca_system_score_gemma":0.0001132324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009050465,"about_ca_topic_score_gemma":7.610345e-7,"domain_scores_codex":[0.9982243,0.0002423137,0.0005985853,0.0002203132,0.0004048855,0.0003096505],"domain_scores_gemma":[0.9976246,0.0009136514,0.0001928251,0.001057095,0.0001512168,0.000060595],"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.00001918685,0.0001011385,0.00003178095,0.00004042438,0.0000655719,5.159953e-7,0.001369529,0.0001808088,0.00001510563,0.9651232,0.001877299,0.03117539],"study_design_scores_gemma":[0.0003517631,0.0002601015,0.0003997134,0.0001983476,0.00003212539,0.000001307283,0.000535024,0.04645298,0.01593661,0.9332107,0.002444234,0.0001771227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02417045,0.0001644292,0.7468323,0.01103274,0.00160807,0.0006103678,0.00001050718,0.00005910596,0.215512],"genre_scores_gemma":[0.9930252,0.00008350793,0.0007750877,0.004792911,0.00001022563,0.00001906081,0.000001071643,0.000002635008,0.001290255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9688548,"threshold_uncertainty_score":0.5871651,"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."}}