{"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/refine","entry":"Refine","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":10,"n_papers_ran_no_instrument_failure":10,"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":10,"n_samples_ran":10,"n_samples_constructed":6,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":7,"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":10,"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":"2404.03635","arxiv_id_is_arxiv":true,"paper":"/paper/wordepth-variational-language-prior-for","title":"WorDepth: Variational Language Prior for Monocular Depth Estimation","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Adonis-galaxy/WorDepth","path":"src/networks/wordepth.py","file_url":"https://github.com/Adonis-galaxy/WorDepth/blob/HEAD/src/networks/wordepth.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, Adonis-galaxy/WorDepth when it was checked","code_sha256":"22c1941ae236e18b","code_sha256_prefix":"22c1941ae236e18b","mcp_get_code":{"code_sha256":"22c1941ae236e18b"}},{"arxiv_id":"2402.18217","arxiv_id_is_arxiv":true,"paper":"/paper/region-aware-exposure-consistency-network-for","title":"Region-Aware Exposure Consistency Network for Mixed Exposure Correction","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kravrolens/RECNet","path":"models/archs/EnhanceN_arch.py","file_url":"https://github.com/kravrolens/RECNet/blob/HEAD/models/archs/EnhanceN_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a3fe57de5f47b21c","code_sha256_prefix":"a3fe57de5f47b21c","mcp_get_code":{"code_sha256":"a3fe57de5f47b21c"}},{"arxiv_id":"2401.02151","arxiv_id_is_arxiv":true,"paper":"/paper/frequency-adaptive-pan-sharpening-with","title":"Frequency-Adaptive Pan-Sharpening with Mixture of Experts","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexhe101/FAME-Net","path":"model/moe.py","file_url":"https://github.com/alexhe101/FAME-Net/blob/HEAD/model/moe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alexhe101/FAME-Net when it was checked","code_sha256":"489d626b9ca31ffc","code_sha256_prefix":"489d626b9ca31ffc","mcp_get_code":{"code_sha256":"489d626b9ca31ffc"}},{"arxiv_id":"2308.14153","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-sampling-transformer-with-uncertainty","title":"Sparse Sampling Transformer with Uncertainty-Driven Ranking for Unified Removal of Raindrops and Rain Streaks","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ephemeral182/UDR-S2Former_deraining","path":"UDR_S2Former.py","file_url":"https://github.com/Ephemeral182/UDR-S2Former_deraining/blob/HEAD/UDR_S2Former.py","status":"ran","verification_level":1,"contract_check":null,"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, Ephemeral182/UDR-S2Former_deraining when it was checked","code_sha256":"808687d27e8153df","code_sha256_prefix":"808687d27e8153df","mcp_get_code":{"code_sha256":"808687d27e8153df"}},{"arxiv_id":"2109.11404","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-memory-matching-network-for","title":"Hierarchical Memory Matching Network for Video Object Segmentation","date":"2021-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hongje/HMMN","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/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, Hongje/HMMN when it was checked","code_sha256":"0aa276a048959a5a","code_sha256_prefix":"0aa276a048959a5a","mcp_get_code":{"code_sha256":"0aa276a048959a5a"}},{"arxiv_id":"2108.08482","arxiv_id_is_arxiv":true,"paper":"/paper/vil-100-a-new-dataset-and-a-baseline-model","title":"VIL-100: A New Dataset and A Baseline Model for Video Instance Lane Detection","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yujun0-0/MMA-Net","path":"libs/models/STM.py","file_url":"https://github.com/yujun0-0/MMA-Net/blob/HEAD/libs/models/STM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yujun0-0/MMA-Net when it was checked","code_sha256":"0e0835b53ed7a160","code_sha256_prefix":"0e0835b53ed7a160","mcp_get_code":{"code_sha256":"0e0835b53ed7a160"}},{"arxiv_id":"2104.10386","arxiv_id_is_arxiv":true,"paper":"/paper/guided-interactive-video-object-segmentation","title":"Guided Interactive Video Object Segmentation Using Reliability-Based Attention Maps","date":"2021-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuk6heo/GIS-RAmap","path":"networks/network.py","file_url":"https://github.com/yuk6heo/GIS-RAmap/blob/HEAD/networks/network.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":"3041bd5ec9f44211","code_sha256_prefix":"3041bd5ec9f44211","mcp_get_code":{"code_sha256":"3041bd5ec9f44211"}},{"arxiv_id":"2103.13746","arxiv_id_is_arxiv":true,"paper":"/paper/video-instance-segmentation-with-a-propose","title":"Video Instance Segmentation with a Propose-Reduce Paradigm","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/proposereduce","path":"mmdet/models/prop_heads/seq_prop_head.py","file_url":"https://github.com/dvlab-research/proposereduce/blob/HEAD/mmdet/models/prop_heads/seq_prop_head.py","status":"ran","verification_level":1,"contract_check":null,"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, dvlab-research/proposereduce when it was checked","code_sha256":"7e8ca60fbece7dea","code_sha256_prefix":"7e8ca60fbece7dea","mcp_get_code":{"code_sha256":"7e8ca60fbece7dea"}},{"arxiv_id":"2103.12934","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-regional-memory-network-for-video","title":"Efficient Regional Memory Network for Video Object Segmentation","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzxie/RMNet","path":"models/rmnet.py","file_url":"https://github.com/hzxie/RMNet/blob/HEAD/models/rmnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47c819e0ff62ea4b","code_sha256_prefix":"47c819e0ff62ea4b","mcp_get_code":{"code_sha256":"47c819e0ff62ea4b"}},{"arxiv_id":"2102.04604","arxiv_id_is_arxiv":true,"paper":"/paper/swiftnet-real-time-video-object-segmentation","title":"SwiftNet: Real-time Video Object Segmentation","date":"2021-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haochenheheda/SwiftNet","path":"swiftnet.py","file_url":"https://github.com/haochenheheda/SwiftNet/blob/HEAD/swiftnet.py","status":"ran","verification_level":1,"contract_check":null,"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, haochenheheda/SwiftNet when it was checked","code_sha256":"7a2451763dfa3a42","code_sha256_prefix":"7a2451763dfa3a42","mcp_get_code":{"code_sha256":"7a2451763dfa3a42"}}],"record_sha256":"355be98d47c1acac1f0fc220cfd3fdbfd190fd569b759fb1b9b952479608d65e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}