{"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/memorybank","entry":"MemoryBank","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":10,"n_samples_ran":9,"n_samples_constructed":6,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":5,"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":9,"unverified":1},"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":"2606.24428","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-24428","title":"Escaping the Self-Confirmation Trap: An Execute-Distill-Verify Paradigm for Agentic Experience Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"shidingz/EDV","path":"src/edv/pipeline.py","file_url":"https://github.com/shidingz/EDV/blob/HEAD/src/edv/pipeline.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":"9079b690f5039ebd","code_sha256_prefix":"9079b690f5039ebd","mcp_get_code":{"code_sha256":"9079b690f5039ebd"}},{"arxiv_id":"2606.13119","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-13119","title":"MP3: Multi-Period Pattern Pre-training for Spatio-Temporal Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YAN-outlook/MP3","path":"preprocess/model.py","file_url":"https://github.com/YAN-outlook/MP3/blob/HEAD/preprocess/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, YAN-outlook/MP3 when it was checked","code_sha256":"77338e3543bc9dc8","code_sha256_prefix":"77338e3543bc9dc8","mcp_get_code":{"code_sha256":"77338e3543bc9dc8"}},{"arxiv_id":"2605.04651","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-04651","title":"FAAST: Forward-Only Associative Learning via Closed-Form Fast Weights for Test-Time Supervised Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"baoguangsheng/faast","path":"llm/memory/memory_layer.py","file_url":"https://github.com/baoguangsheng/faast/blob/HEAD/llm/memory/memory_layer.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":"b1e0da9a2ab1e77e","code_sha256_prefix":"b1e0da9a2ab1e77e","mcp_get_code":{"code_sha256":"b1e0da9a2ab1e77e"}},{"arxiv_id":"2510.23577","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-23577","title":"TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Alleinx/TAMI_temporal_graph","path":"models/MemoryModel.py","file_url":"https://github.com/Alleinx/TAMI_temporal_graph/blob/HEAD/models/MemoryModel.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":"88d37089bbc34b6f","code_sha256_prefix":"88d37089bbc34b6f","mcp_get_code":{"code_sha256":"88d37089bbc34b6f"}},{"arxiv_id":"2505.21533","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.21533","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"sthalles/sop","path":"memory_bank.py","file_url":"https://github.com/sthalles/sop/blob/HEAD/memory_bank.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, sthalles/sop when it was checked","code_sha256":"abb67e9f9388d41e","code_sha256_prefix":"abb67e9f9388d41e","mcp_get_code":{"code_sha256":"abb67e9f9388d41e"}},{"arxiv_id":"2407.17486","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-memory-non-parametric-memory","title":"Learning from Memory: Non-Parametric Memory Augmented Self-Supervised Learning of Visual Features","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sthalles/massl","path":"memory_bank.py","file_url":"https://github.com/sthalles/massl/blob/HEAD/memory_bank.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, sthalles/massl when it was checked","code_sha256":"58927db7f5fe9f69","code_sha256_prefix":"58927db7f5fe9f69","mcp_get_code":{"code_sha256":"58927db7f5fe9f69"}},{"arxiv_id":"2406.13123","arxiv_id_is_arxiv":true,"paper":"/paper/vilco-bench-video-language-continual-learning","title":"ViLCo-Bench: VIdeo Language COntinual learning Benchmark","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cruiseresearchgroup/vilco","path":"MQ/libs/modeling/meta_archs.py","file_url":"https://github.com/cruiseresearchgroup/vilco/blob/HEAD/MQ/libs/modeling/meta_archs.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":"907a3011b6a00a52","code_sha256_prefix":"907a3011b6a00a52","mcp_get_code":{"code_sha256":"907a3011b6a00a52"}},{"arxiv_id":"2211.06612","arxiv_id_is_arxiv":true,"paper":"/paper/divide-and-contrast-source-free-domain","title":"Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyezhang/dac","path":"VisDA/target.py","file_url":"https://github.com/zyezhang/dac/blob/HEAD/VisDA/target.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zyezhang/dac, is not in the permissive set Syntology serves inline","code_sha256":"2c15973eb571a851","code_sha256_prefix":"2c15973eb571a851","mcp_get_code":{"code_sha256":"2c15973eb571a851"}},{"arxiv_id":"2208.01924","arxiv_id_is_arxiv":true,"paper":"/paper/per-clip-video-object-segmentation-1","title":"Per-Clip Video Object Segmentation","date":"2022-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkyong95/PCVOS","path":"inference_core_yv.py","file_url":"https://github.com/pkyong95/PCVOS/blob/HEAD/inference_core_yv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, pkyong95/PCVOS, is not in the permissive set Syntology serves inline","code_sha256":"e1b6bc0bb5d9568c","code_sha256_prefix":"e1b6bc0bb5d9568c","mcp_get_code":{"code_sha256":"e1b6bc0bb5d9568c"}},{"arxiv_id":"2207.02400","arxiv_id_is_arxiv":true,"paper":"/paper/chairs-can-be-stood-on-overcoming-object-bias","title":"Chairs Can be Stood on: Overcoming Object Bias in Human-Object Interaction Detection","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daoyuan98/odm","path":"scg/memory_bank.py","file_url":"https://github.com/daoyuan98/odm/blob/HEAD/scg/memory_bank.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":"0bdebe50d80005ec","code_sha256_prefix":"0bdebe50d80005ec","mcp_get_code":{"code_sha256":"0bdebe50d80005ec"}}],"record_sha256":"10f35248f4bcafba8d9134c04aaa4950c1eddc12aa876b4f63bdc4470c72fa30","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}