{"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/product","entry":"product","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":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":5,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":2},"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":"2410.21341","paper":"/paper/retrieval-retro-retrieval-based-inorganic","title":"Retrieval-Retro: Retrieval-based Inorganic Retrosynthesis with Expert Knowledge","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HeewoongNoh/Retrieval-Retro","path":"utils_main.py","file_url":"https://github.com/HeewoongNoh/Retrieval-Retro/blob/HEAD/utils_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c34779f9f740c600","mcp_get_code":{"code_sha256":"c34779f9f740c600"}},{"arxiv_id":"2409.05816","paper":"/paper/improving-pretraining-data-using-perplexity","title":"Improving Pretraining Data Using Perplexity Correlations","date":"2024-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TristanThrush/perplexity-correlations","path":"perplexity_correlations/estimation/estimation_functions.py","file_url":"https://github.com/TristanThrush/perplexity-correlations/blob/HEAD/perplexity_correlations/estimation/estimation_functions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"25eaf0b8738340d5","mcp_get_code":{"code_sha256":"25eaf0b8738340d5"}},{"arxiv_id":"2309.03060","paper":"/paper/cola-exploiting-compositional-structure-for","title":"CoLA: Exploiting Compositional Structure for Automatic and Efficient Numerical Linear Algebra","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wilson-labs/cola","path":"cola/ops/operators.py","file_url":"https://github.com/wilson-labs/cola/blob/HEAD/cola/ops/operators.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"18ed40676168eff9","mcp_get_code":{"code_sha256":"18ed40676168eff9"}},{"arxiv_id":"2002.09579","paper":"/paper/robustness-to-programmable-string","title":"Robustness to Programmable String Transformations via Augmented Abstract Training","date":"2020-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ForeverZyh/A3T","path":"a3t/diffai/components.py","file_url":"https://github.com/ForeverZyh/A3T/blob/HEAD/a3t/diffai/components.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"92e628e2d5712cd5","mcp_get_code":{"code_sha256":"92e628e2d5712cd5"}},{"arxiv_id":"1804.10829","paper":"/paper/formal-security-analysis-of-neural-networks","title":"Formal Security Analysis of Neural Networks using Symbolic Intervals","date":"2018-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pauls658/ReluDiff-ICSE2020-Artifact","path":"eran/tf_verify/read_net_file.py","file_url":"https://github.com/pauls658/ReluDiff-ICSE2020-Artifact/blob/HEAD/eran/tf_verify/read_net_file.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":"96cf9fddb9aeb8a0","mcp_get_code":{"code_sha256":"96cf9fddb9aeb8a0"}}]}