{"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","name":"Graph Generation","slug":"graph-generation","description_markdown":"**Graph Generation** is an important research area with significant applications in drug and material designs.\n\n\n<span class=\"description-source\">Source: [Graph Deconvolutional Generation ](https://arxiv.org/abs/2002.07087)</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":712,"papers_with_code":326,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-generation-on-toulouse-road-network","slug":"graph-generation-on-toulouse-road-network","dataset":"Toulouse Road Network","dataset_url":"/dataset/trn","rows_in_archive":6,"metrics":["StreetMover"],"first_row_in_archive_order":{"model":"GGT","paper_title":"Image-Conditioned Graph Generation for Road Network Extraction","paper_url":"/paper/image-conditioned-graph-generation-for-road","paper_date":"2019-10-31","arxiv_id":"1910.14388","code_links":[{"title":"davide-belli/generative-graph-transformer","url":"https://github.com/davide-belli/generative-graph-transformer"},{"title":"davide-belli/toulouse-road-network-dataset","url":"https://github.com/davide-belli/toulouse-road-network-dataset"},{"title":"2023-MindSpore-1/ms-code-217","url":"https://github.com/2023-MindSpore-1/ms-code-217/tree/main/trn"}],"syntology":null}}],"datasets":[{"url":"/dataset/torque","name":"Torque","full_name":"","num_papers_in_archive":19},{"url":"/dataset/pisc","name":"PISC","full_name":"People in Social Context","num_papers_in_archive":13},{"url":"/dataset/streets","name":"STREETS","full_name":"","num_papers_in_archive":4},{"url":"/dataset/wikigraphs","name":"WikiGraphs","full_name":"","num_papers_in_archive":4},{"url":"/dataset/trn","name":"TRN","full_name":"Toulouse Road Network","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":8,"rows_per_page":100,"shown":100,"of":712,"of_with_code":326,"tagged_in_all":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":97,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":97,"listed_every_run_a_failure_of_syntologys_instrument":14,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/junction-tree-variational-autoencoder-for","slug":"junction-tree-variational-autoencoder-for","title":"Junction Tree Variational Autoencoder for Molecular Graph Generation","date":"2018-02-12","arxiv_id":"1802.04364","repositories_listed":11,"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/junction-tree-variational-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1802.04364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04364"}},"official":{"repos":["wengong-jin/icml18-jtnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/unbiased-scene-graph-generation-from-biased","slug":"unbiased-scene-graph-generation-from-biased","title":"Unbiased Scene Graph Generation from Biased Training","date":"2020-02-27","arxiv_id":"2002.11949","repositories_listed":6,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"6 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unbiased-scene-graph-generation-from-biased#ran","syntology_url":"https://syntology.ai/paper/2002.11949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11949"}},"official":{"repos":["KaihuaTang/Scene-Graph-Benchmark.pytorch"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/learning-to-compose-dynamic-tree-structures","slug":"learning-to-compose-dynamic-tree-structures","title":"Learning to Compose Dynamic Tree Structures for Visual Contexts","date":"2018-12-05","arxiv_id":"1812.01880","repositories_listed":6,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-to-compose-dynamic-tree-structures#ran","syntology_url":"https://syntology.ai/paper/1812.01880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01880"}},"official":null}},{"url":"/paper/scene-graph-generation-by-iterative-message","slug":"scene-graph-generation-by-iterative-message","title":"Scene Graph Generation by Iterative Message Passing","date":"2017-01-10","arxiv_id":"1701.02426","repositories_listed":5,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scene-graph-generation-by-iterative-message#ran","syntology_url":"https://syntology.ai/paper/1701.02426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.02426"}},"official":null}},{"url":"/paper/structured-sparse-r-cnn-for-direct-scene","slug":"structured-sparse-r-cnn-for-direct-scene","title":"Structured Sparse R-CNN for Direct Scene Graph Generation","date":"2021-06-21","arxiv_id":"2106.10815","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-sparse-r-cnn-for-direct-scene#ran","syntology_url":"https://syntology.ai/paper/2106.10815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10815"}},"official":{"repos":["mcg-nju/structured-sparse-rcnn"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/bipartite-graph-network-with-adaptive-message","slug":"bipartite-graph-network-with-adaptive-message","title":"Bipartite Graph Network with Adaptive Message Passing for Unbiased Scene Graph Generation","date":"2021-04-01","arxiv_id":"2104.00308","repositories_listed":4,"syntology":null},{"url":"/paper/scene-graph-generation-in-large-size-vhr","slug":"scene-graph-generation-in-large-size-vhr","title":"STAR: A First-Ever Dataset and A Large-Scale Benchmark for Scene Graph Generation in Large-Size Satellite Imagery","date":"2024-06-13","arxiv_id":"2406.09410","repositories_listed":3,"syntology":null},{"url":"/paper/4d-panoptic-scene-graph-generation-1","slug":"4d-panoptic-scene-graph-generation-1","title":"4D Panoptic Scene Graph Generation","date":"2024-05-16","arxiv_id":"2405.10305","repositories_listed":3,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":5,"n_pointer_only":10,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/4d-panoptic-scene-graph-generation-1#ran","syntology_url":"https://syntology.ai/paper/2405.10305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10305"}},"official":{"repos":["jingkang50/psg4d","Jingkang50/OpenPSG","jingkang50/openpvsg"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/panoptic-video-scene-graph-generation-1","slug":"panoptic-video-scene-graph-generation-1","title":"Panoptic Video Scene Graph Generation","date":"2023-11-28","arxiv_id":"2311.17058","repositories_listed":3,"syntology":{"n":11,"n_ran":11,"n_constructed":2,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"11 ran (of which 2 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/panoptic-video-scene-graph-generation-1#ran","syntology_url":"https://syntology.ai/paper/2311.17058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17058"}},"official":{"repos":["jingkang50/openpvsg","lilydaytoy/openpvsg","lilydaytoy/pvsgannotation"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":2,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rlipv2-fast-scaling-of-relational-language","slug":"rlipv2-fast-scaling-of-relational-language","title":"RLIPv2: Fast Scaling of Relational Language-Image Pre-training","date":"2023-08-18","arxiv_id":"2308.09351","repositories_listed":3,"syntology":{"n":30,"n_ran":22,"n_constructed":5,"n_ran_checked":18,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":17,"n_pointer_only":0,"phrase":"22 ran (of which 5 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 1 violated, 17 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/rlipv2-fast-scaling-of-relational-language#ran","syntology_url":"https://syntology.ai/paper/2308.09351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09351"}},"official":{"repos":["jacobyuan7/rlipv2"],"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":["listed","official"]}}},{"url":"/paper/raf-holistic-compilation-for-deep-learning","slug":"raf-holistic-compilation-for-deep-learning","title":"RAF: Holistic Compilation for Deep Learning Model Training","date":"2023-03-08","arxiv_id":"2303.04759","repositories_listed":3,"syntology":null},{"url":"/paper/geometry-complete-diffusion-for-3d-molecule","slug":"geometry-complete-diffusion-for-3d-molecule","title":"Geometry-Complete Diffusion for 3D Molecule Generation and Optimization","date":"2023-02-08","arxiv_id":"2302.04313","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/geometry-complete-diffusion-for-3d-molecule#ran","syntology_url":"https://syntology.ai/paper/2302.04313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04313"}},"official":{"repos":["bioinfomachinelearning/bio-diffusion","bioinfomachinelearning/gcdm-sbdd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sgdraw-scene-graph-drawing-interface-using","slug":"sgdraw-scene-graph-drawing-interface-using","title":"SGDraw: Scene Graph Drawing Interface Using Object-Oriented Representation","date":"2022-11-30","arxiv_id":"2211.16697","repositories_listed":3,"syntology":null},{"url":"/paper/digress-discrete-denoising-diffusion-for","slug":"digress-discrete-denoising-diffusion-for","title":"DiGress: Discrete Denoising diffusion for graph generation","date":"2022-09-29","arxiv_id":"2209.14734","repositories_listed":3,"syntology":{"n":25,"n_ran":15,"n_constructed":10,"n_ran_checked":10,"n_instrument":5,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"15 ran (of which 10 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/digress-discrete-denoising-diffusion-for#ran","syntology_url":"https://syntology.ai/paper/2209.14734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14734"}},"official":{"repos":["cvignac/digress"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed"]}}},{"url":"/paper/fastflows-flow-based-models-for-molecular","slug":"fastflows-flow-based-models-for-molecular","title":"FastFlows: Flow-Based Models for Molecular Graph Generation","date":"2022-01-28","arxiv_id":"2201.12419","repositories_listed":3,"syntology":null},{"url":"/paper/graphpiece-efficiently-generating-high","slug":"graphpiece-efficiently-generating-high","title":"Molecule Generation by Principal Subgraph Mining and Assembling","date":"2021-06-29","arxiv_id":"2106.15098","repositories_listed":3,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphpiece-efficiently-generating-high#ran","syntology_url":"https://syntology.ai/paper/2106.15098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15098"}},"official":{"repos":["kxz18/gp-vae","thunlp-mt/ps-vae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-graph-convolutional-recurrent","slug":"adaptive-graph-convolutional-recurrent","title":"Adaptive Graph Convolutional Recurrent Network for Traffic Forecasting","date":"2020-07-06","arxiv_id":"2007.02842","repositories_listed":3,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 5 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) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/adaptive-graph-convolutional-recurrent#ran","syntology_url":"https://syntology.ai/paper/2007.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02842"}},"official":{"repos":["LeiBAI/AGCRN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/image-conditioned-graph-generation-for-road","slug":"image-conditioned-graph-generation-for-road","title":"Image-Conditioned Graph Generation for Road Network Extraction","date":"2019-10-31","arxiv_id":"1910.14388","repositories_listed":3,"syntology":null},{"url":"/paper/graphnvp-an-invertible-flow-model-for","slug":"graphnvp-an-invertible-flow-model-for","title":"GraphNVP: An Invertible Flow Model for Generating Molecular Graphs","date":"2019-05-28","arxiv_id":"1905.11600","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 1 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) · 0 unverified","sample_list":"/paper/graphnvp-an-invertible-flow-model-for#ran","syntology_url":"https://syntology.ai/paper/1905.11600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11600"}},"official":{"repos":["pfnet-research/chainer-chemistry"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/knowledge-embedded-routing-network-for-scene","slug":"knowledge-embedded-routing-network-for-scene","title":"Knowledge-Embedded Routing Network for Scene Graph Generation","date":"2019-03-08","arxiv_id":"1903.03326","repositories_listed":3,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/knowledge-embedded-routing-network-for-scene#ran","syntology_url":"https://syntology.ai/paper/1903.03326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03326"}},"official":{"repos":["yuweihao/KERN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/linknet-relational-embedding-for-scene-graph","slug":"linknet-relational-embedding-for-scene-graph","title":"LinkNet: Relational Embedding for Scene Graph","date":"2018-11-15","arxiv_id":"1811.06410","repositories_listed":3,"syntology":null},{"url":"/paper/graph-r-cnn-for-scene-graph-generation","slug":"graph-r-cnn-for-scene-graph-generation","title":"Graph R-CNN for Scene Graph Generation","date":"2018-08-01","arxiv_id":"1808.00191","repositories_listed":3,"syntology":null},{"url":"/paper/graphrnn-generating-realistic-graphs-with","slug":"graphrnn-generating-realistic-graphs-with","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","date":"2018-02-24","arxiv_id":"1802.08773","repositories_listed":3,"syntology":{"n":19,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"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) · 11 unverified","sample_list":"/paper/graphrnn-generating-realistic-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1802.08773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.08773"}},"official":{"repos":["snap-stanford/GraphRNN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/pixels-to-graphs-by-associative-embedding","slug":"pixels-to-graphs-by-associative-embedding","title":"Pixels to Graphs by Associative Embedding","date":"2017-06-22","arxiv_id":"1706.07365","repositories_listed":3,"syntology":null},{"url":"/paper/discosg-towards-discourse-level-text-scene","slug":"discosg-towards-discourse-level-text-scene","title":"DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph Refinement","date":"2025-06-18","arxiv_id":"2506.15583","repositories_listed":2,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":9,"n_instrument":8,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":19,"phrase":"17 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; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/discosg-towards-discourse-level-text-scene#ran","syntology_url":"https://syntology.ai/paper/2506.15583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.15583"}},"official":{"repos":["shaoqlin/discosg"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/any-property-conditional-molecule-generation","slug":"any-property-conditional-molecule-generation","title":"Any-Property-Conditional Molecule Generation with Self-Criticism using Spanning Trees","date":"2024-07-12","arxiv_id":"2407.09357","repositories_listed":2,"syntology":null},{"url":"/paper/neural-graph-generator-feature-conditioned","slug":"neural-graph-generator-feature-conditioned","title":"Neural Graph Generator: Feature-Conditioned Graph Generation using Latent Diffusion Models","date":"2024-03-03","arxiv_id":"2403.01535","repositories_listed":2,"syntology":null},{"url":"/paper/graph-condensation-a-survey","slug":"graph-condensation-a-survey","title":"Graph Condensation: A Survey","date":"2024-01-22","arxiv_id":"2401.11720","repositories_listed":2,"syntology":null},{"url":"/paper/developing-a-scalable-benchmark-for-assessing","slug":"developing-a-scalable-benchmark-for-assessing","title":"Developing a Scalable Benchmark for Assessing Large Language Models in Knowledge Graph Engineering","date":"2023-08-31","arxiv_id":"2308.16622","repositories_listed":2,"syntology":null},{"url":"/paper/swingnn-rethinking-permutation-invariance-in","slug":"swingnn-rethinking-permutation-invariance-in","title":"SwinGNN: Rethinking Permutation Invariance in Diffusion Models for Graph Generation","date":"2023-07-04","arxiv_id":"2307.01646","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/swingnn-rethinking-permutation-invariance-in#ran","syntology_url":"https://syntology.ai/paper/2307.01646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.01646"}},"official":{"repos":["qiyan98/swingnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/manga109dialog-a-large-scale-dialogue-dataset","slug":"manga109dialog-a-large-scale-dialogue-dataset","title":"Manga109Dialog: A Large-scale Dialogue Dataset for Comics Speaker Detection","date":"2023-06-30","arxiv_id":"2306.17469","repositories_listed":2,"syntology":null},{"url":"/paper/learning-joint-2d-3d-diffusion-models-for","slug":"learning-joint-2d-3d-diffusion-models-for","title":"Learning Joint 2D & 3D Diffusion Models for Complete Molecule Generation","date":"2023-05-21","arxiv_id":"2305.12347","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/learning-joint-2d-3d-diffusion-models-for#ran","syntology_url":"https://syntology.ai/paper/2305.12347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12347"}},"official":{"repos":["graph-0/jodo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-generation-with-destination-driven","slug":"graph-generation-with-destination-driven","title":"Graph Generation with Diffusion Mixture","date":"2023-02-07","arxiv_id":"2302.03596","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-generation-with-destination-driven#ran","syntology_url":"https://syntology.ai/paper/2302.03596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03596"}},"official":{"repos":["harryjo97/drum","harryjo97/grum"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-node-outlier-detection-on-graphs","slug":"benchmarking-node-outlier-detection-on-graphs","title":"BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs","date":"2022-06-21","arxiv_id":"2206.10071","repositories_listed":2,"syntology":null},{"url":"/paper/robust-molecular-image-recognition-a-graph","slug":"robust-molecular-image-recognition-a-graph","title":"MolScribe: Robust Molecular Structure Recognition with Image-To-Graph Generation","date":"2022-05-28","arxiv_id":"2205.14311","repositories_listed":2,"syntology":null},{"url":"/paper/fine-grained-scene-graph-generation-with-data","slug":"fine-grained-scene-graph-generation-with-data","title":"Fine-Grained Scene Graph Generation with Data Transfer","date":"2022-03-22","arxiv_id":"2203.11654","repositories_listed":2,"syntology":null},{"url":"/paper/score-based-generative-modeling-of-graphs-via","slug":"score-based-generative-modeling-of-graphs-via","title":"Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations","date":"2022-02-05","arxiv_id":"2202.02514","repositories_listed":2,"syntology":{"n":26,"n_ran":14,"n_constructed":3,"n_ran_checked":7,"n_instrument":7,"n_unverified":12,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":13,"phrase":"14 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/score-based-generative-modeling-of-graphs-via#ran","syntology_url":"https://syntology.ai/paper/2202.02514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02514"}},"official":{"repos":["harryjo97/gdss"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/outlining-and-filling-hierarchical-query","slug":"outlining-and-filling-hierarchical-query","title":"Outlining and Filling: Hierarchical Query Graph Generation for Answering Complex Questions over Knowledge Graphs","date":"2021-11-01","arxiv_id":"2111.00732","repositories_listed":2,"syntology":null},{"url":"/paper/multiresolution-graph-variational-autoencoder","slug":"multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","arxiv_id":"2106.00967","repositories_listed":2,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multiresolution-graph-variational-autoencoder#ran","syntology_url":"https://syntology.ai/paper/2106.00967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00967"}},"official":{"repos":["hytruongson/mgvae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/learning-and-reasoning-with-the-graph","slug":"learning-and-reasoning-with-the-graph","title":"Learning and Reasoning with the Graph Structure Representation in Robotic Surgery","date":"2020-07-07","arxiv_id":"2007.03357","repositories_listed":2,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"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) · 7 unverified","sample_list":"/paper/learning-and-reasoning-with-the-graph#ran","syntology_url":"https://syntology.ai/paper/2007.03357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03357"}},"official":{"repos":["mobarakol/Surgical_SceneGraph_Generation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/gpt-gnn-generative-pre-training-of-graph","slug":"gpt-gnn-generative-pre-training-of-graph","title":"GPT-GNN: Generative Pre-Training of Graph Neural Networks","date":"2020-06-27","arxiv_id":"2006.15437","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 4 unverified","sample_list":"/paper/gpt-gnn-generative-pre-training-of-graph#ran","syntology_url":"https://syntology.ai/paper/2006.15437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15437"}},"official":{"repos":["acbull/GPT-GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-visual-commonsense-for-robust-scene","slug":"learning-visual-commonsense-for-robust-scene","title":"Learning Visual Commonsense for Robust Scene Graph Generation","date":"2020-06-17","arxiv_id":"2006.09623","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"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; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-visual-commonsense-for-robust-scene#ran","syntology_url":"https://syntology.ai/paper/2006.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09623"}},"official":null}},{"url":"/paper/moflow-an-invertible-flow-model-for","slug":"moflow-an-invertible-flow-model-for","title":"MoFlow: An Invertible Flow Model for Generating Molecular Graphs","date":"2020-06-17","arxiv_id":"2006.10137","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/moflow-an-invertible-flow-model-for#ran","syntology_url":"https://syntology.ai/paper/2006.10137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10137"}},"official":{"repos":["calvin-zcx/moflow"],"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/cyclegt-unsupervised-graph-to-text-and-text","slug":"cyclegt-unsupervised-graph-to-text-and-text","title":"CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training","date":"2020-06-08","arxiv_id":"2006.04702","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cyclegt-unsupervised-graph-to-text-and-text#ran","syntology_url":"https://syntology.ai/paper/2006.04702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04702"}},"official":{"repos":["QipengGuo/CycleGT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hierarchical-generation-of-molecular-graphs","slug":"hierarchical-generation-of-molecular-graphs","title":"Hierarchical Generation of Molecular Graphs using Structural Motifs","date":"2020-02-08","arxiv_id":"2002.03230","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-graph-generation-with-graph","slug":"efficient-graph-generation-with-graph","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","date":"2019-10-02","arxiv_id":"1910.00760","repositories_listed":2,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 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; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/efficient-graph-generation-with-graph#ran","syntology_url":"https://syntology.ai/paper/1910.00760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00760"}},"official":{"repos":["lrjconan/GRAN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-graphs-from-motion-vgfm-scene","slug":"visual-graphs-from-motion-vgfm-scene","title":"Visual Graphs from Motion (VGfM): Scene understanding with object geometry reasoning","date":"2018-07-16","arxiv_id":"1807.05933","repositories_listed":2,"syntology":null},{"url":"/paper/graph-convolutional-policy-network-for-goal","slug":"graph-convolutional-policy-network-for-goal","title":"Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generation","date":"2018-06-07","arxiv_id":"1806.02473","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"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) · 7 unverified","sample_list":"/paper/graph-convolutional-policy-network-for-goal#ran","syntology_url":"https://syntology.ai/paper/1806.02473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02473"}},"official":{"repos":["bowenliu16/rl_graph_generation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/netgan-generating-graphs-via-random-walks","slug":"netgan-generating-graphs-via-random-walks","title":"NetGAN: Generating Graphs via Random Walks","date":"2018-03-02","arxiv_id":"1803.00816","repositories_listed":2,"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":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) · 3 unverified","sample_list":"/paper/netgan-generating-graphs-via-random-walks#ran","syntology_url":"https://syntology.ai/paper/1803.00816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.00816"}},"official":null}},{"url":"/paper/gnn-cnn-an-efficient-hybrid-model-of-1","slug":"gnn-cnn-an-efficient-hybrid-model-of-1","title":"GNN-CNN: An Efficient Hybrid Model of Convolutional and Graph Neural Networks for Text Representation","date":"2025-07-10","arxiv_id":"2507.07414","repositories_listed":1,"syntology":null},{"url":"/paper/gdgb-a-benchmark-for-generative-dynamic-text","slug":"gdgb-a-benchmark-for-generative-dynamic-text","title":"GDGB: A Benchmark for Generative Dynamic Text-Attributed Graph Learning","date":"2025-07-04","arxiv_id":"2507.03267","repositories_listed":1,"syntology":null},{"url":"/paper/open-world-scene-graph-generation-using","slug":"open-world-scene-graph-generation-using","title":"Open World Scene Graph Generation using Vision Language Models","date":"2025-06-09","arxiv_id":"2506.08189","repositories_listed":1,"syntology":null},{"url":"/paper/egoexor-an-ego-exo-centric-operating-room","slug":"egoexor-an-ego-exo-centric-operating-room","title":"EgoExOR: An Ego-Exo-Centric Operating Room Dataset for Surgical Activity Understanding","date":"2025-05-30","arxiv_id":"2505.24287","repositories_listed":1,"syntology":null},{"url":"/paper/directed-graph-grammars-for-sequence-based","slug":"directed-graph-grammars-for-sequence-based","title":"Directed Graph Grammars for Sequence-based Learning","date":"2025-05-29","arxiv_id":"2505.22949","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/directed-graph-grammars-for-sequence-based#ran","syntology_url":"https://syntology.ai/paper/2505.22949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.22949"}},"official":{"repos":["shiningsunnyday/induction"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/llm-meets-scene-graph-can-large-language","slug":"llm-meets-scene-graph-can-large-language","title":"LLM Meets Scene Graph: Can Large Language Models Understand and Generate Scene Graphs? A Benchmark and Empirical Study","date":"2025-05-26","arxiv_id":"2505.19510","repositories_listed":1,"syntology":null},{"url":"/paper/gcal-adapting-graph-models-to-evolving-domain","slug":"gcal-adapting-graph-models-to-evolving-domain","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","date":"2025-05-22","arxiv_id":"2505.16860","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":1,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gcal-adapting-graph-models-to-evolving-domain#ran","syntology_url":"https://syntology.ai/paper/2505.16860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16860"}},"official":{"repos":["joe817/gcal"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scenir-visual-semantic-clarity-through","slug":"scenir-visual-semantic-clarity-through","title":"SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval","date":"2025-05-21","arxiv_id":"2505.15867","repositories_listed":1,"syntology":null},{"url":"/paper/hbs-hardware-build-system-a-tcl-based-minimal","slug":"hbs-hardware-build-system-a-tcl-based-minimal","title":"HBS -- Hardware Build System: A Tcl-based, minimal common abstraction approach for build system for hardware designs","date":"2025-04-13","arxiv_id":"2504.09642","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-evaluation-of-large-vision","slug":"fine-grained-evaluation-of-large-vision","title":"Fine-Grained Evaluation of Large Vision-Language Models in Autonomous Driving","date":"2025-03-27","arxiv_id":"2503.21505","repositories_listed":1,"syntology":null},{"url":"/paper/diffvsgg-diffusion-driven-online-video-scene","slug":"diffvsgg-diffusion-driven-online-video-scene","title":"DIFFVSGG: Diffusion-Driven Online Video Scene Graph Generation","date":"2025-03-18","arxiv_id":"2503.13957","repositories_listed":1,"syntology":null},{"url":"/paper/mm-or-a-large-multimodal-operating-room","slug":"mm-or-a-large-multimodal-operating-room","title":"MM-OR: A Large Multimodal Operating Room Dataset for Semantic Understanding of High-Intensity Surgical Environments","date":"2025-03-04","arxiv_id":"2503.02579","repositories_listed":1,"syntology":null},{"url":"/paper/knowzrel-common-sense-knowledge-based-zero","slug":"knowzrel-common-sense-knowledge-based-zero","title":"KnowZRel: Common Sense Knowledge-based Zero-Shot Relationship Retrieval for Generalised Scene Graph Generation","date":"2025-02-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scale-free-graph-language-models","slug":"scale-free-graph-language-models","title":"Scale-Free Graph-Language Models","date":"2025-02-21","arxiv_id":"2502.15189","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-video-scene-graph","slug":"weakly-supervised-video-scene-graph","title":"Weakly Supervised Video Scene Graph Generation via Natural Language Supervision","date":"2025-02-21","arxiv_id":"2502.15370","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/weakly-supervised-video-scene-graph#ran","syntology_url":"https://syntology.ai/paper/2502.15370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15370"}},"official":{"repos":["rlqja1107/NL-VSGG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hog-diff-higher-order-guided-diffusion-for","slug":"hog-diff-higher-order-guided-diffusion-for","title":"HOG-Diff: Higher-Order Guided Diffusion for Graph Generation","date":"2025-02-06","arxiv_id":"2502.04308","repositories_listed":1,"syntology":null},{"url":"/paper/towards-fast-graph-generation-via","slug":"towards-fast-graph-generation-via","title":"Towards Fast Graph Generation via Autoregressive Noisy Filtration Modeling","date":"2025-02-04","arxiv_id":"2502.02415","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-fast-graph-generation-via#ran","syntology_url":"https://syntology.ai/paper/2502.02415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.02415"}},"official":{"repos":["borgwardtlab/anfm"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffgraph-heterogeneous-graph-diffusion-model","slug":"diffgraph-heterogeneous-graph-diffusion-model","title":"DiffGraph: Heterogeneous Graph Diffusion Model","date":"2025-01-04","arxiv_id":"2501.02313","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-probabilistic-framework-for-continuous","slug":"a-deep-probabilistic-framework-for-continuous","title":"A Deep Probabilistic Framework for Continuous Time Dynamic Graph Generation","date":"2024-12-20","arxiv_id":"2412.15582","repositories_listed":1,"syntology":null},{"url":"/paper/training-free-heterogeneous-graph","slug":"training-free-heterogeneous-graph","title":"Training-free Heterogeneous Graph Condensation via Data Selection","date":"2024-12-20","arxiv_id":"2412.16250","repositories_listed":1,"syntology":null},{"url":"/paper/relationfield-relate-anything-in-radiance","slug":"relationfield-relate-anything-in-radiance","title":"RelationField: Relate Anything in Radiance Fields","date":"2024-12-18","arxiv_id":"2412.13652","repositories_listed":1,"syntology":null},{"url":"/paper/ra-sgg-retrieval-augmented-scene-graph","slug":"ra-sgg-retrieval-augmented-scene-graph","title":"RA-SGG: Retrieval-Augmented Scene Graph Generation Framework via Multi-Prototype Learning","date":"2024-12-17","arxiv_id":"2412.12788","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ra-sgg-retrieval-augmented-scene-graph#ran","syntology_url":"https://syntology.ai/paper/2412.12788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12788"}},"official":{"repos":["KanghoonYoon/torch-rasgg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-as-realistic","slug":"large-language-models-as-realistic","title":"Large Language Models as Realistic Microservice Trace Generators","date":"2024-12-16","arxiv_id":"2502.17439","repositories_listed":1,"syntology":null},{"url":"/paper/multi-class-and-multi-task-strategies-for","slug":"multi-class-and-multi-task-strategies-for","title":"Multi-Class and Multi-Task Strategies for Neural Directed Link Prediction","date":"2024-12-14","arxiv_id":"2412.10895","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-federated-learning-for-semantic","slug":"benchmarking-federated-learning-for-semantic","title":"Benchmarking Federated Learning for Semantic Datasets: Federated Scene Graph Generation","date":"2024-12-11","arxiv_id":"2412.10436","repositories_listed":1,"syntology":null},{"url":"/paper/provision-programmatically-scaling-vision","slug":"provision-programmatically-scaling-vision","title":"ProVision: Programmatically Scaling Vision-centric Instruction Data for Multimodal Language Models","date":"2024-12-09","arxiv_id":"2412.07012","repositories_listed":1,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 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; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/provision-programmatically-scaling-vision#ran","syntology_url":"https://syntology.ai/paper/2412.07012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07012"}},"official":{"repos":["jieyuz2/provision"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/treeformer-single-view-plant-skeleton","slug":"treeformer-single-view-plant-skeleton","title":"TreeFormer: Single-view Plant Skeleton Estimation via Tree-constrained Graph Generation","date":"2024-11-25","arxiv_id":"2411.16132","repositories_listed":1,"syntology":null},{"url":"/paper/layerdag-a-layerwise-autoregressive-diffusion","slug":"layerdag-a-layerwise-autoregressive-diffusion","title":"LayerDAG: A Layerwise Autoregressive Diffusion Model for Directed Acyclic Graph Generation","date":"2024-11-04","arxiv_id":"2411.02322","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/layerdag-a-layerwise-autoregressive-diffusion#ran","syntology_url":"https://syntology.ai/paper/2411.02322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02322"}},"official":{"repos":["graph-com/layerdag"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-voxel-scene-graph-for-intracranial","slug":"federated-voxel-scene-graph-for-intracranial","title":"Federated Voxel Scene Graph for Intracranial Hemorrhage","date":"2024-11-01","arxiv_id":"2411.00578","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-twigs-with-loop-guidance-for","slug":"diffusion-twigs-with-loop-guidance-for","title":"Diffusion Twigs with Loop Guidance for Conditional Graph Generation","date":"2024-10-31","arxiv_id":"2410.24012","repositories_listed":1,"syntology":{"n":21,"n_ran":16,"n_constructed":0,"n_ran_checked":5,"n_instrument":11,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 11 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/diffusion-twigs-with-loop-guidance-for#ran","syntology_url":"https://syntology.ai/paper/2410.24012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.24012"}},"official":{"repos":["aalto-quml/diffusion_twigs"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-enrichment-of-the-quantum-cascade","slug":"semantic-enrichment-of-the-quantum-cascade","title":"Semantic Enrichment of the Quantum Cascade Laser Properties in Text- A Knowledge Graph Generation Approach","date":"2024-10-30","arxiv_id":"2410.22996","repositories_listed":1,"syntology":null},{"url":"/paper/situational-scene-graph-for-structured-human","slug":"situational-scene-graph-for-structured-human","title":"Situational Scene Graph for Structured Human-centric Situation Understanding","date":"2024-10-30","arxiv_id":"2410.22829","repositories_listed":1,"syntology":null},{"url":"/paper/scene-graph-generation-with-role-playing","slug":"scene-graph-generation-with-role-playing","title":"Scene Graph Generation with Role-Playing Large Language Models","date":"2024-10-20","arxiv_id":"2410.15364","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/scene-graph-generation-with-role-playing#ran","syntology_url":"https://syntology.ai/paper/2410.15364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15364"}},"official":{"repos":["guikunchen/sdsgg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-and-textual-graph-generation-via","slug":"dynamic-and-textual-graph-generation-via","title":"LLM-Based Multi-Agent Systems are Scalable Graph Generative Models","date":"2024-10-13","arxiv_id":"2410.09824","repositories_listed":1,"syntology":null},{"url":"/paper/narrative-of-thought-improving-temporal","slug":"narrative-of-thought-improving-temporal","title":"Narrative-of-Thought: Improving Temporal Reasoning of Large Language Models via Recounted Narratives","date":"2024-10-07","arxiv_id":"2410.05558","repositories_listed":1,"syntology":null},{"url":"/paper/defog-discrete-flow-matching-for-graph","slug":"defog-discrete-flow-matching-for-graph","title":"DeFoG: Discrete Flow Matching for Graph Generation","date":"2024-10-05","arxiv_id":"2410.04263","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":3,"n_honours":1,"n_violates":3,"n_no_contract":1,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 3 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/defog-discrete-flow-matching-for-graph#ran","syntology_url":"https://syntology.ai/paper/2410.04263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04263"}},"official":{"repos":["manuelmlmadeira/DeFoG"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-large-language-models-for-inverse","slug":"multimodal-large-language-models-for-inverse","title":"Multimodal Large Language Models for Inverse Molecular Design with Retrosynthetic Planning","date":"2024-10-05","arxiv_id":"2410.04223","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":2,"n_no_contract":1,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multimodal-large-language-models-for-inverse#ran","syntology_url":"https://syntology.ai/paper/2410.04223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04223"}},"official":{"repos":["liugangcode/Llamole"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/advancing-architectural-floorplan-design-with","slug":"advancing-architectural-floorplan-design-with","title":"GSDiff: Synthesizing Vector Floorplans via Geometry-enhanced Structural Graph Generation","date":"2024-08-29","arxiv_id":"2408.16258","repositories_listed":1,"syntology":null},{"url":"/paper/hygene-a-diffusion-based-hypergraph","slug":"hygene-a-diffusion-based-hypergraph","title":"HYGENE: A Diffusion-based Hypergraph Generation Method","date":"2024-08-29","arxiv_id":"2408.16457","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hygene-a-diffusion-based-hypergraph#ran","syntology_url":"https://syntology.ai/paper/2408.16457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16457"}},"official":{"repos":["DorianGailhard/HYGENE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/instruction-based-molecular-graph-generation","slug":"instruction-based-molecular-graph-generation","title":"Instruction-Based Molecular Graph Generation with Unified Text-Graph Diffusion Model","date":"2024-08-19","arxiv_id":"2408.09896","repositories_listed":1,"syntology":null},{"url":"/paper/voxel-scene-graph-for-intracranial-hemorrhage","slug":"voxel-scene-graph-for-intracranial-hemorrhage","title":"Voxel Scene Graph for Intracranial Hemorrhage","date":"2024-07-31","arxiv_id":"2407.21580","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-diversity-aware-prototype-based","slug":"semantic-diversity-aware-prototype-based","title":"Semantic Diversity-aware Prototype-based Learning for Unbiased Scene Graph Generation","date":"2024-07-22","arxiv_id":"2407.15396","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/semantic-diversity-aware-prototype-based#ran","syntology_url":"https://syntology.ai/paper/2407.15396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.15396"}},"official":{"repos":["jeonjaehyeong/dpl"],"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/openpsg-open-set-panoptic-scene-graph","slug":"openpsg-open-set-panoptic-scene-graph","title":"OpenPSG: Open-set Panoptic Scene Graph Generation via Large Multimodal Models","date":"2024-07-15","arxiv_id":"2407.11213","repositories_listed":1,"syntology":null},{"url":"/paper/a-fair-ranking-and-new-model-for-panoptic","slug":"a-fair-ranking-and-new-model-for-panoptic","title":"A Fair Ranking and New Model for Panoptic Scene Graph Generation","date":"2024-07-12","arxiv_id":"2407.09216","repositories_listed":1,"syntology":null},{"url":"/paper/3d-vessel-graph-generation-using-denoising","slug":"3d-vessel-graph-generation-using-denoising","title":"3D Vessel Graph Generation Using Denoising Diffusion","date":"2024-07-08","arxiv_id":"2407.05842","repositories_listed":1,"syntology":null},{"url":"/paper/ltlbench-towards-benchmarks-for-evaluating","slug":"ltlbench-towards-benchmarks-for-evaluating","title":"LTLBench: Towards Benchmarks for Evaluating Temporal Logic Reasoning in Large Language Models","date":"2024-07-07","arxiv_id":"2407.05434","repositories_listed":1,"syntology":null},{"url":"/paper/cascading-large-language-models-for-salient","slug":"cascading-large-language-models-for-salient","title":"Cascading Large Language Models for Salient Event Graph Generation","date":"2024-06-26","arxiv_id":"2406.18449","repositories_listed":1,"syntology":null},{"url":"/paper/generative-modelling-of-structurally","slug":"generative-modelling-of-structurally","title":"Generative Modelling of Structurally Constrained Graphs","date":"2024-06-25","arxiv_id":"2406.17341","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/generative-modelling-of-structurally#ran","syntology_url":"https://syntology.ai/paper/2406.17341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17341"}},"official":{"repos":["manuelmlmadeira/ConStruct"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/se-vgae-unsupervised-disentangled","slug":"se-vgae-unsupervised-disentangled","title":"SE-VGAE: Unsupervised Disentangled Representation Learning for Interpretable Architectural Layout Design Graph Generation","date":"2024-06-25","arxiv_id":"2406.17418","repositories_listed":1,"syntology":null},{"url":"/paper/input-conditioned-graph-generation-for","slug":"input-conditioned-graph-generation-for","title":"Input Conditioned Graph Generation for Language Agents","date":"2024-06-17","arxiv_id":"2406.11555","repositories_listed":1,"syntology":null},{"url":"/paper/skysensegpt-a-fine-grained-instruction-tuning","slug":"skysensegpt-a-fine-grained-instruction-tuning","title":"SkySenseGPT: A Fine-Grained Instruction Tuning Dataset and Model for Remote Sensing Vision-Language Understanding","date":"2024-06-14","arxiv_id":"2406.10100","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/skysensegpt-a-fine-grained-instruction-tuning#ran","syntology_url":"https://syntology.ai/paper/2406.10100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10100"}},"official":{"repos":["luo-z13/skysensegpt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}],"syntology_records":44,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":111,"papers_where_code_ran_first_page":"/task/graph-generation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":8,"url":"/task/graph-generation/papers/2","json":"/task/graph-generation/papers/2.json","rows":100},{"order":"archive","page":3,"of":8,"url":"/task/graph-generation/papers/3","json":"/task/graph-generation/papers/3.json","rows":100},{"order":"archive","page":4,"of":8,"url":"/task/graph-generation/papers/4","json":"/task/graph-generation/papers/4.json","rows":100},{"order":"archive","page":5,"of":8,"url":"/task/graph-generation/papers/5","json":"/task/graph-generation/papers/5.json","rows":100},{"order":"archive","page":6,"of":8,"url":"/task/graph-generation/papers/6","json":"/task/graph-generation/papers/6.json","rows":100},{"order":"archive","page":7,"of":8,"url":"/task/graph-generation/papers/7","json":"/task/graph-generation/papers/7.json","rows":100},{"order":"archive","page":8,"of":8,"url":"/task/graph-generation/papers/8","json":"/task/graph-generation/papers/8.json","rows":12},{"order":"ran","page":1,"of":2,"url":"/task/graph-generation/papers/ran/1","json":"/task/graph-generation/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/graph-generation/papers/ran/2","json":"/task/graph-generation/papers/ran/2.json","rows":11}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"c339cfdf459d3344b6e6acaf4f8ff8d1ac2fc6bb6402703843d68e58add64cdc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}