{"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/memory","entry":"Memory","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":19,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":15,"n_papers_ran_instrument_only":0,"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":22,"n_samples_ran":17,"n_samples_constructed":13,"n_samples_ran_checked":17,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":22,"n_places_pointer_only":15,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":17,"unverified":5},"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":"2503.08275","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-outlining-heterogeneous-recursive","title":"Beyond Outlining: Heterogeneous Recursive Planning for Adaptive Long-form Writing with Language Models","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"principia-ai/WriteHERE","path":"recursive/engine.py","file_url":"https://github.com/principia-ai/WriteHERE/blob/HEAD/recursive/engine.py","status":"ran","verification_level":1,"contract_check":null,"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, principia-ai/WriteHERE when it was checked","code_sha256":"f14d02e64873b84f","code_sha256_prefix":"f14d02e64873b84f","mcp_get_code":{"code_sha256":"f14d02e64873b84f"}},{"arxiv_id":"2501.10332","arxiv_id_is_arxiv":true,"paper":"/paper/agent4edu-generating-learner-response-data-by","title":"Agent4Edu: Generating Learner Response Data by Generative Agents for Intelligent Education Systems","date":"2025-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigdata-ustc/agent4edu","path":"Code/memory.py","file_url":"https://github.com/bigdata-ustc/agent4edu/blob/HEAD/Code/memory.py","status":"unverified","verification_level":0,"contract_check":null,"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, bigdata-ustc/agent4edu when it was checked","code_sha256":"df29466aa359b307","code_sha256_prefix":"df29466aa359b307","mcp_get_code":{"code_sha256":"df29466aa359b307"}},{"arxiv_id":"2309.00827","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-font-generation-via-transferring","title":"Few shot font generation via transferring similarity guided global style and quantization local style","date":"2023-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awei669/VQ-Font","path":"model/generator.py","file_url":"https://github.com/awei669/VQ-Font/blob/HEAD/model/generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8aa95f8d6107478a","code_sha256_prefix":"8aa95f8d6107478a","mcp_get_code":{"code_sha256":"8aa95f8d6107478a"}},{"arxiv_id":"2207.13353","arxiv_id_is_arxiv":true,"paper":"/paper/one-trimap-video-matting","title":"One-Trimap Video Matting","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hongje/OTVM","path":"models/trimap/model.py","file_url":"https://github.com/Hongje/OTVM/blob/HEAD/models/trimap/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Hongje/OTVM (NOASSERTION)","code_sha256":"d7ab2e79a07b4f46","code_sha256_prefix":"d7ab2e79a07b4f46","mcp_get_code":{"code_sha256":"d7ab2e79a07b4f46"}},{"arxiv_id":"2206.15369","arxiv_id_is_arxiv":true,"paper":"/paper/improving-the-generalization-of-supervised","title":"No Reason for No Supervision: Improved Generalization in Supervised Models","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/trex","path":"trex.py","file_url":"https://github.com/naver/trex/blob/HEAD/trex.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, naver/trex (NOASSERTION)","code_sha256":"970137f4cfb773bd","code_sha256_prefix":"970137f4cfb773bd","mcp_get_code":{"code_sha256":"970137f4cfb773bd"}},{"arxiv_id":"2204.01265","arxiv_id_is_arxiv":true,"paper":"/paper/multi-modality-associative-bridging-through-1","title":"Multi-modality Associative Bridging through Memory: Speech Sound Recollected from Face Video","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ms-dot-k/Visual-Audio-Memory","path":"src/models/memory.py","file_url":"https://github.com/ms-dot-k/Visual-Audio-Memory/blob/HEAD/src/models/memory.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ms-dot-k/Visual-Audio-Memory (NOASSERTION)","code_sha256":"d0a7a7a21b4d5d9a","code_sha256_prefix":"d0a7a7a21b4d5d9a","mcp_get_code":{"code_sha256":"d0a7a7a21b4d5d9a"}},{"arxiv_id":"2110.14074","arxiv_id_is_arxiv":true,"paper":"/paper/fault-tolerant-federated-reinforcement","title":"Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flint-xf-fan/Byzantine-Federeated-RL","path":"codes/agent.py","file_url":"https://github.com/flint-xf-fan/Byzantine-Federeated-RL/blob/HEAD/codes/agent.py","status":"ran","verification_level":1,"contract_check":null,"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, flint-xf-fan/Byzantine-Federeated-RL when it was checked","code_sha256":"3d6b44bc159e62bc","code_sha256_prefix":"3d6b44bc159e62bc","mcp_get_code":{"code_sha256":"3d6b44bc159e62bc"}},{"arxiv_id":"2109.11404","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-memory-matching-network-for","title":"Hierarchical Memory Matching Network for Video Object Segmentation","date":"2021-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hongje/HMMN","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"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, Hongje/HMMN when it was checked","code_sha256":"c73e4c9b0c5e54c7","code_sha256_prefix":"c73e4c9b0c5e54c7","mcp_get_code":{"code_sha256":"c73e4c9b0c5e54c7"}},{"arxiv_id":"2109.05490","arxiv_id_is_arxiv":true,"paper":"/paper/hyar-addressing-discrete-continuous-action","title":"HyAR: Addressing Discrete-Continuous Action Reinforcement Learning via Hybrid Action Representation","date":"2021-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cycraig/MP-DQN","path":"agents/pdqn.py","file_url":"https://github.com/cycraig/MP-DQN/blob/HEAD/agents/pdqn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c0ed95b8ea1a2ee","code_sha256_prefix":"5c0ed95b8ea1a2ee","mcp_get_code":{"code_sha256":"5c0ed95b8ea1a2ee"}},{"arxiv_id":"2108.08482","arxiv_id_is_arxiv":true,"paper":"/paper/vil-100-a-new-dataset-and-a-baseline-model","title":"VIL-100: A New Dataset and A Baseline Model for Video Instance Lane Detection","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yujun0-0/MMA-Net","path":"libs/models/STM.py","file_url":"https://github.com/yujun0-0/MMA-Net/blob/HEAD/libs/models/STM.py","status":"ran","verification_level":1,"contract_check":null,"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, yujun0-0/MMA-Net when it was checked","code_sha256":"a216e5479edc80f6","code_sha256_prefix":"a216e5479edc80f6","mcp_get_code":{"code_sha256":"a216e5479edc80f6"}},{"arxiv_id":"2105.03245","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-focus-for-efficient-video","title":"Adaptive Focus for Efficient Video Recognition","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blackfeather-wang/AdaFocus","path":"Experiments on ActivityNet, FCVID and Mini-Kinetics/models/gfv_net.py","file_url":"https://github.com/blackfeather-wang/AdaFocus/blob/HEAD/Experiments%20on%20ActivityNet%2C%20FCVID%20and%20Mini-Kinetics/models/gfv_net.py","status":"ran","verification_level":1,"contract_check":null,"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, blackfeather-wang/AdaFocus when it was checked","code_sha256":"6dab8592a6da4561","code_sha256_prefix":"6dab8592a6da4561","mcp_get_code":{"code_sha256":"6dab8592a6da4561"}},{"arxiv_id":"2104.00924","arxiv_id_is_arxiv":true,"paper":"/paper/video-prediction-recalling-long-term-motion","title":"Video Prediction Recalling Long-term Motion Context via Memory Alignment Learning","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangmin-git/LMC-Memory","path":"model.py","file_url":"https://github.com/sangmin-git/LMC-Memory/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sangmin-git/LMC-Memory (NOASSERTION)","code_sha256":"dded2f1ec50c63b0","code_sha256_prefix":"dded2f1ec50c63b0","mcp_get_code":{"code_sha256":"dded2f1ec50c63b0"}},{"arxiv_id":"2102.04604","arxiv_id_is_arxiv":true,"paper":"/paper/swiftnet-real-time-video-object-segmentation","title":"SwiftNet: Real-time Video Object Segmentation","date":"2021-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haochenheheda/SwiftNet","path":"swiftnet.py","file_url":"https://github.com/haochenheheda/SwiftNet/blob/HEAD/swiftnet.py","status":"unverified","verification_level":0,"contract_check":null,"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, haochenheheda/SwiftNet when it was checked","code_sha256":"a9fffc481b0aad9c","code_sha256_prefix":"a9fffc481b0aad9c","mcp_get_code":{"code_sha256":"a9fffc481b0aad9c"}},{"arxiv_id":"1802.06070","arxiv_id_is_arxiv":true,"paper":"/paper/diversity-is-all-you-need-learning-skills","title":"Diversity is All You Need: Learning Skills without a Reward Function","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alirezakazemipour/DIAYN-PyTorch","path":"Brain/agent.py","file_url":"https://github.com/alirezakazemipour/DIAYN-PyTorch/blob/HEAD/Brain/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9f1643b2317c893","code_sha256_prefix":"b9f1643b2317c893","mcp_get_code":{"code_sha256":"b9f1643b2317c893"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyuezhang/pyrl","path":"ppo/agent.py","file_url":"https://github.com/liuyuezhang/pyrl/blob/HEAD/ppo/agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"121aee63a1a24691","code_sha256_prefix":"121aee63a1a24691","mcp_get_code":{"code_sha256":"121aee63a1a24691"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zowiezhang/stas","path":"models/policy/COMA.py","file_url":"https://github.com/zowiezhang/stas/blob/HEAD/models/policy/COMA.py","status":"ran","verification_level":1,"contract_check":null,"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, zowiezhang/stas when it was checked","code_sha256":"51c877df80bace64","code_sha256_prefix":"51c877df80bace64","mcp_get_code":{"code_sha256":"51c877df80bace64"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KAIST-AILab/deeprl_practice_colab","path":"rllab/dqn/misc/memory_pool.py","file_url":"https://github.com/KAIST-AILab/deeprl_practice_colab/blob/HEAD/rllab/dqn/misc/memory_pool.py","status":"ran","verification_level":1,"contract_check":null,"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, KAIST-AILab/deeprl_practice_colab when it was checked","code_sha256":"4f033d771152e1b0","code_sha256_prefix":"4f033d771152e1b0","mcp_get_code":{"code_sha256":"4f033d771152e1b0"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utarumo/RL_implementation","path":"dqn_atari.py","file_url":"https://github.com/utarumo/RL_implementation/blob/HEAD/dqn_atari.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc87a7e1418f9bb3","code_sha256_prefix":"dc87a7e1418f9bb3","mcp_get_code":{"code_sha256":"dc87a7e1418f9bb3"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fshamshirdar/pytorch-rdpg","path":"rdpg.py","file_url":"https://github.com/fshamshirdar/pytorch-rdpg/blob/HEAD/rdpg.py","status":"ran","verification_level":1,"contract_check":null,"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, fshamshirdar/pytorch-rdpg when it was checked","code_sha256":"a5e014313403ae12","code_sha256_prefix":"a5e014313403ae12","mcp_get_code":{"code_sha256":"a5e014313403ae12"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xtma/simple-pytorch-rl","path":"ddpg.py","file_url":"https://github.com/xtma/simple-pytorch-rl/blob/HEAD/ddpg.py","status":"ran","verification_level":1,"contract_check":null,"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, xtma/simple-pytorch-rl when it was checked","code_sha256":"dc27eb092679d1d2","code_sha256_prefix":"dc27eb092679d1d2","mcp_get_code":{"code_sha256":"dc27eb092679d1d2"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mathformoso/RL-playground---ddpg","path":"DDPG.py","file_url":"https://github.com/mathformoso/RL-playground---ddpg/blob/HEAD/DDPG.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ccb0aa1ef035eb8e","code_sha256_prefix":"ccb0aa1ef035eb8e","mcp_get_code":{"code_sha256":"ccb0aa1ef035eb8e"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anita-hu/TF2-RL","path":"DDPG/TF2_DDPG_Basic.py","file_url":"https://github.com/anita-hu/TF2-RL/blob/HEAD/DDPG/TF2_DDPG_Basic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84a671ee7bad8513","code_sha256_prefix":"84a671ee7bad8513","mcp_get_code":{"code_sha256":"84a671ee7bad8513"}}],"record_sha256":"ef0217c24a88ac4a340f1748904f6f86985e969ada4cc2a7e505df61a170d76b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}