{"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/get-dim","entry":"get_dim","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":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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":"2406.17830","paper":"/paper/treatment-of-statistical-estimation-problems","title":"Treatment of Statistical Estimation Problems in Randomized Smoothing for Adversarial Robustness","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vvoracek/RS_conf_seq","path":"datasets.py","file_url":"https://github.com/vvoracek/RS_conf_seq/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"89b093f4e62b1eef","mcp_get_code":{"code_sha256":"89b093f4e62b1eef"}},{"arxiv_id":"2203.09481","paper":"/paper/diffusion-probabilistic-modeling-for-video","title":"Diffusion Probabilistic Modeling for Video Generation","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buggyyang/rvd","path":"test_video.py","file_url":"https://github.com/buggyyang/rvd/blob/HEAD/test_video.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c59f1a12732cd33","mcp_get_code":{"code_sha256":"4c59f1a12732cd33"}},{"arxiv_id":"2201.09191","paper":"/paper/revisiting-pooling-through-the-lens-of","title":"Revisiting Global Pooling through the Lens of Optimal Transport","date":"2022-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sds-lab/rot-pooling","path":"backbones/attention_mil.py","file_url":"https://github.com/sds-lab/rot-pooling/blob/HEAD/backbones/attention_mil.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec8c933c0c321597","mcp_get_code":{"code_sha256":"ec8c933c0c321597"}},{"arxiv_id":"2105.13407","paper":"/paper/manifold-constrained-gaussian-process","title":"Manifold-constrained Gaussian process inference for time-varying parameters in dynamic systems","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"canadasunyan/tvmagi","path":"package/TVMAGI_HMC.py","file_url":"https://github.com/canadasunyan/tvmagi/blob/HEAD/package/TVMAGI_HMC.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2db5d627e7e8c629","mcp_get_code":{"code_sha256":"2db5d627e7e8c629"}},{"arxiv_id":"1903.08254","paper":"/paper/efficient-off-policy-meta-reinforcement","title":"Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junmokane/offline-PEARL","path":"rlkit/data_management/env_offline_replay_buffer.py","file_url":"https://github.com/junmokane/offline-PEARL/blob/HEAD/rlkit/data_management/env_offline_replay_buffer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8a6359263de246f7","mcp_get_code":{"code_sha256":"8a6359263de246f7"}}]}