{"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/combine-images","entry":"combine_images","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":3,"ran":3,"unverified":1},"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":"2605.10189","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10189","title":"ProteinOPD: Towards Effective and Efficient Preference Alignment for Protein Design","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ibmm-unibe-ch/TemBERTure","path":"dev/analysis/combine_images.py","file_url":"https://github.com/ibmm-unibe-ch/TemBERTure/blob/HEAD/dev/analysis/combine_images.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c86a95c957859f8f","code_sha256_prefix":"c86a95c957859f8f","mcp_get_code":{"code_sha256":"c86a95c957859f8f"}},{"arxiv_id":"2210.05846","arxiv_id_is_arxiv":true,"paper":"/paper/fasterrisk-fast-and-accurate-interpretable","title":"FasterRisk: Fast and Accurate Interpretable Risk Scores","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"interpretml/fasterrisk","path":"src/fasterrisk/score_visual.py","file_url":"https://github.com/interpretml/fasterrisk/blob/HEAD/src/fasterrisk/score_visual.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"44ff2c3c8bb7f519","code_sha256_prefix":"44ff2c3c8bb7f519","mcp_get_code":{"code_sha256":"44ff2c3c8bb7f519"}},{"arxiv_id":"2010.06627","arxiv_id_is_arxiv":true,"paper":"/paper/video-game-level-repair-via-mixed-integer","title":"Video Game Level Repair via Mixed Integer Linear Programming","date":"2020-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icaros-usc/milp_constrained_gan","path":"launchers/pacman_gan_training.py","file_url":"https://github.com/icaros-usc/milp_constrained_gan/blob/HEAD/launchers/pacman_gan_training.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, icaros-usc/milp_constrained_gan when it was checked","code_sha256":"33d201b3658d5fb8","code_sha256_prefix":"33d201b3658d5fb8","mcp_get_code":{"code_sha256":"33d201b3658d5fb8"}},{"arxiv_id":"2007.05674","arxiv_id_is_arxiv":true,"paper":"/paper/illuminating-mario-scenes-in-the-latent-space","title":"Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"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":"33d201b3658d5fb8","code_sha256_prefix":"33d201b3658d5fb8","mcp_get_code":{"code_sha256":"33d201b3658d5fb8"}},{"arxiv_id":"2004.01703","arxiv_id_is_arxiv":true,"paper":"/paper/cppn2gan-combining-compositional-pattern","title":"CPPN2GAN: Combining Compositional Pattern Producing Networks and GANs for Large-scale Pattern Generation","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"schrum2/GameGAN","path":"python/GAN/gan_optimize.py","file_url":"https://github.com/schrum2/GameGAN/blob/HEAD/python/GAN/gan_optimize.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4f2143dd41b49b1","code_sha256_prefix":"c4f2143dd41b49b1","mcp_get_code":{"code_sha256":"c4f2143dd41b49b1"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XifengGuo/CapsNet-Keras","path":"utils.py","file_url":"https://github.com/XifengGuo/CapsNet-Keras/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a4f9b362c3fb2a02","code_sha256_prefix":"a4f9b362c3fb2a02","mcp_get_code":{"code_sha256":"a4f9b362c3fb2a02"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshaikh2/GANs_Comparison","path":"capsule/utils.py","file_url":"https://github.com/mshaikh2/GANs_Comparison/blob/HEAD/capsule/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"889c715d11d8841d","code_sha256_prefix":"889c715d11d8841d","mcp_get_code":{"code_sha256":"889c715d11d8841d"}},{"arxiv_id":"1703.05921","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-anomaly-detection-with","title":"Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkwoo/anogan-keras","path":"anogan.py","file_url":"https://github.com/tkwoo/anogan-keras/blob/HEAD/anogan.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tkwoo/anogan-keras when it was checked","code_sha256":"23797f9dee43955f","code_sha256_prefix":"23797f9dee43955f","mcp_get_code":{"code_sha256":"23797f9dee43955f"}}],"record_sha256":"462677f5156d199835043c04a06fe4455bc1ff9e8fee1550f0417587cb580d43","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}