{"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/dct","entry":"dct","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":24,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":14,"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":18,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":9,"n_samples_unverified":2,"n_samples_fingerprinted":15,"n_places":24,"n_places_pointer_only":10,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":8,"ran_fixture":1,"ran":6,"unverified":2},"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":"2606.05239","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05239","title":"HyFAD: Hybrid Time-Frequency Diffusion with Frequency-Aware Embedding for Time Series Imputation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"hongfangao/HyFAD","path":"diff_models_adaptive.py","file_url":"https://github.com/hongfangao/HyFAD/blob/HEAD/diff_models_adaptive.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, hongfangao/HyFAD when it was checked","code_sha256":"f22a301d97aa2c3e","code_sha256_prefix":"f22a301d97aa2c3e","mcp_get_code":{"code_sha256":"f22a301d97aa2c3e"}},{"arxiv_id":"2603.07523","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07523","title":"Breaking the Scale Barrier: One-Shot Knowledge Transfer via Frequency Transform","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"LUcy0505/FRONT","path":"front_init_deit.py","file_url":"https://github.com/LUcy0505/FRONT/blob/HEAD/front_init_deit.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, LUcy0505/FRONT when it was checked","code_sha256":"80f0f931a054d120","code_sha256_prefix":"80f0f931a054d120","mcp_get_code":{"code_sha256":"80f0f931a054d120"}},{"arxiv_id":"2601.04791","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04791","title":"Measurement-Consistent Langevin Corrector for Stabilizing Latent Diffusion Inverse Problem Solvers","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"FlowDPS-Inverse/FlowDPS","path":"functions/jpeg.py","file_url":"https://github.com/FlowDPS-Inverse/FlowDPS/blob/HEAD/functions/jpeg.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, FlowDPS-Inverse/FlowDPS when it was checked","code_sha256":"b15209709fb2b21d","code_sha256_prefix":"b15209709fb2b21d","mcp_get_code":{"code_sha256":"b15209709fb2b21d"}},{"arxiv_id":"2510.08273","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-08273","title":"One Stone with Two Birds: A Null-Text-Null Frequency-Aware Diffusion Models for Text-Guided Image Inpainting","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"htyjers/NTN-Diff","path":"ntn/ntn_sampler.py","file_url":"https://github.com/htyjers/NTN-Diff/blob/HEAD/ntn/ntn_sampler.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, htyjers/NTN-Diff when it was checked","code_sha256":"0830f5f189e4696e","code_sha256_prefix":"0830f5f189e4696e","mcp_get_code":{"code_sha256":"0830f5f189e4696e"}},{"arxiv_id":"2506.09650","arxiv_id_is_arxiv":true,"paper":"/paper/hopadiff-holistic-partial-aware-fourier","title":"HopaDIFF: Holistic-Partial Aware Fourier Conditioned Diffusion for Referring Human Action Segmentation in Multi-Person Scenarios","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KPeng9510/HopaDIFF","path":"model.py","file_url":"https://github.com/KPeng9510/HopaDIFF/blob/HEAD/model.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":"41779186b8f0dcc8","code_sha256_prefix":"41779186b8f0dcc8","mcp_get_code":{"code_sha256":"41779186b8f0dcc8"}},{"arxiv_id":"2412.07277","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attacks-against-no-reference-image","title":"Backdoor Attacks against No-Reference Image Quality Assessment Models via a Scalable Trigger","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyi-sd/baiqa","path":"network.py","file_url":"https://github.com/yuyi-sd/baiqa/blob/HEAD/network.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yuyi-sd/baiqa when it was checked","code_sha256":"a480f97ef83e404c","code_sha256_prefix":"a480f97ef83e404c","mcp_get_code":{"code_sha256":"a480f97ef83e404c"}},{"arxiv_id":"2406.12814","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-multimodal-agents","title":"Dissecting Adversarial Robustness of Multimodal LM Agents","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenwu98/agent-attack","path":"agent_attack/attacks/clip_attack.py","file_url":"https://github.com/chenwu98/agent-attack/blob/HEAD/agent_attack/attacks/clip_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c3d07280a79397a","code_sha256_prefix":"4c3d07280a79397a","mcp_get_code":{"code_sha256":"4c3d07280a79397a"}},{"arxiv_id":"2406.05531","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-adversarial-transferability-via","title":"Enhancing Adversarial Transferability via Information Bottleneck Constraints","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints","path":"dct.py","file_url":"https://github.com/biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints/blob/HEAD/dct.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, biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints when it was checked","code_sha256":"5f76284c2f8a41bd","code_sha256_prefix":"5f76284c2f8a41bd","mcp_get_code":{"code_sha256":"5f76284c2f8a41bd"}},{"arxiv_id":"2405.13888","arxiv_id_is_arxiv":true,"paper":"/paper/marrying-causal-representation-learning-with","title":"Marrying Causal Representation Learning with Dynamical Systems for Science","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CausalLearningAI/crl-dynamical-systems","path":"marrying/src/utils/dct.py","file_url":"https://github.com/CausalLearningAI/crl-dynamical-systems/blob/HEAD/marrying/src/utils/dct.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94be9d287d02d429","code_sha256_prefix":"94be9d287d02d429","mcp_get_code":{"code_sha256":"94be9d287d02d429"}},{"arxiv_id":"2405.04312","arxiv_id_is_arxiv":true,"paper":"/paper/inf-dit-upsampling-any-resolution-image-with","title":"Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/inf-dit","path":"dit/torch_dct.py","file_url":"https://github.com/thudm/inf-dit/blob/HEAD/dit/torch_dct.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6060d8e21163df8b","code_sha256_prefix":"6060d8e21163df8b","mcp_get_code":{"code_sha256":"6060d8e21163df8b"}},{"arxiv_id":"2404.08255","arxiv_id_is_arxiv":true,"paper":"/paper/practical-region-level-attack-against-segment","title":"Practical Region-level Attack against Segment Anything Models","date":"2024-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenYifanS/S-RA_T-RA","path":"SSAscripts/ssa.py","file_url":"https://github.com/ShenYifanS/S-RA_T-RA/blob/HEAD/SSAscripts/ssa.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, ShenYifanS/S-RA_T-RA when it was checked","code_sha256":"4c3d07280a79397a","code_sha256_prefix":"4c3d07280a79397a","mcp_get_code":{"code_sha256":"4c3d07280a79397a"}},{"arxiv_id":"2403.17460","arxiv_id_is_arxiv":true,"paper":"/paper/building-bridges-across-spatial-and-temporal","title":"Building Bridges across Spatial and Temporal Resolutions: Reference-Based Super-Resolution via Change Priors and Conditional Diffusion Model","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongrunmin/RefDiff","path":"torch_utils/torch_dct.py","file_url":"https://github.com/dongrunmin/RefDiff/blob/HEAD/torch_utils/torch_dct.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, dongrunmin/RefDiff when it was checked","code_sha256":"b15209709fb2b21d","code_sha256_prefix":"b15209709fb2b21d","mcp_get_code":{"code_sha256":"b15209709fb2b21d"}},{"arxiv_id":"2309.03350","arxiv_id_is_arxiv":true,"paper":"/paper/relay-diffusion-unifying-diffusion-process-1","title":"Relay Diffusion: Unifying diffusion process across resolutions for image synthesis","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/RelayDiffusion","path":"blurring.py","file_url":"https://github.com/THUDM/RelayDiffusion/blob/HEAD/blurring.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a480f97ef83e404c","code_sha256_prefix":"a480f97ef83e404c","mcp_get_code":{"code_sha256":"a480f97ef83e404c"}},{"arxiv_id":"2308.08463","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-distill-global-representation-for","title":"Learning to Distill Global Representation for Sparse-View CT","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longzilicart/GloReDi","path":"src/Basic_Freq_Module/torch_dct.py","file_url":"https://github.com/longzilicart/GloReDi/blob/HEAD/src/Basic_Freq_Module/torch_dct.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":"2722de6c59374643","code_sha256_prefix":"2722de6c59374643","mcp_get_code":{"code_sha256":"2722de6c59374643"}},{"arxiv_id":"2308.06703","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-robustness-difference","title":"Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods","date":"2023-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"averyma/opt-robust","path":"src/utils_freq.py","file_url":"https://github.com/averyma/opt-robust/blob/HEAD/src/utils_freq.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, averyma/opt-robust when it was checked","code_sha256":"f0531ec5d46051d8","code_sha256_prefix":"f0531ec5d46051d8","mcp_get_code":{"code_sha256":"f0531ec5d46051d8"}},{"arxiv_id":"2306.12685","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-backward-propagation-for-1","title":"Rethinking the Backward Propagation for Adversarial Transferability","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Trustworthy-AI-Group/RPA","path":"dct.py","file_url":"https://github.com/Trustworthy-AI-Group/RPA/blob/HEAD/dct.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":"29cfe60b8aa41fee","code_sha256_prefix":"29cfe60b8aa41fee","mcp_get_code":{"code_sha256":"29cfe60b8aa41fee"}},{"arxiv_id":"2306.00288","arxiv_id_is_arxiv":true,"paper":"/paper/training-free-neural-architecture-search-for","title":"Training-free Neural Architecture Search for RNNs and Transformers","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaronserianni/training-free-nas","path":"modeling_electra.py","file_url":"https://github.com/aaronserianni/training-free-nas/blob/HEAD/modeling_electra.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":"0e1b2cabd3823f3f","code_sha256_prefix":"0e1b2cabd3823f3f","mcp_get_code":{"code_sha256":"0e1b2cabd3823f3f"}},{"arxiv_id":"2302.02693","arxiv_id_is_arxiv":true,"paper":"/paper/patchdct-patch-refinement-for-high-quality","title":"PatchDCT: Patch Refinement for High Quality Instance Segmentation","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olivia-w12/patchdct","path":"projects/PatchDCT/patchdct/mask_encoding.py","file_url":"https://github.com/olivia-w12/patchdct/blob/HEAD/projects/PatchDCT/patchdct/mask_encoding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"baf95d0e64c9b78d","code_sha256_prefix":"baf95d0e64c9b78d","mcp_get_code":{"code_sha256":"baf95d0e64c9b78d"}},{"arxiv_id":"2209.11888","arxiv_id_is_arxiv":true,"paper":"/paper/jpeg-artifact-correction-using-denoising","title":"JPEG Artifact Correction using Denoising Diffusion Restoration Models","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bahjat-kawar/ddrm-jpeg","path":"functions/denoising.py","file_url":"https://github.com/bahjat-kawar/ddrm-jpeg/blob/HEAD/functions/denoising.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a480f97ef83e404c","code_sha256_prefix":"a480f97ef83e404c","mcp_get_code":{"code_sha256":"a480f97ef83e404c"}},{"arxiv_id":"2206.13397","arxiv_id_is_arxiv":true,"paper":"/paper/generative-modelling-with-inverse-heat","title":"Generative Modelling With Inverse Heat Dissipation","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltoml/generative-inverse-heat-dissipation","path":"model_code/torch_dct.py","file_url":"https://github.com/aaltoml/generative-inverse-heat-dissipation/blob/HEAD/model_code/torch_dct.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from FlowDPS-Inverse/FlowDPS, and GitHub detected no licence in that repository when it was checked","code_sha256":"b15209709fb2b21d","code_sha256_prefix":"b15209709fb2b21d","mcp_get_code":{"code_sha256":"b15209709fb2b21d"}},{"arxiv_id":"2202.00441","arxiv_id_is_arxiv":true,"paper":"/paper/few-bit-backward-quantized-gradients-of","title":"Few-Bit Backward: Quantized Gradients of Activation Functions for Memory Footprint Reduction","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SkoltechAI/fewbit","path":"fewbit/fft.py","file_url":"https://github.com/SkoltechAI/fewbit/blob/HEAD/fewbit/fft.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":"0984394a69efa89b","code_sha256_prefix":"0984394a69efa89b","mcp_get_code":{"code_sha256":"0984394a69efa89b"}},{"arxiv_id":"2105.08997","arxiv_id_is_arxiv":true,"paper":"/paper/when-deep-classifiers-agree-analyzing","title":"When Deep Classifiers Agree: Analyzing Correlations between Learning Order and Image Statistics","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ccc-frankfurt/intrinsic_ordering_nn_training","path":"lib/helpers/dct.py","file_url":"https://github.com/ccc-frankfurt/intrinsic_ordering_nn_training/blob/HEAD/lib/helpers/dct.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":"2722de6c59374643","code_sha256_prefix":"2722de6c59374643","mcp_get_code":{"code_sha256":"2722de6c59374643"}},{"arxiv_id":"2011.04823","arxiv_id_is_arxiv":true,"paper":"/paper/language-through-a-prism-a-spectral-approach","title":"Language Through a Prism: A Spectral Approach for Multiscale Language Representations","date":"2020-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zh217/torch-dct","path":"torch_dct/_dct.py","file_url":"https://github.com/zh217/torch-dct/blob/HEAD/torch_dct/_dct.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":"39394813950ed362","code_sha256_prefix":"39394813950ed362","mcp_get_code":{"code_sha256":"39394813950ed362"}},{"arxiv_id":"aaai_28019","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28019","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"VinAIResearch/COMBAT","path":"train_generator_wanet.py","file_url":"https://github.com/VinAIResearch/COMBAT/blob/HEAD/train_generator_wanet.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":"66c24890aa1cf477","code_sha256_prefix":"66c24890aa1cf477","mcp_get_code":{"code_sha256":"66c24890aa1cf477"}}],"record_sha256":"30223de74c8528904a559a9d68bbe71bdaafac2a46069e4475be9df79e205797","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}