{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/f-2","entry":"F","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":5},"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","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,"code_sha256_prefix":"85a21969756306fa","mcp_get_code":{"code_sha256":"85a21969756306fa"}},{"arxiv_id":"2411.16162","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,"code_sha256_prefix":"e2c5ff4fa9ef0826","mcp_get_code":{"code_sha256":"e2c5ff4fa9ef0826"}},{"arxiv_id":"2403.02648","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,"code_sha256_prefix":"341200895b76ef17","mcp_get_code":{"code_sha256":"341200895b76ef17"}},{"arxiv_id":"2310.18443","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,"code_sha256_prefix":"77d55b4b5690d4e1","mcp_get_code":{"code_sha256":"77d55b4b5690d4e1"}},{"arxiv_id":"2303.12534","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4b2aa3ee6acddaad","mcp_get_code":{"code_sha256":"4b2aa3ee6acddaad"}},{"arxiv_id":"2210.16709","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2bf6026b29195dcd","mcp_get_code":{"code_sha256":"2bf6026b29195dcd"}},{"arxiv_id":"2109.09032","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,"code_sha256_prefix":"ff24f04c816925e4","mcp_get_code":{"code_sha256":"ff24f04c816925e4"}},{"arxiv_id":"2106.06027","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":true,"code_sha256_prefix":"e2c5ff4fa9ef0826","mcp_get_code":{"code_sha256":"e2c5ff4fa9ef0826"}},{"arxiv_id":"2006.14154","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,"code_sha256_prefix":"4985cbdb3ad39e8c","mcp_get_code":{"code_sha256":"4985cbdb3ad39e8c"}}]}