{"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/maybe-download","entry":"maybe_download","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":10,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":9,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":2,"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":0,"ran":1,"unverified":8},"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":"2109.06379","arxiv_id_is_arxiv":true,"paper":"/paper/compression-transduction-and-creation-a","title":"Compression, Transduction, and Creation: A Unified Framework for Evaluating Natural Language Generation","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanyuqian/ctc-gen-eval","path":"ctc_score/download.py","file_url":"https://github.com/tanyuqian/ctc-gen-eval/blob/HEAD/ctc_score/download.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":"d84c734630bc36d8","code_sha256_prefix":"d84c734630bc36d8","mcp_get_code":{"code_sha256":"d84c734630bc36d8"}},{"arxiv_id":"2108.05009","arxiv_id_is_arxiv":true,"paper":"/paper/learning-deep-multimodal-feature","title":"Learning Deep Multimodal Feature Representation with Asymmetric Multi-layer Fusion","date":"2021-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikaiw/AsymFusion","path":"utils/helpers.py","file_url":"https://github.com/yikaiw/AsymFusion/blob/HEAD/utils/helpers.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":"5d35d232de98d91d","code_sha256_prefix":"5d35d232de98d91d","mcp_get_code":{"code_sha256":"5d35d232de98d91d"}},{"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":"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":"e8a8b04a07deed58","code_sha256_prefix":"e8a8b04a07deed58","mcp_get_code":{"code_sha256":"e8a8b04a07deed58"}},{"arxiv_id":"1806.01246","arxiv_id_is_arxiv":true,"paper":"/paper/ml-leaks-model-and-data-independent","title":"ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Models","date":"2018-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arafin-lab/model_inversion_experiments","path":"Utils/data_downloaders.py","file_url":"https://github.com/arafin-lab/model_inversion_experiments/blob/HEAD/Utils/data_downloaders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"331f25784ba59444","code_sha256_prefix":"331f25784ba59444","mcp_get_code":{"code_sha256":"331f25784ba59444"}},{"arxiv_id":"1803.10228","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-differentiable-programming","title":"Demystifying Differentiable Programming: Shift/Reset the Penultimate Backpropagator","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feiwang3311/Lantern","path":"src/out/PLDI19evaluation/generate_cifar10_data.py","file_url":"https://github.com/feiwang3311/Lantern/blob/HEAD/src/out/PLDI19evaluation/generate_cifar10_data.py","status":"unverified","verification_level":0,"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":"eb68e8019c421bbe","code_sha256_prefix":"eb68e8019c421bbe","mcp_get_code":{"code_sha256":"eb68e8019c421bbe"}},{"arxiv_id":"1611.01603","arxiv_id_is_arxiv":true,"paper":"/paper/bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmn-extracts/dcn_plus","path":"question_answering/preprocessing/squad_preprocess.py","file_url":"https://github.com/lmn-extracts/dcn_plus/blob/HEAD/question_answering/preprocessing/squad_preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lmn-extracts/dcn_plus when it was checked","code_sha256":"4839200676aaf471","code_sha256_prefix":"4839200676aaf471","mcp_get_code":{"code_sha256":"4839200676aaf471"}},{"arxiv_id":"1609.04938","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-markup-generation-with-coarse-to","title":"Image-to-Markup Generation with Coarse-to-Fine Attention","date":"2016-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jvpoulos/Attention-OCR","path":"src/model/data_utils.py","file_url":"https://github.com/jvpoulos/Attention-OCR/blob/HEAD/src/model/data_utils.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":"43ea785c6d00f3e4","code_sha256_prefix":"43ea785c6d00f3e4","mcp_get_code":{"code_sha256":"43ea785c6d00f3e4"}},{"arxiv_id":"1606.05250","arxiv_id_is_arxiv":true,"paper":"/paper/squad-100000-questions-for-machine","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","date":"2016-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"4839200676aaf471","code_sha256_prefix":"4839200676aaf471","mcp_get_code":{"code_sha256":"4839200676aaf471"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidsandberg/facenet","path":"tmp/mnist_center_loss.py","file_url":"https://github.com/davidsandberg/facenet/blob/HEAD/tmp/mnist_center_loss.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":"c60b093a5d17ebca","code_sha256_prefix":"c60b093a5d17ebca","mcp_get_code":{"code_sha256":"c60b093a5d17ebca"}},{"arxiv_id":"aaai_28047","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28047","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ksandeshk/LENS","path":"Flower/flower_input.py","file_url":"https://github.com/ksandeshk/LENS/blob/HEAD/Flower/flower_input.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":"93b364e33723ced3","code_sha256_prefix":"93b364e33723ced3","mcp_get_code":{"code_sha256":"93b364e33723ced3"}}],"record_sha256":"5bdf5d08dbde9b624b2cd8ceba0c8e5174caa7293a0d6aa563433fba522c5694","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}