{"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/affine","entry":"affine","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":5,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":5,"n_samples_constructed":1,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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":"2606.08847","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-08847","title":"BLM-SGAN: Bidirectional Language Modeling for Semantic-Spatial Text-to-Image Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"haidy-maher/BLM-SGAN-Text-to-Image-Generation","path":"model.py","file_url":"https://github.com/haidy-maher/BLM-SGAN-Text-to-Image-Generation/blob/HEAD/model.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, haidy-maher/BLM-SGAN-Text-to-Image-Generation when it was checked","code_sha256":"8b25daf50650f980","code_sha256_prefix":"8b25daf50650f980","mcp_get_code":{"code_sha256":"8b25daf50650f980"}},{"arxiv_id":"2405.14077","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-transform-dynamically-for-better","title":"Learning to Transform Dynamically for Better Adversarial Transferability","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhangAIPI/TransferAttack","path":"transferattack/input_transformation/l2t.py","file_url":"https://github.com/ZhangAIPI/TransferAttack/blob/HEAD/transferattack/input_transformation/l2t.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76ec6ea1c611aa1b","code_sha256_prefix":"76ec6ea1c611aa1b","mcp_get_code":{"code_sha256":"76ec6ea1c611aa1b"}},{"arxiv_id":"2006.16495","arxiv_id_is_arxiv":true,"paper":"/paper/guarantees-for-tuning-the-step-size-using-a","title":"Guarantees for Tuning the Step Size using a Learning-to-Learn Approach","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kolin96/learning-to-learn","path":"optimizer/utils.py","file_url":"https://github.com/Kolin96/learning-to-learn/blob/HEAD/optimizer/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":"2dfc94f8071b57a4","code_sha256_prefix":"2dfc94f8071b57a4","mcp_get_code":{"code_sha256":"2dfc94f8071b57a4"}},{"arxiv_id":"2004.08013","arxiv_id_is_arxiv":true,"paper":"/paper/how-recurrent-networks-implement-contextual","title":"How recurrent networks implement contextual processing in sentiment analysis","date":"2020-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/computation-thru-dynamics","path":"integrator_rnn_tutorial/rnn.py","file_url":"https://github.com/google-research/computation-thru-dynamics/blob/HEAD/integrator_rnn_tutorial/rnn.py","status":"ran","verification_level":1,"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":"aced411c40f5de2f","code_sha256_prefix":"aced411c40f5de2f","mcp_get_code":{"code_sha256":"aced411c40f5de2f"}},{"arxiv_id":"2003.06814","arxiv_id_is_arxiv":true,"paper":"/paper/towards-privacy-protection-by-generating","title":"Towards Face Encryption by Generating Adversarial Identity Masks","date":"2020-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnxyang/tip-im","path":"input_diversify.py","file_url":"https://github.com/shawnxyang/tip-im/blob/HEAD/input_diversify.py","status":"ran","verification_level":1,"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":"00e18ccd3f1f30c4","code_sha256_prefix":"00e18ccd3f1f30c4","mcp_get_code":{"code_sha256":"00e18ccd3f1f30c4"}},{"arxiv_id":"1911.03221","arxiv_id_is_arxiv":true,"paper":"/paper/dreem-open-datasets-multi-scored-sleep","title":"Dreem Open Datasets: Multi-Scored Sleep Datasets to compare Human and Automated sleep staging","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dreem-Organization/dreem-learning-open","path":"dreem_learning_open/models/modulo_net/normalization.py","file_url":"https://github.com/Dreem-Organization/dreem-learning-open/blob/HEAD/dreem_learning_open/models/modulo_net/normalization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48b2a11244c8eec9","code_sha256_prefix":"48b2a11244c8eec9","mcp_get_code":{"code_sha256":"48b2a11244c8eec9"}},{"arxiv_id":"1805.10917","arxiv_id_is_arxiv":true,"paper":"/paper/deep-anomaly-detection-using-geometric","title":"Deep Anomaly Detection Using Geometric Transformations","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"izikgo/AnomalyDetectionTransformations","path":"intuition_experiments.py","file_url":"https://github.com/izikgo/AnomalyDetectionTransformations/blob/HEAD/intuition_experiments.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":"6ca23bed44fa5d14","code_sha256_prefix":"6ca23bed44fa5d14","mcp_get_code":{"code_sha256":"6ca23bed44fa5d14"}}],"record_sha256":"ca05d71d499f974e1ba5bae8ca797012dc306f757ed00ff11b02823cc7f4e7cb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}