{"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/load-batch","entry":"load_batch","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":18,"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":13,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":24,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"unverified":6},"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":"2406.01494","arxiv_id_is_arxiv":true,"paper":"/paper/robust-classification-by-coupling-data","title":"Robust Classification by Coupling Data Mollification with Label Smoothing","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markusheinonen/supervised-mollification","path":"src/results.py","file_url":"https://github.com/markusheinonen/supervised-mollification/blob/HEAD/src/results.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, markusheinonen/supervised-mollification when it was checked","code_sha256":"cec2c92b1206664a","code_sha256_prefix":"cec2c92b1206664a","mcp_get_code":{"code_sha256":"cec2c92b1206664a"}},{"arxiv_id":"2307.07664","arxiv_id_is_arxiv":true,"paper":"/paper/outlier-detection-in-the-desi-bright-galaxy","title":"Outlier Detection in the DESI Bright Galaxy Survey","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":"archive","repo":"pmelchior/spender","path":"spender/util.py","file_url":"https://github.com/pmelchior/spender/blob/HEAD/spender/util.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":"98d5335a1f96e36b","code_sha256_prefix":"98d5335a1f96e36b","mcp_get_code":{"code_sha256":"98d5335a1f96e36b"}},{"arxiv_id":"2211.17244","arxiv_id_is_arxiv":true,"paper":"/paper/overcoming-the-convex-relaxation-barrier-for","title":"Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/CROWN-Robustness-Certification","path":"setup_cifar.py","file_url":"https://github.com/IBM/CROWN-Robustness-Certification/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab7faf0047f2c872","code_sha256_prefix":"ab7faf0047f2c872","mcp_get_code":{"code_sha256":"ab7faf0047f2c872"}},{"arxiv_id":"2211.17244","arxiv_id_is_arxiv":true,"paper":"/paper/overcoming-the-convex-relaxation-barrier-for","title":"Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/CROWN-Robustness-Certification","path":"setup_cifar.py","file_url":"https://github.com/IBM/CROWN-Robustness-Certification/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4fb87c66244ebf","code_sha256_prefix":"3b4fb87c66244ebf","mcp_get_code":{"code_sha256":"3b4fb87c66244ebf"}},{"arxiv_id":"2111.00053","arxiv_id_is_arxiv":true,"paper":"/paper/symbolic-regression-via-neural-guided-genetic","title":"Symbolic Regression via Neural-Guided Genetic Programming Population Seeding","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brendenpetersen/deep-symbolic-optimization","path":"dso/dso/memory.py","file_url":"https://github.com/brendenpetersen/deep-symbolic-optimization/blob/HEAD/dso/dso/memory.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7cae67defd7ffaf","code_sha256_prefix":"b7cae67defd7ffaf","mcp_get_code":{"code_sha256":"b7cae67defd7ffaf"}},{"arxiv_id":"2006.15212","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-models-for-learning-to-branch","title":"Hybrid Models for Learning to Branch","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pg2455/Hybrid-learn2branch","path":"utilities_hybrid.py","file_url":"https://github.com/pg2455/Hybrid-learn2branch/blob/HEAD/utilities_hybrid.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01d962ccce151759","code_sha256_prefix":"01d962ccce151759","mcp_get_code":{"code_sha256":"01d962ccce151759"}},{"arxiv_id":"2006.14748","arxiv_id_is_arxiv":true,"paper":"/paper/proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3b4fb87c66244ebf","code_sha256_prefix":"3b4fb87c66244ebf","mcp_get_code":{"code_sha256":"3b4fb87c66244ebf"}},{"arxiv_id":"1909.13082","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-2-generative-networks","title":"Wasserstein-2 Generative Networks","date":"2019-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lit-leo/inner-convex-nn","path":"vae/vanila_vae.py","file_url":"https://github.com/lit-leo/inner-convex-nn/blob/HEAD/vae/vanila_vae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79775596097e420c","code_sha256_prefix":"79775596097e420c","mcp_get_code":{"code_sha256":"79775596097e420c"}},{"arxiv_id":"1905.06292","arxiv_id_is_arxiv":true,"paper":"/paper/3d-point-cloud-generative-adversarial-network","title":"3D Point Cloud Generative Adversarial Network Based on Tree Structured Graph Convolutions","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prajwalsingh/TreeGCN-ED","path":"utils.py","file_url":"https://github.com/prajwalsingh/TreeGCN-ED/blob/HEAD/utils.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":"7d586ed5128718bb","code_sha256_prefix":"7d586ed5128718bb","mcp_get_code":{"code_sha256":"7d586ed5128718bb"}},{"arxiv_id":"1902.03229","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-and-safe-bayesian-optimization-in","title":"Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces","date":"2019-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric-vader/HD-BO-Additive-Models","path":"hdbo/boattack/objective_func/tf_models/setup_cifar.py","file_url":"https://github.com/eric-vader/HD-BO-Additive-Models/blob/HEAD/hdbo/boattack/objective_func/tf_models/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab7faf0047f2c872","code_sha256_prefix":"ab7faf0047f2c872","mcp_get_code":{"code_sha256":"ab7faf0047f2c872"}},{"arxiv_id":"1902.03229","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-and-safe-bayesian-optimization-in","title":"Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces","date":"2019-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric-vader/HD-BO-Additive-Models","path":"hdbo/boattack/objective_func/tf_models/setup_cifar.py","file_url":"https://github.com/eric-vader/HD-BO-Additive-Models/blob/HEAD/hdbo/boattack/objective_func/tf_models/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4fb87c66244ebf","code_sha256_prefix":"3b4fb87c66244ebf","mcp_get_code":{"code_sha256":"3b4fb87c66244ebf"}},{"arxiv_id":"1811.00866","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/CertifiedReLURobustness","path":"setup_cifar.py","file_url":"https://github.com/huanzhang12/CertifiedReLURobustness/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab7faf0047f2c872","code_sha256_prefix":"ab7faf0047f2c872","mcp_get_code":{"code_sha256":"ab7faf0047f2c872"}},{"arxiv_id":"1811.00866","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/CertifiedReLURobustness","path":"setup_cifar.py","file_url":"https://github.com/huanzhang12/CertifiedReLURobustness/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4fb87c66244ebf","code_sha256_prefix":"3b4fb87c66244ebf","mcp_get_code":{"code_sha256":"3b4fb87c66244ebf"}},{"arxiv_id":"1805.11770","arxiv_id_is_arxiv":true,"paper":"/paper/autozoom-autoencoder-based-zeroth-order","title":"AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networks","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Autozoom-Attack","path":"setup_cifar.py","file_url":"https://github.com/IBM/Autozoom-Attack/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab7faf0047f2c872","code_sha256_prefix":"ab7faf0047f2c872","mcp_get_code":{"code_sha256":"ab7faf0047f2c872"}},{"arxiv_id":"1805.11770","arxiv_id_is_arxiv":true,"paper":"/paper/autozoom-autoencoder-based-zeroth-order","title":"AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networks","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Autozoom-Attack","path":"setup_cifar.py","file_url":"https://github.com/IBM/Autozoom-Attack/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4fb87c66244ebf","code_sha256_prefix":"3b4fb87c66244ebf","mcp_get_code":{"code_sha256":"3b4fb87c66244ebf"}},{"arxiv_id":"1805.11090","arxiv_id_is_arxiv":true,"paper":"/paper/genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nesl/adversarial_genattack","path":"setup_cifar.py","file_url":"https://github.com/nesl/adversarial_genattack/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab7faf0047f2c872","code_sha256_prefix":"ab7faf0047f2c872","mcp_get_code":{"code_sha256":"ab7faf0047f2c872"}},{"arxiv_id":"1805.11090","arxiv_id_is_arxiv":true,"paper":"/paper/genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nesl/adversarial_genattack","path":"setup_cifar.py","file_url":"https://github.com/nesl/adversarial_genattack/blob/HEAD/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b4fb87c66244ebf","code_sha256_prefix":"3b4fb87c66244ebf","mcp_get_code":{"code_sha256":"3b4fb87c66244ebf"}},{"arxiv_id":"1610.02136","arxiv_id_is_arxiv":true,"paper":"/paper/a-baseline-for-detecting-misclassified-and","title":"A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networks","date":"2016-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/error-detection","path":"Vision/load_cifar10.py","file_url":"https://github.com/hendrycks/error-detection/blob/HEAD/Vision/load_cifar10.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":"8633f606824fb007","code_sha256_prefix":"8633f606824fb007","mcp_get_code":{"code_sha256":"8633f606824fb007"}},{"arxiv_id":"1610.02136","arxiv_id_is_arxiv":true,"paper":"/paper/a-baseline-for-detecting-misclassified-and","title":"A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networks","date":"2016-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/error-detection","path":"Vision/load_cifar100.py","file_url":"https://github.com/hendrycks/error-detection/blob/HEAD/Vision/load_cifar100.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":"4e5831192b762838","code_sha256_prefix":"4e5831192b762838","mcp_get_code":{"code_sha256":"4e5831192b762838"}},{"arxiv_id":"1608.00530","arxiv_id_is_arxiv":true,"paper":"/paper/early-methods-for-detecting-adversarial","title":"Early Methods for Detecting Adversarial Images","date":"2016-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/fooling","path":"CIFAR/load_cifar10.py","file_url":"https://github.com/hendrycks/fooling/blob/HEAD/CIFAR/load_cifar10.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":"8633f606824fb007","code_sha256_prefix":"8633f606824fb007","mcp_get_code":{"code_sha256":"8633f606824fb007"}},{"arxiv_id":"1606.08415","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-error-linear-units-gelus","title":"Gaussian Error Linear Units (GELUs)","date":"2016-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/GELUs","path":"load_cifar10.py","file_url":"https://github.com/hendrycks/GELUs/blob/HEAD/load_cifar10.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":"8633f606824fb007","code_sha256_prefix":"8633f606824fb007","mcp_get_code":{"code_sha256":"8633f606824fb007"}},{"arxiv_id":"aaai_5987","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_5987","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RingBDStack/MA-GCNNs","path":"M-GCNNs/utils.py","file_url":"https://github.com/RingBDStack/MA-GCNNs/blob/HEAD/M-GCNNs/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98185a078f416a58","code_sha256_prefix":"98185a078f416a58","mcp_get_code":{"code_sha256":"98185a078f416a58"}},{"arxiv_id":"aaai_20650","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20650","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/UAE","path":"Supervised/setup_cifar.py","file_url":"https://github.com/IBM/UAE/blob/HEAD/Supervised/setup_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b60dcd06b47c331c","code_sha256_prefix":"b60dcd06b47c331c","mcp_get_code":{"code_sha256":"b60dcd06b47c331c"}},{"arxiv_id":"Schelling_RADU_Ray-Aligned_Depth_Update_Convolutions_for_ToF_Data_Denoising_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Schelling_RADU_Ray-Aligned_Depth_Update_Convolutions_for_ToF_Data_Denoising_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"schellmi42/RADU","path":"code_dl/data_ops/data_loader.py","file_url":"https://github.com/schellmi42/RADU/blob/HEAD/code_dl/data_ops/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88770eb719772acf","code_sha256_prefix":"88770eb719772acf","mcp_get_code":{"code_sha256":"88770eb719772acf"}}],"record_sha256":"89cadd1cc4d68d722fb1404d302ee758d86338b3a96a83577d1a590472023b4a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}