{"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-construction/papers/2","list_of":"/task/graph-construction","task":"graph construction","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":2,"pages_in_order":6,"rows_per_page":100,"rows":[101,200],"of":561,"counts":{"archive_papers_tagged":561,"with_a_code_link":220,"where_syntology_ran_a_sample":38,"not_listed_spam_title":0,"listed":561,"listed_where_code_ran":38,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":31,"listed_every_run_a_failure_of_syntologys_instrument":7,"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-construction","prev":"/task/graph-construction","next":"/task/graph-construction/papers/3","papers":[{"url":"/paper/misca-a-joint-model-for-multiple-intent","slug":"misca-a-joint-model-for-multiple-intent","title":"MISCA: A Joint Model for Multiple Intent Detection and Slot Filling with Intent-Slot Co-Attention","date":"2023-12-10","arxiv_id":"2312.05741","repositories_listed":1,"syntology":null},{"url":"/paper/relative-nn-descent-a-fast-index-construction","slug":"relative-nn-descent-a-fast-index-construction","title":"Relative NN-Descent: A Fast Index Construction for Graph-Based Approximate Nearest Neighbor Search","date":"2023-10-31","arxiv_id":"2310.20419","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-study-of-population-graph","slug":"a-comparative-study-of-population-graph","title":"A Comparative Study of Population-Graph Construction Methods and Graph Neural Networks for Brain Age Regression","date":"2023-09-26","arxiv_id":"2309.14816","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-relations-classification-using","slug":"multiple-relations-classification-using","title":"Multiple Relations Classification using Imbalanced Predictions Adaptation","date":"2023-09-24","arxiv_id":"2309.13718","repositories_listed":1,"syntology":null},{"url":"/paper/pcn-a-deep-learning-approach-to-jet-tagging","slug":"pcn-a-deep-learning-approach-to-jet-tagging","title":"PCN: A Deep Learning Approach to Jet Tagging Utilizing Novel Graph Construction Methods and Chebyshev Graph Convolutions","date":"2023-09-12","arxiv_id":"2309.08630","repositories_listed":1,"syntology":null},{"url":"/paper/applying-biobert-to-extract-germline-gene","slug":"applying-biobert-to-extract-germline-gene","title":"Applying BioBERT to Extract Germline Gene-Disease Associations for Building a Knowledge Graph from the Biomedical Literature","date":"2023-09-11","arxiv_id":"2309.13061","repositories_listed":1,"syntology":null},{"url":"/paper/fully-connected-spatial-temporal-graph-for","slug":"fully-connected-spatial-temporal-graph-for","title":"Fully-Connected Spatial-Temporal Graph for Multivariate Time-Series Data","date":"2023-09-11","arxiv_id":"2309.05305","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-incomplete-multi-view-clustering","slug":"scalable-incomplete-multi-view-clustering","title":"Scalable Incomplete Multi-View Clustering with Structure Alignment","date":"2023-08-31","arxiv_id":"2308.16541","repositories_listed":1,"syntology":null},{"url":"/paper/gkgnet-group-k-nearest-neighbor-based-graph","slug":"gkgnet-group-k-nearest-neighbor-based-graph","title":"GKGNet: Group K-Nearest Neighbor based Graph Convolutional Network for Multi-Label Image Recognition","date":"2023-08-28","arxiv_id":"2308.14378","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-prompting-for-multi-document","slug":"knowledge-graph-prompting-for-multi-document","title":"Knowledge Graph Prompting for Multi-Document Question Answering","date":"2023-08-22","arxiv_id":"2308.11730","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-prompting-for-multi-document#ran","syntology_url":"https://syntology.ai/paper/2308.11730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11730"}},"official":{"repos":["yuwvandy/kg-llm-mdqa"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-preferential-attached-knn-graph-with","slug":"adaptive-preferential-attached-knn-graph-with","title":"Distribution-Informed Adaptation for kNN Graph Construction","date":"2023-08-04","arxiv_id":"2308.02442","repositories_listed":1,"syntology":null},{"url":"/paper/pvg-progressive-vision-graph-for-vision","slug":"pvg-progressive-vision-graph-for-vision","title":"PVG: Progressive Vision Graph for Vision Recognition","date":"2023-08-01","arxiv_id":"2308.00574","repositories_listed":1,"syntology":null},{"url":"/paper/tfe-gnn-a-temporal-fusion-encoder-using-graph","slug":"tfe-gnn-a-temporal-fusion-encoder-using-graph","title":"TFE-GNN: A Temporal Fusion Encoder Using Graph Neural Networks for Fine-grained Encrypted Traffic Classification","date":"2023-07-31","arxiv_id":"2307.16713","repositories_listed":1,"syntology":null},{"url":"/paper/fast-approximate-nearest-neighbor-search-with-1","slug":"fast-approximate-nearest-neighbor-search-with-1","title":"Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement","date":"2023-07-19","arxiv_id":"2307.10479","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-brain-age-estimation-using","slug":"multimodal-brain-age-estimation-using","title":"Multimodal brain age estimation using interpretable adaptive population-graph learning","date":"2023-07-10","arxiv_id":"2307.04639","repositories_listed":1,"syntology":null},{"url":"/paper/collabkg-a-learnable-human-machine","slug":"collabkg-a-learnable-human-machine","title":"CollabKG: A Learnable Human-Machine-Cooperative Information Extraction Toolkit for (Event) Knowledge Graph Construction","date":"2023-07-03","arxiv_id":"2307.00769","repositories_listed":1,"syntology":null},{"url":"/paper/cuslink-single-linkage-agglomerative","slug":"cuslink-single-linkage-agglomerative","title":"cuSLINK: Single-linkage Agglomerative Clustering on the GPU","date":"2023-06-28","arxiv_id":"2306.16354","repositories_listed":1,"syntology":null},{"url":"/paper/relevant-entity-selection-knowledge-graph","slug":"relevant-entity-selection-knowledge-graph","title":"Relevant Entity Selection: Knowledge Graph Bootstrapping via Zero-Shot Analogical Pruning","date":"2023-06-28","arxiv_id":"2306.16296","repositories_listed":1,"syntology":null},{"url":"/paper/a-decade-of-scholarly-research-on-open","slug":"a-decade-of-scholarly-research-on-open","title":"A Decade of Scholarly Research on Open Knowledge Graphs","date":"2023-06-22","arxiv_id":"2306.13186","repositories_listed":1,"syntology":null},{"url":"/paper/pyrca-a-library-for-metric-based-root-cause","slug":"pyrca-a-library-for-metric-based-root-cause","title":"PyRCA: A Library for Metric-based Root Cause Analysis","date":"2023-06-20","arxiv_id":"2306.11417","repositories_listed":1,"syntology":null},{"url":"/paper/biorex-improving-biomedical-relation","slug":"biorex-improving-biomedical-relation","title":"BioREx: Improving Biomedical Relation Extraction by Leveraging Heterogeneous Datasets","date":"2023-06-19","arxiv_id":"2306.11189","repositories_listed":1,"syntology":null},{"url":"/paper/heuristic-heterogeneous-graph-reasoning","slug":"heuristic-heterogeneous-graph-reasoning","title":"Heuristic Heterogeneous Graph Reasoning Networks for Fact Verification","date":"2023-06-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/from-the-one-judge-of-the-whole-typed","slug":"from-the-one-judge-of-the-whole-typed","title":"From the One, Judge of the Whole: Typed Entailment Graph Construction with Predicate Generation","date":"2023-06-07","arxiv_id":"2306.04170","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-forced-alignment-of","slug":"weakly-supervised-forced-alignment-of","title":"Weakly-supervised forced alignment of disfluent speech using phoneme-level modeling","date":"2023-05-30","arxiv_id":"2306.00996","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-the-dots-what-graph-based-text","slug":"connecting-the-dots-what-graph-based-text","title":"Connecting the Dots: What Graph-Based Text Representations Work Best for Text Classification Using Graph Neural Networks?","date":"2023-05-23","arxiv_id":"2305.14578","repositories_listed":1,"syntology":null},{"url":"/paper/llms-for-knowledge-graph-construction-and","slug":"llms-for-knowledge-graph-construction-and","title":"LLMs for Knowledge Graph Construction and Reasoning: Recent Capabilities and Future Opportunities","date":"2023-05-22","arxiv_id":"2305.13168","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/llms-for-knowledge-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2305.13168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13168"}},"official":{"repos":["zjunlp/autokg"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/dynamic-causal-explanation-based-diffusion","slug":"dynamic-causal-explanation-based-diffusion","title":"Dynamic Causal Explanation Based Diffusion-Variational Graph Neural Network for Spatio-temporal Forecasting","date":"2023-05-16","arxiv_id":"2305.09703","repositories_listed":1,"syntology":null},{"url":"/paper/continual-multimodal-knowledge-graph","slug":"continual-multimodal-knowledge-graph","title":"Continual Multimodal Knowledge Graph Construction","date":"2023-05-15","arxiv_id":"2305.08698","repositories_listed":1,"syntology":null},{"url":"/paper/schema-adaptable-knowledge-graph-construction","slug":"schema-adaptable-knowledge-graph-construction","title":"Schema-adaptable Knowledge Graph Construction","date":"2023-05-15","arxiv_id":"2305.08703","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-tensor-based-proximity-learning-for","slug":"low-rank-tensor-based-proximity-learning-for","title":"Low-Rank Tensor Based Proximity Learning for Multi-View Clustering","date":"2023-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transductive-few-shot-learning-with-prototype","slug":"transductive-few-shot-learning-with-prototype","title":"Transductive Few-shot Learning with Prototype-based Label Propagation by Iterative Graph Refinement","date":"2023-04-23","arxiv_id":"2304.11598","repositories_listed":1,"syntology":null},{"url":"/paper/lane-graph-as-path-continuity-preserving-path","slug":"lane-graph-as-path-continuity-preserving-path","title":"Lane Graph as Path: Continuity-preserving Path-wise Modeling for Online Lane Graph Construction","date":"2023-03-15","arxiv_id":"2303.08815","repositories_listed":1,"syntology":null},{"url":"/paper/mcts-geb-monte-carlo-tree-search-is-a-good-e","slug":"mcts-geb-monte-carlo-tree-search-is-a-good-e","title":"MCTS-GEB: Monte Carlo Tree Search is a Good E-graph Builder","date":"2023-03-08","arxiv_id":"2303.04651","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/mcts-geb-monte-carlo-tree-search-is-a-good-e#ran","syntology_url":"https://syntology.ai/paper/2303.04651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04651"}},"official":{"repos":["ucamrl/eqs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-graph-learning-for-acoustic","slug":"heterogeneous-graph-learning-for-acoustic","title":"Heterogeneous Graph Learning for Acoustic Event Classification","date":"2023-03-05","arxiv_id":"2303.02665","repositories_listed":1,"syntology":null},{"url":"/paper/connectivity-optimized-nested-graph-networks","slug":"connectivity-optimized-nested-graph-networks","title":"Connectivity Optimized Nested Graph Networks for Crystal Structures","date":"2023-02-27","arxiv_id":"2302.14102","repositories_listed":1,"syntology":null},{"url":"/paper/graph-construction-using-principal-axis-trees","slug":"graph-construction-using-principal-axis-trees","title":"Graph Construction using Principal Axis Trees for Simple Graph Convolution","date":"2023-02-22","arxiv_id":"2302.12000","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-forest-initialization-for","slug":"random-projection-forest-initialization-for","title":"Random Projection Forest Initialization for Graph Convolutional Networks","date":"2023-02-22","arxiv_id":"2302.12001","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-meet-directed-graphs","slug":"transformers-meet-directed-graphs","title":"Transformers Meet Directed Graphs","date":"2023-01-31","arxiv_id":"2302.00049","repositories_listed":1,"syntology":null},{"url":"/paper/the-semantic-scholar-open-data-platform","slug":"the-semantic-scholar-open-data-platform","title":"The Semantic Scholar Open Data Platform","date":"2023-01-24","arxiv_id":"2301.10140","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-semantic-scholar-open-data-platform#ran","syntology_url":"https://syntology.ai/paper/2301.10140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10140"}},"official":{"repos":["allenai/s2aff"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vision-hgnn-an-image-is-more-than-a-graph-of","slug":"vision-hgnn-an-image-is-more-than-a-graph-of","title":"Vision HGNN: An Image is More than a Graph of Nodes","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-multimodal-entity-relation-extraction","slug":"joint-multimodal-entity-relation-extraction","title":"Joint Multimodal Entity-Relation Extraction Based on Edge-enhanced Graph Alignment Network and Word-pair Relation Tagging","date":"2022-11-28","arxiv_id":"2211.15028","repositories_listed":1,"syntology":null},{"url":"/paper/a-dataset-for-hyper-relational-extraction-and","slug":"a-dataset-for-hyper-relational-extraction-and","title":"A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach","date":"2022-11-18","arxiv_id":"2211.10018","repositories_listed":1,"syntology":null},{"url":"/paper/folkscope-intention-knowledge-graph","slug":"folkscope-intention-knowledge-graph","title":"FolkScope: Intention Knowledge Graph Construction for E-commerce Commonsense Discovery","date":"2022-11-15","arxiv_id":"2211.08316","repositories_listed":1,"syntology":null},{"url":"/paper/robust-point-cloud-registration-framework-1","slug":"robust-point-cloud-registration-framework-1","title":"Robust Point Cloud Registration Framework Based on Deep Graph Matching(TPAMI Version)","date":"2022-11-09","arxiv_id":"2211.04696","repositories_listed":1,"syntology":null},{"url":"/paper/generative-knowledge-graph-construction-a","slug":"generative-knowledge-graph-construction-a","title":"Generative Knowledge Graph Construction: A Review","date":"2022-10-23","arxiv_id":"2210.12714","repositories_listed":1,"syntology":null},{"url":"/paper/schema-aware-reference-as-prompt-improves","slug":"schema-aware-reference-as-prompt-improves","title":"Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction","date":"2022-10-19","arxiv_id":"2210.10709","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/schema-aware-reference-as-prompt-improves#ran","syntology_url":"https://syntology.ai/paper/2210.10709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10709"}},"official":{"repos":["zjunlp/RAP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-real-time-temporal-graph-learning","slug":"towards-real-time-temporal-graph-learning","title":"Towards Real-Time Temporal Graph Learning","date":"2022-10-08","arxiv_id":"2210.04114","repositories_listed":1,"syntology":null},{"url":"/paper/dyngl-sdp-dynamic-graph-learning-for-semantic","slug":"dyngl-sdp-dynamic-graph-learning-for-semantic","title":"DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/virtual-knowledge-graph-construction-for-zero","slug":"virtual-knowledge-graph-construction-for-zero","title":"Virtual Knowledge Graph Construction for Zero-Shot Domain-Specific Document Retrieval","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/oversquashing-in-gnns-through-the-lens-of","slug":"oversquashing-in-gnns-through-the-lens-of","title":"Oversquashing in GNNs through the lens of information contraction and graph expansion","date":"2022-08-06","arxiv_id":"2208.03471","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/oversquashing-in-gnns-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2208.03471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03471"}},"official":{"repos":["kedar2/oversquashing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automated-dilated-spatio-temporal-synchronous","slug":"automated-dilated-spatio-temporal-synchronous","title":"Automated Dilated Spatio-Temporal Synchronous Graph Modeling for Traffic Prediction","date":"2022-07-22","arxiv_id":"2207.10830","repositories_listed":1,"syntology":null},{"url":"/paper/a-double-graph-based-framework-for-frame-1","slug":"a-double-graph-based-framework-for-frame-1","title":"A Double-Graph Based Framework for Frame Semantic Parsing","date":"2022-06-18","arxiv_id":"2206.09158","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-enhanced-click-model-for-web-search-1","slug":"a-graph-enhanced-click-model-for-web-search-1","title":"A Graph-Enhanced Click Model for Web Search","date":"2022-06-17","arxiv_id":"2206.08621","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/a-graph-enhanced-click-model-for-web-search-1#ran","syntology_url":"https://syntology.ai/paper/2206.08621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08621"}},"official":{"repos":["chiangel/graphcm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stereokg-data-driven-knowledge-graph","slug":"stereokg-data-driven-knowledge-graph","title":"StereoKG: Data-Driven Knowledge Graph Construction for Cultural Knowledge and Stereotypes","date":"2022-05-27","arxiv_id":"2205.14036","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-the-representation-bottleneck-of","slug":"discovering-the-representation-bottleneck-of","title":"Discovering and Explaining the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions","date":"2022-05-15","arxiv_id":"2205.07266","repositories_listed":1,"syntology":null},{"url":"/paper/gypsum-learning-hybrid-representations-for","slug":"gypsum-learning-hybrid-representations-for","title":"GypSum: Learning Hybrid Representations for Code Summarization","date":"2022-04-26","arxiv_id":"2204.12916","repositories_listed":1,"syntology":null},{"url":"/paper/multi-level-cross-view-contrastive-learning","slug":"multi-level-cross-view-contrastive-learning","title":"Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System","date":"2022-04-19","arxiv_id":"2204.08807","repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-representation-learning-on-1","slug":"multi-scale-representation-learning-on-1","title":"Multi-Scale Representation Learning on Proteins","date":"2022-04-04","arxiv_id":"2204.02337","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":0,"n_no_contract":7,"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, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-scale-representation-learning-on-1#ran","syntology_url":"https://syntology.ai/paper/2204.02337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02337"}},"official":null}},{"url":"/paper/automatic-biomedical-term-clustering-by","slug":"automatic-biomedical-term-clustering-by","title":"Automatic Biomedical Term Clustering by Learning Fine-grained Term Representations","date":"2022-04-01","arxiv_id":"2204.00391","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-active-learning-for-semi","slug":"graph-based-active-learning-for-semi","title":"Graph-based Active Learning for Semi-supervised Classification of SAR Data","date":"2022-03-31","arxiv_id":"2204.00005","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-graph-convolutional-networks","slug":"understanding-graph-convolutional-networks","title":"Understanding Graph Convolutional Networks for Text Classification","date":"2022-03-30","arxiv_id":"2203.16060","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-transformer-model-for-scientific","slug":"hierarchical-transformer-model-for-scientific","title":"Hierarchical Transformer Model for Scientific Named Entity Recognition","date":"2022-03-28","arxiv_id":"2203.14710","repositories_listed":1,"syntology":null},{"url":"/paper/pdns-net-a-large-heterogeneous-graph","slug":"pdns-net-a-large-heterogeneous-graph","title":"PDNS-Net: A Large Heterogeneous Graph Benchmark Dataset of Network Resolutions for Graph Learning","date":"2022-03-15","arxiv_id":"2203.07969","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-graph-representation-learning-via-1","slug":"molecular-graph-representation-learning-via-1","title":"Molecular Representation Learning via Heterogeneous Motif Graph Neural Networks","date":"2022-02-01","arxiv_id":"2202.00529","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graphs-for-audio","slug":"self-supervised-graphs-for-audio","title":"Self-supervised Graphs for Audio Representation Learning with Limited Labeled Data","date":"2022-01-31","arxiv_id":"2202.00097","repositories_listed":1,"syntology":null},{"url":"/paper/powergear-early-stage-power-estimation-in","slug":"powergear-early-stage-power-estimation-in","title":"PowerGear: Early-Stage Power Estimation in FPGA HLS via Heterogeneous Edge-Centric GNNs","date":"2022-01-25","arxiv_id":"2201.10114","repositories_listed":1,"syntology":null},{"url":"/paper/bern2-an-advanced-neural-biomedical-named","slug":"bern2-an-advanced-neural-biomedical-named","title":"BERN2: an advanced neural biomedical named entity recognition and normalization tool","date":"2022-01-06","arxiv_id":"2201.02080","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":0,"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/bern2-an-advanced-neural-biomedical-named#ran","syntology_url":"https://syntology.ai/paper/2201.02080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.02080"}},"official":{"repos":["dmis-lab/bern2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-similarity-aware-time-series","slug":"towards-similarity-aware-time-series","title":"Towards Similarity-Aware Time-Series Classification","date":"2022-01-05","arxiv_id":"2201.01413","repositories_listed":1,"syntology":null},{"url":"/paper/node-aligned-graph-convolutional-network-for","slug":"node-aligned-graph-convolutional-network-for","title":"Node-Aligned Graph Convolutional Network for Whole-Slide Image Representation and Classification","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sgtr-end-to-end-scene-graph-generation-with","slug":"sgtr-end-to-end-scene-graph-generation-with","title":"SGTR: End-to-end Scene Graph Generation with Transformer","date":"2021-12-24","arxiv_id":"2112.12970","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sgtr-end-to-end-scene-graph-generation-with#ran","syntology_url":"https://syntology.ai/paper/2112.12970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.12970"}},"official":{"repos":["scarecrow0/sgtr"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph4rec-a-universal-toolkit-with-graph","slug":"graph4rec-a-universal-toolkit-with-graph","title":"Graph4Rec: A Universal Toolkit with Graph Neural Networks for Recommender Systems","date":"2021-12-02","arxiv_id":"2112.01035","repositories_listed":1,"syntology":null},{"url":"/paper/extend-dont-rebuild-phrasing-conditional","slug":"extend-dont-rebuild-phrasing-conditional","title":"Extend, don’t rebuild: Phrasing conditional graph modification as autoregressive sequence labelling","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-k-nn-graph-construction-by-gpu-based-nn","slug":"fast-k-nn-graph-construction-by-gpu-based-nn","title":"Fast k-NN Graph Construction by GPU based NN-Descent","date":"2021-10-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-based-neural-model-for-end-to-end","slug":"a-graph-based-neural-model-for-end-to-end","title":"A Graph-Based Neural Model for End-to-End Frame Semantic Parsing","date":"2021-09-25","arxiv_id":"2109.12319","repositories_listed":1,"syntology":null},{"url":"/paper/modality-and-negation-in-event-extraction","slug":"modality-and-negation-in-event-extraction","title":"Modality and Negation in Event Extraction","date":"2021-09-20","arxiv_id":"2109.09393","repositories_listed":1,"syntology":null},{"url":"/paper/tnnt-the-named-entity-recognition-toolkit","slug":"tnnt-the-named-entity-recognition-toolkit","title":"TNNT: The Named Entity Recognition Toolkit","date":"2021-08-31","arxiv_id":"2108.13700","repositories_listed":1,"syntology":null},{"url":"/paper/group-aware-graph-neural-network-for","slug":"group-aware-graph-neural-network-for","title":"Group-Aware Graph Neural Network for Nationwide City Air Quality Forecasting","date":"2021-08-27","arxiv_id":"2108.12238","repositories_listed":1,"syntology":null},{"url":"/paper/effective-cascade-dual-decoder-model-for","slug":"effective-cascade-dual-decoder-model-for","title":"A Cascade Dual-Decoder Model for Joint Entity and Relation Extraction","date":"2021-06-27","arxiv_id":"2106.14163","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-natural-language","slug":"graph-neural-networks-for-natural-language","title":"Graph Neural Networks for Natural Language Processing: A Survey","date":"2021-06-10","arxiv_id":"2106.06090","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-natural-language#ran","syntology_url":"https://syntology.ai/paper/2106.06090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06090"}},"official":{"repos":["graph4ai/graph4nlp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/context-aware-sparse-deep-coordination-graphs","slug":"context-aware-sparse-deep-coordination-graphs","title":"Context-Aware Sparse Deep Coordination Graphs","date":"2021-06-05","arxiv_id":"2106.02886","repositories_listed":1,"syntology":null},{"url":"/paper/convosumm-conversation-summarization","slug":"convosumm-conversation-summarization","title":"ConvoSumm: Conversation Summarization Benchmark and Improved Abstractive Summarization with Argument Mining","date":"2021-06-01","arxiv_id":"2106.00829","repositories_listed":1,"syntology":null},{"url":"/paper/diakg-an-annotated-diabetes-dataset-for","slug":"diakg-an-annotated-diabetes-dataset-for","title":"DiaKG: an Annotated Diabetes Dataset for Medical Knowledge Graph Construction","date":"2021-05-31","arxiv_id":"2105.15033","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/diakg-an-annotated-diabetes-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2105.15033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.15033"}},"official":{"repos":["changdejie/diaKG-code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-semantic-graph-construction-and","slug":"dynamic-semantic-graph-construction-and","title":"Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering","date":"2021-05-25","arxiv_id":"2105.11776","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/dynamic-semantic-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2105.11776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11776"}},"official":{"repos":["wwxu21/AMR-SG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/boundary-aware-3d-object-detection-from-point","slug":"boundary-aware-3d-object-detection-from-point","title":"BADet: Boundary-Aware 3D Object Detection from Point Clouds","date":"2021-04-21","arxiv_id":"2104.10330","repositories_listed":1,"syntology":null},{"url":"/paper/gkd-semi-supervised-graph-knowledge","slug":"gkd-semi-supervised-graph-knowledge","title":"GKD: Semi-supervised Graph Knowledge Distillation for Graph-Independent Inference","date":"2021-04-08","arxiv_id":"2104.03597","repositories_listed":1,"syntology":null},{"url":"/paper/charged-particle-tracking-via-edge","slug":"charged-particle-tracking-via-edge","title":"Charged particle tracking via edge-classifying interaction networks","date":"2021-03-30","arxiv_id":"2103.16701","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/charged-particle-tracking-via-edge#ran","syntology_url":"https://syntology.ai/paper/2103.16701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16701"}},"official":{"repos":["GageDeZoort/interaction_network_paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/large-scale-approximate-k-nn-graph","slug":"large-scale-approximate-k-nn-graph","title":"Large-Scale Approximate k-NN Graph Construction on GPU","date":"2021-03-29","arxiv_id":"2103.15386","repositories_listed":1,"syntology":null},{"url":"/paper/the-unknown-knowns-a-graph-based-approach-for","slug":"the-unknown-knowns-a-graph-based-approach-for","title":"The unknown knowns: a graph-based approach for temporal COVID-19 literature mining","date":"2021-03-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-edge-oriented-reasoning-for-3d","slug":"exploiting-edge-oriented-reasoning-for-3d","title":"Exploiting Edge-Oriented Reasoning for 3D Point-based Scene Graph Analysis","date":"2021-03-09","arxiv_id":"2103.05558","repositories_listed":1,"syntology":null},{"url":"/paper/movie-summarization-via-sparse-graph","slug":"movie-summarization-via-sparse-graph","title":"Movie Summarization via Sparse Graph Construction","date":"2020-12-14","arxiv_id":"2012.07536","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-visual-content-tagging","slug":"privacy-preserving-visual-content-tagging","title":"Privacy-Preserving Visual Content Tagging using Graph Transformer Networks","date":"2020-10-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-visual-content-tagging-1","slug":"privacy-preserving-visual-content-tagging-1","title":"Privacy-Preserving Visual Content Tagging using Graph Transformer Networks","date":"2020-10-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/location-aware-graph-convolutional-networks","slug":"location-aware-graph-convolutional-networks","title":"Location-aware Graph Convolutional Networks for Video Question Answering","date":"2020-08-07","arxiv_id":"2008.09105","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/location-aware-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2008.09105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09105"}},"official":{"repos":["SunDoge/L-GCN"],"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/learnable-graph-inception-network-for-emotion","slug":"learnable-graph-inception-network-for-emotion","title":"Dynamic Emotion Modeling with Learnable Graphs and Graph Inception Network","date":"2020-08-06","arxiv_id":"2008.02661","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-human-action-generation","slug":"structure-aware-human-action-generation","title":"Structure-Aware Human-Action Generation","date":"2020-07-04","arxiv_id":"2007.01971","repositories_listed":1,"syntology":null},{"url":"/paper/transition-based-directed-graph-construction","slug":"transition-based-directed-graph-construction","title":"Transition-based Directed Graph Construction for Emotion-Cause Pair Extraction","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-extrapolate-knowledge","slug":"learning-to-extrapolate-knowledge","title":"Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction","date":"2020-06-11","arxiv_id":"2006.06648","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-to-extrapolate-knowledge#ran","syntology_url":"https://syntology.ai/paper/2006.06648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06648"}},"official":{"repos":["JinheonBaek/GEN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/rotation-equivariant-graph-convolutional","slug":"rotation-equivariant-graph-convolutional","title":"Rotation Equivariant Graph Convolutional Network for Spherical Image Classification","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/common-knowledge-concept-recognition-for-seva","slug":"common-knowledge-concept-recognition-for-seva","title":"Common-Knowledge Concept Recognition for SEVA","date":"2020-03-26","arxiv_id":"2003.11687","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-segment-3d-point-clouds-in-2d","slug":"learning-to-segment-3d-point-clouds-in-2d","title":"Learning to Segment 3D Point Clouds in 2D Image Space","date":"2020-03-12","arxiv_id":"2003.05593","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-to-segment-3d-point-clouds-in-2d#ran","syntology_url":"https://syntology.ai/paper/2003.05593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05593"}},"official":null}}],"record_sha256":"bfc32f2bde38ba1975884d16ff7f7a30b539a48851d4a078e8339a1e57d47b06","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}