{"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/model-fn","entry":"model_fn","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":10,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":11,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":11,"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":0,"ran_fixture":0,"ran":4,"unverified":7},"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":"2311.11600","arxiv_id_is_arxiv":true,"paper":"/paper/deep-equilibrium-diffusion-restoration-with","title":"Deep Equilibrium Diffusion Restoration with Parallel Sampling","date":"2023-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caojiezhang/deqir","path":"utils/utils_model.py","file_url":"https://github.com/caojiezhang/deqir/blob/HEAD/utils/utils_model.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, caojiezhang/deqir when it was checked","code_sha256":"a794526b2a783dce","code_sha256_prefix":"a794526b2a783dce","mcp_get_code":{"code_sha256":"a794526b2a783dce"}},{"arxiv_id":"2010.14150","arxiv_id_is_arxiv":true,"paper":"/paper/fragmentvc-any-to-any-voice-conversion-by-end","title":"FragmentVC: Any-to-Any Voice Conversion by End-to-End Extracting and Fusing Fine-Grained Voice Fragments With Attention","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avanitanna/robustfragmentvc","path":"train_cv_finetune.py","file_url":"https://github.com/avanitanna/robustfragmentvc/blob/HEAD/train_cv_finetune.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":"0bfcaaaf145d9bfa","code_sha256_prefix":"0bfcaaaf145d9bfa","mcp_get_code":{"code_sha256":"0bfcaaaf145d9bfa"}},{"arxiv_id":"1901.05555","arxiv_id_is_arxiv":true,"paper":"/paper/class-balanced-loss-based-on-effective-number","title":"Class-Balanced Loss Based on Effective Number of Samples","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardaecn/class-balanced-loss","path":"tpu/models/experimental/cifar_keras/cifar_keras.py","file_url":"https://github.com/richardaecn/class-balanced-loss/blob/HEAD/tpu/models/experimental/cifar_keras/cifar_keras.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":"a8d0a5e19105636a","code_sha256_prefix":"a8d0a5e19105636a","mcp_get_code":{"code_sha256":"a8d0a5e19105636a"}},{"arxiv_id":"1901.05555","arxiv_id_is_arxiv":true,"paper":"/paper/class-balanced-loss-based-on-effective-number","title":"Class-Balanced Loss Based on Effective Number of Samples","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardaecn/class-balanced-loss","path":"tpu/models/experimental/dcgan/dcgan_main.py","file_url":"https://github.com/richardaecn/class-balanced-loss/blob/HEAD/tpu/models/experimental/dcgan/dcgan_main.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":"7634c2c31837e3f5","code_sha256_prefix":"7634c2c31837e3f5","mcp_get_code":{"code_sha256":"7634c2c31837e3f5"}},{"arxiv_id":"1812.02573","arxiv_id_is_arxiv":true,"paper":"/paper/verifying-fairness-properties-via","title":"Probabilistic Verification of Fairness Properties via Concentration","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"obastani/verifair","path":"python/verifair/main/quickdraw.py","file_url":"https://github.com/obastani/verifair/blob/HEAD/python/verifair/main/quickdraw.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":"a17c80159bb75915","code_sha256_prefix":"a17c80159bb75915","mcp_get_code":{"code_sha256":"a17c80159bb75915"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aws-samples/amazon-sagemaker-bert-pytorch","path":"code/deploy_ei.py","file_url":"https://github.com/aws-samples/amazon-sagemaker-bert-pytorch/blob/HEAD/code/deploy_ei.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT-0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb140e13be89b1b9","code_sha256_prefix":"eb140e13be89b1b9","mcp_get_code":{"code_sha256":"eb140e13be89b1b9"}},{"arxiv_id":"1807.02758","arxiv_id_is_arxiv":true,"paper":"/paper/image-super-resolution-using-very-deep","title":"Image Super-Resolution Using Very Deep Residual Channel Attention Networks","date":"2018-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keerthan2/Residual-Channel-Attention-Network","path":"code/model.py","file_url":"https://github.com/keerthan2/Residual-Channel-Attention-Network/blob/HEAD/code/model.py","status":"unverified","verification_level":0,"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, keerthan2/Residual-Channel-Attention-Network when it was checked","code_sha256":"345a6af0c359845e","code_sha256_prefix":"345a6af0c359845e","mcp_get_code":{"code_sha256":"345a6af0c359845e"}},{"arxiv_id":"1806.02919","arxiv_id_is_arxiv":true,"paper":"/paper/non-local-recurrent-network-for-image","title":"Non-Local Recurrent Network for Image Restoration","date":"2018-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ding-Liu/NLRN","path":"models/nlrn.py","file_url":"https://github.com/Ding-Liu/NLRN/blob/HEAD/models/nlrn.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":"a67673ff07558f6c","code_sha256_prefix":"a67673ff07558f6c","mcp_get_code":{"code_sha256":"a67673ff07558f6c"}},{"arxiv_id":"1801.04381","arxiv_id_is_arxiv":true,"paper":"/paper/mobilenetv2-inverted-residuals-and-linear","title":"MobileNetV2: Inverted Residuals and Linear Bottlenecks","date":"2018-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gideon0805/Tensorflow1.15-Model-Pruning","path":"src/train_pruning_class.py","file_url":"https://github.com/Gideon0805/Tensorflow1.15-Model-Pruning/blob/HEAD/src/train_pruning_class.py","status":"unverified","verification_level":0,"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, Gideon0805/Tensorflow1.15-Model-Pruning when it was checked","code_sha256":"6ff0b95bc2b81704","code_sha256_prefix":"6ff0b95bc2b81704","mcp_get_code":{"code_sha256":"6ff0b95bc2b81704"}},{"arxiv_id":"1608.06993","arxiv_id_is_arxiv":true,"paper":"/paper/densely-connected-convolutional-networks","title":"Densely Connected Convolutional Networks","date":"2016-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lionelmessi6410/ntga","path":"generate_attack.py","file_url":"https://github.com/lionelmessi6410/ntga/blob/HEAD/generate_attack.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":"0594b4cfe3e12a8d","code_sha256_prefix":"0594b4cfe3e12a8d","mcp_get_code":{"code_sha256":"0594b4cfe3e12a8d"}},{"arxiv_id":"Hu_VMNet_Voxel-Mesh_Network_for_Geodesic-Aware_3D_Semantic_Segmentation_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Hu_VMNet_Voxel-Mesh_Network_for_Geodesic-Aware_3D_Semantic_Segmentation_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hzykent/VMNet","path":"network/VMNet.py","file_url":"https://github.com/hzykent/VMNet/blob/HEAD/network/VMNet.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":"67ac541c6860f9c0","code_sha256_prefix":"67ac541c6860f9c0","mcp_get_code":{"code_sha256":"67ac541c6860f9c0"}}],"record_sha256":"547bcec5f06f5a2cdcaaa7d10be2f472d3cf12a14b6161c78d2f1c0a88abb1de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}