{"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/memoize","entry":"memoize","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":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":8,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":6},"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":"2601.16849","paper":"/paper/arxiv-2601-16849","title":"The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"lumi-a/funsearch","path":"funsearch/memoize.py","file_url":"https://github.com/lumi-a/funsearch/blob/HEAD/funsearch/memoize.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":"7c2294af5708878f","mcp_get_code":{"code_sha256":"7c2294af5708878f"}},{"arxiv_id":"2311.08723","paper":"/paper/token-prediction-as-implicit-classification","title":"Token Prediction as Implicit Classification to Identify LLM-Generated Text","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markchenyutian/t5-sentinel-public","path":"memoizer/memoizer.py","file_url":"https://github.com/markchenyutian/t5-sentinel-public/blob/HEAD/memoizer/memoizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1a6fb91bef271314","mcp_get_code":{"code_sha256":"1a6fb91bef271314"}},{"arxiv_id":"2212.07347","paper":"/paper/lorentz-group-equivariant-autoencoders","title":"Lorentz group equivariant autoencoders","date":"2022-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zichunhao/lgn-autoencoder","path":"lgn/cg_lib/cg_dict.py","file_url":"https://github.com/zichunhao/lgn-autoencoder/blob/HEAD/lgn/cg_lib/cg_dict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"85dd44c534a83507","mcp_get_code":{"code_sha256":"85dd44c534a83507"}},{"arxiv_id":"2201.08484","paper":"/paper/iterated-reasoning-with-mutual-information-in-1","title":"Iterated Reasoning with Mutual Information in Cooperative and Byzantine Decentralized Teaming","date":"2022-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/pysc2","path":"pysc2/lib/memoize.py","file_url":"https://github.com/deepmind/pysc2/blob/HEAD/pysc2/lib/memoize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"1314ce1206a217e8","mcp_get_code":{"code_sha256":"1314ce1206a217e8"}},{"arxiv_id":"2010.03485","paper":"/paper/exact-symbolic-inference-in-probabilistic","title":"SPPL: Probabilistic Programming with Fast Exact Symbolic Inference","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probcomp/sppl","path":"src/spe.py","file_url":"https://github.com/probcomp/sppl/blob/HEAD/src/spe.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":"c085361f73a1d372","mcp_get_code":{"code_sha256":"c085361f73a1d372"}},{"arxiv_id":"1712.01208","paper":"/paper/the-case-for-learned-index-structures","title":"The Case for Learned Index Structures","date":"2017-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khalefa-phd/learned-indexes","path":"Trained_NN.py","file_url":"https://github.com/khalefa-phd/learned-indexes/blob/HEAD/Trained_NN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d57d1a24e1824fa","mcp_get_code":{"code_sha256":"7d57d1a24e1824fa"}},{"arxiv_id":"1011.3245","paper":"/paper/the-computational-complexity-of-linear-optics","title":"The Computational Complexity of Linear Optics","date":null,"month_inferred_from_arxiv_id":"2010-11","title_source":"archive","repo":"steinbrecher/bosonic","path":"bosonic/util.py","file_url":"https://github.com/steinbrecher/bosonic/blob/HEAD/bosonic/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b84c06d0cdfba50","mcp_get_code":{"code_sha256":"8b84c06d0cdfba50"}},{"arxiv_id":"ijcai2024_0286","paper":null,"title":"arXiv:ijcai2024_0286","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zhaoyaya1234/GRFTrajRec","path":"models/loss_fn.py","file_url":"https://github.com/zhaoyaya1234/GRFTrajRec/blob/HEAD/models/loss_fn.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":"94c5d80e4884cc10","mcp_get_code":{"code_sha256":"94c5d80e4884cc10"}}]}