{"id":"W2387462954","doi":"10.1145/2939672.2939751","title":"Asymmetric Transitivity Preserving Graph Embedding","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1293,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Transitive relation; Embedding; Scalability; Computer science; Theoretical computer science; Transitive reduction; Graph embedding; Directed graph; Graph; Vertex (graph theory); Mathematics; Algorithm; Combinatorics; Artificial intelligence; Voltage graph; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01410138418591184,"score_gpt":0.2541467789611533,"score_spread":0.2400453947752415,"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."}}