{"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/3","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":3,"pages_in_order":8,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/graph-generation/papers/4","papers":[{"url":"/paper/rntrajrec-road-network-enhanced-trajectory","slug":"rntrajrec-road-network-enhanced-trajectory","title":"RNTrajRec: Road Network Enhanced Trajectory Recovery with Spatial-Temporal Transformer","date":"2022-11-23","arxiv_id":"2211.13234","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rntrajrec-road-network-enhanced-trajectory#ran","syntology_url":"https://syntology.ai/paper/2211.13234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13234"}},"official":{"repos":["chenyuqi990215/rntrajrec"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-generation-from-text","slug":"knowledge-graph-generation-from-text","title":"Knowledge Graph Generation From Text","date":"2022-11-18","arxiv_id":"2211.10511","repositories_listed":1,"syntology":null},{"url":"/paper/fast-graph-generative-model-via-spectral","slug":"fast-graph-generative-model-via-spectral","title":"Fast Graph Generation via Spectral Diffusion","date":"2022-11-16","arxiv_id":"2211.08892","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-graphon-neural-representation","slug":"implicit-graphon-neural-representation","title":"Implicit Graphon Neural Representation","date":"2022-11-07","arxiv_id":"2211.03329","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graphon-neural-representation#ran","syntology_url":"https://syntology.ai/paper/2211.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03329"}},"official":{"repos":["mishne-lab/ignr"],"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/care-causality-reasoning-for-empathetic","slug":"care-causality-reasoning-for-empathetic","title":"CARE: Causality Reasoning for Empathetic Responses by Conditional Graph Generation","date":"2022-11-01","arxiv_id":"2211.00255","repositories_listed":1,"syntology":null},{"url":"/paper/micro-and-macro-level-graph-modeling-for","slug":"micro-and-macro-level-graph-modeling-for","title":"Micro and Macro Level Graph Modeling for Graph Variational Auto-Encoders","date":"2022-10-30","arxiv_id":"2210.16844","repositories_listed":1,"syntology":null},{"url":"/paper/regularized-graph-structure-learning-with","slug":"regularized-graph-structure-learning-with","title":"Regularized Graph Structure Learning with Semantic Knowledge for Multi-variates Time-Series Forecasting","date":"2022-10-12","arxiv_id":"2210.06126","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regularized-graph-structure-learning-with#ran","syntology_url":"https://syntology.ai/paper/2210.06126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06126"}},"official":{"repos":["alipay/rgsl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-guided-importance-sampling-for-1","slug":"gradient-guided-importance-sampling-for-1","title":"Gradient-Guided Importance Sampling for Learning Binary Energy-Based Models","date":"2022-10-11","arxiv_id":"2210.05782","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"6 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gradient-guided-importance-sampling-for-1#ran","syntology_url":"https://syntology.ai/paper/2210.05782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.05782"}},"official":{"repos":["divelab/rmwggis"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-framework-for-large-scale-synthetic-graph","slug":"a-framework-for-large-scale-synthetic-graph","title":"A Framework for Large Scale Synthetic Graph Dataset Generation","date":"2022-10-04","arxiv_id":"2210.01944","repositories_listed":1,"syntology":null},{"url":"/paper/benchmark-for-research-theme-classification","slug":"benchmark-for-research-theme-classification","title":"Benchmark for Research Theme Classification of Scholarly Documents","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/face-super-resolution-using-stochastic","slug":"face-super-resolution-using-stochastic","title":"Face Super-Resolution Using Stochastic Differential Equations","date":"2022-09-24","arxiv_id":"2209.12064","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-object-aware-and-interaction","slug":"integrating-object-aware-and-interaction","title":"Integrating Object-aware and Interaction-aware Knowledge for Weakly Supervised Scene Graph Generation","date":"2022-08-03","arxiv_id":"2208.01834","repositories_listed":1,"syntology":null},{"url":"/paper/dual-branch-hybrid-learning-network-for","slug":"dual-branch-hybrid-learning-network-for","title":"Dual-branch Hybrid Learning Network for Unbiased Scene Graph Generation","date":"2022-07-16","arxiv_id":"2207.07913","repositories_listed":1,"syntology":null},{"url":"/paper/unified-2d-and-3d-pre-training-of-molecular","slug":"unified-2d-and-3d-pre-training-of-molecular","title":"Unified 2D and 3D Pre-Training of Molecular Representations","date":"2022-07-14","arxiv_id":"2207.08806","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-privacy-enhanced-benchmark-graph","slug":"scalable-privacy-enhanced-benchmark-graph","title":"Graph Generative Model for Benchmarking Graph Neural Networks","date":"2022-07-10","arxiv_id":"2207.04396","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-knowledge-graph-generation-using","slug":"unsupervised-knowledge-graph-generation-using","title":"Unsupervised Knowledge Graph Generation Using Semantic Similarity Matching","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-devil-is-in-the-labels-noisy-label-1","slug":"the-devil-is-in-the-labels-noisy-label-1","title":"The Devil is in the Labels: Noisy Label Correction for Robust Scene Graph Generation","date":"2022-06-07","arxiv_id":"2206.03014","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":2,"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/the-devil-is-in-the-labels-noisy-label-1#ran","syntology_url":"https://syntology.ai/paper/2206.03014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03014"}},"official":{"repos":["muktilin/nice"],"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/an-unpooling-layer-for-graph-generation","slug":"an-unpooling-layer-for-graph-generation","title":"An Unpooling Layer for Graph Generation","date":"2022-06-04","arxiv_id":"2206.01874","repositories_listed":1,"syntology":null},{"url":"/paper/expressive-scene-graph-generation-using","slug":"expressive-scene-graph-generation-using","title":"Expressive Scene Graph Generation Using Commonsense Knowledge Infusion for Visual Understanding and Reasoning","date":"2022-05-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/temporal-domain-generalization-with-drift","slug":"temporal-domain-generalization-with-drift","title":"Temporal Domain Generalization with Drift-Aware Dynamic Neural Networks","date":"2022-05-21","arxiv_id":"2205.10664","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/temporal-domain-generalization-with-drift#ran","syntology_url":"https://syntology.ai/paper/2205.10664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10664"}},"official":{"repos":["baithebest/drain"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hl-net-heterophily-learning-network-for-scene","slug":"hl-net-heterophily-learning-network-for-scene","title":"HL-Net: Heterophily Learning Network for Scene Graph Generation","date":"2022-05-03","arxiv_id":"2205.01316","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hl-net-heterophily-learning-network-for-scene#ran","syntology_url":"https://syntology.ai/paper/2205.01316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01316"}},"official":{"repos":["siml3/hl-net"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/ru-net-regularized-unrolling-network-for","slug":"ru-net-regularized-unrolling-network-for","title":"RU-Net: Regularized Unrolling Network for Scene Graph Generation","date":"2022-05-03","arxiv_id":"2205.01297","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ru-net-regularized-unrolling-network-for#ran","syntology_url":"https://syntology.ai/paper/2205.01297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01297"}},"official":{"repos":["siml3/ru-net"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/supplementing-missing-visions-via-dialog-for","slug":"supplementing-missing-visions-via-dialog-for","title":"Supplementing Missing Visions via Dialog for Scene Graph Generations","date":"2022-04-23","arxiv_id":"2204.11143","repositories_listed":1,"syntology":null},{"url":"/paper/graph-pooling-for-graph-neural-networks","slug":"graph-pooling-for-graph-neural-networks","title":"Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunities","date":"2022-04-15","arxiv_id":"2204.07321","repositories_listed":1,"syntology":null},{"url":"/paper/explanation-graph-generation-via-pre-trained","slug":"explanation-graph-generation-via-pre-trained","title":"Explanation Graph Generation via Pre-trained Language Models: An Empirical Study with Contrastive Learning","date":"2022-04-11","arxiv_id":"2204.04813","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-predicates-learning-for-scene","slug":"fine-grained-predicates-learning-for-scene","title":"Fine-Grained Predicates Learning for Scene Graph Generation","date":"2022-04-06","arxiv_id":"2204.02597","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":3,"n_ran_checked":5,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":10,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fine-grained-predicates-learning-for-scene#ran","syntology_url":"https://syntology.ai/paper/2204.02597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02597"}},"official":{"repos":["xinyulyu/fgpl"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/spectre-spectral-conditioning-helps-to","slug":"spectre-spectral-conditioning-helps-to","title":"SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators","date":"2022-04-04","arxiv_id":"2204.01613","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spectre-spectral-conditioning-helps-to#ran","syntology_url":"https://syntology.ai/paper/2204.01613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01613"}},"official":{"repos":["karolismart/spectre"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/synthetic-graph-generation-to-benchmark-graph","slug":"synthetic-graph-generation-to-benchmark-graph","title":"Synthetic Graph Generation to Benchmark Graph Learning","date":"2022-04-04","arxiv_id":"2204.01376","repositories_listed":1,"syntology":null},{"url":"/paper/relationformer-a-unified-framework-for-image","slug":"relationformer-a-unified-framework-for-image","title":"Relationformer: A Unified Framework for Image-to-Graph Generation","date":"2022-03-19","arxiv_id":"2203.10202","repositories_listed":1,"syntology":null},{"url":"/paper/stacked-hybrid-attention-and-group","slug":"stacked-hybrid-attention-and-group","title":"Stacked Hybrid-Attention and Group Collaborative Learning for Unbiased Scene Graph Generation","date":"2022-03-18","arxiv_id":"2203.09811","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":7,"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/stacked-hybrid-attention-and-group#ran","syntology_url":"https://syntology.ai/paper/2203.09811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09811"}},"official":{"repos":["dongxingning/sha-gcl-for-sgg"],"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/biasing-like-human-a-cognitive-bias-framework","slug":"biasing-like-human-a-cognitive-bias-framework","title":"Biasing Like Human: A Cognitive Bias Framework for Scene Graph Generation","date":"2022-03-17","arxiv_id":"2203.09160","repositories_listed":1,"syntology":null},{"url":"/paper/agrasst-approximate-graph-stein-statistics","slug":"agrasst-approximate-graph-stein-statistics","title":"AgraSSt: Approximate Graph Stein Statistics for Interpretable Assessment of Implicit Graph Generators","date":"2022-03-07","arxiv_id":"2203.03673","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-scene-graph-generation","slug":"one-shot-scene-graph-generation","title":"One-shot Scene Graph Generation","date":"2022-02-22","arxiv_id":"2202.10824","repositories_listed":1,"syntology":null},{"url":"/paper/og-sgg-ontology-guided-scene-graph-generation","slug":"og-sgg-ontology-guided-scene-graph-generation","title":"OG-SGG: Ontology-Guided Scene Graph Generation. A Case Study in Transfer Learning for Telepresence Robotics","date":"2022-02-21","arxiv_id":"2202.10201","repositories_listed":1,"syntology":null},{"url":"/paper/graphtune-a-learning-based-graph-generative","slug":"graphtune-a-learning-based-graph-generative","title":"GraphTune: A Learning-based Graph Generative Model with Tunable Structural Features","date":"2022-01-27","arxiv_id":"2201.11494","repositories_listed":1,"syntology":null},{"url":"/paper/reltr-relation-transformer-for-scene-graph","slug":"reltr-relation-transformer-for-scene-graph","title":"RelTR: Relation Transformer for Scene Graph Generation","date":"2022-01-27","arxiv_id":"2201.11460","repositories_listed":1,"syntology":null},{"url":"/paper/learning-sparse-and-continuous-graph","slug":"learning-sparse-and-continuous-graph","title":"Balanced Graph Structure Learning for Multivariate Time Series Forecasting","date":"2022-01-24","arxiv_id":"2201.09686","repositories_listed":1,"syntology":null},{"url":"/paper/resistance-training-using-prior-bias-toward","slug":"resistance-training-using-prior-bias-toward","title":"Resistance Training using Prior Bias: toward Unbiased Scene Graph Generation","date":"2022-01-18","arxiv_id":"2201.06794","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":3,"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/resistance-training-using-prior-bias-toward#ran","syntology_url":"https://syntology.ai/paper/2201.06794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06794"}},"official":{"repos":["chch1999/rtpb"],"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/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/exploiting-long-term-dependencies-for","slug":"exploiting-long-term-dependencies-for","title":"Exploiting Long-Term Dependencies for Generating Dynamic Scene Graphs","date":"2021-12-18","arxiv_id":"2112.09828","repositories_listed":1,"syntology":null},{"url":"/paper/graph-wise-common-latent-factor-extraction","slug":"graph-wise-common-latent-factor-extraction","title":"Graph-wise Common Latent Factor Extraction for Unsupervised Graph Representation Learning","date":"2021-12-16","arxiv_id":"2112.08830","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/a-scalable-automl-approach-based-on-graph","slug":"a-scalable-automl-approach-based-on-graph","title":"A Scalable AutoML Approach Based on Graph Neural Networks","date":"2021-10-29","arxiv_id":"2111.00083","repositories_listed":1,"syntology":null},{"url":"/paper/topic-scene-graph-generation-by-attention-1","slug":"topic-scene-graph-generation-by-attention-1","title":"Topic Scene Graph Generation by Attention Distillation from Caption","date":"2021-10-12","arxiv_id":"2110.05731","repositories_listed":1,"syntology":null},{"url":"/paper/top-n-equivariant-set-and-graph-generation","slug":"top-n-equivariant-set-and-graph-generation","title":"Top-N: Equivariant set and graph generation without exchangeability","date":"2021-10-05","arxiv_id":"2110.02096","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/top-n-equivariant-set-and-graph-generation#ran","syntology_url":"https://syntology.ai/paper/2110.02096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02096"}},"official":{"repos":["cvignac/top-n"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-guided-importance-sampling-for","slug":"gradient-guided-importance-sampling-for","title":"Gradient-Guided Importance Sampling for Learning Discrete Energy-Based Models","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graphgt-machine-learning-datasets-for-graph","slug":"graphgt-machine-learning-datasets-for-graph","title":"GraphGT: Machine Learning Datasets for Graph Generation and Transformation","date":"2021-09-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/formal-query-building-with-query-structure","slug":"formal-query-building-with-query-structure","title":"Formal Query Building with Query Structure Prediction for Complex Question Answering over Knowledge Base","date":"2021-09-08","arxiv_id":"2109.03614","repositories_listed":1,"syntology":null},{"url":"/paper/geneannotator-a-semi-automatic-annotation","slug":"geneannotator-a-semi-automatic-annotation","title":"GeneAnnotator: A Semi-automatic Annotation Tool for Visual Scene Graph","date":"2021-09-06","arxiv_id":"2109.02226","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generate-scene-graph-from-natural","slug":"learning-to-generate-scene-graph-from-natural","title":"Learning to Generate Scene Graph from Natural Language Supervision","date":"2021-09-06","arxiv_id":"2109.02227","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-generate-scene-graph-from-natural#ran","syntology_url":"https://syntology.ai/paper/2109.02227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.02227"}},"official":{"repos":["yiwuzhong/sgg_from_nls"],"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/roadscene2vec-a-tool-for-extracting-and","slug":"roadscene2vec-a-tool-for-extracting-and","title":"roadscene2vec: A Tool for Extracting and Embedding Road Scene-Graphs","date":"2021-09-02","arxiv_id":"2109.01183","repositories_listed":1,"syntology":null},{"url":"/paper/from-general-to-specific-informative-scene","slug":"from-general-to-specific-informative-scene","title":"From General to Specific: Informative Scene Graph Generation via Balance Adjustment","date":"2021-08-30","arxiv_id":"2108.13129","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":0,"n_no_contract":1,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/from-general-to-specific-informative-scene#ran","syntology_url":"https://syntology.ai/paper/2108.13129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13129"}},"official":{"repos":["zhugekongkong/sgg-g2s"],"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/regen-reinforcement-learning-for-text-and","slug":"regen-reinforcement-learning-for-text-and","title":"ReGen: Reinforcement Learning for Text and Knowledge Base Generation using Pretrained Language Models","date":"2021-08-27","arxiv_id":"2108.12472","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":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) · 0 unverified","sample_list":"/paper/regen-reinforcement-learning-for-text-and#ran","syntology_url":"https://syntology.ai/paper/2108.12472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12472"}},"official":{"repos":["IBM/regen"],"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/target-adaptive-context-aggregation-for-video","slug":"target-adaptive-context-aggregation-for-video","title":"Target Adaptive Context Aggregation for Video Scene Graph Generation","date":"2021-08-18","arxiv_id":"2108.08121","repositories_listed":1,"syntology":null},{"url":"/paper/reformer-the-relational-transformer-for-image","slug":"reformer-the-relational-transformer-for-image","title":"ReFormer: The Relational Transformer for Image Captioning","date":"2021-07-29","arxiv_id":"2107.14178","repositories_listed":1,"syntology":null},{"url":"/paper/image-scene-graph-generation-sgg-benchmark","slug":"image-scene-graph-generation-sgg-benchmark","title":"Image Scene Graph Generation (SGG) Benchmark","date":"2021-07-27","arxiv_id":"2107.12604","repositories_listed":1,"syntology":null},{"url":"/paper/wikigraphs-a-wikipedia-text-knowledge-graph","slug":"wikigraphs-a-wikipedia-text-knowledge-graph","title":"WikiGraphs: A Wikipedia Text - Knowledge Graph Paired Dataset","date":"2021-07-20","arxiv_id":"2107.09556","repositories_listed":1,"syntology":null},{"url":"/paper/graphgen-redux-a-fast-and-lightweight","slug":"graphgen-redux-a-fast-and-lightweight","title":"GraphGen-Redux: a Fast and Lightweight Recurrent Model for labeled Graph Generation","date":"2021-07-18","arxiv_id":"2107.08396","repositories_listed":1,"syntology":null},{"url":"/paper/scenes-and-surroundings-scene-graph","slug":"scenes-and-surroundings-scene-graph","title":"Scenes and Surroundings: Scene Graph Generation using Relation Transformer","date":"2021-07-12","arxiv_id":"2107.05448","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-scene-graph-relation-prediction","slug":"zero-shot-scene-graph-relation-prediction","title":"Zero-Shot Scene Graph Relation Prediction through Commonsense Knowledge Integration","date":"2021-07-11","arxiv_id":"2107.05080","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/zero-shot-scene-graph-relation-prediction#ran","syntology_url":"https://syntology.ai/paper/2107.05080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05080"}},"official":{"repos":["Wayfear/Coacher"],"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/on-demand-and-lightweight-knowledge-graph","slug":"on-demand-and-lightweight-knowledge-graph","title":"On-Demand and Lightweight Knowledge Graph Generation -- a Demonstration with DBpedia","date":"2021-07-02","arxiv_id":"2107.00873","repositories_listed":1,"syntology":null},{"url":"/paper/non-isomorphic-inter-modality-graph-alignment","slug":"non-isomorphic-inter-modality-graph-alignment","title":"Non-isomorphic Inter-modality Graph Alignment and Synthesis for Holistic Brain Mapping","date":"2021-06-30","arxiv_id":"2107.06281","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-the-challenges-in-scene-graph","slug":"tackling-the-challenges-in-scene-graph","title":"Tackling the Challenges in Scene Graph Generation with Local-to-Global Interactions","date":"2021-06-16","arxiv_id":"2106.08543","repositories_listed":1,"syntology":null},{"url":"/paper/order-matters-probabilistic-modeling-of-node","slug":"order-matters-probabilistic-modeling-of-node","title":"Order Matters: Probabilistic Modeling of Node Sequence for Graph Generation","date":"2021-06-11","arxiv_id":"2106.06189","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/order-matters-probabilistic-modeling-of-node#ran","syntology_url":"https://syntology.ai/paper/2106.06189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06189"}},"official":{"repos":["tufts-ml/graph-generation-vi"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/linguistic-structures-as-weak-supervision-for","slug":"linguistic-structures-as-weak-supervision-for","title":"Linguistic Structures as Weak Supervision for Visual Scene Graph Generation","date":"2021-05-28","arxiv_id":"2105.13994","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/linguistic-structures-as-weak-supervision-for#ran","syntology_url":"https://syntology.ai/paper/2105.13994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13994"}},"official":{"repos":["yekeren/WSSGG"],"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/brain-multigraph-prediction-using-topology","slug":"brain-multigraph-prediction-using-topology","title":"Brain Multigraph Prediction using Topology-Aware Adversarial Graph Neural Network","date":"2021-05-06","arxiv_id":"2105.02565","repositories_listed":1,"syntology":null},{"url":"/paper/recovering-barabsi-albert-parameters-of","slug":"recovering-barabsi-albert-parameters-of","title":"Recovering Barabási-Albert Parameters of Graphs through Disentanglement","date":"2021-05-03","arxiv_id":"2105.00997","repositories_listed":1,"syntology":null},{"url":"/paper/explagraphs-an-explanation-graph-generation","slug":"explagraphs-an-explanation-graph-generation","title":"ExplaGraphs: An Explanation Graph Generation Task for Structured Commonsense Reasoning","date":"2021-04-15","arxiv_id":"2104.07644","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/explagraphs-an-explanation-graph-generation#ran","syntology_url":"https://syntology.ai/paper/2104.07644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07644"}},"official":{"repos":["swarnaHub/ExplaGraphs"],"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":["official"]}}},{"url":"/paper/fully-convolutional-scene-graph-generation","slug":"fully-convolutional-scene-graph-generation","title":"Fully Convolutional Scene Graph Generation","date":"2021-03-30","arxiv_id":"2103.16083","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fully-convolutional-scene-graph-generation#ran","syntology_url":"https://syntology.ai/paper/2103.16083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16083"}},"official":{"repos":["liuhengyue/fcsgg"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-distant-supervision-for-scene-graph","slug":"visual-distant-supervision-for-scene-graph","title":"Visual Distant Supervision for Scene Graph Generation","date":"2021-03-29","arxiv_id":"2103.15365","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/visual-distant-supervision-for-scene-graph#ran","syntology_url":"https://syntology.ai/paper/2103.15365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15365"}},"official":{"repos":["thunlp/visualds"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dig-a-turnkey-library-for-diving-into-graph","slug":"dig-a-turnkey-library-for-diving-into-graph","title":"DIG: A Turnkey Library for Diving into Graph Deep Learning Research","date":"2021-03-23","arxiv_id":"2103.12608","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/probabilistic-modeling-of-semantic-ambiguity","slug":"probabilistic-modeling-of-semantic-ambiguity","title":"Probabilistic Modeling of Semantic Ambiguity for Scene Graph Generation","date":"2021-03-09","arxiv_id":"2103.05271","repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-learning-for-scene-graph","slug":"energy-based-learning-for-scene-graph","title":"Energy-Based Learning for Scene Graph Generation","date":"2021-03-03","arxiv_id":"2103.02221","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-on-dynamic-graph-neural-networks","slug":"pre-training-on-dynamic-graph-neural-networks","title":"Pre-Training on Dynamic Graph Neural Networks","date":"2021-02-24","arxiv_id":"2102.12380","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 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) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graphebm-molecular-graph-generation-with","slug":"graphebm-molecular-graph-generation-with","title":"GraphEBM: Molecular Graph Generation with Energy-Based Models","date":"2021-01-31","arxiv_id":"2102.00546","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-scene-graph-generation-with","slug":"context-aware-scene-graph-generation-with","title":"Context-Aware Scene Graph Generation With Seq2Seq Transformers","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-edit-networks","slug":"graph-edit-networks","title":"Graph Edit Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/grounding-consistency-distilling-spatial","slug":"grounding-consistency-distilling-spatial","title":"Grounding Consistency: Distilling Spatial Common Sense for Precise Visual Relationship Detection","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-initial-pose-graph-generation-for","slug":"efficient-initial-pose-graph-generation-for","title":"Efficient Initial Pose-graph Generation for Global SfM","date":"2020-11-24","arxiv_id":"2011.11986","repositories_listed":1,"syntology":null},{"url":"/paper/reinforced-molecular-optimization-with-1","slug":"reinforced-molecular-optimization-with-1","title":"Reinforced Molecular Optimization with Neighborhood-Controlled Grammars","date":"2020-11-14","arxiv_id":"2011.07225","repositories_listed":1,"syntology":null},{"url":"/paper/after-all-only-the-last-neuron-matters","slug":"after-all-only-the-last-neuron-matters","title":"After All, Only The Last Neuron Matters: Comparing Multi-modal Fusion Functions for Scene Graph Generation","date":"2020-11-09","arxiv_id":"2011.04779","repositories_listed":1,"syntology":null},{"url":"/paper/neural-language-modeling-for-contextualized","slug":"neural-language-modeling-for-contextualized","title":"Neural Language Modeling for Contextualized Temporal Graph Generation","date":"2020-10-20","arxiv_id":"2010.10077","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-dynamic-graph-deep-generation","slug":"disentangled-dynamic-graph-deep-generation","title":"Disentangled Dynamic Graph Deep Generation","date":"2020-10-14","arxiv_id":"2010.07276","repositories_listed":1,"syntology":null},{"url":"/paper/dirichlet-graph-variational-autoencoder","slug":"dirichlet-graph-variational-autoencoder","title":"Dirichlet Graph Variational Autoencoder","date":"2020-10-09","arxiv_id":"2010.04408","repositories_listed":1,"syntology":null},{"url":"/paper/dense-relational-image-captioning-via-multi","slug":"dense-relational-image-captioning-via-multi","title":"Dense Relational Image Captioning via Multi-task Triple-Stream Networks","date":"2020-10-08","arxiv_id":"2010.03855","repositories_listed":1,"syntology":null},{"url":"/paper/scene-graph-modification-based-on-natural","slug":"scene-graph-modification-based-on-natural","title":"Scene Graph Modification Based on Natural Language Commands","date":"2020-10-06","arxiv_id":"2010.02591","repositories_listed":1,"syntology":null},{"url":"/paper/are-scene-graphs-good-enough-to-improve-image","slug":"are-scene-graphs-good-enough-to-improve-image","title":"Are scene graphs good enough to improve Image Captioning?","date":"2020-09-25","arxiv_id":"2009.12313","repositories_listed":1,"syntology":null},{"url":"/paper/topology-aware-generative-adversarial-network","slug":"topology-aware-generative-adversarial-network","title":"Topology-Aware Generative Adversarial Network for Joint Prediction of Multiple Brain Graphs from a Single Brain Graph","date":"2020-09-23","arxiv_id":"2009.11058","repositories_listed":1,"syntology":null},{"url":"/paper/cogtree-cognition-tree-loss-for-unbiased","slug":"cogtree-cognition-tree-loss-for-unbiased","title":"CogTree: Cognition Tree Loss for Unbiased Scene Graph Generation","date":"2020-09-16","arxiv_id":"2009.07526","repositories_listed":1,"syntology":null},{"url":"/paper/pcpl-predicate-correlation-perception","slug":"pcpl-predicate-correlation-perception","title":"PCPL: Predicate-Correlation Perception Learning for Unbiased Scene Graph Generation","date":"2020-09-02","arxiv_id":"2009.00893","repositories_listed":1,"syntology":null},{"url":"/paper/sketching-image-gist-human-mimetic","slug":"sketching-image-gist-human-mimetic","title":"Sketching Image Gist: Human-Mimetic Hierarchical Scene Graph Generation","date":"2020-07-17","arxiv_id":"2007.08760","repositories_listed":1,"syntology":null},{"url":"/paper/generative-graph-perturbations-for-scene","slug":"generative-graph-perturbations-for-scene","title":"Generative Compositional Augmentations for Scene Graph Prediction","date":"2020-07-11","arxiv_id":"2007.05756","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-deep-generative-modeling-for-sparse","slug":"scalable-deep-generative-modeling-for-sparse","title":"Scalable Deep Generative Modeling for Sparse Graphs","date":"2020-06-28","arxiv_id":"2006.15502","repositories_listed":1,"syntology":null},{"url":"/paper/malont-an-ontology-for-malware-threat","slug":"malont-an-ontology-for-malware-threat","title":"MALOnt: An Ontology for Malware Threat Intelligence","date":"2020-06-20","arxiv_id":"2006.11446","repositories_listed":1,"syntology":null},{"url":"/paper/forming-an-electoral-college-for-a-graph-a","slug":"forming-an-electoral-college-for-a-graph-a","title":"Heuristic Semi-Supervised Learning for Graph Generation Inspired by Electoral College","date":"2020-06-10","arxiv_id":"2006.06469","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-deep-graph-generation-with-node","slug":"interpretable-deep-graph-generation-with-node","title":"Interpretable Deep Graph Generation with Node-Edge Co-Disentanglement","date":"2020-06-09","arxiv_id":"2006.05385","repositories_listed":1,"syntology":null},{"url":"/paper/xgnn-towards-model-level-explanations-of","slug":"xgnn-towards-model-level-explanations-of","title":"XGNN: Towards Model-Level Explanations of Graph Neural Networks","date":"2020-06-03","arxiv_id":"2006.02587","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/xgnn-towards-model-level-explanations-of#ran","syntology_url":"https://syntology.ai/paper/2006.02587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02587"}},"official":null}}],"record_sha256":"6a9857a9fc70f4cc51d2dbf10f67560e04ac0a51c288a7846a6908a3e04de2a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}