{"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/f-2","entry":"F","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":8,"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":8,"n_samples_ran":5,"n_samples_constructed":2,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":3},"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":"2411.16162","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-patches-adversarial-attacks-via","title":"Sparse patches adversarial attacks via extrapolating point-wise information","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanemcovsky/sparsepatches","path":"attacks/SAHomotopy/attack.py","file_url":"https://github.com/yanemcovsky/sparsepatches/blob/HEAD/attacks/SAHomotopy/attack.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, yanemcovsky/sparsepatches when it was checked","code_sha256":"85a21969756306fa","code_sha256_prefix":"85a21969756306fa","mcp_get_code":{"code_sha256":"85a21969756306fa"}},{"arxiv_id":"2411.16162","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-patches-adversarial-attacks-via","title":"Sparse patches adversarial attacks via extrapolating point-wise information","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanemcovsky/sparsepatches","path":"attacks/SAHomotopy/attack.py","file_url":"https://github.com/yanemcovsky/sparsepatches/blob/HEAD/attacks/SAHomotopy/attack.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, yanemcovsky/sparsepatches when it was checked","code_sha256":"e2c5ff4fa9ef0826","code_sha256_prefix":"e2c5ff4fa9ef0826","mcp_get_code":{"code_sha256":"e2c5ff4fa9ef0826"}},{"arxiv_id":"2403.02648","arxiv_id_is_arxiv":true,"paper":"/paper/remove-that-square-root-a-new-efficient-scale","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nazya/kate","path":"logistic_regression/KATEscaleinvariance.py","file_url":"https://github.com/nazya/kate/blob/HEAD/logistic_regression/KATEscaleinvariance.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nazya/kate when it was checked","code_sha256":"341200895b76ef17","code_sha256_prefix":"341200895b76ef17","mcp_get_code":{"code_sha256":"341200895b76ef17"}},{"arxiv_id":"2310.18443","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-fuller-understanding-of-neurons-1","title":"Towards a fuller understanding of neurons with Clustered Compositional Explanations","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krlgroup/clustered-compositional-explanations","path":"src/heuristic_search.py","file_url":"https://github.com/krlgroup/clustered-compositional-explanations/blob/HEAD/src/heuristic_search.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":"77d55b4b5690d4e1","code_sha256_prefix":"77d55b4b5690d4e1","mcp_get_code":{"code_sha256":"77d55b4b5690d4e1"}},{"arxiv_id":"2303.12534","arxiv_id_is_arxiv":true,"paper":"/paper/inexact-iterative-numerical-linear-algebra","title":"Inexact iterative numerical linear algebra for neural network-based spectral estimation and rare-event prediction","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dinner-group/inexact-subspace-iteration","path":"MB_Model.py","file_url":"https://github.com/dinner-group/inexact-subspace-iteration/blob/HEAD/MB_Model.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":"4b2aa3ee6acddaad","code_sha256_prefix":"4b2aa3ee6acddaad","mcp_get_code":{"code_sha256":"4b2aa3ee6acddaad"}},{"arxiv_id":"2210.16709","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-computational-imaging-for","title":"Data-Driven Computational Imaging for Scientific Discovery","date":"2022-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vganapati/LED_PVAE","path":"SyntheticMNIST_functions.py","file_url":"https://github.com/vganapati/LED_PVAE/blob/HEAD/SyntheticMNIST_functions.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":"2bf6026b29195dcd","code_sha256_prefix":"2bf6026b29195dcd","mcp_get_code":{"code_sha256":"2bf6026b29195dcd"}},{"arxiv_id":"2109.09032","arxiv_id_is_arxiv":true,"paper":"/paper/jem-improved-techniques-for-training-jem","title":"JEM++: Improved Techniques for Training JEM","date":"2021-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sndnyang/JEMPP","path":"models/jem_models.py","file_url":"https://github.com/sndnyang/JEMPP/blob/HEAD/models/jem_models.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, sndnyang/JEMPP when it was checked","code_sha256":"ff24f04c816925e4","code_sha256_prefix":"ff24f04c816925e4","mcp_get_code":{"code_sha256":"ff24f04c816925e4"}},{"arxiv_id":"2106.06027","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-and-imperceptible-adversarial-attack","title":"Sparse and Imperceptible Adversarial Attack via a Homotopy Algorithm","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/SparseADV_Homotopy","path":"demo_attack.py","file_url":"https://github.com/VITA-Group/SparseADV_Homotopy/blob/HEAD/demo_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 yanemcovsky/sparsepatches, and GitHub detected no licence in that repository when it was checked","code_sha256":"e2c5ff4fa9ef0826","code_sha256_prefix":"e2c5ff4fa9ef0826","mcp_get_code":{"code_sha256":"e2c5ff4fa9ef0826"}},{"arxiv_id":"2006.14154","arxiv_id_is_arxiv":true,"paper":"/paper/strictly-batch-imitation-learning-by-energy","title":"Strictly Batch Imitation Learning by Energy-based Distribution Matching","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wgrathwohl/JEM","path":"train_wrn_ebm.py","file_url":"https://github.com/wgrathwohl/JEM/blob/HEAD/train_wrn_ebm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4985cbdb3ad39e8c","code_sha256_prefix":"4985cbdb3ad39e8c","mcp_get_code":{"code_sha256":"4985cbdb3ad39e8c"}}],"record_sha256":"08454fc80e0e8892cc743651001cc90d630a13ea67d3a392aca67ea66c07e977","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}