{"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/get-memory","entry":"get_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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"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":0,"ran":3,"unverified":3},"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":"2608.23936","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23936","title":"MnemoDyn: Learning Resting State Dynamics from 40K FMRI sequences","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"vsingh-group/mnemodyn","path":"code/light/abide_classification.py","file_url":"https://github.com/vsingh-group/mnemodyn/blob/HEAD/code/light/abide_classification.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae078e97ac146b18","code_sha256_prefix":"ae078e97ac146b18","mcp_get_code":{"code_sha256":"ae078e97ac146b18"}},{"arxiv_id":"2411.11396","arxiv_id_is_arxiv":true,"paper":"/paper/stacking-brick-by-brick-aligned-feature","title":"Stacking Brick by Brick: Aligned Feature Isolation for Incremental Face Forgery Detection","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beautyremain/sur-lid","path":"training/detectors/utils/lid_api.py","file_url":"https://github.com/beautyremain/sur-lid/blob/HEAD/training/detectors/utils/lid_api.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, beautyremain/sur-lid when it was checked","code_sha256":"061c97248eeaaf05","code_sha256_prefix":"061c97248eeaaf05","mcp_get_code":{"code_sha256":"061c97248eeaaf05"}},{"arxiv_id":"2404.02882","arxiv_id_is_arxiv":true,"paper":"/paper/linear-attention-sequence-parallelism","title":"Linear Attention Sequence Parallelism","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opennlplab/lasp","path":"lasp/utils/module_utils.py","file_url":"https://github.com/opennlplab/lasp/blob/HEAD/lasp/utils/module_utils.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":"d74763ca1f8b4730","code_sha256_prefix":"d74763ca1f8b4730","mcp_get_code":{"code_sha256":"d74763ca1f8b4730"}},{"arxiv_id":"2404.01628","arxiv_id_is_arxiv":true,"paper":"/paper/learning-equi-angular-representations-for","title":"Learning Equi-angular Representations for Online Continual Learning","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yonseivnl/earl","path":"datasets.py","file_url":"https://github.com/yonseivnl/earl/blob/HEAD/datasets.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, yonseivnl/earl when it was checked","code_sha256":"2b614a52f04d0485","code_sha256_prefix":"2b614a52f04d0485","mcp_get_code":{"code_sha256":"2b614a52f04d0485"}},{"arxiv_id":"2308.10278","arxiv_id_is_arxiv":true,"paper":"/paper/characterchat-learning-towards-conversational","title":"CharacterChat: Learning towards Conversational AI with Personalized Social Support","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morecry/characterchat","path":"model/demo/chat_demo.py","file_url":"https://github.com/morecry/characterchat/blob/HEAD/model/demo/chat_demo.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, morecry/characterchat when it was checked","code_sha256":"2384edaf1dcef2b1","code_sha256_prefix":"2384edaf1dcef2b1","mcp_get_code":{"code_sha256":"2384edaf1dcef2b1"}},{"arxiv_id":"2308.10278","arxiv_id_is_arxiv":true,"paper":"/paper/characterchat-learning-towards-conversational","title":"CharacterChat: Learning towards Conversational AI with Personalized Social Support","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morecry/characterchat","path":"model/demo/web_supporter.py","file_url":"https://github.com/morecry/characterchat/blob/HEAD/model/demo/web_supporter.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, morecry/characterchat when it was checked","code_sha256":"a0b6eee4ca6e0090","code_sha256_prefix":"a0b6eee4ca6e0090","mcp_get_code":{"code_sha256":"a0b6eee4ca6e0090"}},{"arxiv_id":"2104.08984","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-improves-model","title":"Contrastive Learning Improves Model Robustness Under Label Noise","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arghosh/noisy_label_pretrain","path":"scheduler.py","file_url":"https://github.com/arghosh/noisy_label_pretrain/blob/HEAD/scheduler.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":"9ef98e4eebd96977","code_sha256_prefix":"9ef98e4eebd96977","mcp_get_code":{"code_sha256":"9ef98e4eebd96977"}}],"record_sha256":"b32229cc668de2e8dc438808c2f5277afb831ef09fd964ec73b5d051849421d4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}