{"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/crop-center","entry":"crop_center","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":3,"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":1,"ran_fixture":2,"ran":5,"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":"2411.19158","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-deconvolution-of-astronomical-images","title":"Bayesian Deconvolution of Astronomical Images with Diffusion Models: Quantifying Prior-Driven Features in Reconstructions","date":"2024-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astrodeepnet/diffusion4astro","path":"image_sample_inv.py","file_url":"https://github.com/astrodeepnet/diffusion4astro/blob/HEAD/image_sample_inv.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":"c1aba3fdc02521f3","code_sha256_prefix":"c1aba3fdc02521f3","mcp_get_code":{"code_sha256":"c1aba3fdc02521f3"}},{"arxiv_id":"2406.00645","arxiv_id_is_arxiv":true,"paper":"/paper/furl-visual-language-models-as-fuzzy-rewards","title":"FuRL: Visual-Language Models as Fuzzy Rewards for Reinforcement Learning","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuyw/FuRL","path":"experiments/train_furl.py","file_url":"https://github.com/fuyw/FuRL/blob/HEAD/experiments/train_furl.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fuyw/FuRL when it was checked","code_sha256":"c08628fe9b6245db","code_sha256_prefix":"c08628fe9b6245db","mcp_get_code":{"code_sha256":"c08628fe9b6245db"}},{"arxiv_id":"2403.06462","arxiv_id_is_arxiv":true,"paper":"/paper/towards-the-uncharted-density-descending","title":"Towards the Uncharted: Density-Descending Feature Perturbation for Semi-supervised Semantic Segmentation","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gavinwxy/ddfp","path":"dataset/transform.py","file_url":"https://github.com/gavinwxy/ddfp/blob/HEAD/dataset/transform.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":"6eb28f8d24da4c1d","code_sha256_prefix":"6eb28f8d24da4c1d","mcp_get_code":{"code_sha256":"6eb28f8d24da4c1d"}},{"arxiv_id":"2311.02189","arxiv_id_is_arxiv":true,"paper":"/paper/fairseg-a-large-scale-medical-image","title":"FairSeg: A Large-Scale Medical Image Segmentation Dataset for Fairness Learning Using Segment Anything Model with Fair Error-Bound Scaling","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harvard-ophthalmology-ai-lab/fairseg","path":"TransUNet/datasets/dataset_fairseg.py","file_url":"https://github.com/harvard-ophthalmology-ai-lab/fairseg/blob/HEAD/TransUNet/datasets/dataset_fairseg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, harvard-ophthalmology-ai-lab/fairseg when it was checked","code_sha256":"fd18c8c90c72a792","code_sha256_prefix":"fd18c8c90c72a792","mcp_get_code":{"code_sha256":"fd18c8c90c72a792"}},{"arxiv_id":"2108.02158","arxiv_id_is_arxiv":true,"paper":"/paper/physics-based-noise-modeling-for-extreme-low","title":"Physics-based Noise Modeling for Extreme Low-light Photography","date":"2021-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vandermode/NoiseModel","path":"dataset/sid_dataset.py","file_url":"https://github.com/Vandermode/NoiseModel/blob/HEAD/dataset/sid_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":"103b27cc220783e8","code_sha256_prefix":"103b27cc220783e8","mcp_get_code":{"code_sha256":"103b27cc220783e8"}},{"arxiv_id":"2006.06015","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-segmentation-networks-modelling","title":"Stochastic Segmentation Networks: Modelling Spatially Correlated Aleatoric Uncertainty","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/stochastic_segmentation_networks","path":"ssn/models/base.py","file_url":"https://github.com/biomedia-mira/stochastic_segmentation_networks/blob/HEAD/ssn/models/base.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":"168556b063807692","code_sha256_prefix":"168556b063807692","mcp_get_code":{"code_sha256":"168556b063807692"}},{"arxiv_id":"1905.01576","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-control-in-metric-space-with","title":"Learning to Control in Metric Space with Optimal Regret","date":"2019-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjunhongshen/Deterministic-Control-in-Metric-Space","path":"cartpole_images.py","file_url":"https://github.com/sjunhongshen/Deterministic-Control-in-Metric-Space/blob/HEAD/cartpole_images.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, sjunhongshen/Deterministic-Control-in-Metric-Space when it was checked","code_sha256":"fd18c8c90c72a792","code_sha256_prefix":"fd18c8c90c72a792","mcp_get_code":{"code_sha256":"fd18c8c90c72a792"}},{"arxiv_id":"1805.02410","arxiv_id_is_arxiv":true,"paper":"/paper/mmdenselstm-an-efficient-combination-of","title":"MMDenseLSTM: An efficient combination of convolutional and recurrent neural networks for audio source separation","date":null,"month_inferred_from_arxiv_id":"2018-05","title_source":"archive","repo":"tsurumeso/vocal-remover","path":"lib/spec_utils.py","file_url":"https://github.com/tsurumeso/vocal-remover/blob/HEAD/lib/spec_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":"2c5f4f581b03c006","code_sha256_prefix":"2c5f4f581b03c006","mcp_get_code":{"code_sha256":"2c5f4f581b03c006"}},{"arxiv_id":"1705.06950","arxiv_id_is_arxiv":true,"paper":"/paper/the-kinetics-human-action-video-dataset","title":"The Kinetics Human Action Video Dataset","date":"2017-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OanaIgnat/i3d_keras","path":"src/preprocess.py","file_url":"https://github.com/OanaIgnat/i3d_keras/blob/HEAD/src/preprocess.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e078cbd233af75ee","code_sha256_prefix":"e078cbd233af75ee","mcp_get_code":{"code_sha256":"e078cbd233af75ee"}}],"record_sha256":"385d47b53a8b5fd36e3009cbf90facc69c9efda2f6aec424a9d6888863b4c2d8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}