{"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":"/code/parse-comma-separated-list","entry":"parse_comma_separated_list","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":14,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":14,"n_places_pointer_only_link_open":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2502.06349","arxiv_id_is_arxiv":true,"paper":"/paper/provably-near-optimal-federated-ensemble","title":"Provably Near-Optimal Federated Ensemble Distillation with Negligible Overhead","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/stylegan-xl","path":"calc_metrics.py","file_url":"https://github.com/autonomousvision/stylegan-xl/blob/HEAD/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nv-tlabs/GET3D, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2409.09867","arxiv_id_is_arxiv":true,"paper":"/paper/towards-kinetic-manipulation-of-the-latent","title":"Towards Kinetic Manipulation of the Latent Space","date":"2024-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PDillis/stylegan3-fun","path":"calc_metrics.py","file_url":"https://github.com/PDillis/stylegan3-fun/blob/HEAD/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, PDillis/stylegan3-fun when it was checked","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2407.19451","arxiv_id_is_arxiv":true,"paper":"/paper/textsc-perm-a-parametric-representation-for","title":"Perm: A Parametric Representation for Multi-Style 3D Hair Modeling","date":"2024-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2406.02968","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-generation-of-hierarchical","title":"GSGAN: Adversarial Learning for Hierarchical Generation of 3D Gaussian Splats","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model","path":"calc_metrics.py","file_url":"https://github.com/hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model/blob/HEAD/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model when it was checked","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2311.17857","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-shell-maps-for-efficient-3d-human","title":"Gaussian Shell Maps for Efficient 3D Human Generation","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computational-imaging/GSM","path":"main/gsm/calc_metrics.py","file_url":"https://github.com/computational-imaging/GSM/blob/HEAD/main/gsm/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, computational-imaging/GSM when it was checked","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2311.08403","arxiv_id_is_arxiv":true,"paper":"/paper/instant3d-instant-text-to-3d-generation","title":"Instant3D: Instant Text-to-3D Generation","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ming1993li/instant3dcodes","path":"calc_metrics.py","file_url":"https://github.com/ming1993li/instant3dcodes/blob/HEAD/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nv-tlabs/GET3D, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2306.04675","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhendong-Wang/Diffusion-GAN","path":"diffusion-projected-gan/calc_metrics.py","file_url":"https://github.com/Zhendong-Wang/Diffusion-GAN/blob/HEAD/diffusion-projected-gan/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nv-tlabs/GET3D, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2303.08133","arxiv_id_is_arxiv":true,"paper":"/paper/meshdiffusion-score-based-generative-3d-mesh","title":"MeshDiffusion: Score-based Generative 3D Mesh Modeling","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2212.09877","arxiv_id_is_arxiv":true,"paper":"/paper/layoutdetr-detection-transformer-is-a-good","title":"LayoutDETR: Detection Transformer Is a Good Multimodal Layout Designer","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2211.11208","arxiv_id_is_arxiv":true,"paper":"/paper/next3d-generative-neural-texture","title":"Next3D: Generative Neural Texture Rasterization for 3D-Aware Head Avatars","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2209.11163","arxiv_id_is_arxiv":true,"paper":"/paper/get3d-a-generative-model-of-high-quality-3d","title":"GET3D: A Generative Model of High Quality 3D Textured Shapes Learned from Images","date":"2022-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nv-tlabs/GET3D","path":"train_3d.py","file_url":"https://github.com/nv-tlabs/GET3D/blob/HEAD/train_3d.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nv-tlabs/GET3D (NOASSERTION)","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2206.07695","arxiv_id_is_arxiv":true,"paper":"/paper/voxgraf-fast-3d-aware-image-synthesis-with","title":"VoxGRAF: Fast 3D-Aware Image Synthesis with Sparse Voxel Grids","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/voxgraf","path":"calc_metrics.py","file_url":"https://github.com/autonomousvision/voxgraf/blob/HEAD/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nv-tlabs/GET3D, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2202.00273","arxiv_id_is_arxiv":true,"paper":"/paper/stylegan-xl-scaling-stylegan-to-large-diverse","title":"StyleGAN-XL: Scaling StyleGAN to Large Diverse Datasets","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/stylegan_xl","path":"calc_metrics.py","file_url":"https://github.com/autonomousvision/stylegan_xl/blob/HEAD/calc_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nv-tlabs/GET3D, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}},{"arxiv_id":"2112.07945","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-geometry-aware-3d-generative","title":"Efficient Geometry-aware 3D Generative Adversarial Networks","date":"2021-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d01b68a634f71551","code_sha256_prefix":"d01b68a634f71551","mcp_get_code":{"code_sha256":"d01b68a634f71551"}}],"record_sha256":"39223dffe94c522f89cf99c5ce13b08b7ba746f1e32d32efe61638b43e61695c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}