{"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/random-brightness","entry":"random_brightness","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":6,"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":6,"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":"2205.09723","paper":"/paper/robust-and-efficient-medical-imaging-with","title":"Robust and Efficient Medical Imaging with Self-Supervision","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/medical-ai-research-foundations","path":"data_util.py","file_url":"https://github.com/google-research/medical-ai-research-foundations/blob/HEAD/data_util.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":"6c4f36fab52ddbe9","mcp_get_code":{"code_sha256":"6c4f36fab52ddbe9"}},{"arxiv_id":"2112.11435","paper":"/paper/learned-queries-for-efficient-local-attention","title":"Learned Queries for Efficient Local Attention","date":"2021-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moabarar/qna","path":"augment/color_util.py","file_url":"https://github.com/moabarar/qna/blob/HEAD/augment/color_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1aaf77a8784526a","mcp_get_code":{"code_sha256":"e1aaf77a8784526a"}},{"arxiv_id":"2109.12909","paper":"/paper/compressive-visual-representations","title":"Compressive Visual Representations","date":"2021-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/compressive-visual-representations","path":"compressive_visual_representations/data_util.py","file_url":"https://github.com/google-research/compressive-visual-representations/blob/HEAD/compressive_visual_representations/data_util.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":"35f2f206e2a2532c","mcp_get_code":{"code_sha256":"35f2f206e2a2532c"}},{"arxiv_id":"2108.10310","paper":"/paper/ranking-models-in-unlabeled-new-environments","title":"Ranking Models in Unlabeled New Environments","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sxzrt/Proxy-Set","path":"domain_gap/DG_gegerate_data.py","file_url":"https://github.com/sxzrt/Proxy-Set/blob/HEAD/domain_gap/DG_gegerate_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1aaf77a8784526a","mcp_get_code":{"code_sha256":"e1aaf77a8784526a"}},{"arxiv_id":"2105.12723","paper":"/paper/aggregating-nested-transformers","title":"Nested Hierarchical Transformer: Towards Accurate, Data-Efficient and Interpretable Visual Understanding","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/nested-transformer","path":"augment/color_util.py","file_url":"https://github.com/google-research/nested-transformer/blob/HEAD/augment/color_util.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":"e1aaf77a8784526a","mcp_get_code":{"code_sha256":"e1aaf77a8784526a"}},{"arxiv_id":"1902.10556","paper":"/paper/recurrent-mvsnet-for-high-resolution-multi","title":"Recurrent MVSNet for High-resolution Multi-view Stereo Depth Inference","date":"2019-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YoYo000/MVSNet","path":"mvsnet/photometric_augmentation.py","file_url":"https://github.com/YoYo000/MVSNet/blob/HEAD/mvsnet/photometric_augmentation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5516b4b5cdcb1b3f","mcp_get_code":{"code_sha256":"5516b4b5cdcb1b3f"}}]}