{"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/short-hash","entry":"short_hash","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":10,"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":12,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":16,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":3,"ran_fixture":0,"ran":9,"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":"2608.21252","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-21252","title":"EnSI-RAG: Entity-Structure-Indexed Retrieval-Augmented Generation for Long-Document Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"RamonMeng/EnSI-RAG","path":"ensi-rag-financebench-eval/ensi_financebench/document_preparation.py","file_url":"https://github.com/RamonMeng/EnSI-RAG/blob/HEAD/ensi-rag-financebench-eval/ensi_financebench/document_preparation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, RamonMeng/EnSI-RAG when it was checked","code_sha256":"8b059ea024d8d27a","code_sha256_prefix":"8b059ea024d8d27a","mcp_get_code":{"code_sha256":"8b059ea024d8d27a"}},{"arxiv_id":"2601.07576","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-07576","title":"A Multimodal Dataset of Student Oral Presentations with Sensors and Evaluation Data","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"deepinsight/insightface","path":"python-package/insightface/model_zoo/model_store.py","file_url":"https://github.com/deepinsight/insightface/blob/HEAD/python-package/insightface/model_zoo/model_store.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, deepinsight/insightface when it was checked","code_sha256":"48aa1fdc7e6172f9","code_sha256_prefix":"48aa1fdc7e6172f9","mcp_get_code":{"code_sha256":"48aa1fdc7e6172f9"}},{"arxiv_id":"2506.05310","arxiv_id_is_arxiv":true,"paper":"/paper/learning-normalized-image-densities-via-dual","title":"Learning normalized image densities via dual score matching","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"florentinguth/dualscorematching","path":"memoize.py","file_url":"https://github.com/florentinguth/dualscorematching/blob/HEAD/memoize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19bbbeb6b9e5ba8f","code_sha256_prefix":"19bbbeb6b9e5ba8f","mcp_get_code":{"code_sha256":"19bbbeb6b9e5ba8f"}},{"arxiv_id":"2203.15565","arxiv_id_is_arxiv":true,"paper":"/paper/killing-two-birds-with-one-stone-efficient","title":"Killing Two Birds with One Stone:Efficient and Robust Training of Face Recognition CNNs by Partial FC","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/-insightface","path":"python-package/insightface/model_zoo/model_store.py","file_url":"https://github.com/yangyucheng000/-insightface/blob/HEAD/python-package/insightface/model_zoo/model_store.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from deepinsight/insightface, and GitHub detected no licence in that repository when it was checked","code_sha256":"48aa1fdc7e6172f9","code_sha256_prefix":"48aa1fdc7e6172f9","mcp_get_code":{"code_sha256":"48aa1fdc7e6172f9"}},{"arxiv_id":"2007.05201","arxiv_id_is_arxiv":true,"paper":"/paper/rose-a-retinal-oct-angiography-vessel","title":"ROSE: A Retinal OCT-Angiography Vessel Segmentation Dataset and New Model","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iMED-Lab/OCTA-Net-OCTA-Vessel-Segmentation-Network","path":"code/OCTA-Net/resnest.py","file_url":"https://github.com/iMED-Lab/OCTA-Net-OCTA-Vessel-Segmentation-Network/blob/HEAD/code/OCTA-Net/resnest.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from RobertHong1992/Resnest, and GitHub detected no licence in that repository when it was checked","code_sha256":"979123ace229d553","code_sha256_prefix":"979123ace229d553","mcp_get_code":{"code_sha256":"979123ace229d553"}},{"arxiv_id":"2004.08955","arxiv_id_is_arxiv":true,"paper":"/paper/resnest-split-attention-networks","title":"ResNeSt: Split-Attention Networks","date":"2020-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobertHong1992/Resnest","path":"core/resnest.py","file_url":"https://github.com/RobertHong1992/Resnest/blob/HEAD/core/resnest.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, RobertHong1992/Resnest when it was checked","code_sha256":"979123ace229d553","code_sha256_prefix":"979123ace229d553","mcp_get_code":{"code_sha256":"979123ace229d553"}},{"arxiv_id":"2004.08955","arxiv_id_is_arxiv":true,"paper":"/paper/resnest-split-attention-networks","title":"ResNeSt: Split-Attention Networks","date":"2020-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghang1989/ResNeSt","path":"resnest/gluon/model_store.py","file_url":"https://github.com/zhanghang1989/ResNeSt/blob/HEAD/resnest/gluon/model_store.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":"b06092cd4eb27a10","code_sha256_prefix":"b06092cd4eb27a10","mcp_get_code":{"code_sha256":"b06092cd4eb27a10"}},{"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/model_store.py","file_url":"https://github.com/Andrew-Qibin/SPNet/blob/HEAD/models/model_store.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":"cbac586a86ff7adc","code_sha256_prefix":"cbac586a86ff7adc","mcp_get_code":{"code_sha256":"cbac586a86ff7adc"}},{"arxiv_id":"2003.10778","arxiv_id_is_arxiv":true,"paper":"/paper/pannuke-dataset-extension-insights-and","title":"PanNuke Dataset Extension, Insights and Baselines","date":"2020-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiseem/pointnu-net","path":"models/model_store.py","file_url":"https://github.com/kaiseem/pointnu-net/blob/HEAD/models/model_store.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":"77bc65d2018e9d9e","code_sha256_prefix":"77bc65d2018e9d9e","mcp_get_code":{"code_sha256":"77bc65d2018e9d9e"}},{"arxiv_id":"2003.06505","arxiv_id_is_arxiv":true,"paper":"/paper/autogluon-tabular-robust-and-accurate-automl","title":"AutoGluon-Tabular: Robust and Accurate AutoML for Structured Data","date":"2020-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BingLiHanShuang/AutoGluon_IntegrateSimpleFeedforward","path":"autogluon/model_zoo/model_store.py","file_url":"https://github.com/BingLiHanShuang/AutoGluon_IntegrateSimpleFeedforward/blob/HEAD/autogluon/model_zoo/model_store.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":"9093f79796af5f6c","code_sha256_prefix":"9093f79796af5f6c","mcp_get_code":{"code_sha256":"9093f79796af5f6c"}},{"arxiv_id":"1909.00179","arxiv_id_is_arxiv":true,"paper":"/paper/boundary-aware-feature-propagation-for-scene","title":"Boundary-Aware Feature Propagation for Scene Segmentation","date":"2019-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henghuiding/BFP","path":"utils/models/model_store.py","file_url":"https://github.com/henghuiding/BFP/blob/HEAD/utils/models/model_store.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":"eae432d086b326c5","code_sha256_prefix":"eae432d086b326c5","mcp_get_code":{"code_sha256":"eae432d086b326c5"}},{"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/model_store.py","file_url":"https://github.com/chenwydj/ultra_high_resolution_segmentation/blob/HEAD/models/model_store.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":"2dcd89bf466544aa","code_sha256_prefix":"2dcd89bf466544aa","mcp_get_code":{"code_sha256":"2dcd89bf466544aa"}},{"arxiv_id":"1905.00641","arxiv_id_is_arxiv":true,"paper":"/paper/190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"code-trip/insightface-mxnet","path":"python-package/insightface/model_zoo/model_store.py","file_url":"https://github.com/code-trip/insightface-mxnet/blob/HEAD/python-package/insightface/model_zoo/model_store.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from deepinsight/insightface, and GitHub detected no licence in that repository when it was checked","code_sha256":"48aa1fdc7e6172f9","code_sha256_prefix":"48aa1fdc7e6172f9","mcp_get_code":{"code_sha256":"48aa1fdc7e6172f9"}},{"arxiv_id":"1809.02983","arxiv_id_is_arxiv":true,"paper":"/paper/dual-attention-network-for-scene-segmentation","title":"Dual Attention Network for Scene Segmentation","date":"2018-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junfu1115/DANet","path":"encoding/models/model_store.py","file_url":"https://github.com/junfu1115/DANet/blob/HEAD/encoding/models/model_store.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, junfu1115/DANet, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e8e7fc06d9a54bbc","code_sha256_prefix":"e8e7fc06d9a54bbc","mcp_get_code":{"code_sha256":"e8e7fc06d9a54bbc"}},{"arxiv_id":"1803.08904","arxiv_id_is_arxiv":true,"paper":"/paper/context-encoding-for-semantic-segmentation","title":"Context Encoding for Semantic Segmentation","date":"2018-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"etmwb/cvsegmentation","path":"cvss/models/model_store.py","file_url":"https://github.com/etmwb/cvsegmentation/blob/HEAD/cvss/models/model_store.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, etmwb/cvsegmentation, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"61402045af693de1","code_sha256_prefix":"61402045af693de1","mcp_get_code":{"code_sha256":"61402045af693de1"}},{"arxiv_id":"Li_From_Contexts_to_Locality_Ultra-High_Resolution_Image_Segmentation_via_Locality-Aware_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_From_Contexts_to_Locality_Ultra-High_Resolution_Image_Segmentation_via_Locality-Aware_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"liqiokkk/FCtL","path":"models/model_store.py","file_url":"https://github.com/liqiokkk/FCtL/blob/HEAD/models/model_store.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":"2dcd89bf466544aa","code_sha256_prefix":"2dcd89bf466544aa","mcp_get_code":{"code_sha256":"2dcd89bf466544aa"}}],"record_sha256":"412612ec2319f6b0125da17f4196ef735c0beb43ff5334ff37fa2086a2935d7a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}