{"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/add-gaussian-noise","entry":"add_gaussian_noise","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":25,"n_papers_ran":25,"n_papers_ran_no_instrument_failure":20,"n_papers_ran_instrument_only":5,"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":26,"n_samples_ran":26,"n_samples_constructed":0,"n_samples_ran_checked":21,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":11,"n_places":26,"n_places_pointer_only":9,"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":3,"ran_violates":1,"ran_draft_wrong":5,"ran_fixture":0,"ran":17,"unverified":0},"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":"2608.23799","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23799","title":"Restoring Without Forgetting: Continual Learning Across Image Degradations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"AlifAshrafee/Restoring-Without-Forgetting","path":"degradations.py","file_url":"https://github.com/AlifAshrafee/Restoring-Without-Forgetting/blob/HEAD/degradations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, AlifAshrafee/Restoring-Without-Forgetting when it was checked","code_sha256":"6a4415d5c7a0b330","code_sha256_prefix":"6a4415d5c7a0b330","mcp_get_code":{"code_sha256":"6a4415d5c7a0b330"}},{"arxiv_id":"2606.20666","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20666","title":"Robust Auto-associative Memory via Convolutional Restricted Hopfield Networks","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"C16Mftang/covariance-learning-PCNs","path":"src/get_data.py","file_url":"https://github.com/C16Mftang/covariance-learning-PCNs/blob/HEAD/src/get_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, C16Mftang/covariance-learning-PCNs when it was checked","code_sha256":"f71f0fdf5e867c84","code_sha256_prefix":"f71f0fdf5e867c84","mcp_get_code":{"code_sha256":"f71f0fdf5e867c84"}},{"arxiv_id":"2606.02178","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02178","title":"Order within Chaos: Capturing Intrinsic Energy Anomalies for AI-Manipulated Image Forgery Localization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"phoenixnir/FLAME","path":"FLAME/utils/perturbations.py","file_url":"https://github.com/phoenixnir/FLAME/blob/HEAD/FLAME/utils/perturbations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, phoenixnir/FLAME when it was checked","code_sha256":"bcb4e83e9f4c75b5","code_sha256_prefix":"bcb4e83e9f4c75b5","mcp_get_code":{"code_sha256":"bcb4e83e9f4c75b5"}},{"arxiv_id":"2602.14622","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-14622","title":"Tabular Foundation Models Can Learn Association Rules","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DiTEC-project/tabprobe","path":"src/wrapper/tabprobe.py","file_url":"https://github.com/DiTEC-project/tabprobe/blob/HEAD/src/wrapper/tabprobe.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da4ecd76c60aee17","code_sha256_prefix":"da4ecd76c60aee17","mcp_get_code":{"code_sha256":"da4ecd76c60aee17"}},{"arxiv_id":"2503.01087","arxiv_id_is_arxiv":true,"paper":"/paper/rashomon-sets-for-prototypical-part-networks","title":"Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Time","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jdonnelly36/proto-rset","path":"protopnet/metrics.py","file_url":"https://github.com/jdonnelly36/proto-rset/blob/HEAD/protopnet/metrics.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":"a66bbb3d304f6150","code_sha256_prefix":"a66bbb3d304f6150","mcp_get_code":{"code_sha256":"a66bbb3d304f6150"}},{"arxiv_id":"2412.15206","arxiv_id_is_arxiv":true,"paper":"/paper/autotrust-benchmarking-trustworthiness-in","title":"AutoTrust: Benchmarking Trustworthiness in Large Vision Language Models for Autonomous Driving","date":"2024-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taco-group/autotrust","path":"src/noise_add.py","file_url":"https://github.com/taco-group/autotrust/blob/HEAD/src/noise_add.py","status":"ran","verification_level":1,"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":"ad7192037ac896ef","code_sha256_prefix":"ad7192037ac896ef","mcp_get_code":{"code_sha256":"ad7192037ac896ef"}},{"arxiv_id":"2412.06141","arxiv_id_is_arxiv":true,"paper":"/paper/mmedpo-aligning-medical-vision-language","title":"MMedPO: Aligning Medical Vision-Language Models with Clinical-Aware Multimodal Preference Optimization","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiming-lab/MMedPO","path":"inference/llava-med-1.5_vqa.py","file_url":"https://github.com/aiming-lab/MMedPO/blob/HEAD/inference/llava-med-1.5_vqa.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2bfc515570f0eed","code_sha256_prefix":"d2bfc515570f0eed","mcp_get_code":{"code_sha256":"d2bfc515570f0eed"}},{"arxiv_id":"2412.06141","arxiv_id_is_arxiv":true,"paper":"/paper/mmedpo-aligning-medical-vision-language","title":"MMedPO: Aligning Medical Vision-Language Models with Clinical-Aware Multimodal Preference Optimization","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiming-lab/mmedpo","path":"inference/llava-med-1.5_report.py","file_url":"https://github.com/aiming-lab/mmedpo/blob/HEAD/inference/llava-med-1.5_report.py","status":"ran","verification_level":1,"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":"8f611a3a3069da33","code_sha256_prefix":"8f611a3a3069da33","mcp_get_code":{"code_sha256":"8f611a3a3069da33"}},{"arxiv_id":"2405.18217","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-inter-concept-relationships-in","title":"Understanding Inter-Concept Relationships in Concept-Based Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naveenr414/Concept-Learning","path":"src/dataset.py","file_url":"https://github.com/naveenr414/Concept-Learning/blob/HEAD/src/dataset.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, naveenr414/Concept-Learning when it was checked","code_sha256":"b46d787c7739ef2d","code_sha256_prefix":"b46d787c7739ef2d","mcp_get_code":{"code_sha256":"b46d787c7739ef2d"}},{"arxiv_id":"2403.03463","arxiv_id_is_arxiv":true,"paper":"/paper/flame-diffuser-grounded-wildfire-image","title":"FLAME Diffuser: Wildfire Image Synthesis using Mask Guided Diffusion","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIS-Clemson/FLAME_SD","path":"Flame_diffuser_binary_mask.py","file_url":"https://github.com/AIS-Clemson/FLAME_SD/blob/HEAD/Flame_diffuser_binary_mask.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AIS-Clemson/FLAME_SD when it was checked","code_sha256":"eeeb4d8815f3913c","code_sha256_prefix":"eeeb4d8815f3913c","mcp_get_code":{"code_sha256":"eeeb4d8815f3913c"}},{"arxiv_id":"2403.02955","arxiv_id_is_arxiv":true,"paper":"/paper/xai-based-detection-of-adversarial-attacks-on","title":"XAI-Based Detection of Adversarial Attacks on Deepfake Detectors","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"razla/xai-based-detection-of-adversarial-attacks-on-deepfake-detectors","path":"robust_transforms.py","file_url":"https://github.com/razla/xai-based-detection-of-adversarial-attacks-on-deepfake-detectors/blob/HEAD/robust_transforms.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, razla/xai-based-detection-of-adversarial-attacks-on-deepfake-detectors when it was checked","code_sha256":"a47ffbdfd29954cc","code_sha256_prefix":"a47ffbdfd29954cc","mcp_get_code":{"code_sha256":"a47ffbdfd29954cc"}},{"arxiv_id":"2312.02708","arxiv_id_is_arxiv":true,"paper":"/paper/provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jan-schuchardt/invariance-smoothing","path":"pointcloud_invariance_smoothing/training.py","file_url":"https://github.com/jan-schuchardt/invariance-smoothing/blob/HEAD/pointcloud_invariance_smoothing/training.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":"fee01cc7d1d5c624","code_sha256_prefix":"fee01cc7d1d5c624","mcp_get_code":{"code_sha256":"fee01cc7d1d5c624"}},{"arxiv_id":"2310.03013","arxiv_id_is_arxiv":true,"paper":"/paper/semireward-a-general-reward-model-for-semi","title":"SemiReward: A General Reward Model for Semi-supervised Learning","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Westlake-AI/SemiReward","path":"semilearn/algorithms/semireward/semireward.py","file_url":"https://github.com/Westlake-AI/SemiReward/blob/HEAD/semilearn/algorithms/semireward/semireward.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c416c897b374d349","code_sha256_prefix":"c416c897b374d349","mcp_get_code":{"code_sha256":"c416c897b374d349"}},{"arxiv_id":"2308.11918","arxiv_id_is_arxiv":true,"paper":"/paper/amsp-uod-when-vortex-convolution-and","title":"AMSP-UOD: When Vortex Convolution and Stochastic Perturbation Meet Underwater Object Detection","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhoujingchun03/amsp-uod","path":"val.py","file_url":"https://github.com/zhoujingchun03/amsp-uod/blob/HEAD/val.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhoujingchun03/amsp-uod when it was checked","code_sha256":"38418626f32f380e","code_sha256_prefix":"38418626f32f380e","mcp_get_code":{"code_sha256":"38418626f32f380e"}},{"arxiv_id":"2307.13885","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-estimation-of-the-local-robustness","title":"Characterizing Data Point Vulnerability via Average-Case Robustness","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4life-group/average-case-robustness","path":"estimators/fns_add_noise.py","file_url":"https://github.com/ai4life-group/average-case-robustness/blob/HEAD/estimators/fns_add_noise.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":"639a0058eb04fb0d","code_sha256_prefix":"639a0058eb04fb0d","mcp_get_code":{"code_sha256":"639a0058eb04fb0d"}},{"arxiv_id":"2307.07055","arxiv_id_is_arxiv":true,"paper":"/paper/reward-directed-conditional-diffusion","title":"Reward-Directed Conditional Diffusion: Provable Distribution Estimation and Reward Improvement","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaffaljidhmah2/rcgdm","path":"fake_dataset.py","file_url":"https://github.com/kaffaljidhmah2/rcgdm/blob/HEAD/fake_dataset.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":"e22d5d89e893bd94","code_sha256_prefix":"e22d5d89e893bd94","mcp_get_code":{"code_sha256":"e22d5d89e893bd94"}},{"arxiv_id":"2306.07730","arxiv_id_is_arxiv":true,"paper":"/paper/beliefppg-uncertainty-aware-heart-rate","title":"BeliefPPG: Uncertainty-aware Heart Rate Estimation from PPG signals via Belief Propagation","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-siplab/beliefppg","path":"beliefppg/util/augmentations.py","file_url":"https://github.com/eth-siplab/beliefppg/blob/HEAD/beliefppg/util/augmentations.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":"c0811adb00c0c99b","code_sha256_prefix":"c0811adb00c0c99b","mcp_get_code":{"code_sha256":"c0811adb00c0c99b"}},{"arxiv_id":"2208.14226","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-in-deep","title":"Unsupervised Representation Learning in Deep Reinforcement Learning: A Review","date":"2022-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicob15/state_representation_learning_methods","path":"utils.py","file_url":"https://github.com/nicob15/state_representation_learning_methods/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":"932dcb85f985edaa","code_sha256_prefix":"932dcb85f985edaa","mcp_get_code":{"code_sha256":"932dcb85f985edaa"}},{"arxiv_id":"2208.07204","arxiv_id_is_arxiv":true,"paper":"/paper/usb-a-unified-semi-supervised-learning","title":"USB: A Unified Semi-supervised Learning Benchmark for Classification","date":"2022-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Westlake-AI/SemiReward","path":"semilearn/algorithms/semireward/semireward.py","file_url":"https://github.com/Westlake-AI/SemiReward/blob/HEAD/semilearn/algorithms/semireward/semireward.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ece83a7233a5806","code_sha256_prefix":"2ece83a7233a5806","mcp_get_code":{"code_sha256":"2ece83a7233a5806"}},{"arxiv_id":"2007.08202","arxiv_id_is_arxiv":true,"paper":"/paper/provably-good-batch-reinforcement-learning","title":"Provably Good Batch Reinforcement Learning Without Great Exploration","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaoliucs/PQL","path":"BCQ.py","file_url":"https://github.com/yaoliucs/PQL/blob/HEAD/BCQ.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":"7a5ca9e02cb89716","code_sha256_prefix":"7a5ca9e02cb89716","mcp_get_code":{"code_sha256":"7a5ca9e02cb89716"}},{"arxiv_id":"2006.05164","arxiv_id_is_arxiv":true,"paper":"/paper/ar-dae-towards-unbiased-neural-entropy","title":"AR-DAE: Towards Unbiased Neural Entropy Gradient Estimation","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lim0606/pytorch-ardae-rl","path":"models/graddae/mlp.py","file_url":"https://github.com/lim0606/pytorch-ardae-rl/blob/HEAD/models/graddae/mlp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lim0606/pytorch-ardae-rl when it was checked","code_sha256":"227e853b8ec43231","code_sha256_prefix":"227e853b8ec43231","mcp_get_code":{"code_sha256":"227e853b8ec43231"}},{"arxiv_id":"2002.10392","arxiv_id_is_arxiv":true,"paper":"/paper/suppressing-uncertainties-for-large-scale","title":"Suppressing Uncertainties for Large-Scale Facial Expression Recognition","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/Self-Cure-Network","path":"src/image_utils.py","file_url":"https://github.com/kaiwang960112/Self-Cure-Network/blob/HEAD/src/image_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaiwang960112/Self-Cure-Network when it was checked","code_sha256":"4a205054e9598fcd","code_sha256_prefix":"4a205054e9598fcd","mcp_get_code":{"code_sha256":"4a205054e9598fcd"}},{"arxiv_id":"1805.03064","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-cnn-for-3d-gaze-estimation-using","title":"Recurrent CNN for 3D Gaze Estimation using Appearance and Shape Cues","date":"2018-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crisie/RecurrentGaze","path":"images_data_augmenter_seqaware.py","file_url":"https://github.com/crisie/RecurrentGaze/blob/HEAD/images_data_augmenter_seqaware.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":"41089fa584fba486","code_sha256_prefix":"41089fa584fba486","mcp_get_code":{"code_sha256":"41089fa584fba486"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecstayalive/Degenerate-capsule-neural-network","path":"capsule_net/utils/add_noise.py","file_url":"https://github.com/ecstayalive/Degenerate-capsule-neural-network/blob/HEAD/capsule_net/utils/add_noise.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d412a9be3a2a5d6","code_sha256_prefix":"0d412a9be3a2a5d6","mcp_get_code":{"code_sha256":"0d412a9be3a2a5d6"}},{"arxiv_id":"Zhang_Point_Cloud_Upsampling_Using_Conditional_Diffusion_Module_with_Adaptive_Noise_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhang_Point_Cloud_Upsampling_Using_Conditional_Diffusion_Module_with_Adaptive_Noise_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Baty2023/PDANS","path":"pointnet2/dataloader/prepare_dataset.py","file_url":"https://github.com/Baty2023/PDANS/blob/HEAD/pointnet2/dataloader/prepare_dataset.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":"52f38a73fe1a8e41","code_sha256_prefix":"52f38a73fe1a8e41","mcp_get_code":{"code_sha256":"52f38a73fe1a8e41"}},{"arxiv_id":"Zang_IntraTomo_Self-Supervised_Learning-Based_Tomography_via_Sinogram_Synthesis_and_Prediction_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zang_IntraTomo_Self-Supervised_Learning-Based_Tomography_via_Sinogram_Synthesis_and_Prediction_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"matheusgadelha/ShapeRecDeepPrior","path":"experiments/denoiseradon.py","file_url":"https://github.com/matheusgadelha/ShapeRecDeepPrior/blob/HEAD/experiments/denoiseradon.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":"9e4460e45cbdb057","code_sha256_prefix":"9e4460e45cbdb057","mcp_get_code":{"code_sha256":"9e4460e45cbdb057"}}],"record_sha256":"a2e9172e50cc143fa9ec445b1d1beb58fcb68b6406649643b28001dfd80f6835","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}