{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004914512,0.0001387097,0.0001121738,0.0002995332,0.0002285757,0.00009457167,0.0003761504,0.00005997568,0.00001047346],"category_scores_gemma":[0.000009955905,0.00009561073,0.0001787494,0.0007518142,0.00007072897,0.0005917437,0.000002547145,0.0001763022,0.00003746146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006029944,"about_ca_system_score_gemma":0.00003045972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001254919,"about_ca_topic_score_gemma":3.001857e-7,"domain_scores_codex":[0.9989546,0.00007876528,0.0003341986,0.0001548883,0.0002828574,0.0001946865],"domain_scores_gemma":[0.998451,0.0008910029,0.00009601231,0.0004258209,0.00009127055,0.00004487762],"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.00006186672,0.00004799475,3.580437e-8,0.00003257251,0.00003756697,7.602812e-7,0.0006602926,0.3840645,0.00004199177,0.5155399,0.0007949875,0.09871753],"study_design_scores_gemma":[0.0005192567,0.000446928,0.00000570445,0.0001990112,0.00003117898,0.00003058025,0.0001900956,0.8036807,0.04252994,0.1491605,0.002966576,0.0002395353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007837981,0.00003518762,0.9959068,0.0008152639,0.001212531,0.0006190661,0.00003714386,0.0002314398,0.0003587388],"genre_scores_gemma":[0.9954788,0.00003295917,0.003490422,0.0006486049,0.00001496739,0.0002095176,0.00000538571,0.000009028472,0.0001103048],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.994695,"threshold_uncertainty_score":0.3898892,"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."}}