{"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/product","entry":"product","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":5,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":2,"unverified":0},"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":"2410.21341","arxiv_id_is_arxiv":true,"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":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, HeewoongNoh/Retrieval-Retro when it was checked","code_sha256":"c34779f9f740c600","code_sha256_prefix":"c34779f9f740c600","mcp_get_code":{"code_sha256":"c34779f9f740c600"}},{"arxiv_id":"2409.05816","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25eaf0b8738340d5","code_sha256_prefix":"25eaf0b8738340d5","mcp_get_code":{"code_sha256":"25eaf0b8738340d5"}},{"arxiv_id":"2309.03060","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18ed40676168eff9","code_sha256_prefix":"18ed40676168eff9","mcp_get_code":{"code_sha256":"18ed40676168eff9"}},{"arxiv_id":"2002.09579","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92e628e2d5712cd5","code_sha256_prefix":"92e628e2d5712cd5","mcp_get_code":{"code_sha256":"92e628e2d5712cd5"}},{"arxiv_id":"1804.10829","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"96cf9fddb9aeb8a0","code_sha256_prefix":"96cf9fddb9aeb8a0","mcp_get_code":{"code_sha256":"96cf9fddb9aeb8a0"}}],"record_sha256":"391b032a720bfd08d37fc49bda160562324e4c9f7640a6c35d93051283cc7bad","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}