{"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","name":"graph construction","slug":"graph-construction","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":561,"papers_with_code":220,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":4,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/roadtracer","name":"RoadTracer","full_name":"","num_papers_in_archive":39},{"url":"/dataset/covidqa","name":"CovidQA","full_name":"","num_papers_in_archive":15},{"url":"/dataset/ipre","name":"IPRE","full_name":"","num_papers_in_archive":4},{"url":"/dataset/user-reviews-and-perfume-attributes-dataset","name":"Perfume Co-Preference Network","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":6,"rows_per_page":100,"shown":100,"of":561,"of_with_code":220,"tagged_in_all":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":30,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":30,"listed_every_run_a_failure_of_syntologys_instrument":8,"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"},"items":[{"url":"/paper/181110831","slug":"181110831","title":"sCAKE: Semantic Connectivity Aware Keyword Extraction","date":"2018-11-27","arxiv_id":"1811.10831","repositories_listed":5,"syntology":null},{"url":"/paper/efanna-an-extremely-fast-approximate-nearest","slug":"efanna-an-extremely-fast-approximate-nearest","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","date":"2016-09-23","arxiv_id":"1609.07228","repositories_listed":5,"syntology":null},{"url":"/paper/visualizing-large-scale-and-high-dimensional","slug":"visualizing-large-scale-and-high-dimensional","title":"Visualizing Large-scale and High-dimensional Data","date":"2016-02-01","arxiv_id":"1602.00370","repositories_listed":5,"syntology":null},{"url":"/paper/probabilistic-weather-forecasting-with","slug":"probabilistic-weather-forecasting-with","title":"Probabilistic Weather Forecasting with Hierarchical Graph Neural Networks","date":"2024-06-07","arxiv_id":"2406.04759","repositories_listed":4,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":5,"n_instrument":6,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"11 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; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/probabilistic-weather-forecasting-with#ran","syntology_url":"https://syntology.ai/paper/2406.04759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04759"}},"official":{"repos":["mllam/neural-lam"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/x-lora-mixture-of-low-rank-adapter-experts-a","slug":"x-lora-mixture-of-low-rank-adapter-experts-a","title":"X-LoRA: Mixture of Low-Rank Adapter Experts, a Flexible Framework for Large Language Models with Applications in Protein Mechanics and Molecular Design","date":"2024-02-11","arxiv_id":"2402.07148","repositories_listed":4,"syntology":null},{"url":"/paper/structured-sparse-r-cnn-for-direct-scene","slug":"structured-sparse-r-cnn-for-direct-scene","title":"Structured Sparse R-CNN for Direct Scene Graph Generation","date":"2021-06-21","arxiv_id":"2106.10815","repositories_listed":4,"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/structured-sparse-r-cnn-for-direct-scene#ran","syntology_url":"https://syntology.ai/paper/2106.10815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10815"}},"official":{"repos":["mcg-nju/structured-sparse-rcnn"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/non-local-graph-convolutional-networks-for","slug":"non-local-graph-convolutional-networks-for","title":"Two-Stream Adaptive Graph Convolutional Networks for Skeleton-Based Action Recognition","date":"2018-05-20","arxiv_id":"1805.07694","repositories_listed":4,"syntology":null},{"url":"/paper/dynet-the-dynamic-neural-network-toolkit","slug":"dynet-the-dynamic-neural-network-toolkit","title":"DyNet: The Dynamic Neural Network Toolkit","date":"2017-01-15","arxiv_id":"1701.03980","repositories_listed":4,"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/dynet-the-dynamic-neural-network-toolkit#ran","syntology_url":"https://syntology.ai/paper/1701.03980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.03980"}},"official":{"repos":["clab/dynet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-construction-from-data-using-non","slug":"graph-construction-from-data-using-non","title":"Neighborhood and Graph Constructions using Non-Negative Kernel Regression","date":"2019-10-21","arxiv_id":"1910.09383","repositories_listed":3,"syntology":null},{"url":"/paper/graph-neural-networks-for-jamming-source","slug":"graph-neural-networks-for-jamming-source","title":"Graph Neural Networks for Jamming Source Localization","date":"2025-06-01","arxiv_id":"2506.03196","repositories_listed":2,"syntology":null},{"url":"/paper/ras-retrieval-and-structuring-for-knowledge","slug":"ras-retrieval-and-structuring-for-knowledge","title":"RAS: Retrieval-And-Structuring for Knowledge-Intensive LLM Generation","date":"2025-02-16","arxiv_id":"2502.10996","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"8 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ras-retrieval-and-structuring-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2502.10996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10996"}},"official":{"repos":["pat-jj/ras","pat-jj/Retrieval-And-Structure"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["community","official"]}}},{"url":"/paper/multimodal-contextualized-semantic-parsing","slug":"multimodal-contextualized-semantic-parsing","title":"Multimodal Contextualized Semantic Parsing from Speech","date":"2024-06-10","arxiv_id":"2406.06438","repositories_listed":2,"syntology":null},{"url":"/paper/cagra-highly-parallel-graph-construction-and","slug":"cagra-highly-parallel-graph-construction-and","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","date":"2023-08-29","arxiv_id":"2308.15136","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":8,"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) · 3 unverified","sample_list":"/paper/cagra-highly-parallel-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2308.15136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15136"}},"official":{"repos":["rapidsai/raft"],"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":["listed","official"]}}},{"url":"/paper/codekgc-code-language-model-for-generative","slug":"codekgc-code-language-model-for-generative","title":"CodeKGC: Code Language Model for Generative Knowledge Graph Construction","date":"2023-04-18","arxiv_id":"2304.09048","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/codekgc-code-language-model-for-generative#ran","syntology_url":"https://syntology.ai/paper/2304.09048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09048"}},"official":{"repos":["zjunlp/deepke"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-analyzing-the-role-of-image-for-visual","slug":"on-analyzing-the-role-of-image-for-visual","title":"On Analyzing the Role of Image for Visual-enhanced Relation Extraction","date":"2022-11-14","arxiv_id":"2211.07504","repositories_listed":2,"syntology":null},{"url":"/paper/hdgt-heterogeneous-driving-graph-transformer","slug":"hdgt-heterogeneous-driving-graph-transformer","title":"HDGT: Heterogeneous Driving Graph Transformer for Multi-Agent Trajectory Prediction via Scene Encoding","date":"2022-04-30","arxiv_id":"2205.09753","repositories_listed":2,"syntology":null},{"url":"/paper/beta-distribution-guided-aspect-aware-graph","slug":"beta-distribution-guided-aspect-aware-graph","title":"Beta Distribution Guided Aspect-aware Graph for Aspect Category Sentiment Analysis with Affective Knowledge","date":"2021-11-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/outlining-and-filling-hierarchical-query","slug":"outlining-and-filling-hierarchical-query","title":"Outlining and Filling: Hierarchical Query Graph Generation for Answering Complex Questions over Knowledge Graphs","date":"2021-11-01","arxiv_id":"2111.00732","repositories_listed":2,"syntology":null},{"url":"/paper/3d-transformer-molecular-representation-with","slug":"3d-transformer-molecular-representation-with","title":"Molformer: Motif-based Transformer on 3D Heterogeneous Molecular Graphs","date":"2021-10-04","arxiv_id":"2110.01191","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/3d-transformer-molecular-representation-with#ran","syntology_url":"https://syntology.ai/paper/2110.01191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.01191"}},"official":{"repos":["smiles724/3d-transformer","smiles724/molformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/abcd-a-graph-framework-to-convert-complex","slug":"abcd-a-graph-framework-to-convert-complex","title":"ABCD: A Graph Framework to Convert Complex Sentences to a Covering Set of Simple Sentences","date":"2021-06-22","arxiv_id":"2106.12027","repositories_listed":2,"syntology":null},{"url":"/paper/robust-point-cloud-registration-framework","slug":"robust-point-cloud-registration-framework","title":"Robust Point Cloud Registration Framework Based on Deep Graph Matching","date":"2021-03-07","arxiv_id":"2103.04256","repositories_listed":2,"syntology":{"n":38,"n_ran":26,"n_constructed":6,"n_ran_checked":20,"n_instrument":6,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":38,"phrase":"26 ran (of which 6 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 6 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/robust-point-cloud-registration-framework#ran","syntology_url":"https://syntology.ai/paper/2103.04256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.04256"}},"official":{"repos":["fukexue/RGM"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":8,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/large-scale-product-graph-construction-for","slug":"large-scale-product-graph-construction-for","title":"Large Scale Product Graph Construction for Recommendation in E-commerce","date":"2020-10-12","arxiv_id":"2010.05525","repositories_listed":2,"syntology":null},{"url":"/paper/deep-relational-reasoning-graph-network-for","slug":"deep-relational-reasoning-graph-network-for","title":"Deep Relational Reasoning Graph Network for Arbitrary Shape Text Detection","date":"2020-03-17","arxiv_id":"2003.07493","repositories_listed":2,"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/deep-relational-reasoning-graph-network-for#ran","syntology_url":"https://syntology.ai/paper/2003.07493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07493"}},"official":{"repos":["GXYM/DRRG"],"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/auto-encoding-twin-bottleneck-hashing","slug":"auto-encoding-twin-bottleneck-hashing","title":"Auto-Encoding Twin-Bottleneck Hashing","date":"2020-02-27","arxiv_id":"2002.11930","repositories_listed":2,"syntology":null},{"url":"/paper/skeleton-based-action-recognition-with-multi","slug":"skeleton-based-action-recognition-with-multi","title":"Skeleton-Based Action Recognition with Multi-Stream Adaptive Graph Convolutional Networks","date":"2019-12-15","arxiv_id":"1912.06971","repositories_listed":2,"syntology":null},{"url":"/paper/icdm-2019-knowledge-graph-contest-team-uwa","slug":"icdm-2019-knowledge-graph-contest-team-uwa","title":"ICDM 2019 Knowledge Graph Contest: Team UWA","date":"2019-09-04","arxiv_id":"1909.01807","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-topological-data-analysis-and","slug":"scalable-topological-data-analysis-and","title":"Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications","date":"2019-07-19","arxiv_id":"1907.08325","repositories_listed":2,"syntology":null},{"url":"/paper/robust-graph-learning-from-noisy-data","slug":"robust-graph-learning-from-noisy-data","title":"Robust Graph Learning from Noisy Data","date":"2018-12-17","arxiv_id":"1812.06673","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-propagate-labels-transductive","slug":"learning-to-propagate-labels-transductive","title":"Learning to Propagate Labels: Transductive Propagation Network for Few-shot Learning","date":"2018-05-25","arxiv_id":"1805.10002","repositories_listed":2,"syntology":null},{"url":"/paper/xgraphrag-interactive-visual-analysis-for","slug":"xgraphrag-interactive-visual-analysis-for","title":"XGraphRAG: Interactive Visual Analysis for Graph-based Retrieval-Augmented Generation","date":"2025-06-10","arxiv_id":"2506.13782","repositories_listed":1,"syntology":null},{"url":"/paper/hiegnet-a-heterogenous-graph-neural-network","slug":"hiegnet-a-heterogenous-graph-neural-network","title":"HIEGNet: A Heterogenous Graph Neural Network Including the Immune Environment in Glomeruli Classification","date":"2025-06-03","arxiv_id":"2506.02542","repositories_listed":1,"syntology":null},{"url":"/paper/autoschemakg-autonomous-knowledge-graph","slug":"autoschemakg-autonomous-knowledge-graph","title":"AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora","date":"2025-05-29","arxiv_id":"2505.23628","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":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) · 0 unverified","sample_list":"/paper/autoschemakg-autonomous-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2505.23628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23628"}},"official":{"repos":["hkust-knowcomp/autoschemakg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/retrieval-augmented-generation-based-large-1","slug":"retrieval-augmented-generation-based-large-1","title":"Retrieval Augmented Generation based Large Language Models for Causality Mining","date":"2025-05-29","arxiv_id":"2505.23944","repositories_listed":1,"syntology":null},{"url":"/paper/ma-coir-leveraging-semantic-search-index-and","slug":"ma-coir-leveraging-semantic-search-index-and","title":"MA-COIR: Leveraging Semantic Search Index and Generative Models for Ontology-Driven Biomedical Concept Recognition","date":"2025-05-19","arxiv_id":"2505.12964","repositories_listed":1,"syntology":null},{"url":"/paper/elite-embedding-less-retrieval-with-iterative","slug":"elite-embedding-less-retrieval-with-iterative","title":"ELITE: Embedding-Less retrieval with Iterative Text Exploration","date":"2025-05-17","arxiv_id":"2505.11908","repositories_listed":1,"syntology":null},{"url":"/paper/do-rag-a-domain-specific-qa-framework-using","slug":"do-rag-a-domain-specific-qa-framework-using","title":"DO-RAG: A Domain-Specific QA Framework Using Knowledge Graph-Enhanced Retrieval-Augmented Generation","date":"2025-05-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/matching-distance-and-geometric-distribution","slug":"matching-distance-and-geometric-distribution","title":"Matching Distance and Geometric Distribution Aided Learning Multiview Point Cloud Registration","date":"2025-05-06","arxiv_id":"2505.03692","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-the-structural-bias-in-graph","slug":"mitigating-the-structural-bias-in-graph","title":"Mitigating the Structural Bias in Graph Adversarial Defenses","date":"2025-04-29","arxiv_id":"2504.20848","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-document-retrieval-with-g-retriever","slug":"efficient-document-retrieval-with-g-retriever","title":"Efficient Document Retrieval with G-Retriever","date":"2025-04-21","arxiv_id":"2504.14955","repositories_listed":1,"syntology":null},{"url":"/paper/rakg-document-level-retrieval-augmented","slug":"rakg-document-level-retrieval-augmented","title":"RAKG:Document-level Retrieval Augmented Knowledge Graph Construction","date":"2025-04-14","arxiv_id":"2504.09823","repositories_listed":1,"syntology":null},{"url":"/paper/building-machine-learning-limited-area-models","slug":"building-machine-learning-limited-area-models","title":"Building Machine Learning Limited Area Models: Kilometer-Scale Weather Forecasting in Realistic Settings","date":"2025-04-12","arxiv_id":"2504.09340","repositories_listed":1,"syntology":null},{"url":"/paper/self-prompting-analogical-reasoning-for-uav","slug":"self-prompting-analogical-reasoning-for-uav","title":"self-prompting analogical reasoning for uav object detection","date":"2025-04-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/type-information-assisted-self-supervised","slug":"type-information-assisted-self-supervised","title":"Type Information-Assisted Self-Supervised Knowledge Graph Denoising","date":"2025-03-13","arxiv_id":"2503.09916","repositories_listed":1,"syntology":null},{"url":"/paper/attackseqbench-benchmarking-large-language","slug":"attackseqbench-benchmarking-large-language","title":"AttackSeqBench: Benchmarking Large Language Models' Understanding of Sequential Patterns in Cyber Attacks","date":"2025-03-05","arxiv_id":"2503.03170","repositories_listed":1,"syntology":null},{"url":"/paper/cagn-gat-fusion-a-hybrid-contrastive","slug":"cagn-gat-fusion-a-hybrid-contrastive","title":"CAGN-GAT Fusion: A Hybrid Contrastive Attentive Graph Neural Network for Network Intrusion Detection","date":"2025-03-02","arxiv_id":"2503.00961","repositories_listed":1,"syntology":null},{"url":"/paper/agentic-deep-graph-reasoning-yields-self","slug":"agentic-deep-graph-reasoning-yields-self","title":"Agentic Deep Graph Reasoning Yields Self-Organizing Knowledge Networks","date":"2025-02-18","arxiv_id":"2502.13025","repositories_listed":1,"syntology":null},{"url":"/paper/the-role-of-graph-based-mil-and","slug":"the-role-of-graph-based-mil-and","title":"The Role of Graph-based MIL and Interventional Training in the Generalization of WSI Classifiers","date":"2025-01-31","arxiv_id":"2501.19048","repositories_listed":1,"syntology":null},{"url":"/paper/ufgraphfr-an-attempt-at-a-federated","slug":"ufgraphfr-an-attempt-at-a-federated","title":"UFGraphFR: An attempt at a federated recommendation system based on user text characteristics","date":"2025-01-14","arxiv_id":"2501.08044","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-superpixel-segmentation-via","slug":"hierarchical-superpixel-segmentation-via","title":"Hierarchical Superpixel Segmentation via Structural Information Theory","date":"2025-01-13","arxiv_id":"2501.07069","repositories_listed":1,"syntology":null},{"url":"/paper/improving-skeleton-based-action-recognition","slug":"improving-skeleton-based-action-recognition","title":"Improving Skeleton-based Action Recognition with Interactive Object Information","date":"2025-01-09","arxiv_id":"2501.05066","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-feature-fusion-combining-global-graph","slug":"dynamic-feature-fusion-combining-global-graph","title":"Dynamic Feature Fusion: Combining Global Graph Structures and Local Semantics for Blockchain Fraud Detection","date":"2025-01-03","arxiv_id":"2501.02032","repositories_listed":1,"syntology":null},{"url":"/paper/phgc-procedural-heterogeneous-graph","slug":"phgc-procedural-heterogeneous-graph","title":"PHGC: Procedural Heterogeneous Graph Completion for Natural Language Task Verification in Egocentric Videos","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sepsiscalc-integrating-clinical-calculators","slug":"sepsiscalc-integrating-clinical-calculators","title":"SepsisCalc: Integrating Clinical Calculators into Early Sepsis Prediction via Dynamic Temporal Graph Construction","date":"2024-12-31","arxiv_id":"2501.00190","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sepsiscalc-integrating-clinical-calculators#ran","syntology_url":"https://syntology.ai/paper/2501.00190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.00190"}},"official":{"repos":["yinchangchang/sepsiscalc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-automatic-graph-construction-framework","slug":"an-automatic-graph-construction-framework","title":"An Automatic Graph Construction Framework based on Large Language Models for Recommendation","date":"2024-12-24","arxiv_id":"2412.18241","repositories_listed":1,"syntology":null},{"url":"/paper/gims-image-matching-system-based-on-adaptive","slug":"gims-image-matching-system-based-on-adaptive","title":"GIMS: Image Matching System Based on Adaptive Graph Construction and Graph Neural Network","date":"2024-12-24","arxiv_id":"2412.18221","repositories_listed":1,"syntology":null},{"url":"/paper/anchor-learning-with-potential-cluster","slug":"anchor-learning-with-potential-cluster","title":"Anchor Learning with Potential Cluster Constraints for Multi-view Clustering","date":"2024-12-21","arxiv_id":"2412.16519","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-editing-with-dynamic-knowledge","slug":"knowledge-editing-with-dynamic-knowledge","title":"Knowledge Editing with Dynamic Knowledge Graphs for Multi-Hop Question Answering","date":"2024-12-18","arxiv_id":"2412.13782","repositories_listed":1,"syntology":null},{"url":"/paper/socialed-a-python-library-for-social-event","slug":"socialed-a-python-library-for-social-event","title":"SocialED: A Python Library for Social Event Detection","date":"2024-12-18","arxiv_id":"2412.13472","repositories_listed":1,"syntology":null},{"url":"/paper/mast3r-slam-real-time-dense-slam-with-3d","slug":"mast3r-slam-real-time-dense-slam-with-3d","title":"MASt3R-SLAM: Real-Time Dense SLAM with 3D Reconstruction Priors","date":"2024-12-16","arxiv_id":"2412.12392","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mast3r-slam-real-time-dense-slam-with-3d#ran","syntology_url":"https://syntology.ai/paper/2412.12392","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12392"}},"official":null}},{"url":"/paper/repository-level-graph-representation","slug":"repository-level-graph-representation","title":"Repository-Level Graph Representation Learning for Enhanced Security Patch Detection","date":"2024-12-11","arxiv_id":"2412.08068","repositories_listed":1,"syntology":null},{"url":"/paper/merge-multi-faceted-hierarchical-graph-based","slug":"merge-multi-faceted-hierarchical-graph-based","title":"MERGE: Multi-faceted Hierarchical Graph-based GNN for Gene Expression Prediction from Whole Slide Histopathology Images","date":"2024-12-03","arxiv_id":"2412.02601","repositories_listed":1,"syntology":null},{"url":"/paper/can-llms-be-good-graph-judger-for-knowledge","slug":"can-llms-be-good-graph-judger-for-knowledge","title":"Can LLMs be Good Graph Judge for Knowledge Graph Construction?","date":"2024-11-26","arxiv_id":"2411.17388","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-llms-be-good-graph-judger-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2411.17388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17388"}},"official":{"repos":["hhy-huang/graphjudge"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/forpkg-1-0-a-framework-for-constructing","slug":"forpkg-1-0-a-framework-for-constructing","title":"ForPKG: A Framework for Constructing Forestry Policy Knowledge Graph and Application Analysis","date":"2024-11-17","arxiv_id":"2411.11090","repositories_listed":1,"syntology":null},{"url":"/paper/no-reference-point-cloud-quality-assessment-2","slug":"no-reference-point-cloud-quality-assessment-2","title":"No-Reference Point Cloud Quality Assessment via Graph Convolutional Network","date":"2024-11-12","arxiv_id":"2411.07728","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-spatio-temporal-gcnns-for","slug":"explainable-spatio-temporal-gcnns-for","title":"Explainable Spatio-Temporal GCNNs for Irregular Multivariate Time Series: Architecture and Application to ICU Patient Data","date":"2024-11-01","arxiv_id":"2411.01070","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-on-discriminative","slug":"graph-neural-networks-on-discriminative","title":"Graph Neural Networks on Discriminative Graphs of Words","date":"2024-10-27","arxiv_id":"2410.20469","repositories_listed":1,"syntology":null},{"url":"/paper/sentiment-driven-community-detection-in-a","slug":"sentiment-driven-community-detection-in-a","title":"Sentiment-Driven Community Detection in a Network of Perfume Preferences","date":"2024-10-24","arxiv_id":"2410.19177","repositories_listed":1,"syntology":null},{"url":"/paper/graphusion-a-rag-framework-for-knowledge","slug":"graphusion-a-rag-framework-for-knowledge","title":"Graphusion: A RAG Framework for Knowledge Graph Construction with a Global Perspective","date":"2024-10-23","arxiv_id":"2410.17600","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphusion-a-rag-framework-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2410.17600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17600"}},"official":{"repos":["irenezihuili/graphusion"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-on-graph-neural-networks-for-1","slug":"a-survey-on-graph-neural-networks-for-1","title":"A Survey on Graph Neural Networks for Remaining Useful Life Prediction: Methodologies, Evaluation and Future Trends","date":"2024-09-29","arxiv_id":"2409.19629","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-scientific-cross-document","slug":"inferring-scientific-cross-document","title":"Inferring Scientific Cross-Document Coreference and Hierarchy with Definition-Augmented Relational Reasoning","date":"2024-09-23","arxiv_id":"2409.15113","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-perspective-on-adhd-research-knowledge","slug":"a-new-perspective-on-adhd-research-knowledge","title":"A New Perspective on ADHD Research: Knowledge Graph Construction with LLMs and Network Based Insights","date":"2024-09-19","arxiv_id":"2409.12853","repositories_listed":1,"syntology":null},{"url":"/paper/mooss-mask-enhanced-temporal-contrastive","slug":"mooss-mask-enhanced-temporal-contrastive","title":"MOOSS: Mask-Enhanced Temporal Contrastive Learning for Smooth State Evolution in Visual Reinforcement Learning","date":"2024-09-02","arxiv_id":"2409.02714","repositories_listed":1,"syntology":null},{"url":"/paper/wikicausal-corpus-and-evaluation-framework","slug":"wikicausal-corpus-and-evaluation-framework","title":"WikiCausal: Corpus and Evaluation Framework for Causal Knowledge Graph Construction","date":"2024-08-31","arxiv_id":"2409.00331","repositories_listed":1,"syntology":null},{"url":"/paper/st-usleepnet-a-spatial-temporal-coupling","slug":"st-usleepnet-a-spatial-temporal-coupling","title":"ST-USleepNet: A Spatial-Temporal Coupling Prominence Network for Multi-Channel Sleep Staging","date":"2024-08-21","arxiv_id":"2408.11884","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/st-usleepnet-a-spatial-temporal-coupling#ran","syntology_url":"https://syntology.ai/paper/2408.11884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11884"}},"official":{"repos":["majy-yuji/st-usleepnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gem-context-aware-gaze-estimation-with-visual","slug":"gem-context-aware-gaze-estimation-with-visual","title":"GEM: Context-Aware Gaze EstiMation with Visual Search Behavior Matching for Chest Radiograph","date":"2024-08-10","arxiv_id":"2408.05502","repositories_listed":1,"syntology":null},{"url":"/paper/medical-graph-rag-towards-safe-medical-large","slug":"medical-graph-rag-towards-safe-medical-large","title":"Medical Graph RAG: Towards Safe Medical Large Language Model via Graph Retrieval-Augmented Generation","date":"2024-08-08","arxiv_id":"2408.04187","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/medical-graph-rag-towards-safe-medical-large#ran","syntology_url":"https://syntology.ai/paper/2408.04187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.04187"}},"official":{"repos":["medicinetoken/medical-graph-rag"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/2407-21452","slug":"2407-21452","title":"Navigating Beyond Instructions: Vision-and-Language Navigation in Obstructed Environments","date":"2024-07-31","arxiv_id":"2407.21452","repositories_listed":1,"syntology":null},{"url":"/paper/mindsearch-mimicking-human-minds-elicits-deep","slug":"mindsearch-mimicking-human-minds-elicits-deep","title":"MindSearch: Mimicking Human Minds Elicits Deep AI Searcher","date":"2024-07-29","arxiv_id":"2407.20183","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":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) · 0 unverified","sample_list":"/paper/mindsearch-mimicking-human-minds-elicits-deep#ran","syntology_url":"https://syntology.ai/paper/2407.20183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20183"}},"official":{"repos":["internlm/mindsearch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-a-suitable-alternative","slug":"graph-neural-networks-a-suitable-alternative","title":"Graph Neural Networks: A suitable Alternative to MLPs in Latent 3D Medical Image Classification?","date":"2024-07-24","arxiv_id":"2407.17219","repositories_listed":1,"syntology":null},{"url":"/paper/graphusion-leveraging-large-language-models","slug":"graphusion-leveraging-large-language-models","title":"Graphusion: Leveraging Large Language Models for Scientific Knowledge Graph Fusion and Construction in NLP Education","date":"2024-07-15","arxiv_id":"2407.10794","repositories_listed":1,"syntology":null},{"url":"/paper/slidegcd-slide-based-graph-collaborative","slug":"slidegcd-slide-based-graph-collaborative","title":"SlideGCD: Slide-based Graph Collaborative Training with Knowledge Distillation for Whole Slide Image Classification","date":"2024-07-12","arxiv_id":"2407.08968","repositories_listed":1,"syntology":null},{"url":"/paper/ldgcn-an-edge-end-lightweight-dual-gcn-based","slug":"ldgcn-an-edge-end-lightweight-dual-gcn-based","title":"LDGCN: An Edge-End Lightweight Dual GCN Based on Single-Channel EEG for Driver Drowsiness Monitoring","date":"2024-07-08","arxiv_id":"2407.05749","repositories_listed":1,"syntology":null},{"url":"/paper/emt-a-novel-transformer-for-generalized-cross","slug":"emt-a-novel-transformer-for-generalized-cross","title":"EmT: A Novel Transformer for Generalized Cross-subject EEG Emotion Recognition","date":"2024-06-26","arxiv_id":"2406.18345","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/emt-a-novel-transformer-for-generalized-cross#ran","syntology_url":"https://syntology.ai/paper/2406.18345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18345"}},"official":{"repos":["yi-ding-cs/emt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graphstorm-all-in-one-graph-machine-learning","slug":"graphstorm-all-in-one-graph-machine-learning","title":"GraphStorm: all-in-one graph machine learning framework for industry applications","date":"2024-06-10","arxiv_id":"2406.06022","repositories_listed":1,"syntology":null},{"url":"/paper/docs2kg-unified-knowledge-graph-construction","slug":"docs2kg-unified-knowledge-graph-construction","title":"Docs2KG: Unified Knowledge Graph Construction from Heterogeneous Documents Assisted by Large Language Models","date":"2024-06-05","arxiv_id":"2406.02962","repositories_listed":1,"syntology":null},{"url":"/paper/using-gnn-property-predictors-as-molecule","slug":"using-gnn-property-predictors-as-molecule","title":"Using GNN property predictors as molecule generators","date":"2024-06-05","arxiv_id":"2406.03278","repositories_listed":1,"syntology":null},{"url":"/paper/greedyvig-dynamic-axial-graph-construction","slug":"greedyvig-dynamic-axial-graph-construction","title":"GreedyViG: Dynamic Axial Graph Construction for Efficient Vision GNNs","date":"2024-05-10","arxiv_id":"2405.06849","repositories_listed":1,"syntology":null},{"url":"/paper/extract-define-canonicalize-an-llm-based","slug":"extract-define-canonicalize-an-llm-based","title":"Extract, Define, Canonicalize: An LLM-based Framework for Knowledge Graph Construction","date":"2024-04-05","arxiv_id":"2404.03868","repositories_listed":1,"syntology":null},{"url":"/paper/banglaautokg-automatic-bangla-knowledge-graph","slug":"banglaautokg-automatic-bangla-knowledge-graph","title":"BanglaAutoKG: Automatic Bangla Knowledge Graph Construction with Semantic Neural Graph Filtering","date":"2024-04-04","arxiv_id":"2404.03528","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/banglaautokg-automatic-bangla-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2404.03528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03528"}},"official":{"repos":["azminewasi/banglaautokg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/from-human-experts-to-machines-an-llm","slug":"from-human-experts-to-machines-an-llm","title":"From human experts to machines: An LLM supported approach to ontology and knowledge graph construction","date":"2024-03-13","arxiv_id":"2403.08345","repositories_listed":1,"syntology":null},{"url":"/paper/urbankgent-a-unified-large-language-model","slug":"urbankgent-a-unified-large-language-model","title":"UrbanKGent: A Unified Large Language Model Agent Framework for Urban Knowledge Graph Construction","date":"2024-02-10","arxiv_id":"2402.06861","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/urbankgent-a-unified-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.06861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06861"}},"official":{"repos":["usail-hkust/urbankgent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sgtr-end-to-end-scene-graph-generation-with-1","slug":"sgtr-end-to-end-scene-graph-generation-with-1","title":"SGTR+: End-to-end Scene Graph Generation with Transformer","date":"2024-01-23","arxiv_id":"2401.12835","repositories_listed":1,"syntology":null},{"url":"/paper/assisted-knowledge-graph-authoring-human","slug":"assisted-knowledge-graph-authoring-human","title":"Assisted Knowledge Graph Authoring: Human-Supervised Knowledge Graph Construction from Natural Language","date":"2024-01-15","arxiv_id":"2401.07683","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-for-contention","slug":"graph-representation-learning-for-contention","title":"Graph Representation Learning for Contention and Interference Management in Wireless Networks","date":"2024-01-15","arxiv_id":"2402.00879","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-source-to-post-route-qor","slug":"hierarchical-source-to-post-route-qor","title":"Hierarchical Source-to-Post-Route QoR Prediction in High-Level Synthesis with GNNs","date":"2024-01-14","arxiv_id":"2401.08696","repositories_listed":1,"syntology":null},{"url":"/paper/techgpt-2-0-a-large-language-model-project-to","slug":"techgpt-2-0-a-large-language-model-project-to","title":"TechGPT-2.0: A large language model project to solve the task of knowledge graph construction","date":"2024-01-09","arxiv_id":"2401.04507","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-sub-graph-distillation-for-robust","slug":"dynamic-sub-graph-distillation-for-robust","title":"Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning","date":"2023-12-27","arxiv_id":"2312.16409","repositories_listed":1,"syntology":null},{"url":"/paper/superpixel-based-and-spatially-regularized","slug":"superpixel-based-and-spatially-regularized","title":"Superpixel-based and Spatially-regularized Diffusion Learning for Unsupervised Hyperspectral Image Clustering","date":"2023-12-24","arxiv_id":"2312.15447","repositories_listed":1,"syntology":null},{"url":"/paper/hyperpie-hyperparameter-information","slug":"hyperpie-hyperparameter-information","title":"HyperPIE: Hyperparameter Information Extraction from Scientific Publications","date":"2023-12-17","arxiv_id":"2312.10638","repositories_listed":1,"syntology":null},{"url":"/paper/online-semi-supervised-learning-of-composite","slug":"online-semi-supervised-learning-of-composite","title":"Online Semi-Supervised Learning of Composite Event Rules by Combining Structure and Mass-Based Predicate Similarity","date":"2023-12-15","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":20,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":38,"papers_where_code_ran_first_page":"/task/graph-construction/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":6,"url":"/task/graph-construction/papers/2","json":"/task/graph-construction/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/task/graph-construction/papers/3","json":"/task/graph-construction/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/task/graph-construction/papers/4","json":"/task/graph-construction/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/task/graph-construction/papers/5","json":"/task/graph-construction/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/task/graph-construction/papers/6","json":"/task/graph-construction/papers/6.json","rows":61},{"order":"ran","page":1,"of":1,"url":"/task/graph-construction/papers/ran/1","json":"/task/graph-construction/papers/ran/1.json","rows":38}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"ed778e7e25cf5de0e7f63284aac4ab9ca807f44ce2e245edb9ad4d5ac26e62ee","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}