{"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/extract-images","entry":"extract_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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":2},"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":"2006.08877","arxiv_id_is_arxiv":true,"paper":"/paper/practical-quasi-newton-methods-for-training","title":"Practical Quasi-Newton Methods for Training Deep Neural Networks","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renyiryry/kbfgs_neurips2020_public","path":"datasets_utils.py","file_url":"https://github.com/renyiryry/kbfgs_neurips2020_public/blob/HEAD/datasets_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":"851f949555ae8ab8","code_sha256_prefix":"851f949555ae8ab8","mcp_get_code":{"code_sha256":"851f949555ae8ab8"}},{"arxiv_id":"1906.06307","arxiv_id_is_arxiv":true,"paper":"/paper/a-signal-propagation-perspective-for-pruning","title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"namhoonlee/spp-public","path":"spp/mnist.py","file_url":"https://github.com/namhoonlee/spp-public/blob/HEAD/spp/mnist.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":"dc6a20f23af74deb","code_sha256_prefix":"dc6a20f23af74deb","mcp_get_code":{"code_sha256":"dc6a20f23af74deb"}},{"arxiv_id":"1809.04157","arxiv_id_is_arxiv":true,"paper":"/paper/heated-up-softmax-embedding","title":"Heated-Up Softmax Embedding","date":"2018-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ColumbiaDVMM/Heated_Up_Softmax_Embedding","path":"tensorflow/mnist.py","file_url":"https://github.com/ColumbiaDVMM/Heated_Up_Softmax_Embedding/blob/HEAD/tensorflow/mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24b10f0c7a83f999","code_sha256_prefix":"24b10f0c7a83f999","mcp_get_code":{"code_sha256":"24b10f0c7a83f999"}},{"arxiv_id":"1809.02499","arxiv_id_is_arxiv":true,"paper":"/paper/mixup-as-locally-linear-out-of-manifold","title":"MixUp as Locally Linear Out-Of-Manifold Regularization","date":"2018-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SITE5039/AdaMixUp","path":"GitHub.AdaMixup.AAAI.MNIST.Cifar.py","file_url":"https://github.com/SITE5039/AdaMixUp/blob/HEAD/GitHub.AdaMixup.AAAI.MNIST.Cifar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SITE5039/AdaMixUp when it was checked","code_sha256":"6da4c3aa8c6bb48b","code_sha256_prefix":"6da4c3aa8c6bb48b","mcp_get_code":{"code_sha256":"6da4c3aa8c6bb48b"}},{"arxiv_id":"1803.01500","arxiv_id_is_arxiv":true,"paper":"/paper/memorization-precedes-generation-learning","title":"Memorization Precedes Generation: Learning Unsupervised GANs with Memory Networks","date":"2018-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whyjay/memoryGAN","path":"affmnist.py","file_url":"https://github.com/whyjay/memoryGAN/blob/HEAD/affmnist.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":"24b10f0c7a83f999","code_sha256_prefix":"24b10f0c7a83f999","mcp_get_code":{"code_sha256":"24b10f0c7a83f999"}},{"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":"Colonel-Hathi/CapsNet-Treemap-Perception-Trafficsign","path":"data_handler.py","file_url":"https://github.com/Colonel-Hathi/CapsNet-Treemap-Perception-Trafficsign/blob/HEAD/data_handler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0fa7ba2d6f1b5e7d","code_sha256_prefix":"0fa7ba2d6f1b5e7d","mcp_get_code":{"code_sha256":"0fa7ba2d6f1b5e7d"}},{"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":"ameliajimenez/capsule-networks-medical-data-challenges","path":"data_loader.py","file_url":"https://github.com/ameliajimenez/capsule-networks-medical-data-challenges/blob/HEAD/data_loader.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":"9ef54be9d13fc447","code_sha256_prefix":"9ef54be9d13fc447","mcp_get_code":{"code_sha256":"9ef54be9d13fc447"}}],"record_sha256":"fcbe465df17375391d0b5e246726fb66e0af88210060a455379cea2bc7b8a6d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}