{"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/gauss","entry":"gauss","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":18,"n_papers_ran_no_instrument_failure":17,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":18,"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":2,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"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":"2508.00443","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-00443","title":"SDMatte: Grafting Diffusion Models for Interactive Matting","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"vivoCameraResearch/SDMatte","path":"utils/evaluate.py","file_url":"https://github.com/vivoCameraResearch/SDMatte/blob/HEAD/utils/evaluate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4085a9b496ef62d","code_sha256_prefix":"b4085a9b496ef62d","mcp_get_code":{"code_sha256":"b4085a9b496ef62d"}},{"arxiv_id":"2402.04613","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-gradient-flows-for-moreau","title":"Wasserstein Gradient Flows for Moreau Envelopes of f-Divergences in Reproducing Kernel Hilbert Spaces","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viktorajstein/regularized_f_divergence_particle_flows","path":"kernels.py","file_url":"https://github.com/viktorajstein/regularized_f_divergence_particle_flows/blob/HEAD/kernels.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, viktorajstein/regularized_f_divergence_particle_flows when it was checked","code_sha256":"9377a4a950459e75","code_sha256_prefix":"9377a4a950459e75","mcp_get_code":{"code_sha256":"9377a4a950459e75"}},{"arxiv_id":"2401.02610","arxiv_id_is_arxiv":true,"paper":"/paper/dhgcn-dynamic-hop-graph-convolution-network","title":"DHGCN: Dynamic Hop Graph Convolution Network for Self-Supervised Point Cloud Learning","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jinec98/DHGCN","path":"obj_cls/model.py","file_url":"https://github.com/Jinec98/DHGCN/blob/HEAD/obj_cls/model.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, Jinec98/DHGCN when it was checked","code_sha256":"2c8aac4af0e3c93e","code_sha256_prefix":"2c8aac4af0e3c93e","mcp_get_code":{"code_sha256":"2c8aac4af0e3c93e"}},{"arxiv_id":"2304.12666","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimization-meets-self-distillation","title":"Bayesian Optimization Meets Self-Distillation","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sooperset/boss","path":"utils/visualize.py","file_url":"https://github.com/sooperset/boss/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"2109.05489","arxiv_id_is_arxiv":true,"paper":"/paper/illuminating-diverse-neural-cellular-automata","title":"Illuminating Diverse Neural Cellular Automata for Level Generation","date":"2021-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smearle/gym-pcgrl","path":"control_pcgrl/evo/models.py","file_url":"https://github.com/smearle/gym-pcgrl/blob/HEAD/control_pcgrl/evo/models.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":"7e891b936316c34e","code_sha256_prefix":"7e891b936316c34e","mcp_get_code":{"code_sha256":"7e891b936316c34e"}},{"arxiv_id":"2012.01426","arxiv_id_is_arxiv":true,"paper":"/paper/stellar-population-inference-with-prospector","title":"Stellar Population Inference with Prospector","date":null,"month_inferred_from_arxiv_id":"2020-12","title_source":"archive","repo":"bd-j/prospector","path":"prospect/models/sedmodel.py","file_url":"https://github.com/bd-j/prospector/blob/HEAD/prospect/models/sedmodel.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2490bc95044a18bc","code_sha256_prefix":"2490bc95044a18bc","mcp_get_code":{"code_sha256":"2490bc95044a18bc"}},{"arxiv_id":"1908.04008","arxiv_id_is_arxiv":true,"paper":"/paper/instance-enhancement-batch-normalization-an","title":"Instance Enhancement Batch Normalization: an Adaptive Regulator of Batch Noise","date":"2019-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbup-group/IEBN","path":"utils/visualize.py","file_url":"https://github.com/gbup-group/IEBN/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1908.03265","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-variance-of-the-adaptive-learning-rate","title":"On the Variance of the Adaptive Learning Rate and Beyond","date":"2019-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiyuanLucasLiu/RAdam","path":"cifar_imagenet/utils/visualize.py","file_url":"https://github.com/LiyuanLucasLiu/RAdam/blob/HEAD/cifar_imagenet/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1907.04371","arxiv_id_is_arxiv":true,"paper":"/paper/a-stochastic-first-order-method-for-ordered","title":"Ordered SGD: A New Stochastic Optimization Framework for Empirical Risk Minimization","date":"2019-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenjikawaguchi/qSGD","path":"cifar10_WideResNet/utils/visualize.py","file_url":"https://github.com/kenjikawaguchi/qSGD/blob/HEAD/cifar10_WideResNet/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1907.00208","arxiv_id_is_arxiv":true,"paper":"/paper/deep-gamblers-learning-to-abstain-with","title":"Deep Gamblers: Learning to Abstain with Portfolio Theory","date":"2019-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Z-T-WANG/NIPS2019DeepGamblers","path":"utils/visualize.py","file_url":"https://github.com/Z-T-WANG/NIPS2019DeepGamblers/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1905.10671","arxiv_id_is_arxiv":true,"paper":"/paper/dianet-dense-and-implicit-attention-network","title":"DIANet: Dense-and-Implicit Attention Network","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbup-group/DIANet","path":"utils/visualize.py","file_url":"https://github.com/gbup-group/DIANet/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1904.05514","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-information-leakage-in-image","title":"Mitigating Information Leakage in Image Representations: A Maximum Entropy Approach","date":"2019-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"human-analysis/MaxEnt-ARL","path":"utils/visualize.py","file_url":"https://github.com/human-analysis/MaxEnt-ARL/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1812.10025","arxiv_id_is_arxiv":true,"paper":"/paper/attention-branch-network-learning-of","title":"Attention Branch Network: Learning of Attention Mechanism for Visual Explanation","date":"2018-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"machine-perception-robotics-group/attention_branch_network","path":"utils/visualize.py","file_url":"https://github.com/machine-perception-robotics-group/attention_branch_network/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1811.05850","arxiv_id_is_arxiv":true,"paper":"/paper/drop-activation-implicit-parameter-reduction","title":"Drop-Activation: Implicit Parameter Reduction and Harmonic Regularization","date":"2018-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeungSamWai/Drop-Activation","path":"utils/visualize.py","file_url":"https://github.com/LeungSamWai/Drop-Activation/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1806.04606","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-distillation-by-on-the-fly-native","title":"Knowledge Distillation by On-the-Fly Native Ensemble","date":"2018-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lan1991Xu/ONE_NeurIPS2018","path":"utils/visualize.py","file_url":"https://github.com/Lan1991Xu/ONE_NeurIPS2018/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1805.07925","arxiv_id_is_arxiv":true,"paper":"/paper/batch-instance-normalization-for-adaptively","title":"Batch-Instance Normalization for Adaptively Style-Invariant Neural Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyeonseob-nam/Batch-Instance-Normalization","path":"utils/visualize.py","file_url":"https://github.com/hyeonseob-nam/Batch-Instance-Normalization/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}},{"arxiv_id":"1312.6082","arxiv_id_is_arxiv":true,"paper":"/paper/multi-digit-number-recognition-from-street","title":"Multi-digit Number Recognition from Street View Imagery using Deep Convolutional Neural Networks","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Factotum8/test_task_street_view_house_numbers","path":"CNN_eval.py","file_url":"https://github.com/Factotum8/test_task_street_view_house_numbers/blob/HEAD/CNN_eval.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":"c1f2fbdbe5cfa21f","code_sha256_prefix":"c1f2fbdbe5cfa21f","mcp_get_code":{"code_sha256":"c1f2fbdbe5cfa21f"}},{"arxiv_id":"03451","arxiv_id_is_arxiv":false,"paper":null,"title":"id 03451 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zhongshsh/ASR","path":"utils/visualize.py","file_url":"https://github.com/zhongshsh/ASR/blob/HEAD/utils/visualize.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":"d66f0a3cbb86204c","code_sha256_prefix":"d66f0a3cbb86204c","mcp_get_code":{"code_sha256":"d66f0a3cbb86204c"}}],"record_sha256":"8e4bad4ec1bd101b50d928bac4c86de948070f38b0db4cb9b7c9ab9e1c73a68b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}