{"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/conv-net","entry":"conv_net","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":8,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":2,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":10,"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":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":6},"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":"2605.25616","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25616","title":"Courtroom Analogy: New Perspective on Uncertainty-Aware Classification","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TaeseongYoon/MoDEX","path":"models.py","file_url":"https://github.com/TaeseongYoon/MoDEX/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d3875a213c74223c","code_sha256_prefix":"d3875a213c74223c","mcp_get_code":{"code_sha256":"d3875a213c74223c"}},{"arxiv_id":"2510.18322","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-18322","title":"Uncertainty Estimation by Flexible Evidential Deep Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"TaeseongYoon/F-EDL","path":"models.py","file_url":"https://github.com/TaeseongYoon/F-EDL/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, TaeseongYoon/F-EDL when it was checked","code_sha256":"da0c11b5601f20e5","code_sha256_prefix":"da0c11b5601f20e5","mcp_get_code":{"code_sha256":"da0c11b5601f20e5"}},{"arxiv_id":"2311.16833","arxiv_id_is_arxiv":true,"paper":"/paper/1-lipschitz-layers-compared-memory-speed-and","title":"1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berndprach/1lipschitzlayerscompared","path":"models/simplified_conv_net.py","file_url":"https://github.com/berndprach/1lipschitzlayerscompared/blob/HEAD/models/simplified_conv_net.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":"d01cf17f6047ced1","code_sha256_prefix":"d01cf17f6047ced1","mcp_get_code":{"code_sha256":"d01cf17f6047ced1"}},{"arxiv_id":"1904.05049","arxiv_id_is_arxiv":true,"paper":"/paper/drop-an-octave-reducing-spatial-redundancy-in","title":"Drop an Octave: Reducing Spatial Redundancy in Convolutional Neural Networks with Octave Convolution","date":"2019-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markliou/OctConv","path":"VanillaConv_cifar10.py","file_url":"https://github.com/markliou/OctConv/blob/HEAD/VanillaConv_cifar10.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":"112117a703e03d5c","code_sha256_prefix":"112117a703e03d5c","mcp_get_code":{"code_sha256":"112117a703e03d5c"}},{"arxiv_id":"1904.04472","arxiv_id_is_arxiv":true,"paper":"/paper/190404472","title":"Probability density distillation with generative adversarial networks for high-quality parallel waveform generation","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markliou/model_distillation","path":"mnist_distillation.py","file_url":"https://github.com/markliou/model_distillation/blob/HEAD/mnist_distillation.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":"315e181a80930c67","code_sha256_prefix":"315e181a80930c67","mcp_get_code":{"code_sha256":"315e181a80930c67"}},{"arxiv_id":"1904.04472","arxiv_id_is_arxiv":true,"paper":"/paper/190404472","title":"Probability density distillation with generative adversarial networks for high-quality parallel waveform generation","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markliou/model_distillation","path":"mnist_distillation_ad.py","file_url":"https://github.com/markliou/model_distillation/blob/HEAD/mnist_distillation_ad.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":"3d0901d6d44dabc7","code_sha256_prefix":"3d0901d6d44dabc7","mcp_get_code":{"code_sha256":"3d0901d6d44dabc7"}},{"arxiv_id":"1904.04472","arxiv_id_is_arxiv":true,"paper":"/paper/190404472","title":"Probability density distillation with generative adversarial networks for high-quality parallel waveform generation","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markliou/model_distillation","path":"mnist_distillation_ad_check.py","file_url":"https://github.com/markliou/model_distillation/blob/HEAD/mnist_distillation_ad_check.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":"b61b2e1085ff3682","code_sha256_prefix":"b61b2e1085ff3682","mcp_get_code":{"code_sha256":"b61b2e1085ff3682"}},{"arxiv_id":"1903.03096","arxiv_id_is_arxiv":true,"paper":"/paper/meta-dataset-a-dataset-of-datasets-for","title":"Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examples","date":"2019-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebadrian/metadl","path":"baselines/maml/helper.py","file_url":"https://github.com/ebadrian/metadl/blob/HEAD/baselines/maml/helper.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":"ab96a11f341b7378","code_sha256_prefix":"ab96a11f341b7378","mcp_get_code":{"code_sha256":"ab96a11f341b7378"}},{"arxiv_id":"1603.08511","arxiv_id_is_arxiv":true,"paper":"/paper/colorful-image-colorization","title":"Colorful Image Colorization","date":"2016-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arghyadeep/Image-Colorization-using-CNN","path":"Code/colorize_cnn.py","file_url":"https://github.com/Arghyadeep/Image-Colorization-using-CNN/blob/HEAD/Code/colorize_cnn.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, Arghyadeep/Image-Colorization-using-CNN when it was checked","code_sha256":"335ba79e7753d1ab","code_sha256_prefix":"335ba79e7753d1ab","mcp_get_code":{"code_sha256":"335ba79e7753d1ab"}},{"arxiv_id":"Prach_1-Lipschitz_Layers_Compared_Memory_Speed_and_Certifiable_Robustness_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Prach_1-Lipschitz_Layers_Compared_Memory_Speed_and_Certifiable_Robustness_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"berndprach/1LipschitzLayersCompared","path":"models/simplified_conv_net.py","file_url":"https://github.com/berndprach/1LipschitzLayersCompared/blob/HEAD/models/simplified_conv_net.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":"d01cf17f6047ced1","code_sha256_prefix":"d01cf17f6047ced1","mcp_get_code":{"code_sha256":"d01cf17f6047ced1"}}],"record_sha256":"d2675d69e43c7515bb1ba06480c932d5478c170ba3e9f455d49c816dded1cfa0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}