{"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-mem-space","entry":"get_mem_space","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":2,"unverified":0},"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":"2404.07143","arxiv_id_is_arxiv":true,"paper":"/paper/leave-no-context-behind-efficient-infinite","title":"Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention","date":"2024-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Beomi/InfiniTransformer","path":"gpu_mem_track.py","file_url":"https://github.com/Beomi/InfiniTransformer/blob/HEAD/gpu_mem_track.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":"a01911ff65691be7","code_sha256_prefix":"a01911ff65691be7","mcp_get_code":{"code_sha256":"a01911ff65691be7"}},{"arxiv_id":"2404.03637","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"applied-machine-learning-lab/dt4ier","path":"gpu_mem_track.py","file_url":"https://github.com/applied-machine-learning-lab/dt4ier/blob/HEAD/gpu_mem_track.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, applied-machine-learning-lab/dt4ier when it was checked","code_sha256":"efa7095cdb85be6c","code_sha256_prefix":"efa7095cdb85be6c","mcp_get_code":{"code_sha256":"efa7095cdb85be6c"}},{"arxiv_id":"2402.09565","arxiv_id_is_arxiv":true,"paper":"/paper/graph-skeleton-1-nodes-are-sufficient-to","title":"Graph-Skeleton: ~1% Nodes are Sufficient to Represent Billion-Scale Graph","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunet/graphskeleton","path":"preliminary_exploration/dgraph/models/gpu_mem_track.py","file_url":"https://github.com/zjunet/graphskeleton/blob/HEAD/preliminary_exploration/dgraph/models/gpu_mem_track.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zjunet/graphskeleton when it was checked","code_sha256":"efa7095cdb85be6c","code_sha256_prefix":"efa7095cdb85be6c","mcp_get_code":{"code_sha256":"efa7095cdb85be6c"}},{"arxiv_id":"2312.07378","arxiv_id_is_arxiv":true,"paper":"/paper/x4d-sceneformer-enhanced-scene-understanding","title":"X4D-SceneFormer: Enhanced Scene Understanding on 4D Point Cloud Videos through Cross-modal Knowledge Transfer","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinglinglingling/x4d","path":"gpu_mem_track.py","file_url":"https://github.com/jinglinglingling/x4d/blob/HEAD/gpu_mem_track.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, jinglinglingling/x4d when it was checked","code_sha256":"efa7095cdb85be6c","code_sha256_prefix":"efa7095cdb85be6c","mcp_get_code":{"code_sha256":"efa7095cdb85be6c"}},{"arxiv_id":"2311.08756","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-toeplitz-neural-network-with","title":"Accelerating Toeplitz Neural Network with Constant-time Inference Complexity","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opennlplab/etsc-exact-toeplitz-to-ssm-conversion","path":"gpu_mem_track.py","file_url":"https://github.com/opennlplab/etsc-exact-toeplitz-to-ssm-conversion/blob/HEAD/gpu_mem_track.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, opennlplab/etsc-exact-toeplitz-to-ssm-conversion when it was checked","code_sha256":"e587d8232ac158a1","code_sha256_prefix":"e587d8232ac158a1","mcp_get_code":{"code_sha256":"e587d8232ac158a1"}},{"arxiv_id":"2310.20199","arxiv_id_is_arxiv":true,"paper":"/paper/in-search-of-lost-online-test-time-adaptation","title":"In Search of Lost Online Test-time Adaptation: A Survey","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jo-wang/otta_vit_survey","path":"classification/gpu_mem_track.py","file_url":"https://github.com/jo-wang/otta_vit_survey/blob/HEAD/classification/gpu_mem_track.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":"a01911ff65691be7","code_sha256_prefix":"a01911ff65691be7","mcp_get_code":{"code_sha256":"a01911ff65691be7"}},{"arxiv_id":"2310.13012","arxiv_id_is_arxiv":true,"paper":"/paper/h2o-open-ecosystem-for-state-of-the-art-large","title":"H2O Open Ecosystem for State-of-the-art Large Language Models","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"h2oai/h2ogpt","path":"models/gpu_mem_track.py","file_url":"https://github.com/h2oai/h2ogpt/blob/HEAD/models/gpu_mem_track.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from applied-machine-learning-lab/dt4ier, and GitHub detected no licence in that repository when it was checked","code_sha256":"efa7095cdb85be6c","code_sha256_prefix":"efa7095cdb85be6c","mcp_get_code":{"code_sha256":"efa7095cdb85be6c"}},{"arxiv_id":"2306.06446","arxiv_id_is_arxiv":true,"paper":"/paper/shiftaddvit-mixture-of-multiplication-1","title":"ShiftAddViT: Mixture of Multiplication Primitives Towards Efficient Vision Transformer","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GATECH-EIC/ShiftAddViT","path":"pvt/gpu_mem_track.py","file_url":"https://github.com/GATECH-EIC/ShiftAddViT/blob/HEAD/pvt/gpu_mem_track.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from applied-machine-learning-lab/dt4ier, and GitHub detected no licence in that repository when it was checked","code_sha256":"efa7095cdb85be6c","code_sha256_prefix":"efa7095cdb85be6c","mcp_get_code":{"code_sha256":"efa7095cdb85be6c"}}],"record_sha256":"97451cfefc6872d6d1b4ed61bb9088148925d77a1ce1fe7c56e3b359f6d5cb76","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}