{"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/check-exists","entry":"check_exists","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":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":4,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":4},"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":"2211.08036","paper":"/paper/provably-reliable-large-scale-sampling-from","title":"Provably Reliable Large-Scale Sampling from Gaussian Processes","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ant-stephenson/gpsampler","path":"utils.py","file_url":"https://github.com/ant-stephenson/gpsampler/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"596c7719cc8db7e4","mcp_get_code":{"code_sha256":"596c7719cc8db7e4"}},{"arxiv_id":"2105.05226","paper":"/paper/home-action-genome-cooperative-compositional","title":"Home Action Genome: Cooperative Compositional Action Understanding","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nishantrai18/homage","path":"process_data/src/write_csv.py","file_url":"https://github.com/nishantrai18/homage/blob/HEAD/process_data/src/write_csv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e5e9f599c7fb5c8e","mcp_get_code":{"code_sha256":"e5e9f599c7fb5c8e"}},{"arxiv_id":"2010.01264","paper":"/paper/heterofl-computation-and-communication-1","title":"HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients","date":"2020-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diaoenmao/HeteroFL-Computation-and-Communication-Efficient-Federated-Learning-for-Heterogeneous-Clients","path":"src/utils.py","file_url":"https://github.com/diaoenmao/HeteroFL-Computation-and-Communication-Efficient-Federated-Learning-for-Heterogeneous-Clients/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e54e85886591c7b5","mcp_get_code":{"code_sha256":"e54e85886591c7b5"}},{"arxiv_id":"2008.01065","paper":"/paper/memory-augmented-dense-predictive-coding-for","title":"Memory-augmented Dense Predictive Coding for Video Representation Learning","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TengdaHan/MemDPC","path":"process_data/src/write_csv.py","file_url":"https://github.com/TengdaHan/MemDPC/blob/HEAD/process_data/src/write_csv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"798674d07b9de57d","mcp_get_code":{"code_sha256":"798674d07b9de57d"}},{"arxiv_id":"1909.04656","paper":"/paper/video-representation-learning-by-dense","title":"Video Representation Learning by Dense Predictive Coding","date":"2019-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TengdaHan/DPC","path":"process_data/src/write_csv.py","file_url":"https://github.com/TengdaHan/DPC/blob/HEAD/process_data/src/write_csv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"798674d07b9de57d","mcp_get_code":{"code_sha256":"798674d07b9de57d"}}]}