{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-neural-network/papers/15","list_of":"/task/graph-neural-network","task":"Graph Neural Network","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":15,"pages_in_order":36,"rows_per_page":100,"rows":[1401,1500],"of":3598,"counts":{"archive_papers_tagged":3598,"with_a_code_link":1516,"where_syntology_ran_a_sample":350,"not_listed_spam_title":0,"listed":3598,"listed_where_code_ran":350,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":302,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":302,"listed_every_run_a_failure_of_syntologys_instrument":48,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-neural-network","prev":"/task/graph-neural-network/papers/14","next":"/task/graph-neural-network/papers/16","papers":[{"url":"/paper/multi-modal-graph-neural-network-for-joint","slug":"multi-modal-graph-neural-network-for-joint","title":"Multi-Modal Graph Neural Network for Joint Reasoning on Vision and Scene Text","date":"2020-03-31","arxiv_id":"2003.13962","repositories_listed":1,"syntology":null},{"url":"/paper/a-heterogeneous-dynamical-graph-neural","slug":"a-heterogeneous-dynamical-graph-neural","title":"A Heterogeneous Dynamical Graph Neural Networks Approach to Quantify Scientific Impact","date":"2020-03-26","arxiv_id":"2003.12042","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-framework-with-information-fusion-and","slug":"a-novel-framework-with-information-fusion-and","title":"A Novel Framework with Information Fusion and Neighborhood Enhancement for User Identity Linkage","date":"2020-03-16","arxiv_id":"2003.07122","repositories_listed":1,"syntology":null},{"url":"/paper/learning-algebraic-multigrid-using-graph","slug":"learning-algebraic-multigrid-using-graph","title":"Learning Algebraic Multigrid Using Graph Neural Networks","date":"2020-03-12","arxiv_id":"2003.05744","repositories_listed":1,"syntology":null},{"url":"/paper/global-attention-based-graph-convolutional","slug":"global-attention-based-graph-convolutional","title":"Global Attention based Graph Convolutional Neural Networks for Improved Materials Property Prediction","date":"2020-03-11","arxiv_id":"2003.13379","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-invariant-graph-generation-via","slug":"permutation-invariant-graph-generation-via","title":"Permutation Invariant Graph Generation via Score-Based Generative Modeling","date":"2020-03-02","arxiv_id":"2003.00638","repositories_listed":1,"syntology":null},{"url":"/paper/point-gnn-graph-neural-network-for-3d-object","slug":"point-gnn-graph-neural-network-for-3d-object","title":"Point-GNN: Graph Neural Network for 3D Object Detection in a Point Cloud","date":"2020-03-02","arxiv_id":"2003.01251","repositories_listed":1,"syntology":null},{"url":"/paper/sketchgcn-semantic-sketch-segmentation-with","slug":"sketchgcn-semantic-sketch-segmentation-with","title":"SketchGNN: Semantic Sketch Segmentation with Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00678","repositories_listed":1,"syntology":null},{"url":"/paper/a-semi-supervised-graph-attentive-network-for","slug":"a-semi-supervised-graph-attentive-network-for","title":"A Semi-supervised Graph Attentive Network for Financial Fraud Detection","date":"2020-02-28","arxiv_id":"2003.01171","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-neural-networks-for","slug":"heterogeneous-graph-neural-networks-for","title":"Heterogeneous Graph Neural Networks for Malicious Account Detection","date":"2020-02-27","arxiv_id":"2002.12307","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-typed-syntactic-dependencies-for","slug":"exploiting-typed-syntactic-dependencies-for","title":"Investigating Typed Syntactic Dependencies for Targeted Sentiment Classification Using Graph Attention Neural Network","date":"2020-02-22","arxiv_id":"2002.09685","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-clicks-modeling-multi-relational-item","slug":"beyond-clicks-modeling-multi-relational-item","title":"Beyond Clicks: Modeling Multi-Relational Item Graph for Session-Based Target Behavior Prediction","date":"2020-02-19","arxiv_id":"2002.07993","repositories_listed":1,"syntology":null},{"url":"/paper/a-lagrangian-approach-to-information","slug":"a-lagrangian-approach-to-information","title":"A Lagrangian Approach to Information Propagation in Graph Neural Networks","date":"2020-02-18","arxiv_id":"2002.07684","repositories_listed":1,"syntology":null},{"url":"/paper/learning-cross-modal-context-graph-for-visual","slug":"learning-cross-modal-context-graph-for-visual","title":"Learning Cross-modal Context Graph for Visual Grounding","date":"2020-02-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/superpixel-image-classification-with-graph","slug":"superpixel-image-classification-with-graph","title":"Superpixel Image Classification with Graph Attention Networks","date":"2020-02-13","arxiv_id":"2002.05544","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multi-task-augmented-feature-learning","slug":"deep-multi-task-augmented-feature-learning","title":"Deep Multi-Task Augmented Feature Learning via Hierarchical Graph Neural Network","date":"2020-02-12","arxiv_id":"2002.04813","repositories_listed":1,"syntology":null},{"url":"/paper/graph-universal-adversarial-attacks-a-few-bad","slug":"graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","arxiv_id":"2002.04784","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-universal-adversarial-attacks-a-few-bad#ran","syntology_url":"https://syntology.ai/paper/2002.04784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04784"}},"official":{"repos":["chisam0217/Graph-Universal-Attack"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiable-graph-module-dgm-graph","slug":"differentiable-graph-module-dgm-graph","title":"Differentiable Graph Module (DGM) for Graph Convolutional Networks","date":"2020-02-11","arxiv_id":"2002.04999","repositories_listed":1,"syntology":null},{"url":"/paper/bilinear-graph-neural-network-with-node","slug":"bilinear-graph-neural-network-with-node","title":"Bilinear Graph Neural Network with Neighbor Interactions","date":"2020-02-10","arxiv_id":"2002.03575","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","repositories_listed":1,"syntology":null},{"url":"/paper/message-passing-for-query-answering-over","slug":"message-passing-for-query-answering-over","title":"Message Passing Query Embedding","date":"2020-02-06","arxiv_id":"2002.02406","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/message-passing-for-query-answering-over#ran","syntology_url":"https://syntology.ai/paper/2002.02406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02406"}},"official":{"repos":["dfdazac/mpqe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mraea-an-efficient-and-robust-entity","slug":"mraea-an-efficient-and-robust-entity","title":"MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph","date":"2020-02-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-video-object-segmentation-via-1","slug":"zero-shot-video-object-segmentation-via-1","title":"Zero-Shot Video Object Segmentation via Attentive Graph Neural Networks","date":"2020-01-19","arxiv_id":"2001.06807","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/zero-shot-video-object-segmentation-via-1#ran","syntology_url":"https://syntology.ai/paper/2001.06807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06807"}},"official":{"repos":["carrierlxk/AGNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-augmented-graph-neural-networks-for","slug":"memory-augmented-graph-neural-networks-for","title":"Memory Augmented Graph Neural Networks for Sequential Recommendation","date":"2019-12-26","arxiv_id":"1912.11730","repositories_listed":1,"syntology":null},{"url":"/paper/multi-graph-transformer-for-free-hand-sketch","slug":"multi-graph-transformer-for-free-hand-sketch","title":"Multi-Graph Transformer for Free-Hand Sketch Recognition","date":"2019-12-24","arxiv_id":"1912.11258","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/multi-graph-transformer-for-free-hand-sketch#ran","syntology_url":"https://syntology.ai/paper/1912.11258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11258"}},"official":{"repos":["PengBoXiangShang/multigraph_transformer"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/learning-variable-ordering-heuristics-for","slug":"learning-variable-ordering-heuristics-for","title":"Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems","date":"2019-12-23","arxiv_id":"1912.10762","repositories_listed":1,"syntology":null},{"url":"/paper/meta-graph-few-shot-link-prediction-via-meta-1","slug":"meta-graph-few-shot-link-prediction-via-meta-1","title":"Meta-Graph: Few Shot Link Prediction via Meta Learning","date":"2019-12-20","arxiv_id":"1912.09867","repositories_listed":1,"syntology":null},{"url":"/paper/an-attention-based-graph-neural-network-for","slug":"an-attention-based-graph-neural-network-for","title":"An Attention-based Graph Neural Network for Heterogeneous Structural Learning","date":"2019-12-19","arxiv_id":"1912.10832","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/an-attention-based-graph-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/1912.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10832"}},"official":{"repos":["didi/hetsann"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/graph-neural-networks-for-decentralized-multi","slug":"graph-neural-networks-for-decentralized-multi","title":"Graph Neural Networks for Decentralized Multi-Robot Path Planning","date":"2019-12-12","arxiv_id":"1912.06095","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-on-electronic-health","slug":"graph-neural-network-on-electronic-health","title":"Variationally Regularized Graph-based Representation Learning for Electronic Health Records","date":"2019-12-08","arxiv_id":"1912.03761","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-graph-attention-network","slug":"hyperbolic-graph-attention-network","title":"Hyperbolic Graph Attention Network","date":"2019-12-06","arxiv_id":"1912.03046","repositories_listed":1,"syntology":null},{"url":"/paper/conv-mpn-convolutional-message-passing-neural","slug":"conv-mpn-convolutional-message-passing-neural","title":"Conv-MPN: Convolutional Message Passing Neural Network for Structured Outdoor Architecture Reconstruction","date":"2019-12-04","arxiv_id":"1912.01756","repositories_listed":1,"syntology":null},{"url":"/paper/neural-network-branching-for-neural-network-1","slug":"neural-network-branching-for-neural-network-1","title":"Neural Network Branching for Neural Network Verification","date":"2019-12-03","arxiv_id":"1912.01329","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-network-branching-for-neural-network-1#ran","syntology_url":"https://syntology.ai/paper/1912.01329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01329"}},"official":{"repos":["oval-group/GNN_branching"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/compiler-auto-vectorization-with-imitation","slug":"compiler-auto-vectorization-with-imitation","title":"Compiler Auto-Vectorization with Imitation Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-local-search-heuristics-for-boolean","slug":"learning-local-search-heuristics-for-boolean","title":"Learning Local Search Heuristics for Boolean Satisfiability","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-hierarchical-recurrent-graph","slug":"semi-supervised-hierarchical-recurrent-graph","title":"Semi-Supervised Hierarchical Recurrent Graph Neural Network for City-Wide Parking Availability Prediction","date":"2019-11-24","arxiv_id":"1911.10516","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/modality-to-modality-translation-an","slug":"modality-to-modality-translation-an","title":"Modality to Modality Translation: An Adversarial Representation Learning and Graph Fusion Network for Multimodal Fusion","date":"2019-11-18","arxiv_id":"1911.07848","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-neural-network","slug":"improving-graph-neural-network","title":"Improving Graph Neural Network Representations of Logical Formulae with Subgraph Pooling","date":"2019-11-15","arxiv_id":"1911.06904","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/1911.06904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06904"}},"official":null}},{"url":"/paper/leveraging-dependency-forest-for-neural-1","slug":"leveraging-dependency-forest-for-neural-1","title":"Leveraging Dependency Forest for Neural Medical Relation Extraction","date":"2019-11-11","arxiv_id":"1911.04123","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}},"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-relationship-detection-with-relative","slug":"visual-relationship-detection-with-relative","title":"Visual Relationship Detection with Relative Location Mining","date":"2019-11-02","arxiv_id":"1911.00713","repositories_listed":1,"syntology":null},{"url":"/paper/do-sentence-interactions-matter-leveraging","slug":"do-sentence-interactions-matter-leveraging","title":"Do Sentence Interactions Matter? Leveraging Sentence Level Representations for Fake News Classification","date":"2019-10-27","arxiv_id":"1910.12203","repositories_listed":1,"syntology":null},{"url":"/paper/ufal-mrpipe-at-mrp-2019-udpipe-goes-semantic","slug":"ufal-mrpipe-at-mrp-2019-udpipe-goes-semantic","title":"ÚFAL MRPipe at MRP 2019: UDPipe Goes Semantic in the Meaning Representation Parsing Shared Task","date":"2019-10-24","arxiv_id":"1910.11295","repositories_listed":1,"syntology":null},{"url":"/paper/natural-question-generation-with","slug":"natural-question-generation-with","title":"Natural Question Generation with Reinforcement Learning Based Graph-to-Sequence Model","date":"2019-10-19","arxiv_id":"1910.08832","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-knowledge-tracing-modeling","slug":"graph-based-knowledge-tracing-modeling","title":"Graph-based Knowledge Tracing: Modeling Student Proficiency Using Graph Neural Network","date":"2019-10-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/routenet-leveraging-graph-neural-networks-for","slug":"routenet-leveraging-graph-neural-networks-for","title":"RouteNet: Leveraging Graph Neural Networks for network modeling and optimization in SDN","date":"2019-10-03","arxiv_id":"1910.01508","repositories_listed":1,"syntology":null},{"url":"/paper/overlapping-community-detection-with-graph-1","slug":"overlapping-community-detection-with-graph-1","title":"Overlapping Community Detection with Graph Neural Networks","date":"2019-09-26","arxiv_id":"1909.12201","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/overlapping-community-detection-with-graph-1#ran","syntology_url":"https://syntology.ai/paper/1909.12201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12201"}},"official":{"repos":["shchur/overlapping-community-detection"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graphmix-regularized-training-of-graph-neural","slug":"graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":"1909.11715","repositories_listed":1,"syntology":null},{"url":"/paper/190910086","slug":"190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","arxiv_id":"1909.10086","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-image-understanding","slug":"graph-neural-networks-for-image-understanding","title":"Graph Neural Networks for Image Understanding Based on Multiple Cues: Group Emotion Recognition and Event Recognition as Use Cases","date":"2019-09-19","arxiv_id":"1909.12911","repositories_listed":1,"syntology":null},{"url":"/paper/run-csp-unsupervised-learning-of-message","slug":"run-csp-unsupervised-learning-of-message","title":"Graph Neural Networks for Maximum Constraint Satisfaction","date":"2019-09-18","arxiv_id":"1909.08387","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-manipulate-object-collections","slug":"learning-to-manipulate-object-collections","title":"Learning to Manipulate Object Collections Using Grounded State Representations","date":"2019-09-17","arxiv_id":"1909.07876","repositories_listed":1,"syntology":null},{"url":"/paper/distance-preserving-graph-embeddings-from","slug":"distance-preserving-graph-embeddings-from","title":"Graph Random Neural Features for Distance-Preserving Graph Representations","date":"2019-09-09","arxiv_id":"1909.03790","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-human-gaze-communication-by","slug":"understanding-human-gaze-communication-by","title":"Understanding Human Gaze Communication by Spatio-Temporal Graph Reasoning","date":"2019-09-04","arxiv_id":"1909.02144","repositories_listed":1,"syntology":null},{"url":"/paper/global-reasoning-over-database-structures-for","slug":"global-reasoning-over-database-structures-for","title":"Global Reasoning over Database Structures for Text-to-SQL Parsing","date":"2019-08-29","arxiv_id":"1908.11214","repositories_listed":1,"syntology":null},{"url":"/paper/multi-channel-graph-neural-network-for-entity-1","slug":"multi-channel-graph-neural-network-for-entity-1","title":"Multi-Channel Graph Neural Network for Entity Alignment","date":"2019-08-26","arxiv_id":"1908.09898","repositories_listed":1,"syntology":null},{"url":"/paper/propagate-selector-detecting-supporting","slug":"propagate-selector-detecting-supporting","title":"Propagate-Selector: Detecting Supporting Sentences for Question Answering via Graph Neural Networks","date":"2019-08-24","arxiv_id":"1908.09137","repositories_listed":1,"syntology":null},{"url":"/paper/190807558","slug":"190807558","title":"Transferring Robustness for Graph Neural Network Against Poisoning Attacks","date":"2019-08-20","arxiv_id":"1908.07558","repositories_listed":1,"syntology":null},{"url":"/paper/adagcn-adaboosting-graph-convolutional","slug":"adagcn-adaboosting-graph-convolutional","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","date":"2019-08-14","arxiv_id":"1908.05081","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-based-graph-to","slug":"reinforcement-learning-based-graph-to","title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","date":"2019-08-14","arxiv_id":"1908.04942","repositories_listed":1,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/reinforcement-learning-based-graph-to#ran","syntology_url":"https://syntology.ai/paper/1908.04942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04942"}},"official":{"repos":["hugochan/RL-based-Graph2Seq-for-NQG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/complicated-table-structure-recognition","slug":"complicated-table-structure-recognition","title":"Complicated Table Structure Recognition","date":"2019-08-13","arxiv_id":"1908.04729","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/complicated-table-structure-recognition#ran","syntology_url":"https://syntology.ai/paper/1908.04729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04729"}},"official":{"repos":["Academic-Hammer/SciTSR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/metapath-guided-heterogeneous-graph-neural","slug":"metapath-guided-heterogeneous-graph-neural","title":"Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation","date":"2019-08-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graphflow-exploiting-conversation-flow-with","slug":"graphflow-exploiting-conversation-flow-with","title":"GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension","date":"2019-07-31","arxiv_id":"1908.00059","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graphflow-exploiting-conversation-flow-with#ran","syntology_url":"https://syntology.ai/paper/1908.00059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00059"}},"official":{"repos":["hugochan/GraphFlow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/graph-neural-lasso-for-dynamic-network","slug":"graph-neural-lasso-for-dynamic-network","title":"Graph Neural Lasso for Dynamic Network Regression","date":"2019-07-25","arxiv_id":"1907.11114","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-graphical-nlp-problems-with-graph","slug":"tackling-graphical-nlp-problems-with-graph","title":"Tackling Graphical NLP problems with Graph Recurrent Networks","date":"2019-07-13","arxiv_id":"1907.06142","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-static-bug-finder-from-data","slug":"learning-a-static-bug-finder-from-data","title":"Learning a Static Bug Finder from Data","date":"2019-07-12","arxiv_id":"1907.05579","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-based-end-to-end-data","slug":"graph-neural-based-end-to-end-data","title":"Graph Neural Based End-to-end Data Association Framework for Online Multiple-Object Tracking","date":"2019-07-11","arxiv_id":"1907.05315","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-representation-learning-on-large","slug":"adversarial-representation-learning-on-large","title":"Cascade-BGNN: Toward Efficient Self-supervised Representation Learning on Large-scale Bipartite Graphs","date":"2019-06-27","arxiv_id":"1906.11994","repositories_listed":1,"syntology":null},{"url":"/paper/signed-graph-attention-networks","slug":"signed-graph-attention-networks","title":"Signed Graph Attention Networks","date":"2019-06-26","arxiv_id":"1906.10958","repositories_listed":1,"syntology":null},{"url":"/paper/alchemy-a-quantum-chemistry-dataset-for","slug":"alchemy-a-quantum-chemistry-dataset-for","title":"Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models","date":"2019-06-22","arxiv_id":"1906.09427","repositories_listed":1,"syntology":null},{"url":"/paper/coupled-graph-neural-networks-for-predicting","slug":"coupled-graph-neural-networks-for-predicting","title":"Popularity Prediction on Social Platforms with Coupled Graph Neural Networks","date":"2019-06-21","arxiv_id":"1906.09032","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-for-music-score-data-and","slug":"graph-neural-network-for-music-score-data-and","title":"Graph Neural Network for Music Score Data and Modeling Expressive Piano Performance","date":"2019-06-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/combining-generative-and-discriminative-3","slug":"combining-generative-and-discriminative-3","title":"Combining Generative and Discriminative Models for Hybrid Inference","date":"2019-06-06","arxiv_id":"1906.02547","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/combining-generative-and-discriminative-3#ran","syntology_url":"https://syntology.ai/paper/1906.02547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02547"}},"official":{"repos":["vgsatorras/hybrid-inference"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/demo-net-degree-specific-graph-neural","slug":"demo-net-degree-specific-graph-neural","title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","date":"2019-06-05","arxiv_id":"1906.02319","repositories_listed":1,"syntology":null},{"url":"/paper/variational-spectral-graph-convolutional","slug":"variational-spectral-graph-convolutional","title":"Variational Inference for Graph Convolutional Networks in the Absence of Graph Data and Adversarial Settings","date":"2019-06-05","arxiv_id":"1906.01852","repositories_listed":1,"syntology":null},{"url":"/paper/190600554","slug":"190600554","title":"Factor Graph Neural Network","date":"2019-06-03","arxiv_id":"1906.00554","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190600554#ran","syntology_url":"https://syntology.ai/paper/1906.00554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00554"}},"official":{"repos":["zzhang1987/Factor-Graph-Neural-Network"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/skeleton-based-action-recognition-with-4","slug":"skeleton-based-action-recognition-with-4","title":"Skeleton-Based Action Recognition With Directed Graph Neural Networks","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-normalizing-flows","slug":"graph-normalizing-flows","title":"Graph Normalizing Flows","date":"2019-05-30","arxiv_id":"1905.13177","repositories_listed":1,"syntology":null},{"url":"/paper/latentgnn-learning-efficient-non-local","slug":"latentgnn-learning-efficient-non-local","title":"LatentGNN: Learning Efficient Non-local Relations for Visual Recognition","date":"2019-05-28","arxiv_id":"1905.11634","repositories_listed":1,"syntology":null},{"url":"/paper/crystal-graph-neural-networks-for-data-mining","slug":"crystal-graph-neural-networks-for-data-mining","title":"Crystal Graph Neural Networks for Data Mining in Materials Science","date":"2019-05-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-identify-high-betweenness","slug":"learning-to-identify-high-betweenness","title":"Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach","date":"2019-05-24","arxiv_id":"1905.10418","repositories_listed":1,"syntology":null},{"url":"/paper/190510350","slug":"190510350","title":"Unsupervised Community Detection with Modularity-Based Attention Model","date":"2019-05-20","arxiv_id":"1905.10350","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190510350#ran","syntology_url":"https://syntology.ai/paper/1905.10350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10350"}},"official":{"repos":["Ivanopolo/modnet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gmnn-graph-markov-neural-networks","slug":"gmnn-graph-markov-neural-networks","title":"GMNN: Graph Markov Neural Networks","date":"2019-05-15","arxiv_id":"1905.06214","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gmnn-graph-markov-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1905.06214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06214"}},"official":null}},{"url":"/paper/representing-schema-structure-with-graph","slug":"representing-schema-structure-with-graph","title":"Representing Schema Structure with Graph Neural Networks for Text-to-SQL Parsing","date":"2019-05-15","arxiv_id":"1905.06241","repositories_listed":1,"syntology":null},{"url":"/paper/the-cracks-that-wanted-to-be-a-graph","slug":"the-cracks-that-wanted-to-be-a-graph","title":"Craquelure as a Graph: Application of Image Processing and Graph Neural Networks to the Description of Fracture Patterns","date":"2019-05-13","arxiv_id":"1905.05010","repositories_listed":1,"syntology":null},{"url":"/paper/pinet-a-permutation-invariant-graph-neural","slug":"pinet-a-permutation-invariant-graph-neural","title":"PiNet: A Permutation Invariant Graph Neural Network for Graph Classification","date":"2019-05-08","arxiv_id":"1905.03046","repositories_listed":1,"syntology":null},{"url":"/paper/generating-classification-weights-with-gnn","slug":"generating-classification-weights-with-gnn","title":"Generating Classification Weights with GNN Denoising Autoencoders for Few-Shot Learning","date":"2019-05-03","arxiv_id":"1905.01102","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generating-classification-weights-with-gnn#ran","syntology_url":"https://syntology.ai/paper/1905.01102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01102"}},"official":{"repos":["gidariss/wDAE_GNN_FewShot"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/capsule-graph-neural-network","slug":"capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","repositories_listed":1,"syntology":null},{"url":"/paper/advancing-graphsage-with-a-data-driven-node","slug":"advancing-graphsage-with-a-data-driven-node","title":"Advancing GraphSAGE with A Data-Driven Node Sampling","date":"2019-04-29","arxiv_id":"1904.12935","repositories_listed":1,"syntology":null},{"url":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","slug":"edgnn-a-simple-and-powerful-gnn-for-directed","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","date":"2019-04-18","arxiv_id":"1904.08745","repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-visual-dialogs-with-structural-and","slug":"reasoning-visual-dialogs-with-structural-and","title":"Reasoning Visual Dialogs with Structural and Partial Observations","date":"2019-04-11","arxiv_id":"1904.05548","repositories_listed":1,"syntology":null},{"url":"/paper/what-object-should-i-use-task-driven-object","slug":"what-object-should-i-use-task-driven-object","title":"What Object Should I Use? - Task Driven Object Detection","date":"2019-04-05","arxiv_id":"1904.03000","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/what-object-should-i-use-task-driven-object#ran","syntology_url":"https://syntology.ai/paper/1904.03000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.03000"}},"official":null}},{"url":"/paper/medgcn-graph-convolutional-networks-for","slug":"medgcn-graph-convolutional-networks-for","title":"MedGCN: Medication recommendation and lab test imputation via graph convolutional networks","date":"2019-03-31","arxiv_id":"1904.00326","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/medgcn-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1904.00326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00326"}},"official":{"repos":["mocherson/MedGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/molecular-geometry-prediction-using-a-deep","slug":"molecular-geometry-prediction-using-a-deep","title":"Molecular geometry prediction using a deep generative graph neural network","date":"2019-03-31","arxiv_id":"1904.00314","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/molecular-geometry-prediction-using-a-deep#ran","syntology_url":"https://syntology.ai/paper/1904.00314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00314"}},"official":{"repos":["nyu-dl/dl4chem-geometry"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fisher-bures-adversary-graph-convolutional","slug":"fisher-bures-adversary-graph-convolutional","title":"Fisher-Bures Adversary Graph Convolutional Networks","date":"2019-03-11","arxiv_id":"1903.04154","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fisher-bures-adversary-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1903.04154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04154"}},"official":{"repos":["stellargraph/FisherGCN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-adversarial-training-dynamically","slug":"graph-adversarial-training-dynamically","title":"Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure","date":"2019-02-20","arxiv_id":"1902.08226","repositories_listed":1,"syntology":null},{"url":"/paper/dom-q-net-grounded-rl-on-structured-language","slug":"dom-q-net-grounded-rl-on-structured-language","title":"DOM-Q-NET: Grounded RL on Structured Language","date":"2019-02-19","arxiv_id":"1902.07257","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-visual-compatibility-prediction","slug":"context-aware-visual-compatibility-prediction","title":"Context-Aware Visual Compatibility Prediction","date":"2019-02-10","arxiv_id":"1902.03646","repositories_listed":1,"syntology":null}],"record_sha256":"03470bd7564ddbd3c7b7185ff8f64136435e4ab0ed71124fa128f2a168d50342","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}