{"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/simple-tokenize","entry":"simple_tokenize","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":4,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"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":"2606.07402","paper":"/paper/arxiv-2606-07402","title":"M 3 Exam: Benchmarking Multimodal Memory for Realistic User-Agent Interactions","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"WujiangXu/A-mem","path":"utils.py","file_url":"https://github.com/WujiangXu/A-mem/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48cea41b09d89a75","mcp_get_code":{"code_sha256":"48cea41b09d89a75"}},{"arxiv_id":"2604.22893","paper":"/paper/arxiv-2604-22893","title":"Utility-Aware Data Pricing: Token-Level Quality and Empirical Training Gain for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"BDS-SDU/utility-aware-data-pricing","path":"data_pricing/valuation.py","file_url":"https://github.com/BDS-SDU/utility-aware-data-pricing/blob/HEAD/data_pricing/valuation.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":"45ce145302c2df1b","mcp_get_code":{"code_sha256":"45ce145302c2df1b"}},{"arxiv_id":"2604.18349","paper":"/paper/arxiv-2604-18349","title":"HiGMem: A Hierarchical and LLM-Guided Memory System for Long-Term Conversational Agents","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ZeroLoss-Lab/HiGMem","path":"utils.py","file_url":"https://github.com/ZeroLoss-Lab/HiGMem/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48cea41b09d89a75","mcp_get_code":{"code_sha256":"48cea41b09d89a75"}},{"arxiv_id":"2502.12110","paper":"/paper/a-mem-agentic-memory-for-llm-agents","title":"A-MEM: Agentic Memory for LLM Agents","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agiresearch/a-mem","path":"agentic_memory/retrievers.py","file_url":"https://github.com/agiresearch/a-mem/blob/HEAD/agentic_memory/retrievers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef1bb1531a00b95c","mcp_get_code":{"code_sha256":"ef1bb1531a00b95c"}},{"arxiv_id":"1801.04354","paper":"/paper/black-box-generation-of-adversarial-text","title":"Black-box Generation of Adversarial Text Sequences to Evade Deep Learning Classifiers","date":"2018-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QData/deepWordBug","path":"attack_interactive.py","file_url":"https://github.com/QData/deepWordBug/blob/HEAD/attack_interactive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c7e51df2685092e8","mcp_get_code":{"code_sha256":"c7e51df2685092e8"}}]}