{"id":"W3212564326","doi":"","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Longest path problem; Artificial neural network; Path (computing); Shortest path problem; Operator (biology); Mathematical optimization; Graph; Representation (politics); Theoretical computer science; Artificial intelligence; Mathematics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004981044,0.00058703,0.0006107407,0.0002434661,0.001171678,0.002036191,0.001050584,0.000444849,0.000003775368],"category_scores_gemma":[0.0001655651,0.0005604845,0.00032238,0.002348238,0.0001030585,0.008804605,0.0003200466,0.0008551513,0.00000975743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000108141,"about_ca_system_score_gemma":0.0001246118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001030588,"about_ca_topic_score_gemma":0.000005237737,"domain_scores_codex":[0.9954869,0.0002033497,0.001593712,0.000705365,0.0007464336,0.001264219],"domain_scores_gemma":[0.996529,0.0003095342,0.001039559,0.0008811872,0.0009186217,0.0003220437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004458785,0.00001877865,0.0005989234,0.0002389369,0.00002564762,0.000009701009,0.0003351035,0.869734,0.00001947029,0.01740129,0.002770592,0.1088029],"study_design_scores_gemma":[0.000664529,0.0001782462,0.0006796744,0.0002600897,0.00003021545,0.0003012218,0.0000808372,0.983572,0.00004873953,0.005000788,0.00865174,0.0005319404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008216669,0.003062825,0.9770086,0.001410554,0.007757714,0.001096934,0.00002355948,0.001230009,0.0001931034],"genre_scores_gemma":[0.9221094,0.0001192473,0.0674156,0.00419664,0.004815657,0.0005947162,0.0004203345,0.00007659774,0.0002517855],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9138927,"threshold_uncertainty_score":0.9996847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01838694867752891,"score_gpt":0.2599354822932214,"score_spread":0.2415485336156925,"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."}}