{"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-generation/papers/4","list_of":"/task/graph-generation","task":"Graph Generation","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":4,"pages_in_order":8,"rows_per_page":100,"rows":[301,400],"of":712,"counts":{"archive_papers_tagged":712,"with_a_code_link":326,"where_syntology_ran_a_sample":111,"not_listed_spam_title":0,"listed":712,"listed_where_code_ran":111,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":98,"every_run_a_failure_of_syntologys_instrument":13,"listed_with_a_run_with_no_instrument_failure":98,"listed_every_run_a_failure_of_syntologys_instrument":13,"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-generation","prev":"/task/graph-generation/papers/3","next":"/task/graph-generation/papers/5","papers":[{"url":"/paper/graph-density-aware-losses-for-novel","slug":"graph-density-aware-losses-for-novel","title":"Graph Density-Aware Losses for Novel Compositions in Scene Graph Generation","date":"2020-05-17","arxiv_id":"2005.08230","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-density-aware-losses-for-novel#ran","syntology_url":"https://syntology.ai/paper/2005.08230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08230"}},"official":{"repos":["bknyaz/sgg"],"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/tg-gan-deep-generative-models-for","slug":"tg-gan-deep-generative-models-for","title":"TG-GAN: Continuous-time Temporal Graph Generation with Deep Generative Models","date":"2020-05-17","arxiv_id":"2005.08323","repositories_listed":1,"syntology":null},{"url":"/paper/graphs-over-time-densification-laws-shrinking","slug":"graphs-over-time-densification-laws-shrinking","title":"Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/secure-network-release-with-link-privacy","slug":"secure-network-release-with-link-privacy","title":"Secure Deep Graph Generation with Link Differential Privacy","date":"2020-05-01","arxiv_id":"2005.00455","repositories_listed":1,"syntology":null},{"url":"/paper/relation-transformer-network","slug":"relation-transformer-network","title":"Relation Transformer Network","date":"2020-04-13","arxiv_id":"2004.06193","repositories_listed":1,"syntology":null},{"url":"/paper/the-general-theory-of-permutation-equivarant","slug":"the-general-theory-of-permutation-equivarant","title":"The general theory of permutation equivarant neural networks and higher order graph variational encoders","date":"2020-04-08","arxiv_id":"2004.03990","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"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) · 9 unverified","sample_list":"/paper/the-general-theory-of-permutation-equivarant#ran","syntology_url":"https://syntology.ai/paper/2004.03990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03990"}},"official":null}},{"url":"/paper/gps-net-graph-property-sensing-network-for","slug":"gps-net-graph-property-sensing-network-for","title":"GPS-Net: Graph Property Sensing Network for Scene Graph Generation","date":"2020-03-29","arxiv_id":"2003.12962","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gps-net-graph-property-sensing-network-for#ran","syntology_url":"https://syntology.ai/paper/2003.12962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12962"}},"official":{"repos":["taksau/GPS-Net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/permutation-invariant-graph-generation-via","slug":"permutation-invariant-graph-generation-via","title":"Permutation Invariant Graph Generation via Score-Based Generative Modeling","date":"2020-03-02","arxiv_id":"2003.00638","repositories_listed":1,"syntology":null},{"url":"/paper/edge-based-sequential-graph-generation-with","slug":"edge-based-sequential-graph-generation-with","title":"Edge-based sequential graph generation with recurrent neural networks","date":"2020-01-31","arxiv_id":"2002.00102","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/edge-based-sequential-graph-generation-with#ran","syntology_url":"https://syntology.ai/paper/2002.00102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00102"}},"official":{"repos":["marcopodda/grapher"],"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/graphaf-a-flow-based-autoregressive-model-for-1","slug":"graphaf-a-flow-based-autoregressive-model-for-1","title":"GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation","date":"2020-01-26","arxiv_id":"2001.09382","repositories_listed":1,"syntology":null},{"url":"/paper/graphgen-a-scalable-approach-to-domain","slug":"graphgen-a-scalable-approach-to-domain","title":"GraphGen: A Scalable Approach to Domain-agnostic Labeled Graph Generation","date":"2020-01-22","arxiv_id":"2001.08184","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/graphgen-a-scalable-approach-to-domain#ran","syntology_url":"https://syntology.ai/paper/2001.08184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08184"}},"official":{"repos":["idea-iitd/graphgen"],"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/nodis-neural-ordinary-differential-scene","slug":"nodis-neural-ordinary-differential-scene","title":"NODIS: Neural Ordinary Differential Scene Understanding","date":"2020-01-14","arxiv_id":"2001.04735","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-visual-semantic-parsing","slug":"weakly-supervised-visual-semantic-parsing","title":"Weakly Supervised Visual Semantic Parsing","date":"2020-01-08","arxiv_id":"2001.02359","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-knowledge-graphs-to-generate-scene","slug":"bridging-knowledge-graphs-to-generate-scene","title":"Bridging Knowledge Graphs to Generate Scene Graphs","date":"2020-01-07","arxiv_id":"2001.02314","repositories_listed":1,"syntology":null},{"url":"/paper/tgg-transferable-graph-generation-for-zero","slug":"tgg-transferable-graph-generation-for-zero","title":"TGG: Transferable Graph Generation for Zero-shot and Few-shot Learning","date":"2019-08-30","arxiv_id":"1908.11503","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-the-representation-power-of","slug":"understanding-the-representation-power-of","title":"Understanding the Representation Power of Graph Neural Networks in Learning Graph Topology","date":"2019-07-11","arxiv_id":"1907.05008","repositories_listed":1,"syntology":null},{"url":"/paper/the-limited-multi-label-projection-layer","slug":"the-limited-multi-label-projection-layer","title":"The Limited Multi-Label Projection Layer","date":"2019-06-20","arxiv_id":"1906.08707","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/the-limited-multi-label-projection-layer#ran","syntology_url":"https://syntology.ai/paper/1906.08707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08707"}},"official":{"repos":["locuslab/lml"],"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/encoding-robust-representation-for-graph","slug":"encoding-robust-representation-for-graph","title":"Encoding Robust Representation for Graph Generation","date":"2018-09-28","arxiv_id":"1809.10851","repositories_listed":1,"syntology":null},{"url":"/paper/aesthetic-discrimination-of-graph-layouts","slug":"aesthetic-discrimination-of-graph-layouts","title":"Aesthetic Discrimination of Graph Layouts","date":"2018-09-04","arxiv_id":"1809.01017","repositories_listed":1,"syntology":null},{"url":"/paper/sequence-to-action-end-to-end-semantic-graph","slug":"sequence-to-action-end-to-end-semantic-graph","title":"Sequence-to-Action: End-to-End Semantic Graph Generation for Semantic Parsing","date":"2018-09-04","arxiv_id":"1809.00773","repositories_listed":1,"syntology":null},{"url":"/paper/natural-language-processing-for-music","slug":"natural-language-processing-for-music","title":"Natural Language Processing for Music Knowledge Discovery","date":"2018-07-06","arxiv_id":"1807.02200","repositories_listed":1,"syntology":null},{"url":"/paper/factorizable-net-an-efficient-subgraph-based","slug":"factorizable-net-an-efficient-subgraph-based","title":"Factorizable Net: An Efficient Subgraph-based Framework for Scene Graph Generation","date":"2018-06-29","arxiv_id":"1806.11538","repositories_listed":1,"syntology":null},{"url":"/paper/growing-story-forest-online-from-massive","slug":"growing-story-forest-online-from-massive","title":"Growing Story Forest Online from Massive Breaking News","date":"2018-03-01","arxiv_id":"1803.00189","repositories_listed":1,"syntology":null},{"url":"/paper/scene-graph-generation-from-objects-phrases","slug":"scene-graph-generation-from-objects-phrases","title":"Scene Graph Generation from Objects, Phrases and Region Captions","date":"2017-07-31","arxiv_id":"1707.09700","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-via-word-embedding-for-network","slug":"node-embedding-via-word-embedding-for-network","title":"Node Embedding via Word Embedding for Network Community Discovery","date":"2016-11-09","arxiv_id":"1611.03028","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-parsing-via-staged-query-graph","slug":"semantic-parsing-via-staged-query-graph","title":"Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"ngtm-substructure-based-neural-graph-topic","title":"NGTM: Substructure-based Neural Graph Topic Model for Interpretable Graph Generation","date":"2025-07-17","arxiv_id":"2507.13133","repositories_listed":0,"syntology":null},{"url":null,"slug":"spade-spatial-aware-denoising-network-for","title":"SPADE: Spatial-Aware Denoising Network for Open-vocabulary Panoptic Scene Graph Generation with Long- and Local-range Context Reasoning","date":"2025-07-08","arxiv_id":"2507.05798","repositories_listed":0,"syntology":null},{"url":null,"slug":"cat-sg-a-large-dynamic-scene-graph-dataset","title":"CAT-SG: A Large Dynamic Scene Graph Dataset for Fine-Grained Understanding of Cataract Surgery","date":"2025-06-26","arxiv_id":"2506.21813","repositories_listed":0,"syntology":null},{"url":null,"slug":"copa-sg-dense-scene-graphs-with-parametric","title":"CoPa-SG: Dense Scene Graphs with Parametric and Proto-Relations","date":"2025-06-26","arxiv_id":"2506.21357","repositories_listed":0,"syntology":null},{"url":null,"slug":"hoiverse-a-synthetic-scene-graph-dataset-with","title":"HOIverse: A Synthetic Scene Graph Dataset With Human Object Interactions","date":"2025-06-24","arxiv_id":"2506.19639","repositories_listed":0,"syntology":null},{"url":null,"slug":"bures-wasserstein-flow-matching-for-graph","title":"Bures-Wasserstein Flow Matching for Graph Generation","date":"2025-06-16","arxiv_id":"2506.14020","repositories_listed":0,"syntology":null},{"url":null,"slug":"freeq-graph-free-form-querying-with-semantic","title":"FreeQ-Graph: Free-form Querying with Semantic Consistent Scene Graph for 3D Scene Understanding","date":"2025-06-16","arxiv_id":"2506.13629","repositories_listed":0,"syntology":null},{"url":null,"slug":"representing-time-continuous-behavior-of","title":"Representing Time-Continuous Behavior of Cyber-Physical Systems in Knowledge Graphs","date":"2025-06-08","arxiv_id":"2506.13773","repositories_listed":0,"syntology":null},{"url":null,"slug":"out-of-distribution-graph-models-merging","title":"Out-of-Distribution Graph Models Merging","date":"2025-06-04","arxiv_id":"2506.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"hi-dyna-graph-hierarchical-dynamic-scene","title":"Hi-Dyna Graph: Hierarchical Dynamic Scene Graph for Robotic Autonomy in Human-Centric Environments","date":"2025-05-30","arxiv_id":"2506.00083","repositories_listed":0,"syntology":null},{"url":null,"slug":"studying-and-improving-graph-neural-network","title":"Studying and Improving Graph Neural Network-based Motif Estimation","date":"2025-05-30","arxiv_id":"2506.15709","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-reverse-causal-framework-to-mitigate","title":"A Reverse Causal Framework to Mitigate Spurious Correlations for Debiasing Scene Graph Generation","date":"2025-05-29","arxiv_id":"2505.23451","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-data-to-modeling-fully-open-vocabulary","title":"From Data to Modeling: Fully Open-vocabulary Scene Graph Generation","date":"2025-05-26","arxiv_id":"2505.20106","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-guided-diffusion-unified-guidance-for","title":"Graph Guided Diffusion: Unified Guidance for Conditional Graph Generation","date":"2025-05-26","arxiv_id":"2505.19685","repositories_listed":0,"syntology":null},{"url":null,"slug":"orqa-a-benchmark-and-foundation-model-for","title":"ORQA: A Benchmark and Foundation Model for Holistic Operating Room Modeling","date":"2025-05-19","arxiv_id":"2505.12890","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesizing-diverse-network-flow-datasets","title":"Synthesizing Diverse Network Flow Datasets with Scalable Dynamic Multigraph Generation","date":"2025-05-12","arxiv_id":"2505.07777","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-generation-of-precedence-graphs-in","title":"Automated Generation of Precedence Graphs in Digital Value Chains for Automotive Production","date":"2025-04-28","arxiv_id":"2504.19835","repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-r1-cognitive-chain-of-thought-guided","title":"Relation-R1: Cognitive Chain-of-Thought Guided Reinforcement Learning for Unified Relational Comprehension","date":"2025-04-20","arxiv_id":"2504.14642","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-modal-knowledge-graph-generation-with","title":"Multi-modal Knowledge Graph Generation with Semantics-enriched Prompts","date":"2025-04-18","arxiv_id":"2504.13631","repositories_listed":0,"syntology":null},{"url":null,"slug":"robo-sgg-exploiting-layout-oriented","title":"Robo-SGG: Exploiting Layout-Oriented Normalization and Restitution for Robust Scene Graph Generation","date":"2025-04-17","arxiv_id":"2504.12606","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-visual-relation-detection-with","title":"Generalized Visual Relation Detection with Diffusion Models","date":"2025-04-16","arxiv_id":"2504.12100","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthetic-data-for-blood-vessel-network","title":"Synthetic Data for Blood Vessel Network Extraction","date":"2025-04-16","arxiv_id":"2504.11858","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-llms-a-linguistic-approach-to-causal","title":"Beyond LLMs: A Linguistic Approach to Causal Graph Generation from Narrative Texts","date":"2025-04-10","arxiv_id":"2504.07459","repositories_listed":0,"syntology":null},{"url":null,"slug":"samjam-zero-shot-video-scene-graph-generation","title":"SAMJAM: Zero-Shot Video Scene Graph Generation for Egocentric Kitchen Videos","date":"2025-04-10","arxiv_id":"2504.07867","repositories_listed":0,"syntology":null},{"url":null,"slug":"nuscenes-spatialqa-a-spatial-understanding","title":"NuScenes-SpatialQA: A Spatial Understanding and Reasoning Benchmark for Vision-Language Models in Autonomous Driving","date":"2025-04-04","arxiv_id":"2504.03164","repositories_listed":0,"syntology":null},{"url":null,"slug":"make-autoregressive-great-again-diffusion","title":"Make Autoregressive Great Again: Diffusion-Free Graph Generation with Next-Scale Prediction","date":"2025-03-30","arxiv_id":"2503.23612","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantic-enhanced-heterogeneous-graph","title":"A Semantic-Enhanced Heterogeneous Graph Learning Method for Flexible Objects Recognition","date":"2025-03-28","arxiv_id":"2503.22079","repositories_listed":0,"syntology":null},{"url":"/paper/critical-iterative-denoising-a-discrete","slug":"critical-iterative-denoising-a-discrete","title":"Critical Iterative Denoising: A Discrete Generative Model Applied to Graphs","date":"2025-03-27","arxiv_id":"2503.21592","repositories_listed":0,"syntology":{"n":10,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":2,"n_pointer_only":10,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/critical-iterative-denoising-a-discrete#ran","syntology_url":"https://syntology.ai/paper/2503.21592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.21592"}},"official":null}},{"url":null,"slug":"a-causal-adjustment-module-for-debiasing","title":"A Causal Adjustment Module for Debiasing Scene Graph Generation","date":"2025-03-22","arxiv_id":"2503.17862","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-scene-graph-conditioning-for","title":"Neuro-Symbolic Scene Graph Conditioning for Synthetic Image Dataset Generation","date":"2025-03-21","arxiv_id":"2503.17224","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-can-off-the-shelves-large-multi-modal","title":"What can Off-the-Shelves Large Multi-Modal Models do for Dynamic Scene Graph Generation?","date":"2025-03-20","arxiv_id":"2503.15846","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-scene-graph-generation","title":"Universal Scene Graph Generation","date":"2025-03-19","arxiv_id":"2503.15005","repositories_listed":0,"syntology":null},{"url":null,"slug":"conformal-prediction-and-mllm-aided","title":"Conformal Prediction and MLLM aided Uncertainty Quantification in Scene Graph Generation","date":"2025-03-18","arxiv_id":"2503.13947","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-spatio-temporal-kriging-with","title":"Inductive Spatio-Temporal Kriging with Physics-Guided Increment Training Strategy for Air Quality Inference","date":"2025-03-12","arxiv_id":"2503.09646","repositories_listed":0,"syntology":null},{"url":null,"slug":"fungraph-functionality-aware-3d-scene-graphs","title":"FunGraph: Functionality Aware 3D Scene Graphs for Language-Prompted Scene Interaction","date":"2025-03-10","arxiv_id":"2503.07909","repositories_listed":0,"syntology":null},{"url":null,"slug":"backdoor-attacks-on-discrete-graph-diffusion","title":"Backdoor Attacks on Discrete Graph Diffusion Models","date":"2025-03-08","arxiv_id":"2503.06340","repositories_listed":0,"syntology":null},{"url":null,"slug":"pretraining-generative-flow-networks-with","title":"Pretraining Generative Flow Networks with Inexpensive Rewards for Molecular Graph Generation","date":"2025-03-08","arxiv_id":"2503.06337","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-order-autoregressive-models-with","title":"Learning-Order Autoregressive Models with Application to Molecular Graph Generation","date":"2025-03-07","arxiv_id":"2503.05979","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-video-scene-graph-generation-via","title":"Unbiased Video Scene Graph Generation via Visual and Semantic Dual Debiasing","date":"2025-03-01","arxiv_id":"2503.00548","repositories_listed":0,"syntology":null},{"url":"/paper/fragfm-efficient-fragment-based-molecular","slug":"fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","arxiv_id":"2502.15805","repositories_listed":0,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"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) · 6 unverified","sample_list":"/paper/fragfm-efficient-fragment-based-molecular#ran","syntology_url":"https://syntology.ai/paper/2502.15805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15805"}},"official":null}},{"url":null,"slug":"adaptive-knowledge-graphs-enhance-medical","title":"Agentic Medical Knowledge Graphs Enhance Medical Question Answering: Bridging the Gap Between LLMs and Evolving Medical Knowledge","date":"2025-02-18","arxiv_id":"2502.13010","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-synthetic-graph-generation-and-fused","title":"Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance","date":"2025-02-17","arxiv_id":"2502.11778","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-pairwise-global-zero-shot-temporal","title":"Beyond Pairwise: Global Zero-shot Temporal Graph Generation","date":"2025-02-16","arxiv_id":"2502.11114","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-v2x-for-collaborative-hd-maps","title":"Leveraging V2X for Collaborative HD Maps Construction Using Scene Graph Generation","date":"2025-02-14","arxiv_id":"2502.10127","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-graph-diffusion-models-accurately-capture","title":"Do Graph Diffusion Models Accurately Capture and Generate Substructure Distributions?","date":"2025-02-04","arxiv_id":"2502.02488","repositories_listed":0,"syntology":null},{"url":null,"slug":"flatten-graphs-as-sequences-transformers-are","title":"Flatten Graphs as Sequences: Transformers are Scalable Graph Generators","date":"2025-02-04","arxiv_id":"2502.02216","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-hard-maximum-cut-instances-for","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","date":"2025-01-30","arxiv_id":"2502.12012","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniq-unified-decoder-with-task-specific","title":"UniQ: Unified Decoder with Task-specific Queries for Efficient Scene Graph Generation","date":"2025-01-10","arxiv_id":"2501.05687","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-generative-pre-trained-transformer","title":"Graph Generative Pre-trained Transformer","date":"2025-01-02","arxiv_id":"2501.01073","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphmimic-graph-to-graphs-generative","title":"GraphMimic: Graph-to-Graphs Generative Modeling from Videos for Policy Learning","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-reciprocal-transformer-with-triplet","title":"Hybrid Reciprocal Transformer with Triplet Feature Alignment for Scene Graph Generation","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-4d-panoptic-scene-graph-generation","title":"Learning 4D Panoptic Scene Graph Generation from Rich 2D Visual Scene","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"navigating-the-unseen-zero-shot-scene-graph","title":"Navigating the Unseen: Zero-shot Scene Graph Generation via Capsule-Based Equivariant Features","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-aware-hierarchical-prompt-for-open","title":"Relation-aware Hierarchical Prompt for Open-vocabulary Scene Graph Generation","date":"2024-12-26","arxiv_id":"2412.19021","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg4diagnosis-a-hierarchical-multi-agent-llm","title":"KG4Diagnosis: A Hierarchical Multi-Agent LLM Framework with Knowledge Graph Enhancement for Medical Diagnosis","date":"2024-12-22","arxiv_id":"2412.16833","repositories_listed":0,"syntology":null},{"url":null,"slug":"analogxpert-automating-analog-topology","title":"AnalogXpert: Automating Analog Topology Synthesis by Incorporating Circuit Design Expertise into Large Language Models","date":"2024-12-17","arxiv_id":"2412.19824","repositories_listed":0,"syntology":null},{"url":null,"slug":"scenellm-implicit-language-reasoning-in-llm","title":"SceneLLM: Implicit Language Reasoning in LLM for Dynamic Scene Graph Generation","date":"2024-12-15","arxiv_id":"2412.11026","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-dynamic-attributed-graph-generation","title":"Efficient Dynamic Attributed Graph Generation","date":"2024-12-11","arxiv_id":"2412.08810","repositories_listed":0,"syntology":null},{"url":null,"slug":"motion-aware-contrastive-learning-for","title":"Motion-aware Contrastive Learning for Temporal Panoptic Scene Graph Generation","date":"2024-12-10","arxiv_id":"2412.07160","repositories_listed":0,"syntology":null},{"url":null,"slug":"hmgie-hierarchical-and-multi-grained","title":"HMGIE: Hierarchical and Multi-Grained Inconsistency Evaluation for Vision-Language Data Cleansing","date":"2024-12-07","arxiv_id":"2412.05685","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-community-augmentation-with-gmm-based","title":"Graph Community Augmentation with GMM-based Modeling in Latent Space","date":"2024-12-02","arxiv_id":"2412.01163","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-llm-for-automated-ontology","title":"Leveraging LLM for Automated Ontology Extraction and Knowledge Graph Generation","date":"2024-11-30","arxiv_id":"2412.00608","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperglm-hypergraph-for-video-scene-graph","title":"HyperGLM: HyperGraph for Video Scene Graph Generation and Anticipation","date":"2024-11-27","arxiv_id":"2411.18042","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-graph-condensation-advancing-data","title":"Contrastive Graph Condensation: Advancing Data Versatility through Self-Supervised Learning","date":"2024-11-26","arxiv_id":"2411.17063","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unbiased-and-robust-spatio-temporal","title":"Towards Unbiased and Robust Spatio-Temporal Scene Graph Generation and Anticipation","date":"2024-11-20","arxiv_id":"2411.13059","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-scene-graph-generation-by-type-aware","title":"Unbiased Scene Graph Generation by Type-Aware Message Passing on Heterogeneous and Dual Graphs","date":"2024-11-20","arxiv_id":"2411.13287","repositories_listed":0,"syntology":null},{"url":null,"slug":"instant-policy-in-context-imitation-learning","title":"Instant Policy: In-Context Imitation Learning via Graph Diffusion","date":"2024-11-19","arxiv_id":"2411.12633","repositories_listed":0,"syntology":null},{"url":null,"slug":"latency-optimization-in-leo-satellite","title":"Latency Optimization in LEO Satellite Communications with Hybrid Beam Pattern and Interference Control","date":"2024-11-14","arxiv_id":"2411.09600","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-molecular-graph-generation-with","title":"Improving Molecular Graph Generation with Flow Matching and Optimal Transport","date":"2024-11-08","arxiv_id":"2411.05676","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-graph-covariate-shift-via-score","title":"Mitigating Graph Covariate Shift via Score-based Out-of-distribution Augmentation","date":"2024-10-23","arxiv_id":"2410.17506","repositories_listed":0,"syntology":null},{"url":null,"slug":"seadag-semi-autoregressive-diffusion-for","title":"SeaDAG: Semi-autoregressive Diffusion for Conditional Directed Acyclic Graph Generation","date":"2024-10-21","arxiv_id":"2410.16119","repositories_listed":0,"syntology":null},{"url":"/paper/gesubnet-gene-interaction-inference-for","slug":"gesubnet-gene-interaction-inference-for","title":"GeSubNet: Gene Interaction Inference for Disease Subtype Network Generation","date":"2024-10-17","arxiv_id":"2410.13178","repositories_listed":0,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/gesubnet-gene-interaction-inference-for#ran","syntology_url":"https://syntology.ai/paper/2410.13178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13178"}},"official":null}},{"url":null,"slug":"parametric-graph-representations-in-the-era","title":"What Do LLMs Need to Understand Graphs: A Survey of Parametric Representation of Graphs","date":"2024-10-16","arxiv_id":"2410.12126","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-graph-generation-a-hierarchical","title":"Heterogeneous Graph Generation: A Hierarchical Approach using Node Feature Pooling","date":"2024-10-15","arxiv_id":"2410.11972","repositories_listed":0,"syntology":null}],"record_sha256":"4bfd3281b3d6f0be679c90f94aa0bb552aacf8b0da1f28b350fb34811d040fde","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}