{"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/cross-entropy2d","entry":"cross_entropy2d","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":12,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":3,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":13,"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":1,"ran_fixture":2,"ran":6,"unverified":2},"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":"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/losses.py","file_url":"https://github.com/isl-org/MultiObjectiveOptimization/blob/HEAD/multi_task/losses.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":"36497fd5247322ab","code_sha256_prefix":"36497fd5247322ab","mcp_get_code":{"code_sha256":"36497fd5247322ab"}},{"arxiv_id":"2108.08012","arxiv_id_is_arxiv":true,"paper":"/paper/multi-anchor-active-domain-adaptation-for","title":"Multi-Anchor Active Domain Adaptation for Semantic Segmentation","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"munanning/mada","path":"loss/loss.py","file_url":"https://github.com/munanning/mada/blob/HEAD/loss/loss.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":"57b36a6b7f29df1a","code_sha256_prefix":"57b36a6b7f29df1a","mcp_get_code":{"code_sha256":"57b36a6b7f29df1a"}},{"arxiv_id":"2108.08012","arxiv_id_is_arxiv":true,"paper":"/paper/multi-anchor-active-domain-adaptation-for","title":"Multi-Anchor Active Domain Adaptation for Semantic Segmentation","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"munanning/madav2","path":"loss/loss.py","file_url":"https://github.com/munanning/madav2/blob/HEAD/loss/loss.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":"4865609e5a035433","code_sha256_prefix":"4865609e5a035433","mcp_get_code":{"code_sha256":"4865609e5a035433"}},{"arxiv_id":"2106.14917","arxiv_id_is_arxiv":true,"paper":"/paper/striking-the-right-balance-recall-loss-for","title":"Striking the Right Balance: Recall Loss for Semantic Segmentation","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PotatoTian/recall-semseg","path":"ptsemseg/loss/loss.py","file_url":"https://github.com/PotatoTian/recall-semseg/blob/HEAD/ptsemseg/loss/loss.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":"c76dc561618f7c2e","code_sha256_prefix":"c76dc561618f7c2e","mcp_get_code":{"code_sha256":"c76dc561618f7c2e"}},{"arxiv_id":"2101.10979","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-pseudo-label-denoising-and","title":"Prototypical Pseudo Label Denoising and Target Structure Learning for Domain Adaptive Semantic Segmentation","date":"2021-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ProDA","path":"models/adaptation_modelv2.py","file_url":"https://github.com/microsoft/ProDA/blob/HEAD/models/adaptation_modelv2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e48b895c94b5aa40","code_sha256_prefix":"e48b895c94b5aa40","mcp_get_code":{"code_sha256":"e48b895c94b5aa40"}},{"arxiv_id":"2007.11782","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-rgb-d-salient-object-detection-via","title":"Accurate RGB-D Salient Object Detection via Collaborative Learning","date":"2020-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwei0921/CoNet","path":"CoNet/trainer.py","file_url":"https://github.com/jiwei0921/CoNet/blob/HEAD/CoNet/trainer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiwei0921/CoNet when it was checked","code_sha256":"e8215c12ce048e2b","code_sha256_prefix":"e8215c12ce048e2b","mcp_get_code":{"code_sha256":"e8215c12ce048e2b"}},{"arxiv_id":"2006.00176","arxiv_id_is_arxiv":true,"paper":"/paper/when2com-multi-agent-perception-via","title":"When2com: Multi-Agent Perception via Communication Graph Grouping","date":"2020-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/MultiAgentPerception","path":"ptsemseg/loss/loss.py","file_url":"https://github.com/GT-RIPL/MultiAgentPerception/blob/HEAD/ptsemseg/loss/loss.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":"187e0bb11e846d2d","code_sha256_prefix":"187e0bb11e846d2d","mcp_get_code":{"code_sha256":"187e0bb11e846d2d"}},{"arxiv_id":"2002.06604","arxiv_id_is_arxiv":true,"paper":"/paper/key-points-estimation-and-point-instance","title":"Key Points Estimation and Point Instance Segmentation Approach for Lane Detection","date":"2020-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koyeongmin/PINet","path":"util_hourglass.py","file_url":"https://github.com/koyeongmin/PINet/blob/HEAD/util_hourglass.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":"57e9d54adac6bc85","code_sha256_prefix":"57e9d54adac6bc85","mcp_get_code":{"code_sha256":"57e9d54adac6bc85"}},{"arxiv_id":"1910.13049","arxiv_id_is_arxiv":true,"paper":"/paper/category-anchor-guided-unsupervised-domain","title":"Category Anchor-Guided Unsupervised Domain Adaptation for Semantic Segmentation","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RogerZhangzz/CAG_UDA","path":"loss/loss.py","file_url":"https://github.com/RogerZhangzz/CAG_UDA/blob/HEAD/loss/loss.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":"57b36a6b7f29df1a","code_sha256_prefix":"57b36a6b7f29df1a","mcp_get_code":{"code_sha256":"57b36a6b7f29df1a"}},{"arxiv_id":"1904.01206","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-lidar-adaptation-for-road","title":"Progressive LiDAR Adaptation for Road Detection","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhechen/PLARD","path":"ptsemseg/loss.py","file_url":"https://github.com/zhechen/PLARD/blob/HEAD/ptsemseg/loss.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":"31c592674a619dff","code_sha256_prefix":"31c592674a619dff","mcp_get_code":{"code_sha256":"31c592674a619dff"}},{"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/losses.py","file_url":"https://github.com/IntelVCL/MultiObjectiveOptimization/blob/HEAD/multi_task/losses.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":"36497fd5247322ab","code_sha256_prefix":"36497fd5247322ab","mcp_get_code":{"code_sha256":"36497fd5247322ab"}},{"arxiv_id":"1803.06791","arxiv_id_is_arxiv":true,"paper":"/paper/depth-aware-cnn-for-rgb-d-segmentation","title":"Depth-aware CNN for RGB-D Segmentation","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laughtervv/DepthAwareCNN","path":"models/losses.py","file_url":"https://github.com/laughtervv/DepthAwareCNN/blob/HEAD/models/losses.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":"8a7cda981e891b1b","code_sha256_prefix":"8a7cda981e891b1b","mcp_get_code":{"code_sha256":"8a7cda981e891b1b"}},{"arxiv_id":"1511.00561","arxiv_id_is_arxiv":true,"paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"okn-yu/SegNet-A-Deep-Convolutional-Encoder-Decoder-Architecture-for-Image-Segmentation","path":"src/model/train_segnet.py","file_url":"https://github.com/okn-yu/SegNet-A-Deep-Convolutional-Encoder-Decoder-Architecture-for-Image-Segmentation/blob/HEAD/src/model/train_segnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, okn-yu/SegNet-A-Deep-Convolutional-Encoder-Decoder-Architecture-for-Image-Segmentation when it was checked","code_sha256":"9d053840bc397be9","code_sha256_prefix":"9d053840bc397be9","mcp_get_code":{"code_sha256":"9d053840bc397be9"}}],"record_sha256":"9f144fb09a4871d2486d082227f54c60295d3d8aeaa77f8adcb084004927ede4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}