{"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/asppconv","entry":"ASPPConv","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"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":6,"n_samples_ran":6,"n_samples_constructed":5,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":6,"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":1,"ran_fixture":0,"ran":5,"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":"2606.02221","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02221","title":"CORE-MTL: Rethinking Gradient Balancing via Causal Orthogonal Representations","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Hope-Rita/CORE-MTL","path":"models/causal_model.py","file_url":"https://github.com/Hope-Rita/CORE-MTL/blob/HEAD/models/causal_model.py","status":"ran","verification_level":1,"contract_check":null,"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, Hope-Rita/CORE-MTL when it was checked","code_sha256":"6fd767bdb1a93cbc","code_sha256_prefix":"6fd767bdb1a93cbc","mcp_get_code":{"code_sha256":"6fd767bdb1a93cbc"}},{"arxiv_id":"2407.04036","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-pixels-semi-supervised-semantic","title":"Beyond Pixels: Semi-Supervised Semantic Segmentation with a Multi-scale Patch-based Multi-Label Classifier","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-stonybrook/beyond-pixels","path":"model/semseg/deeplabv3plus.py","file_url":"https://github.com/cvlab-stonybrook/beyond-pixels/blob/HEAD/model/semseg/deeplabv3plus.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, cvlab-stonybrook/beyond-pixels when it was checked","code_sha256":"392d0834780485a1","code_sha256_prefix":"392d0834780485a1","mcp_get_code":{"code_sha256":"392d0834780485a1"}},{"arxiv_id":"2405.20610","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-and-maximizing-temporal-knowledge","title":"Revisiting and Maximizing Temporal Knowledge in Semi-supervised Semantic Segmentation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wooseok-shin/PrevMatch","path":"model/semseg/deeplabv3plus.py","file_url":"https://github.com/wooseok-shin/PrevMatch/blob/HEAD/model/semseg/deeplabv3plus.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 cvlab-stonybrook/beyond-pixels, and GitHub detected no licence in that repository when it was checked","code_sha256":"392d0834780485a1","code_sha256_prefix":"392d0834780485a1","mcp_get_code":{"code_sha256":"392d0834780485a1"}},{"arxiv_id":"2208.09910","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-weak-to-strong-consistency-in-semi","title":"Revisiting Weak-to-Strong Consistency in Semi-Supervised Semantic Segmentation","date":"2022-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiheYoung/UniMatch","path":"model/semseg/deeplabv3plus.py","file_url":"https://github.com/LiheYoung/UniMatch/blob/HEAD/model/semseg/deeplabv3plus.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 cvlab-stonybrook/beyond-pixels, and GitHub detected no licence in that repository when it was checked","code_sha256":"392d0834780485a1","code_sha256_prefix":"392d0834780485a1","mcp_get_code":{"code_sha256":"392d0834780485a1"}},{"arxiv_id":"2203.04845","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-to-fine-sparse-transformer-for","title":"Coarse-to-Fine Sparse Transformer for Hyperspectral Image Reconstruction","date":"2022-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyuanhao1998/MST","path":"real/train_code/architecture/CST.py","file_url":"https://github.com/caiyuanhao1998/MST/blob/HEAD/real/train_code/architecture/CST.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4bd71cba3602449c","code_sha256_prefix":"4bd71cba3602449c","mcp_get_code":{"code_sha256":"4bd71cba3602449c"}},{"arxiv_id":"2106.11562","arxiv_id_is_arxiv":true,"paper":"/paper/ssul-semantic-segmentation-with-unknown-label","title":"SSUL: Semantic Segmentation with Unknown Label for Exemplar-based Class-Incremental Learning","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/SSUL","path":"network/modeling.py","file_url":"https://github.com/clovaai/SSUL/blob/HEAD/network/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, clovaai/SSUL (NOASSERTION)","code_sha256":"3704384e62d46e83","code_sha256_prefix":"3704384e62d46e83","mcp_get_code":{"code_sha256":"3704384e62d46e83"}},{"arxiv_id":"2106.05095","arxiv_id_is_arxiv":true,"paper":"/paper/st-make-self-training-work-better-for-semi","title":"ST++: Make Self-training Work Better for Semi-supervised Semantic Segmentation","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiheYoung/ST-PlusPlus","path":"model/semseg/deeplabv3plus.py","file_url":"https://github.com/LiheYoung/ST-PlusPlus/blob/HEAD/model/semseg/deeplabv3plus.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 cvlab-stonybrook/beyond-pixels, and GitHub detected no licence in that repository when it was checked","code_sha256":"392d0834780485a1","code_sha256_prefix":"392d0834780485a1","mcp_get_code":{"code_sha256":"392d0834780485a1"}},{"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":"ensta-u2is/deeplabv3plus-muad-pytorch","path":"network/_deeplab.py","file_url":"https://github.com/ensta-u2is/deeplabv3plus-muad-pytorch/blob/HEAD/network/_deeplab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eaa0ac6ed86c450b","code_sha256_prefix":"eaa0ac6ed86c450b","mcp_get_code":{"code_sha256":"eaa0ac6ed86c450b"}},{"arxiv_id":"1606.00915","arxiv_id_is_arxiv":true,"paper":"/paper/deeplab-semantic-image-segmentation-with-deep","title":"DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs","date":"2016-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Media-Smart/vedaseg","path":"vedaseg/models/encoders/enhance_modules/aspp.py","file_url":"https://github.com/Media-Smart/vedaseg/blob/HEAD/vedaseg/models/encoders/enhance_modules/aspp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"308ccdb3fbb740d8","code_sha256_prefix":"308ccdb3fbb740d8","mcp_get_code":{"code_sha256":"308ccdb3fbb740d8"}}],"record_sha256":"601d49a65c51e9f11ffb1abc6f50429e2f87ea8ea5312a16345e02c36947763f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}