{"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/vector-graphics/papers/ran/1","list_of":"/task/vector-graphics","task":"Vector Graphics","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,15],"of":15,"counts":{"archive_papers_tagged":88,"with_a_code_link":37,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":88,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/vector-graphics/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/neuralsvg-an-implicit-representation-for-text","slug":"neuralsvg-an-implicit-representation-for-text","title":"NeuralSVG: An Implicit Representation for Text-to-Vector Generation","date":"2025-01-07","arxiv_id":"2501.03992","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/neuralsvg-an-implicit-representation-for-text#ran","syntology_url":"https://syntology.ai/paper/2501.03992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.03992"}},"official":null}},{"url":"/paper/segmentation-guided-layer-wise-image","slug":"segmentation-guided-layer-wise-image","title":"Segmentation-guided Layer-wise Image Vectorization with Gradient Fills","date":"2024-08-28","arxiv_id":"2408.15741","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/segmentation-guided-layer-wise-image#ran","syntology_url":"https://syntology.ai/paper/2408.15741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15741"}},"official":{"repos":["Rhacoal/SGLIVE"],"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/vgbench-evaluating-large-language-models-on","slug":"vgbench-evaluating-large-language-models-on","title":"VGBench: Evaluating Large Language Models on Vector Graphics Understanding and Generation","date":"2024-07-15","arxiv_id":"2407.10972","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":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/vgbench-evaluating-large-language-models-on#ran","syntology_url":"https://syntology.ai/paper/2407.10972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10972"}},"official":{"repos":["vgbench/VGBench"],"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/svgeditbench-a-benchmark-dataset-for","slug":"svgeditbench-a-benchmark-dataset-for","title":"SVGEditBench: A Benchmark Dataset for Quantitative Assessment of LLM's SVG Editing Capabilities","date":"2024-04-21","arxiv_id":"2404.13710","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/svgeditbench-a-benchmark-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2404.13710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13710"}},"official":{"repos":["mti-lab/svgeditbench"],"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/svgcraft-beyond-single-object-text-to-svg","slug":"svgcraft-beyond-single-object-text-to-svg","title":"SVGCraft: Beyond Single Object Text-to-SVG Synthesis with Comprehensive Canvas Layout","date":"2024-03-30","arxiv_id":"2404.00412","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 2 unverified","sample_list":"/paper/svgcraft-beyond-single-object-text-to-svg#ran","syntology_url":"https://syntology.ai/paper/2404.00412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00412"}},"official":{"repos":["ayanban011/svgcraft"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/symbol-as-points-panoptic-symbol-spotting-via","slug":"symbol-as-points-panoptic-symbol-spotting-via","title":"Symbol as Points: Panoptic Symbol Spotting via Point-based Representation","date":"2024-01-19","arxiv_id":"2401.10556","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/symbol-as-points-panoptic-symbol-spotting-via#ran","syntology_url":"https://syntology.ai/paper/2401.10556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10556"}},"official":{"repos":["nicehuster/sympoint"],"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":["official"]}}},{"url":"/paper/svgdreamer-text-guided-svg-generation-with","slug":"svgdreamer-text-guided-svg-generation-with","title":"SVGDreamer: Text Guided SVG Generation with Diffusion Model","date":"2023-12-27","arxiv_id":"2312.16476","repositories_listed":4,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/svgdreamer-text-guided-svg-generation-with#ran","syntology_url":"https://syntology.ai/paper/2312.16476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16476"}},"official":{"repos":["ximinng/SVGDreamer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/automatikz-text-guided-synthesis-of","slug":"automatikz-text-guided-synthesis-of","title":"AutomaTikZ: Text-Guided Synthesis of Scientific Vector Graphics with TikZ","date":"2023-09-30","arxiv_id":"2310.00367","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/automatikz-text-guided-synthesis-of#ran","syntology_url":"https://syntology.ai/paper/2310.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00367"}},"official":{"repos":["potamides/automatikz"],"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/housediffusion-vector-floorplan-generation","slug":"housediffusion-vector-floorplan-generation","title":"HouseDiffusion: Vector Floorplan Generation via a Diffusion Model with Discrete and Continuous Denoising","date":"2022-11-23","arxiv_id":"2211.13287","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/housediffusion-vector-floorplan-generation#ran","syntology_url":"https://syntology.ai/paper/2211.13287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13287"}},"official":{"repos":["aminshabani/house_diffusion"],"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/gat-cadnet-graph-attention-network-for","slug":"gat-cadnet-graph-attention-network-for","title":"GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings","date":"2022-01-03","arxiv_id":"2201.00625","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gat-cadnet-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/2201.00625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.00625"}},"official":null}},{"url":"/paper/recognizing-vector-graphics-without","slug":"recognizing-vector-graphics-without","title":"Recognizing Vector Graphics without Rasterization","date":"2021-11-05","arxiv_id":"2111.03281","repositories_listed":2,"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":3,"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/recognizing-vector-graphics-without#ran","syntology_url":"https://syntology.ai/paper/2111.03281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03281"}},"official":{"repos":["microsoft/YOLaT-VectorGraphicsRecognition"],"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":["listed","official"]}}},{"url":"/paper/deepsvg-a-hierarchical-generative-network-for","slug":"deepsvg-a-hierarchical-generative-network-for","title":"DeepSVG: A Hierarchical Generative Network for Vector Graphics Animation","date":"2020-07-22","arxiv_id":"2007.11301","repositories_listed":2,"syntology":{"n":25,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":20,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/deepsvg-a-hierarchical-generative-network-for#ran","syntology_url":"https://syntology.ai/paper/2007.11301","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11301"}},"official":{"repos":["alexandre01/deepsvg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":20,"ran_from_kinds":["official"]}}},{"url":"/paper/uv-net-learning-from-curve-networks-and","slug":"uv-net-learning-from-curve-networks-and","title":"UV-Net: Learning from Boundary Representations","date":"2020-06-18","arxiv_id":"2006.10211","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uv-net-learning-from-curve-networks-and#ran","syntology_url":"https://syntology.ai/paper/2006.10211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10211"}},"official":{"repos":["AutodeskAILab/UV-Net"],"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/a-learned-representation-for-scalable-vector","slug":"a-learned-representation-for-scalable-vector","title":"A Learned Representation for Scalable Vector Graphics","date":"2019-04-04","arxiv_id":"1904.02632","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 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) · 3 unverified","sample_list":"/paper/a-learned-representation-for-scalable-vector#ran","syntology_url":"https://syntology.ai/paper/1904.02632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02632"}},"official":null}},{"url":"/paper/floornet-a-unified-framework-for-floorplan","slug":"floornet-a-unified-framework-for-floorplan","title":"FloorNet: A Unified Framework for Floorplan Reconstruction from 3D Scans","date":"2018-03-31","arxiv_id":"1804.00090","repositories_listed":2,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/floornet-a-unified-framework-for-floorplan#ran","syntology_url":"https://syntology.ai/paper/1804.00090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00090"}},"official":{"repos":["art-programmer/FloorNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":8,"ran_from_kinds":["official"]}}}],"record_sha256":"20530ce215e4d302f9c03362decd4d3c4480b0261ed9b8bbbf18e7405e45b0de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}