{"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/normalize-img","entry":"normalize_img","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":13,"n_places_pointer_only":4,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":1},"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":"2503.01257","arxiv_id_is_arxiv":true,"paper":"/paper/svdc-consistent-direct-time-of-flight-video","title":"SVDC: Consistent Direct Time-of-Flight Video Depth Completion with Frequency Selective Fusion","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lan1eve/SVDC","path":"gmflow/utils.py","file_url":"https://github.com/Lan1eve/SVDC/blob/HEAD/gmflow/utils.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":"b1ba789ed7470207","code_sha256_prefix":"b1ba789ed7470207","mcp_get_code":{"code_sha256":"b1ba789ed7470207"}},{"arxiv_id":"2503.01257","arxiv_id_is_arxiv":true,"paper":"/paper/svdc-consistent-direct-time-of-flight-video","title":"SVDC: Consistent Direct Time-of-Flight Video Depth Completion with Frequency Selective Fusion","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lan1eve/SVDC","path":"calculate_metrics.py","file_url":"https://github.com/Lan1eve/SVDC/blob/HEAD/calculate_metrics.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":"d01a7936484699f7","code_sha256_prefix":"d01a7936484699f7","mcp_get_code":{"code_sha256":"d01a7936484699f7"}},{"arxiv_id":"2410.13175","arxiv_id_is_arxiv":true,"paper":"/paper/tcp-diffusion-a-multi-modal-diffusion-model","title":"TCP-Diffusion: A Multi-modal Diffusion Model for Global Tropical Cyclone Precipitation Forecasting with Change Awareness","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zjut-MultimediaPlus/TCP-Diffusion","path":"video_diffusion_pytorch/rainfall_diffusion_F4_E1ifs_0316.py","file_url":"https://github.com/Zjut-MultimediaPlus/TCP-Diffusion/blob/HEAD/video_diffusion_pytorch/rainfall_diffusion_F4_E1ifs_0316.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, Zjut-MultimediaPlus/TCP-Diffusion when it was checked","code_sha256":"906dac1256db387d","code_sha256_prefix":"906dac1256db387d","mcp_get_code":{"code_sha256":"906dac1256db387d"}},{"arxiv_id":"2312.13299","arxiv_id_is_arxiv":true,"paper":"/paper/compact-3d-scene-representation-via-self","title":"Compact 3D Scene Representation via Self-Organizing Gaussian Grids","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fraunhoferhhi/Self-Organizing-Gaussians","path":"compression/codec.py","file_url":"https://github.com/fraunhoferhhi/Self-Organizing-Gaussians/blob/HEAD/compression/codec.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, fraunhoferhhi/Self-Organizing-Gaussians (NOASSERTION)","code_sha256":"bb1a101c33c97d1e","code_sha256_prefix":"bb1a101c33c97d1e","mcp_get_code":{"code_sha256":"bb1a101c33c97d1e"}},{"arxiv_id":"2309.05281","arxiv_id_is_arxiv":true,"paper":"/paper/class-incremental-grouping-network-for","title":"Class-Incremental Grouping Network for Continual Audio-Visual Learning","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stonemo/cign","path":"utils.py","file_url":"https://github.com/stonemo/cign/blob/HEAD/utils.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":"e7357eb51f7bea31","code_sha256_prefix":"e7357eb51f7bea31","mcp_get_code":{"code_sha256":"e7357eb51f7bea31"}},{"arxiv_id":"2308.02097","arxiv_id_is_arxiv":true,"paper":"/paper/multi-interactive-feature-learning-and-a-full","title":"Multi-interactive Feature Learning and a Full-time Multi-modality Benchmark for Image Fusion and Segmentation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinyuanliu-cv/segmif","path":"datasets/imutils.py","file_url":"https://github.com/jinyuanliu-cv/segmif/blob/HEAD/datasets/imutils.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, jinyuanliu-cv/segmif when it was checked","code_sha256":"d1a6979f946f9e74","code_sha256_prefix":"d1a6979f946f9e74","mcp_get_code":{"code_sha256":"d1a6979f946f9e74"}},{"arxiv_id":"2306.02562","arxiv_id_is_arxiv":true,"paper":"/paper/video-diffusion-models-with-local-global","title":"Video Diffusion Models with Local-Global Context Guidance","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"exisas/LGC-VD","path":"video_diffusion_pytorch/diffusion.py","file_url":"https://github.com/exisas/LGC-VD/blob/HEAD/video_diffusion_pytorch/diffusion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 Zjut-MultimediaPlus/TCP-Diffusion, and GitHub detected no licence in that repository when it was checked","code_sha256":"906dac1256db387d","code_sha256_prefix":"906dac1256db387d","mcp_get_code":{"code_sha256":"906dac1256db387d"}},{"arxiv_id":"2209.09634","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-weakly-supervised-audio","title":"A Closer Look at Weakly-Supervised Audio-Visual Source Localization","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stonemo/slavc","path":"utils.py","file_url":"https://github.com/stonemo/slavc/blob/HEAD/utils.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":"e7357eb51f7bea31","code_sha256_prefix":"e7357eb51f7bea31","mcp_get_code":{"code_sha256":"e7357eb51f7bea31"}},{"arxiv_id":"2205.13571","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-lottery-tickets-finding-efficient","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csmmlab/dlranet","path":"src/mnist_DLRT.py","file_url":"https://github.com/csmmlab/dlranet/blob/HEAD/src/mnist_DLRT.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":"0bc1827082ea37b5","code_sha256_prefix":"0bc1827082ea37b5","mcp_get_code":{"code_sha256":"0bc1827082ea37b5"}},{"arxiv_id":"2111.13680","arxiv_id_is_arxiv":true,"paper":"/paper/gmflow-learning-optical-flow-via-global","title":"GMFlow: Learning Optical Flow via Global Matching","date":"2021-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haofeixu/gmflow","path":"gmflow/utils.py","file_url":"https://github.com/haofeixu/gmflow/blob/HEAD/gmflow/utils.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":"b1ba789ed7470207","code_sha256_prefix":"b1ba789ed7470207","mcp_get_code":{"code_sha256":"b1ba789ed7470207"}},{"arxiv_id":"2008.04237","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-of-audio-visual","title":"Self-Supervised Learning of Audio-Visual Objects from Video","date":"2020-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"afourast/avobjects","path":"viz_utils.py","file_url":"https://github.com/afourast/avobjects/blob/HEAD/viz_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":"e7357eb51f7bea31","code_sha256_prefix":"e7357eb51f7bea31","mcp_get_code":{"code_sha256":"e7357eb51f7bea31"}},{"arxiv_id":"1509.09308","arxiv_id_is_arxiv":true,"paper":"/paper/fast-algorithms-for-convolutional-neural","title":"Fast Algorithms for Convolutional Neural Networks","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaoMi/mace","path":"micro/pretrained_models/keras/mnist/mnist_keras.py","file_url":"https://github.com/XiaoMi/mace/blob/HEAD/micro/pretrained_models/keras/mnist/mnist_keras.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":"6fc2401962e121fb","code_sha256_prefix":"6fc2401962e121fb","mcp_get_code":{"code_sha256":"6fc2401962e121fb"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjsong/sspl","path":"sspl_w_pcm/utils.py","file_url":"https://github.com/zjsong/sspl/blob/HEAD/sspl_w_pcm/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":"f3de63f91af92ad1","code_sha256_prefix":"f3de63f91af92ad1","mcp_get_code":{"code_sha256":"f3de63f91af92ad1"}}],"record_sha256":"c235fdee08eb64bcba170f844286fd115454f7d548604e2f721c462e31e932ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}