{"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/2","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":2,"pages_in_order":8,"rows_per_page":100,"rows":[101,200],"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","next":"/task/graph-generation/papers/3","papers":[{"url":"/paper/advancing-graph-generation-through-beta","slug":"advancing-graph-generation-through-beta","title":"Advancing Graph Generation through Beta Diffusion","date":"2024-06-13","arxiv_id":"2406.09357","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-for-constrained-based","slug":"large-language-models-for-constrained-based","title":"Large Language Models for Constrained-Based Causal Discovery","date":"2024-06-11","arxiv_id":"2406.07378","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-complex-score-based-diffusion","slug":"combinatorial-complex-score-based-diffusion","title":"Combinatorial Complex Score-based Diffusion Modelling through Stochastic Differential Equations","date":"2024-06-07","arxiv_id":"2406.04916","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-predicate-and-triplet-learning-for","slug":"leveraging-predicate-and-triplet-learning-for","title":"Leveraging Predicate and Triplet Learning for Scene Graph Generation","date":"2024-06-04","arxiv_id":"2406.02038","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/leveraging-predicate-and-triplet-learning-for#ran","syntology_url":"https://syntology.ai/paper/2406.02038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02038"}},"official":{"repos":["jkli1998/drm"],"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/alignment-is-key-for-applying-diffusion","slug":"alignment-is-key-for-applying-diffusion","title":"Equivariant Denoisers Cannot Copy Graphs: Align Your Graph Diffusion Models","date":"2024-05-27","arxiv_id":"2405.17656","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":2,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":16,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/alignment-is-key-for-applying-diffusion#ran","syntology_url":"https://syntology.ai/paper/2405.17656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17656"}},"official":{"repos":["aalto-quml/diffalign"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/oed-towards-one-stage-end-to-end-dynamic","slug":"oed-towards-one-stage-end-to-end-dynamic","title":"OED: Towards One-stage End-to-End Dynamic Scene Graph Generation","date":"2024-05-27","arxiv_id":"2405.16925","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/oed-towards-one-stage-end-to-end-dynamic#ran","syntology_url":"https://syntology.ai/paper/2405.16925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16925"}},"official":{"repos":["guanw-pku/oed"],"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/real-time-scene-graph-generation","slug":"real-time-scene-graph-generation","title":"REACT: Real-time Efficiency and Accuracy Compromise for Tradeoffs in Scene Graph Generation","date":"2024-05-25","arxiv_id":"2405.16116","repositories_listed":1,"syntology":null},{"url":"/paper/discrete-state-continuous-time-diffusion-for","slug":"discrete-state-continuous-time-diffusion-for","title":"Discrete-state Continuous-time Diffusion for Graph Generation","date":"2024-05-19","arxiv_id":"2405.11416","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/discrete-state-continuous-time-diffusion-for#ran","syntology_url":"https://syntology.ai/paper/2405.11416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11416"}},"official":{"repos":["pricexu/disco"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-the-individuality-and-collectivity","slug":"exploring-the-individuality-and-collectivity","title":"Exploring the Individuality and Collectivity of Intents behind Interactions for Graph Collaborative Filtering","date":"2024-05-15","arxiv_id":"2405.09042","repositories_listed":1,"syntology":null},{"url":"/paper/midgard-self-consistency-using-minimum","slug":"midgard-self-consistency-using-minimum","title":"MIDGARD: Self-Consistency Using Minimum Description Length for Structured Commonsense Reasoning","date":"2024-05-08","arxiv_id":"2405.05189","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-geometric-latent-diffusion-model","slug":"hyperbolic-geometric-latent-diffusion-model","title":"Hyperbolic Geometric Latent Diffusion Model for Graph Generation","date":"2024-05-06","arxiv_id":"2405.03188","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/hyperbolic-geometric-latent-diffusion-model#ran","syntology_url":"https://syntology.ai/paper/2405.03188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03188"}},"official":{"repos":["ringbdstack/hypdiff"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-review-and-efficient-implementation-of","slug":"a-review-and-efficient-implementation-of","title":"A Review and Efficient Implementation of Scene Graph Generation Metrics","date":"2024-04-15","arxiv_id":"2404.09616","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-review-and-efficient-implementation-of#ran","syntology_url":"https://syntology.ai/paper/2404.09616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.09616"}},"official":{"repos":["lorjul/sgbench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/oracle-large-vision-language-models-for","slug":"oracle-large-vision-language-models-for","title":"ORacle: Large Vision-Language Models for Knowledge-Guided Holistic OR Domain Modeling","date":"2024-04-10","arxiv_id":"2404.07031","repositories_listed":1,"syntology":null},{"url":"/paper/sportshhi-a-dataset-for-human-human","slug":"sportshhi-a-dataset-for-human-human","title":"SportsHHI: A Dataset for Human-Human Interaction Detection in Sports Videos","date":"2024-04-06","arxiv_id":"2404.04565","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-3d-scene-graph-generation","slug":"weakly-supervised-3d-scene-graph-generation","title":"Weakly-Supervised 3D Scene Graph Generation via Visual-Linguistic Assisted Pseudo-labeling","date":"2024-04-03","arxiv_id":"2404.02527","repositories_listed":1,"syntology":null},{"url":"/paper/egtr-extracting-graph-from-transformer-for","slug":"egtr-extracting-graph-from-transformer-for","title":"EGTR: Extracting Graph from Transformer for Scene Graph Generation","date":"2024-04-02","arxiv_id":"2404.02072","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":4,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/egtr-extracting-graph-from-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2404.02072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02072"}},"official":{"repos":["naver-ai/egtr"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/from-pixels-to-graphs-open-vocabulary-scene","slug":"from-pixels-to-graphs-open-vocabulary-scene","title":"From Pixels to Graphs: Open-Vocabulary Scene Graph Generation with Vision-Language Models","date":"2024-04-01","arxiv_id":"2404.00906","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/from-pixels-to-graphs-open-vocabulary-scene#ran","syntology_url":"https://syntology.ai/paper/2404.00906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00906"}},"official":{"repos":["shtuplus/pix2grp_cvpr2024"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/set-aligning-framework-for-auto-regressive","slug":"set-aligning-framework-for-auto-regressive","title":"Set-Aligning Framework for Auto-Regressive Event Temporal Graph Generation","date":"2024-04-01","arxiv_id":"2404.01532","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":1,"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/set-aligning-framework-for-auto-regressive#ran","syntology_url":"https://syntology.ai/paper/2404.01532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01532"}},"official":{"repos":["xingwei-warwick/set-aligning-event-temporal-graph-generation"],"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/steingen-generating-fidelitous-and-diverse","slug":"steingen-generating-fidelitous-and-diverse","title":"SteinGen: Generating Fidelitous and Diverse Graph Samples","date":"2024-03-27","arxiv_id":"2403.18578","repositories_listed":1,"syntology":null},{"url":"/paper/dsgg-dense-relation-transformer-for-an-end-to","slug":"dsgg-dense-relation-transformer-for-an-end-to","title":"DSGG: Dense Relation Transformer for an End-to-end Scene Graph Generation","date":"2024-03-21","arxiv_id":"2403.14886","repositories_listed":1,"syntology":null},{"url":"/paper/3m-diffusion-latent-multi-modal-diffusion-for","slug":"3m-diffusion-latent-multi-modal-diffusion-for","title":"3M-Diffusion: Latent Multi-Modal Diffusion for Language-Guided Molecular Structure Generation","date":"2024-03-11","arxiv_id":"2403.07179","repositories_listed":1,"syntology":null},{"url":"/paper/graphinstruct-empowering-large-language","slug":"graphinstruct-empowering-large-language","title":"GraphInstruct: Empowering Large Language Models with Graph Understanding and Reasoning Capability","date":"2024-03-07","arxiv_id":"2403.04483","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/graphinstruct-empowering-large-language#ran","syntology_url":"https://syntology.ai/paper/2403.04483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04483"}},"official":{"repos":["cgcl-codes/graphinstruct"],"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/towards-scene-graph-anticipation","slug":"towards-scene-graph-anticipation","title":"Towards Scene Graph Anticipation","date":"2024-03-07","arxiv_id":"2403.04899","repositories_listed":1,"syntology":null},{"url":"/paper/graph-diffusion-policy-optimization","slug":"graph-diffusion-policy-optimization","title":"Graph Diffusion Policy Optimization","date":"2024-02-26","arxiv_id":"2402.16302","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/graph-diffusion-policy-optimization#ran","syntology_url":"https://syntology.ai/paper/2402.16302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16302"}},"official":{"repos":["sail-sg/gdpo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["community","official"]}}},{"url":"/paper/s-2former-or-single-stage-bimodal-transformer","slug":"s-2former-or-single-stage-bimodal-transformer","title":"S^2Former-OR: Single-Stage Bi-Modal Transformer for Scene Graph Generation in OR","date":"2024-02-22","arxiv_id":"2402.14461","repositories_listed":1,"syntology":null},{"url":"/paper/pard-permutation-invariant-autoregressive","slug":"pard-permutation-invariant-autoregressive","title":"Pard: Permutation-Invariant Autoregressive Diffusion for Graph Generation","date":"2024-02-06","arxiv_id":"2402.03687","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-is-worth-k-words-euclideanizing-graph","slug":"a-graph-is-worth-k-words-euclideanizing-graph","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","date":"2024-02-04","arxiv_id":"2402.02464","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-graph-is-worth-k-words-euclideanizing-graph#ran","syntology_url":"https://syntology.ai/paper/2402.02464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02464"}},"official":{"repos":["A4Bio/GraphsGPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-based-graph-generative-methods","slug":"diffusion-based-graph-generative-methods","title":"Diffusion-based Graph Generative Methods","date":"2024-01-28","arxiv_id":"2401.15617","repositories_listed":1,"syntology":null},{"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/adaptive-self-training-framework-for-fine","slug":"adaptive-self-training-framework-for-fine","title":"Adaptive Self-training Framework for Fine-grained Scene Graph Generation","date":"2024-01-18","arxiv_id":"2401.09786","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":5,"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/adaptive-self-training-framework-for-fine#ran","syntology_url":"https://syntology.ai/paper/2401.09786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09786"}},"official":{"repos":["rlqja1107/torch-st-sgg"],"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/replica-tree-based-federated-learning-using","slug":"replica-tree-based-federated-learning-using","title":"Replica Tree-based Federated Learning using Limited Data","date":"2023-12-28","arxiv_id":"2312.17159","repositories_listed":1,"syntology":null},{"url":"/paper/tspp-a-unified-benchmarking-tool-for-time","slug":"tspp-a-unified-benchmarking-tool-for-time","title":"TSPP: A Unified Benchmarking Tool for Time-series Forecasting","date":"2023-12-28","arxiv_id":"2312.17100","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-scalable-graph-generation","slug":"efficient-and-scalable-graph-generation","title":"Efficient and Scalable Graph Generation through Iterative Local Expansion","date":"2023-12-14","arxiv_id":"2312.11529","repositories_listed":1,"syntology":null},{"url":"/paper/gpt4sgg-synthesizing-scene-graphs-from","slug":"gpt4sgg-synthesizing-scene-graphs-from","title":"GPT4SGG: Synthesizing Scene Graphs from Holistic and Region-specific Narratives","date":"2023-12-07","arxiv_id":"2312.04314","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-scalable-representation-for","slug":"a-simple-and-scalable-representation-for","title":"A Simple and Scalable Representation for Graph Generation","date":"2023-12-04","arxiv_id":"2312.02230","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-simple-and-scalable-representation-for#ran","syntology_url":"https://syntology.ai/paper/2312.02230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02230"}},"official":{"repos":["yunhuijang/geel"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/vlprompt-vision-language-prompting-for","slug":"vlprompt-vision-language-prompting-for","title":"VLPrompt: Vision-Language Prompting for Panoptic Scene Graph Generation","date":"2023-11-27","arxiv_id":"2311.16492","repositories_listed":1,"syntology":null},{"url":"/paper/autokg-efficient-automated-knowledge-graph","slug":"autokg-efficient-automated-knowledge-graph","title":"AutoKG: Efficient Automated Knowledge Graph Generation for Language Models","date":"2023-11-22","arxiv_id":"2311.14740","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/autokg-efficient-automated-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2311.14740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14740"}},"official":{"repos":["wispcarey/autokg"],"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/expanding-scene-graph-boundaries-fully-open","slug":"expanding-scene-graph-boundaries-fully-open","title":"Expanding Scene Graph Boundaries: Fully Open-vocabulary Scene Graph Generation via Visual-Concept Alignment and Retention","date":"2023-11-18","arxiv_id":"2311.10988","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/expanding-scene-graph-boundaries-fully-open#ran","syntology_url":"https://syntology.ai/paper/2311.10988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.10988"}},"official":{"repos":["gpt4vision/OvSGTR"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/neusyre-neuro-symbolic-visual-understanding","slug":"neusyre-neuro-symbolic-visual-understanding","title":"NeuSyRE: Neuro-Symbolic Visual Understanding and Reasoning Framework based on Scene Graph Enrichment","date":"2023-11-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparse-training-of-discrete-diffusion-models","slug":"sparse-training-of-discrete-diffusion-models","title":"Sparse Training of Discrete Diffusion Models for Graph Generation","date":"2023-11-03","arxiv_id":"2311.02142","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sparse-training-of-discrete-diffusion-models#ran","syntology_url":"https://syntology.ai/paper/2311.02142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02142"}},"official":{"repos":["qym7/sparsediff"],"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/sqlformer-deep-auto-regressive-query-graph","slug":"sqlformer-deep-auto-regressive-query-graph","title":"SQLformer: Deep Auto-Regressive Query Graph Generation for Text-to-SQL Translation","date":"2023-10-27","arxiv_id":"2310.18376","repositories_listed":1,"syntology":null},{"url":"/paper/graphmaker-can-diffusion-models-generate","slug":"graphmaker-can-diffusion-models-generate","title":"GraphMaker: Can Diffusion Models Generate Large Attributed Graphs?","date":"2023-10-20","arxiv_id":"2310.13833","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphmaker-can-diffusion-models-generate#ran","syntology_url":"https://syntology.ai/paper/2310.13833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.13833"}},"official":{"repos":["graph-com/graphmaker"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-visual-scene-understanding","slug":"adaptive-visual-scene-understanding","title":"Adaptive Visual Scene Understanding: Incremental Scene Graph Generation","date":"2023-10-02","arxiv_id":"2310.01636","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/adaptive-visual-scene-understanding#ran","syntology_url":"https://syntology.ai/paper/2310.01636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01636"}},"official":{"repos":["zhanglab-deepneurocoglab/csegg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-toward-zero-shot-local-scene","slug":"less-is-more-toward-zero-shot-local-scene","title":"Less is More: Toward Zero-Shot Local Scene Graph Generation via Foundation Models","date":"2023-10-02","arxiv_id":"2310.01356","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/less-is-more-toward-zero-shot-local-scene#ran","syntology_url":"https://syntology.ai/paper/2310.01356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01356"}},"official":null}},{"url":"/paper/node-aligned-graph-to-graph-generation-for","slug":"node-aligned-graph-to-graph-generation-for","title":"Node-Aligned Graph-to-Graph (NAG2G): Elevating Template-Free Deep Learning Approaches in Single-Step Retrosynthesis","date":"2023-09-27","arxiv_id":"2309.15798","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/node-aligned-graph-to-graph-generation-for#ran","syntology_url":"https://syntology.ai/paper/2309.15798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15798"}},"official":{"repos":["dptech-corp/nag2g"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/spatial-temporal-knowledge-embedded","slug":"spatial-temporal-knowledge-embedded","title":"Spatial-Temporal Knowledge-Embedded Transformer for Video Scene Graph Generation","date":"2023-09-23","arxiv_id":"2309.13237","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-scene-graph-generation-via-triplet","slug":"zero-shot-scene-graph-generation-via-triplet","title":"Zero-Shot Scene Graph Generation via Triplet Calibration and Reduction","date":"2023-09-07","arxiv_id":"2309.03542","repositories_listed":1,"syntology":null},{"url":"/paper/haystack-a-panoptic-scene-graph-dataset-to","slug":"haystack-a-panoptic-scene-graph-dataset-to","title":"Haystack: A Panoptic Scene Graph Dataset to Evaluate Rare Predicate Classes","date":"2023-09-05","arxiv_id":"2309.02286","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/haystack-a-panoptic-scene-graph-dataset-to#ran","syntology_url":"https://syntology.ai/paper/2309.02286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.02286"}},"official":{"repos":["lorjul/haystack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-addressing-the-misalignment-of-object","slug":"towards-addressing-the-misalignment-of-object","title":"Towards Addressing the Misalignment of Object Proposal Evaluation for Vision-Language Tasks via Semantic Grounding","date":"2023-09-01","arxiv_id":"2309.00215","repositories_listed":1,"syntology":null},{"url":"/paper/head-tail-cooperative-learning-network-for","slug":"head-tail-cooperative-learning-network-for","title":"Head-Tail Cooperative Learning Network for Unbiased Scene Graph Generation","date":"2023-08-23","arxiv_id":"2308.12048","repositories_listed":1,"syntology":null},{"url":"/paper/rba-gcn-relational-bilevel-aggregation-graph","slug":"rba-gcn-relational-bilevel-aggregation-graph","title":"RBA-GCN: Relational Bilevel Aggregation Graph Convolutional Network for Emotion Recognition","date":"2023-08-18","arxiv_id":"2308.11029","repositories_listed":1,"syntology":null},{"url":"/paper/vision-relation-transformer-for-unbiased","slug":"vision-relation-transformer-for-unbiased","title":"Vision Relation Transformer for Unbiased Scene Graph Generation","date":"2023-08-18","arxiv_id":"2308.09472","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":2,"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/vision-relation-transformer-for-unbiased#ran","syntology_url":"https://syntology.ai/paper/2308.09472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09472"}},"official":{"repos":["visinf/veto"],"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/compositional-feature-augmentation-for","slug":"compositional-feature-augmentation-for","title":"Compositional Feature Augmentation for Unbiased Scene Graph Generation","date":"2023-08-13","arxiv_id":"2308.06712","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/compositional-feature-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2308.06712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06712"}},"official":{"repos":["hkust-longgroup/cfa"],"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/environment-invariant-curriculum-relation","slug":"environment-invariant-curriculum-relation","title":"Environment-Invariant Curriculum Relation Learning for Fine-Grained Scene Graph Generation","date":"2023-08-07","arxiv_id":"2308.03282","repositories_listed":1,"syntology":null},{"url":"/paper/text2kgbench-a-benchmark-for-ontology-driven","slug":"text2kgbench-a-benchmark-for-ontology-driven","title":"Text2KGBench: A Benchmark for Ontology-Driven Knowledge Graph Generation from Text","date":"2023-08-04","arxiv_id":"2308.02357","repositories_listed":1,"syntology":null},{"url":"/paper/panoptic-scene-graph-generation-with","slug":"panoptic-scene-graph-generation-with","title":"Panoptic Scene Graph Generation with Semantics-Prototype Learning","date":"2023-07-28","arxiv_id":"2307.15567","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-the-impact-of-localized-training","slug":"addressing-the-impact-of-localized-training","title":"Addressing the Impact of Localized Training Data in Graph Neural Networks","date":"2023-07-24","arxiv_id":"2307.12689","repositories_listed":1,"syntology":null},{"url":"/paper/pixel-wise-graph-attention-networks-for","slug":"pixel-wise-graph-attention-networks-for","title":"Pixel-wise Graph Attention Networks for Person Re-identification","date":"2023-07-18","arxiv_id":"2307.09183","repositories_listed":1,"syntology":null},{"url":"/paper/autoregressive-diffusion-model-for-graph","slug":"autoregressive-diffusion-model-for-graph","title":"Autoregressive Diffusion Model for Graph Generation","date":"2023-07-17","arxiv_id":"2307.08849","repositories_listed":1,"syntology":null},{"url":"/paper/pair-then-relation-pair-net-for-panoptic","slug":"pair-then-relation-pair-net-for-panoptic","title":"Pair then Relation: Pair-Net for Panoptic Scene Graph Generation","date":"2023-07-17","arxiv_id":"2307.08699","repositories_listed":1,"syntology":null},{"url":"/paper/intelligraphs-datasets-for-benchmarking","slug":"intelligraphs-datasets-for-benchmarking","title":"IntelliGraphs: Datasets for Benchmarking Knowledge Graph Generation","date":"2023-07-13","arxiv_id":"2307.06698","repositories_listed":1,"syntology":null},{"url":"/paper/transformerg2g-adaptive-time-stepping-for","slug":"transformerg2g-adaptive-time-stepping-for","title":"TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers","date":"2023-07-05","arxiv_id":"2307.02588","repositories_listed":1,"syntology":null},{"url":"/paper/sagess-sampling-graph-denoising-diffusion","slug":"sagess-sampling-graph-denoising-diffusion","title":"SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation","date":"2023-06-29","arxiv_id":"2306.16827","repositories_listed":1,"syntology":null},{"url":"/paper/using-motif-transitions-for-temporal-graph","slug":"using-motif-transitions-for-temporal-graph","title":"Using Motif Transitions for Temporal Graph Generation","date":"2023-06-19","arxiv_id":"2306.11190","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-meta-weighting-for-long-tailed","slug":"multi-label-meta-weighting-for-long-tailed","title":"Multi-Label Meta Weighting for Long-Tailed Dynamic Scene Graph Generation","date":"2023-06-16","arxiv_id":"2306.10122","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-graph-diffusion-model-for-molecule","slug":"hyperbolic-graph-diffusion-model-for-molecule","title":"Hyperbolic Graph Diffusion Model","date":"2023-06-13","arxiv_id":"2306.07618","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/hyperbolic-graph-diffusion-model-for-molecule#ran","syntology_url":"https://syntology.ai/paper/2306.07618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07618"}},"official":{"repos":["lf-wen/hgdm"],"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/optimized-crystallographic-graph-generation","slug":"optimized-crystallographic-graph-generation","title":"Optimized Crystallographic Graph Generation for Material Science","date":"2023-06-07","arxiv_id":"2307.05380","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimized-crystallographic-graph-generation#ran","syntology_url":"https://syntology.ai/paper/2307.05380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.05380"}},"official":{"repos":["aklipf/mat-graph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/explanation-graph-generation-via-generative","slug":"explanation-graph-generation-via-generative","title":"Explanation Graph Generation via Generative Pre-training over Synthetic Graphs","date":"2023-06-01","arxiv_id":"2306.00652","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-is-too-coarse-a-novel-data","slug":"fine-grained-is-too-coarse-a-novel-data","title":"Fine-Grained is Too Coarse: A Novel Data-Centric Approach for Efficient Scene Graph Generation","date":"2023-05-30","arxiv_id":"2305.18668","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-generation-with-k-2-trees","slug":"hierarchical-graph-generation-with-k-2-trees","title":"Graph Generation with $K^2$-trees","date":"2023-05-30","arxiv_id":"2305.19125","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":1,"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/hierarchical-graph-generation-with-k-2-trees#ran","syntology_url":"https://syntology.ai/paper/2305.19125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19125"}},"official":{"repos":["yunhuijang/hggt"],"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/higen-hierarchical-graph-generative-networks","slug":"higen-hierarchical-graph-generative-networks","title":"HiGen: Hierarchical Graph Generative Networks","date":"2023-05-30","arxiv_id":"2305.19337","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/higen-hierarchical-graph-generative-networks#ran","syntology_url":"https://syntology.ai/paper/2305.19337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19337"}},"official":{"repos":["karami-m/higen_main"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-diffusion-model-for-event-skeleton","slug":"a-diffusion-model-for-event-skeleton","title":"A Diffusion Model for Event Skeleton Generation","date":"2023-05-27","arxiv_id":"2305.17458","repositories_listed":1,"syntology":null},{"url":"/paper/let-there-be-order-rethinking-ordering-in","slug":"let-there-be-order-rethinking-ordering-in","title":"Let There Be Order: Rethinking Ordering in Autoregressive Graph Generation","date":"2023-05-24","arxiv_id":"2305.15562","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-knowledge-graph-generation-from","slug":"boosting-knowledge-graph-generation-from","title":"Boosting Knowledge Graph Generation from Tabular Data with RML Views","date":"2023-05-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pive-prompting-with-iterative-verification","slug":"pive-prompting-with-iterative-verification","title":"PiVe: Prompting with Iterative Verification Improving Graph-based Generative Capability of LLMs","date":"2023-05-21","arxiv_id":"2305.12392","repositories_listed":1,"syntology":null},{"url":"/paper/molhf-a-hierarchical-normalizing-flow-for","slug":"molhf-a-hierarchical-normalizing-flow-for","title":"MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation","date":"2023-05-15","arxiv_id":"2305.08457","repositories_listed":1,"syntology":{"n":23,"n_ran":14,"n_constructed":7,"n_ran_checked":12,"n_instrument":2,"n_unverified":9,"n_honours":1,"n_violates":1,"n_no_contract":10,"n_pointer_only":0,"phrase":"14 ran (of which 7 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/molhf-a-hierarchical-normalizing-flow-for#ran","syntology_url":"https://syntology.ai/paper/2305.08457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08457"}},"official":{"repos":["violet-sto/molhf"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":7,"n_ran_no_instrument_failure":12,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-degree-guided-graph-generation","slug":"efficient-and-degree-guided-graph-generation","title":"Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling","date":"2023-05-06","arxiv_id":"2305.04111","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":4,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-and-degree-guided-graph-generation#ran","syntology_url":"https://syntology.ai/paper/2305.04111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04111"}},"official":{"repos":["tufts-ml/graph-generation-edge"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/connector-0-5-a-unified-framework-for-graph","slug":"connector-0-5-a-unified-framework-for-graph","title":"Connector 0.5: A unified framework for graph representation learning","date":"2023-04-25","arxiv_id":"2304.13195","repositories_listed":1,"syntology":null},{"url":"/paper/an-equivariant-generative-framework-for","slug":"an-equivariant-generative-framework-for","title":"An Equivariant Generative Framework for Molecular Graph-Structure Co-Design","date":"2023-04-12","arxiv_id":"2304.12436","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-equivariant-generative-framework-for#ran","syntology_url":"https://syntology.ai/paper/2304.12436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.12436"}},"official":{"repos":["zaixizhang/molcode"],"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/unbiased-scene-graph-generation-in-videos","slug":"unbiased-scene-graph-generation-in-videos","title":"Unbiased Scene Graph Generation in Videos","date":"2023-04-03","arxiv_id":"2304.00733","repositories_listed":1,"syntology":null},{"url":"/paper/learning-similarity-between-scene-graphs-and","slug":"learning-similarity-between-scene-graphs-and","title":"SPAN: Learning Similarity between Scene Graphs and Images with Transformers","date":"2023-04-02","arxiv_id":"2304.00590","repositories_listed":1,"syntology":null},{"url":"/paper/taking-a-closer-look-at-visual-relation","slug":"taking-a-closer-look-at-visual-relation","title":"Taking A Closer Look at Visual Relation: Unbiased Video Scene Graph Generation with Decoupled Label Learning","date":"2023-03-23","arxiv_id":"2303.13209","repositories_listed":1,"syntology":null},{"url":"/paper/visually-prompted-language-model-for-fine","slug":"visually-prompted-language-model-for-fine","title":"Visually-Prompted Language Model for Fine-Grained Scene Graph Generation in an Open World","date":"2023-03-23","arxiv_id":"2303.13233","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/visually-prompted-language-model-for-fine#ran","syntology_url":"https://syntology.ai/paper/2303.13233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13233"}},"official":{"repos":["Yuqifan1117/CaCao"],"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/location-free-scene-graph-generation","slug":"location-free-scene-graph-generation","title":"Location-Free Scene Graph Generation","date":"2023-03-20","arxiv_id":"2303.10944","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-transformer-for-point-cloud-based","slug":"revisiting-transformer-for-point-cloud-based","title":"SGFormer: Semantic Graph Transformer for Point Cloud-based 3D Scene Graph Generation","date":"2023-03-20","arxiv_id":"2303.11048","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-based-embedding-network-for-scene","slug":"prototype-based-embedding-network-for-scene","title":"Prototype-based Embedding Network for Scene Graph Generation","date":"2023-03-13","arxiv_id":"2303.07096","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/prototype-based-embedding-network-for-scene#ran","syntology_url":"https://syntology.ai/paper/2303.07096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.07096"}},"official":{"repos":["vl-group/penet"],"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/scene-graph-generation-from-hierarchical","slug":"scene-graph-generation-from-hierarchical","title":"Hierarchical Relationships: A New Perspective to Enhance Scene Graph Generation","date":"2023-03-13","arxiv_id":"2303.06842","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/scene-graph-generation-from-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2303.06842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06842"}},"official":{"repos":["bowen-upenn/scene_graph_commonsense"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/landmark-language-guided-representation","slug":"landmark-language-guided-representation","title":"LANDMARK: Language-guided Representation Enhancement Framework for Scene Graph Generation","date":"2023-03-02","arxiv_id":"2303.01080","repositories_listed":1,"syntology":null},{"url":"/paper/graphguide-interpretable-and-controllable","slug":"graphguide-interpretable-and-controllable","title":"GraphGUIDE: interpretable and controllable conditional graph generation with discrete Bernoulli diffusion","date":"2023-02-07","arxiv_id":"2302.03790","repositories_listed":1,"syntology":null},{"url":"/paper/generative-diffusion-models-on-graphs-methods","slug":"generative-diffusion-models-on-graphs-methods","title":"Generative Diffusion Models on Graphs: Methods and Applications","date":"2023-02-06","arxiv_id":"2302.02591","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-can-recover-the-hidden","slug":"graph-neural-networks-can-recover-the-hidden","title":"Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure","date":"2023-01-26","arxiv_id":"2301.10956","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/graph-neural-networks-can-recover-the-hidden#ran","syntology_url":"https://syntology.ai/paper/2301.10956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10956"}},"official":{"repos":["joisino/gnnrecover"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/improving-graph-generation-by-restricting","slug":"improving-graph-generation-by-restricting","title":"Improving Graph Generation by Restricting Graph Bandwidth","date":"2023-01-25","arxiv_id":"2301.10857","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-graph-generation-by-restricting#ran","syntology_url":"https://syntology.ai/paper/2301.10857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10857"}},"official":{"repos":["genentech/bandwidth-graph-generation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-diffusion-based-on-discrete-graph","slug":"conditional-diffusion-based-on-discrete-graph","title":"Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generation","date":"2023-01-01","arxiv_id":"2301.00427","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generate-language-supervised-and","slug":"learning-to-generate-language-supervised-and","title":"Learning To Generate Language-Supervised and Open-Vocabulary Scene Graph Using Pre-Trained Visual-Semantic Space","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/skew-class-balanced-re-weighting-for-unbiased","slug":"skew-class-balanced-re-weighting-for-unbiased","title":"Skew Class-balanced Re-weighting for Unbiased Scene Graph Generation","date":"2023-01-01","arxiv_id":"2301.00351","repositories_listed":1,"syntology":null},{"url":"/paper/promptcal-contrastive-affinity-learning-via","slug":"promptcal-contrastive-affinity-learning-via","title":"PromptCAL: Contrastive Affinity Learning via Auxiliary Prompts for Generalized Novel Category Discovery","date":"2022-12-11","arxiv_id":"2212.05590","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/promptcal-contrastive-affinity-learning-via#ran","syntology_url":"https://syntology.ai/paper/2212.05590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.05590"}},"official":{"repos":["sheng-eatamath/promptcal"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/data-imputation-with-iterative-graph","slug":"data-imputation-with-iterative-graph","title":"Data Imputation with Iterative Graph Reconstruction","date":"2022-12-06","arxiv_id":"2212.02810","repositories_listed":1,"syntology":null},{"url":"/paper/graphgdp-generative-diffusion-processes-for","slug":"graphgdp-generative-diffusion-processes-for","title":"GraphGDP: Generative Diffusion Processes for Permutation Invariant Graph Generation","date":"2022-12-04","arxiv_id":"2212.01842","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graphgdp-generative-diffusion-processes-for#ran","syntology_url":"https://syntology.ai/paper/2212.01842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.01842"}},"official":{"repos":["graph-0/graphgdp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unbiased-heterogeneous-scene-graph-generation","slug":"unbiased-heterogeneous-scene-graph-generation","title":"Unbiased Heterogeneous Scene Graph Generation with Relation-aware Message Passing Neural Network","date":"2022-12-01","arxiv_id":"2212.00443","repositories_listed":1,"syntology":null},{"url":"/paper/moma-lrg-language-refined-graphs-for-multi","slug":"moma-lrg-language-refined-graphs-for-multi","title":"MOMA-LRG: Language-Refined Graphs for Multi-Object Multi-Actor Activity Parsing","date":"2022-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"3f999e72a837c1ead661ee3f547dcc5ed182d99d27a98843fa470e42b19aba74","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}