{"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/dim","entry":"dim","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":5,"n_papers_ran":4,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":1},"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":"2608.25158","paper":"/paper/arxiv-2608-25158","title":"FuzzingBrain-Bench V1: Evaluating Open-Ended Bug Discovery by LLMs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"fuzzingbrain/FuzzingBrain-Bench","path":"fbbench/cli/console.py","file_url":"https://github.com/fuzzingbrain/FuzzingBrain-Bench/blob/HEAD/fbbench/cli/console.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ca491cc5d1be584e","mcp_get_code":{"code_sha256":"ca491cc5d1be584e"}},{"arxiv_id":"2605.22898","paper":"/paper/arxiv-2605-22898","title":"FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hedjrachid/FIRMA","path":"fibfl/fibfl.py","file_url":"https://github.com/Hedjrachid/FIRMA/blob/HEAD/fibfl/fibfl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a21c448c165d2e1f","mcp_get_code":{"code_sha256":"a21c448c165d2e1f"}},{"arxiv_id":"2405.14077","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":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a38c7f0ecdc2bb8","mcp_get_code":{"code_sha256":"7a38c7f0ecdc2bb8"}},{"arxiv_id":"1803.05449","paper":"/paper/senteval-an-evaluation-toolkit-for-universal","title":"SentEval: An Evaluation Toolkit for Universal Sentence Representations","date":"2018-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goel96vibhor/AdvSentEval","path":"examples/infersent.py","file_url":"https://github.com/goel96vibhor/AdvSentEval/blob/HEAD/examples/infersent.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"d3816cc60711a3b2","mcp_get_code":{"code_sha256":"d3816cc60711a3b2"}},{"arxiv_id":"1312.6680","paper":"/paper/faster-all-pairs-shortest-paths-via-circuit","title":"Faster all-pairs shortest paths via circuit complexity","date":null,"month_inferred_from_arxiv_id":"2013-12","title_source":"archive","repo":"JamesCraster/URSS-Subcubic-APSP","path":"RWilliamsAPSP.py","file_url":"https://github.com/JamesCraster/URSS-Subcubic-APSP/blob/HEAD/RWilliamsAPSP.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":"903fcf8483af0f7e","mcp_get_code":{"code_sha256":"903fcf8483af0f7e"}}]}