{"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/data","entry":"Data","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":7,"n_papers_ran":4,"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":9,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"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":"2608.05670","paper":"/paper/arxiv-2608-05670","title":"When Does Consensus Mean Correctness? Measuring the Agreement-Accuracy Coupling with Semantics-Preserving Re-Rendering","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"KurbanIntelligenceLab/rendeq","path":"rendeq_generator.py","file_url":"https://github.com/KurbanIntelligenceLab/rendeq/blob/HEAD/rendeq_generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de7055e01b57dd86","mcp_get_code":{"code_sha256":"de7055e01b57dd86"}},{"arxiv_id":"2507.00518","paper":null,"title":"arXiv:2507.00518","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"deezer/vMF-exploration","path":"src/sampler/vmf_sampler.py","file_url":"https://github.com/deezer/vMF-exploration/blob/HEAD/src/sampler/vmf_sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"39e3090f674c8702","mcp_get_code":{"code_sha256":"39e3090f674c8702"}},{"arxiv_id":"2106.08630","paper":"/paper/help-hardware-adaptive-efficient-latency","title":"HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hayeonlee/help","path":"help.py","file_url":"https://github.com/hayeonlee/help/blob/HEAD/help.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3c44d4cc08c514e","mcp_get_code":{"code_sha256":"d3c44d4cc08c514e"}},{"arxiv_id":"2105.06138","paper":"/paper/unsupervised-hashing-with-contrastive","title":"Unsupervised Hashing with Contrastive Information Bottleneck","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiuzx2/CIBHash","path":"model/CIBHash.py","file_url":"https://github.com/qiuzx2/CIBHash/blob/HEAD/model/CIBHash.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ae75be554ee6746","mcp_get_code":{"code_sha256":"6ae75be554ee6746"}},{"arxiv_id":"2004.03991","paper":"/paper/learning-discrete-structured-representations","title":"Learning Discrete Structured Representations by Adversarially Maximizing Mutual Information","date":"2020-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karlstratos/ammi","path":"ammi.py","file_url":"https://github.com/karlstratos/ammi/blob/HEAD/ammi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"832329ad3f5db304","mcp_get_code":{"code_sha256":"832329ad3f5db304"}},{"arxiv_id":"1806.07366","paper":"/paper/neural-ordinary-differential-equations","title":"Neural Ordinary Differential Equations","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UofTrees/ProjectX2020","path":"mr_node/model/odefunc.py","file_url":"https://github.com/UofTrees/ProjectX2020/blob/HEAD/mr_node/model/odefunc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"afcd5754477bf8a7","mcp_get_code":{"code_sha256":"afcd5754477bf8a7"}},{"arxiv_id":"1803.07728","paper":"/paper/unsupervised-representation-learning-by-1","title":"Unsupervised Representation Learning by Predicting Image Rotations","date":"2018-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nab-126/resnet","path":"rotnet.py","file_url":"https://github.com/nab-126/resnet/blob/HEAD/rotnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"977eb64069f84f67","mcp_get_code":{"code_sha256":"977eb64069f84f67"}},{"arxiv_id":"1803.07728","paper":"/paper/unsupervised-representation-learning-by-1","title":"Unsupervised Representation Learning by Predicting Image Rotations","date":"2018-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rahuldesai1/NMEP_HW5","path":"rotnet.py","file_url":"https://github.com/rahuldesai1/NMEP_HW5/blob/HEAD/rotnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0b75c3d1eaec7793","mcp_get_code":{"code_sha256":"0b75c3d1eaec7793"}},{"arxiv_id":"1803.07728","paper":"/paper/unsupervised-representation-learning-by-1","title":"Unsupervised Representation Learning by Predicting Image Rotations","date":"2018-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Blimeo/rotnet","path":"rotnet.py","file_url":"https://github.com/Blimeo/rotnet/blob/HEAD/rotnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4d382e3a78bdf9d7","mcp_get_code":{"code_sha256":"4d382e3a78bdf9d7"}}]}