{"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/resnet101","entry":"resnet101","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":24,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":5,"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":22,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":5,"n_samples_unverified":11,"n_samples_fingerprinted":0,"n_places":24,"n_places_pointer_only":9,"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":5,"ran_fixture":0,"ran":6,"unverified":11},"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":"2505.05522","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-thought-machines","title":"Continuous Thought Machines","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SakanaAI/continuous-thought-machines","path":"models/ctm.py","file_url":"https://github.com/SakanaAI/continuous-thought-machines/blob/HEAD/models/ctm.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":"388020d20161fcd4","code_sha256_prefix":"388020d20161fcd4","mcp_get_code":{"code_sha256":"388020d20161fcd4"}},{"arxiv_id":"2402.17726","arxiv_id_is_arxiv":true,"paper":"/paper/vrp-sam-sam-with-visual-reference-prompt","title":"VRP-SAM: SAM with Visual Reference Prompt","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syp2ysy/VRP-SAM","path":"model/VRP_encoder.py","file_url":"https://github.com/syp2ysy/VRP-SAM/blob/HEAD/model/VRP_encoder.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":"e2f6e006a0c3cd9f","code_sha256_prefix":"e2f6e006a0c3cd9f","mcp_get_code":{"code_sha256":"e2f6e006a0c3cd9f"}},{"arxiv_id":"2311.16450","arxiv_id_is_arxiv":true,"paper":"/paper/typhoon-intensity-prediction-with-vision","title":"Typhoon Intensity Prediction with Vision Transformer","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chen-huanxin/Tint","path":"models/origin_resnet.py","file_url":"https://github.com/chen-huanxin/Tint/blob/HEAD/models/origin_resnet.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, chen-huanxin/Tint when it was checked","code_sha256":"4c28563cb29215c4","code_sha256_prefix":"4c28563cb29215c4","mcp_get_code":{"code_sha256":"4c28563cb29215c4"}},{"arxiv_id":"2308.07934","arxiv_id_is_arxiv":true,"paper":"/paper/one-bit-flip-is-all-you-need-when-bit-flip","title":"One-bit Flip is All You Need: When Bit-flip Attack Meets Model Training","date":"2023-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianshuod/tba","path":"models/quan_resnet_imagenet.py","file_url":"https://github.com/jianshuod/tba/blob/HEAD/models/quan_resnet_imagenet.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":"d12f282b670852c9","code_sha256_prefix":"d12f282b670852c9","mcp_get_code":{"code_sha256":"d12f282b670852c9"}},{"arxiv_id":"2210.09879","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-visualization-of-image-datasets","title":"Unsupervised visualization of image datasets using contrastive learning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berenslab/t-simcne","path":"tsimcne/tsimcne.py","file_url":"https://github.com/berenslab/t-simcne/blob/HEAD/tsimcne/tsimcne.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, berenslab/t-simcne when it was checked","code_sha256":"a86999ce90809772","code_sha256_prefix":"a86999ce90809772","mcp_get_code":{"code_sha256":"a86999ce90809772"}},{"arxiv_id":"2208.06974","arxiv_id_is_arxiv":true,"paper":"/paper/learning-semantic-correspondence-with-sparse","title":"Learning Semantic Correspondence with Sparse Annotations","date":"2022-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuaiyihuang/scorrsan","path":"models/model/scorrsan.py","file_url":"https://github.com/shuaiyihuang/scorrsan/blob/HEAD/models/model/scorrsan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, shuaiyihuang/scorrsan, is not in the permissive set Syntology serves inline","code_sha256":"412a3781a8d0a1bc","code_sha256_prefix":"412a3781a8d0a1bc","mcp_get_code":{"code_sha256":"412a3781a8d0a1bc"}},{"arxiv_id":"2206.01934","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-multiple-target-sampling-gradient","title":"Stochastic Multiple Target Sampling Gradient Descent","date":"2022-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isl-org/MultiObjectiveOptimization","path":"multi_task/models/resnet_mit.py","file_url":"https://github.com/isl-org/MultiObjectiveOptimization/blob/HEAD/multi_task/models/resnet_mit.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":"deddf757c7ef17c5","code_sha256_prefix":"deddf757c7ef17c5","mcp_get_code":{"code_sha256":"deddf757c7ef17c5"}},{"arxiv_id":"2204.09903","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-the-prototype-divide-and-conquer","title":"Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chunbolang/DCP","path":"model/DCP.py","file_url":"https://github.com/chunbolang/DCP/blob/HEAD/model/DCP.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae93e3b60685c29d","code_sha256_prefix":"ae93e3b60685c29d","mcp_get_code":{"code_sha256":"ae93e3b60685c29d"}},{"arxiv_id":"2203.02172","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-aware-representation-blending-for","title":"Semantic-Aware Representation Blending for Multi-Label Image Recognition with Partial Labels","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HCPLab-SYSU/HCP-MLR-PL","path":"model/SARB.py","file_url":"https://github.com/HCPLab-SYSU/HCP-MLR-PL/blob/HEAD/model/SARB.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, HCPLab-SYSU/HCP-MLR-PL when it was checked","code_sha256":"0df3f7fc5719d71e","code_sha256_prefix":"0df3f7fc5719d71e","mcp_get_code":{"code_sha256":"0df3f7fc5719d71e"}},{"arxiv_id":"2202.11202","arxiv_id_is_arxiv":true,"paper":"/paper/indiscriminate-poisoning-attacks-on","title":"Indiscriminate Poisoning Attacks on Unsupervised Contrastive Learning","date":"2022-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwenzha/contrastive-poisoning","path":"model.py","file_url":"https://github.com/kaiwenzha/contrastive-poisoning/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"188a542bb3d0c413","code_sha256_prefix":"188a542bb3d0c413","mcp_get_code":{"code_sha256":"188a542bb3d0c413"}},{"arxiv_id":"2110.00970","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-guided-zero-shot-learning-for-low","title":"Semantic-Guided Zero-Shot Learning for Low-Light Image/Video Enhancement","date":"2021-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenZheng2000/Semantic-Guided-Low-Light-Image-Enhancement","path":"modeling/resnet.py","file_url":"https://github.com/ShenZheng2000/Semantic-Guided-Low-Light-Image-Enhancement/blob/HEAD/modeling/resnet.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":"c7423f05f117cdcb","code_sha256_prefix":"c7423f05f117cdcb","mcp_get_code":{"code_sha256":"c7423f05f117cdcb"}},{"arxiv_id":"2107.02156","arxiv_id_is_arxiv":true,"paper":"/paper/do-different-tracking-tasks-require-different","title":"Do Different Tracking Tasks Require Different Appearance Models?","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhongdao/UniTrack","path":"model/model.py","file_url":"https://github.com/Zhongdao/UniTrack/blob/HEAD/model/model.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":"33b995998b62c580","code_sha256_prefix":"33b995998b62c580","mcp_get_code":{"code_sha256":"33b995998b62c580"}},{"arxiv_id":"2104.02613","arxiv_id_is_arxiv":true,"paper":"/paper/mutual-graph-learning-for-camouflaged-object","title":"Mutual Graph Learning for Camouflaged Object Detection","date":"2021-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanyang587/MGL","path":"model/mglnet.py","file_url":"https://github.com/fanyang587/MGL/blob/HEAD/model/mglnet.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, fanyang587/MGL when it was checked","code_sha256":"4b24d57ee9d24676","code_sha256_prefix":"4b24d57ee9d24676","mcp_get_code":{"code_sha256":"4b24d57ee9d24676"}},{"arxiv_id":"2104.02243","arxiv_id_is_arxiv":true,"paper":"/paper/3d-to-2d-distillation-for-indoor-scene","title":"3D-to-2D Distillation for Indoor Scene Parsing","date":"2021-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuzhengzhe/3D-to-2D-Distillation-for-Indoor-Scene-Parsing","path":"3d-2d-distillation/model/psanet.py","file_url":"https://github.com/liuzhengzhe/3D-to-2D-Distillation-for-Indoor-Scene-Parsing/blob/HEAD/3d-2d-distillation/model/psanet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liuzhengzhe/3D-to-2D-Distillation-for-Indoor-Scene-Parsing when it was checked","code_sha256":"764fd2589f954854","code_sha256_prefix":"764fd2589f954854","mcp_get_code":{"code_sha256":"764fd2589f954854"}},{"arxiv_id":"2003.13328","arxiv_id_is_arxiv":true,"paper":"/paper/2003-13328","title":"Strip Pooling: Rethinking Spatial Pooling for Scene Parsing","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andrew-Qibin/SPNet","path":"models/resnet.py","file_url":"https://github.com/Andrew-Qibin/SPNet/blob/HEAD/models/resnet.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":"3679a69b2193a551","code_sha256_prefix":"3679a69b2193a551","mcp_get_code":{"code_sha256":"3679a69b2193a551"}},{"arxiv_id":"2003.08607","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptation-via-4","title":"Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorilla-lab-scut/srdc-cvpr2020","path":"models/resnet.py","file_url":"https://github.com/gorilla-lab-scut/srdc-cvpr2020/blob/HEAD/models/resnet.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":"22d0ebffba4ad6a5","code_sha256_prefix":"22d0ebffba4ad6a5","mcp_get_code":{"code_sha256":"22d0ebffba4ad6a5"}},{"arxiv_id":"2003.00832","arxiv_id_is_arxiv":true,"paper":"/paper/an-end-to-end-visual-audio-attention-network","title":"An End-to-End Visual-Audio Attention Network for Emotion Recognition in User-Generated Videos","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maysonma/VAANet","path":"models/vaanet.py","file_url":"https://github.com/maysonma/VAANet/blob/HEAD/models/vaanet.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, maysonma/VAANet when it was checked","code_sha256":"a6d391f0f1cb1769","code_sha256_prefix":"a6d391f0f1cb1769","mcp_get_code":{"code_sha256":"a6d391f0f1cb1769"}},{"arxiv_id":"1909.13130","arxiv_id_is_arxiv":true,"paper":"/paper/grouped-spatial-temporal-aggregation-for","title":"Grouped Spatial-Temporal Aggregation for Efficient Action Recognition","date":"2019-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenxuluo/GST-video","path":"GST.py","file_url":"https://github.com/chenxuluo/GST-video/blob/HEAD/GST.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":"cf910ac82480d5a5","code_sha256_prefix":"cf910ac82480d5a5","mcp_get_code":{"code_sha256":"cf910ac82480d5a5"}},{"arxiv_id":"1905.06368","arxiv_id_is_arxiv":true,"paper":"/paper/190506368","title":"Collaborative Global-Local Networks for Memory-Efficient Segmentation of Ultra-High Resolution Images","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenwydj/ultra_high_resolution_segmentation","path":"models/resnet.py","file_url":"https://github.com/chenwydj/ultra_high_resolution_segmentation/blob/HEAD/models/resnet.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":"c7423f05f117cdcb","code_sha256_prefix":"c7423f05f117cdcb","mcp_get_code":{"code_sha256":"c7423f05f117cdcb"}},{"arxiv_id":"1902.09777","arxiv_id_is_arxiv":true,"paper":"/paper/single-image-piece-wise-planar-3d","title":"Single-Image Piece-wise Planar 3D Reconstruction via Associative Embedding","date":"2019-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"svip-lab/PlanarReconstruction","path":"models/resnet_scene.py","file_url":"https://github.com/svip-lab/PlanarReconstruction/blob/HEAD/models/resnet_scene.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":"63c27e56a1dfdea5","code_sha256_prefix":"63c27e56a1dfdea5","mcp_get_code":{"code_sha256":"63c27e56a1dfdea5"}},{"arxiv_id":"1810.04650","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-learning-as-multi-objective","title":"Multi-Task Learning as Multi-Objective Optimization","date":"2018-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IntelVCL/MultiObjectiveOptimization","path":"multi_task/models/resnet_mit.py","file_url":"https://github.com/IntelVCL/MultiObjectiveOptimization/blob/HEAD/multi_task/models/resnet_mit.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":"deddf757c7ef17c5","code_sha256_prefix":"deddf757c7ef17c5","mcp_get_code":{"code_sha256":"deddf757c7ef17c5"}},{"arxiv_id":"1802.02611","arxiv_id_is_arxiv":true,"paper":"/paper/encoder-decoder-with-atrous-separable","title":"Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation","date":"2018-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petko-nikolov/pysemseg","path":"pysemseg/models/deeplab.py","file_url":"https://github.com/petko-nikolov/pysemseg/blob/HEAD/pysemseg/models/deeplab.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, petko-nikolov/pysemseg, is not in the permissive set Syntology serves inline","code_sha256":"c5fb690670bbe8da","code_sha256_prefix":"c5fb690670bbe8da","mcp_get_code":{"code_sha256":"c5fb690670bbe8da"}},{"arxiv_id":"1705.09759","arxiv_id_is_arxiv":true,"paper":"/paper/casenet-deep-category-aware-semantic-edge","title":"CASENet: Deep Category-Aware Semantic Edge Detection","date":"2017-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milongo/CASENet","path":"models/resnet.py","file_url":"https://github.com/milongo/CASENet/blob/HEAD/models/resnet.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, milongo/CASENet when it was checked","code_sha256":"7ebed0ef3d87ac83","code_sha256_prefix":"7ebed0ef3d87ac83","mcp_get_code":{"code_sha256":"7ebed0ef3d87ac83"}},{"arxiv_id":"aaai_29654","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29654","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zcy866/CSR","path":"model.py","file_url":"https://github.com/zcy866/CSR/blob/HEAD/model.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":"2464f34ea2ca5798","code_sha256_prefix":"2464f34ea2ca5798","mcp_get_code":{"code_sha256":"2464f34ea2ca5798"}}],"record_sha256":"3510e20b873e35dae6d826d2563a44eac836b488285ffacd4ef71a2e2c8bc948","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}