{"id":"W4226193467","doi":"10.1109/isit50566.2022.9834398","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Time complexity","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":[],"consensus_categories":[],"category_scores_codex":[0.001079584,0.000191564,0.0001631319,0.0002923919,0.0004850384,0.00009761936,0.001523659,0.0000410092,0.00008024294],"category_scores_gemma":[0.00006840858,0.000153539,0.0002072317,0.0005821601,0.00006158511,0.0005117239,0.0002721226,0.0002558008,0.00002456023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002986729,"about_ca_system_score_gemma":0.00003250689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003902341,"about_ca_topic_score_gemma":2.593804e-7,"domain_scores_codex":[0.9976664,0.0002133284,0.0005651967,0.0002564091,0.001046404,0.0002523061],"domain_scores_gemma":[0.997757,0.0008876617,0.0005426194,0.0005409423,0.0002145683,0.00005717312],"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.0002073412,0.00009003528,0.000005752458,0.000004613428,0.00004427516,0.000001609525,0.0004426097,0.3780485,0.0002151134,0.6126664,0.005608271,0.002665397],"study_design_scores_gemma":[0.002102069,0.001257577,0.0001246029,0.00005842588,0.00002189267,0.00008961225,0.0005236362,0.7686737,0.01760436,0.1822829,0.02675579,0.0005054588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01681614,0.00001614906,0.9686847,0.005385523,0.003713158,0.001088044,0.0001844194,0.0001405701,0.003971271],"genre_scores_gemma":[0.99337,0.00001906552,0.0009638739,0.004358794,0.00008129154,0.000657267,0.0001432333,0.00001501418,0.0003914402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9765539,"threshold_uncertainty_score":0.6261138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01938843897496104,"score_gpt":0.2559160239593848,"score_spread":0.2365275849844237,"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."}}