{"id":"W2973697852","doi":"10.1371/journal.pone.0247936","title":"Learning temporal attention in dynamic graphs with bilinear interactions","year":2021,"lang":"en","type":"preprint","venue":"PLoS ONE","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Institute for Advanced Research; University of Saskatchewan; University of Guelph; Vector Institute","funders":"National Institute of Environmental Health Sciences; Defense Advanced Research Projects Agency; Canada Foundation for Innovation; Canada Research Chairs; University of Guelph; University of Saskatchewan; Government of Canada; Defense Sciences Office, DARPA; Vector Institute; Canadian Institute for Advanced Research; U.S. Department of Defense","keywords":"Computer science; Concatenation (mathematics); Node (physics); Term (time); Bilinear interpolation; Task (project management); Artificial intelligence; Feature (linguistics); Flexibility (engineering); Graph; Key (lock); Theoretical computer science; Machine learning; Mathematics","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.0009977192,0.0009426061,0.0007746499,0.0009194262,0.0004634818,0.0008500468,0.001535729,0.001649142,0.00163602],"category_scores_gemma":[0.005368735,0.0007463582,0.001053052,0.0009309913,0.00109243,0.003189409,0.001517131,0.002326385,0.0003604242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00167311,"about_ca_system_score_gemma":0.0006882941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0165578,"about_ca_topic_score_gemma":0.02163698,"domain_scores_codex":[0.9994726,0.0001247363,0.00001617442,0.0002614207,0.00005790209,0.00006715902],"domain_scores_gemma":[0.9977174,0.001616634,0.0002235788,0.0002059339,0.000127912,0.0001086034],"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.0001744886,0.00009304375,0.003159018,0.00009125849,0.00005967768,0.0001989539,0.0002787098,0.8878019,0.003611395,0.02931924,0.002406202,0.07280611],"study_design_scores_gemma":[0.000004152341,0.000007768715,0.0002371843,0.000003458628,0.000004408904,0.00001221197,0.000007464862,0.9807162,0.0002607811,0.01855558,0.0001878382,0.000002938313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1337323,0.0005502403,0.8610418,0.0009623485,0.00004866143,0.00004180759,0.0003786416,0.001296707,0.001947497],"genre_scores_gemma":[0.9411849,0.0003244345,0.05261353,0.0003474444,0.00008171557,0.00005530091,0.0007457742,0.0001612735,0.004485615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0165578,"threshold_uncertainty_score":0.0329228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02905274807875053,"score_gpt":0.2513163439872472,"score_spread":0.2222635959084967,"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."}}