{"id":"W4390659502","doi":"10.1109/tit.2024.3351107","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Algorithm; Vertex (graph theory); Graph; Time complexity; Theoretical computer science; Efficient algorithm; Connectivity","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.008496158,0.002774631,0.003609971,0.002906902,0.002125139,0.004961221,0.004256289,0.003093079,0.007102334],"category_scores_gemma":[0.07055809,0.001462672,0.002364628,0.004024548,0.004376825,0.009176336,0.005577748,0.006529245,0.002747213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003167643,"about_ca_system_score_gemma":0.005793432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388437,"about_ca_topic_score_gemma":0.001641492,"domain_scores_codex":[0.9908485,0.00406071,0.0004127675,0.002261003,0.001483556,0.0009333292],"domain_scores_gemma":[0.9213437,0.06705093,0.003513629,0.004300578,0.002615815,0.001175278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008216739,0.000389605,0.001286291,0.0006427104,0.0001095847,0.000159904,0.0005468587,0.6189006,0.002891076,0.2561657,0.00795655,0.1101295],"study_design_scores_gemma":[0.00009291822,0.0001228321,0.0001585565,0.00009121815,0.00002413689,0.00009513432,0.00009482699,0.7314467,0.001432728,0.2642587,0.002149392,0.00003286259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01251603,0.0007956243,0.9813806,0.0007993376,0.00006075275,0.0001526439,0.0001787367,0.0005194548,0.003596791],"genre_scores_gemma":[0.297866,0.001784386,0.6923951,0.0005621781,0.0002661554,0.000976013,0.001251658,0.0007249897,0.004173564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008496158,"threshold_uncertainty_score":0.04493248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02218252933870495,"score_gpt":0.2538713566313062,"score_spread":0.2316888272926013,"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."}}