{"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/lr-poly","entry":"lr_poly","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":25,"n_papers_ran":25,"n_papers_ran_no_instrument_failure":25,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":25,"n_places_pointer_only":23,"n_places_pointer_only_link_open":9,"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":5,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2403.18469","arxiv_id_is_arxiv":true,"paper":"/paper/density-guided-translator-boosts-synthetic-to","title":"Density-guided Translator Boosts Synthetic-to-Real Unsupervised Domain Adaptive Segmentation of 3D Point Clouds","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuan-zm/DGT-ST","path":"network/lr_adjust.py","file_url":"https://github.com/yuan-zm/DGT-ST/blob/HEAD/network/lr_adjust.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2403.02746","arxiv_id_is_arxiv":true,"paper":"/paper/learning-without-exact-guidance-updating","title":"Learning without Exact Guidance: Updating Large-scale High-resolution Land Cover Maps from Low-resolution Historical Labels","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lizhuohong/segland","path":"ft_pop.py","file_url":"https://github.com/lizhuohong/segland/blob/HEAD/ft_pop.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2312.13783","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-part-segmentation-reveals","title":"Few Shot Part Segmentation Reveals Compositional Logic for Industrial Anomaly Detection","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2307.15942","arxiv_id_is_arxiv":true,"paper":"/paper/cmda-cross-modality-domain-adaptation-for","title":"CMDA: Cross-Modality Domain Adaptation for Nighttime Semantic Segmentation","date":"2023-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaRho/CMDA","path":"utils/utils.py","file_url":"https://github.com/XiaRho/CMDA/blob/HEAD/utils/utils.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, XiaRho/CMDA when it was checked","code_sha256":"a8ad52a812530368","code_sha256_prefix":"a8ad52a812530368","mcp_get_code":{"code_sha256":"a8ad52a812530368"}},{"arxiv_id":"2207.10667","arxiv_id_is_arxiv":true,"paper":"/paper/online-domain-adaptation-for-semantic","title":"Online Domain Adaptation for Semantic Segmentation in Ever-Changing Conditions","date":"2022-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theo2021/OnDA","path":"framework/domain_adaptation/methods/prototypes.py","file_url":"https://github.com/theo2021/OnDA/blob/HEAD/framework/domain_adaptation/methods/prototypes.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"GPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-2.0, as GitHub detects it on this paper's repository, theo2021/OnDA, is not in the permissive set Syntology serves inline","code_sha256":"9fec89dab050cb13","code_sha256_prefix":"9fec89dab050cb13","mcp_get_code":{"code_sha256":"9fec89dab050cb13"}},{"arxiv_id":"2104.13415","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-semantic-segmentation-with-2","title":"Semi-Supervised Semantic Segmentation with Pixel-Level Contrastive Learning from a Class-wise Memory Bank","date":"2021-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shathe/SemiSeg-Contrastive","path":"trainSSL.py","file_url":"https://github.com/Shathe/SemiSeg-Contrastive/blob/HEAD/trainSSL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b0ce6e9e98a57de","code_sha256_prefix":"1b0ce6e9e98a57de","mcp_get_code":{"code_sha256":"1b0ce6e9e98a57de"}},{"arxiv_id":"2008.01059","arxiv_id_is_arxiv":true,"paper":"/paper/improving-one-stage-visual-grounding-by","title":"Improving One-stage Visual Grounding by Recursive Sub-query Construction","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyang-ur/ReSC","path":"model/loss.py","file_url":"https://github.com/zyang-ur/ReSC/blob/HEAD/model/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2007.08702","arxiv_id_is_arxiv":true,"paper":"/paper/dacs-domain-adaptation-via-cross-domain-mixed","title":"DACS: Domain Adaptation via Cross-domain Mixed Sampling","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2007.07936","arxiv_id_is_arxiv":true,"paper":"/paper/classmix-segmentation-based-data-augmentation","title":"ClassMix: Segmentation-Based Data Augmentation for Semi-Supervised Learning","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WilhelmT/ClassMix","path":"trainSSL.py","file_url":"https://github.com/WilhelmT/ClassMix/blob/HEAD/trainSSL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2004.06042","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-style-mining-for-one-shot","title":"Adversarial Style Mining for One-Shot Unsupervised Domain Adaptation","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2003.08040","arxiv_id_is_arxiv":true,"paper":"/paper/differential-treatment-for-stuff-and-things-a","title":"Differential Treatment for Stuff and Things: A Simple Unsupervised Domain Adaptation Method for Semantic Segmentation","date":"2020-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/Unsupervised-Domain-Adaptation-with-Differential-Treatment","path":"train_sim.py","file_url":"https://github.com/SHI-Labs/Unsupervised-Domain-Adaptation-with-Differential-Treatment/blob/HEAD/train_sim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SHI-Labs/Unsupervised-Domain-Adaptation-with-Differential-Treatment when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"2003.00867","arxiv_id_is_arxiv":true,"paper":"/paper/learning-texture-invariant-representation-for","title":"Learning Texture Invariant Representation for Domain Adaptation of Semantic Segmentation","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1910.05475","arxiv_id_is_arxiv":true,"paper":"/paper/saliency-guided-self-attention-network-for","title":"Saliency Guided Self-attention Network for Weakly and Semi-supervised Semantic Segmentation","date":"2019-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1908.06354","arxiv_id_is_arxiv":true,"paper":"/paper/a-fast-and-accurate-one-stage-approach-to","title":"A Fast and Accurate One-Stage Approach to Visual Grounding","date":"2019-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyang-ur/onestage_grounding","path":"train_yolo.py","file_url":"https://github.com/zyang-ur/onestage_grounding/blob/HEAD/train_yolo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1908.05724","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-semantic-segmentation-with","title":"Semi-Supervised Semantic Segmentation with High- and Low-level Consistency","date":"2019-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1906.01620","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-scalable-bayesian-deep-learning","title":"Evaluating Scalable Bayesian Deep Learning Methods for Robust Computer Vision","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fregu856/evaluating_bdl","path":"segmentation/ensembling_train_syn.py","file_url":"https://github.com/fregu856/evaluating_bdl/blob/HEAD/segmentation/ensembling_train_syn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b91a29dacf5ca1a2","code_sha256_prefix":"b91a29dacf5ca1a2","mcp_get_code":{"code_sha256":"b91a29dacf5ca1a2"}},{"arxiv_id":"1901.05427","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-for-structured-output-via","title":"Domain Adaptation for Structured Output via Discriminative Patch Representations","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wasidennis/AdaptSegNet","path":"pytorch_0.4/train_gta2cityscapes_multi.py","file_url":"https://github.com/wasidennis/AdaptSegNet/blob/HEAD/pytorch_0.4/train_gta2cityscapes_multi.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wasidennis/AdaptSegNet when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1901.03784","arxiv_id_is_arxiv":true,"paper":"/paper/upsnet-a-unified-panoptic-segmentation","title":"UPSNet: A Unified Panoptic Segmentation Network","date":"2019-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uber-research/UPSNet","path":"upsnet/upsnet_end2end_train.py","file_url":"https://github.com/uber-research/UPSNet/blob/HEAD/upsnet/upsnet_end2end_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, uber-research/UPSNet (NOASSERTION)","code_sha256":"93a18ae852753bae","code_sha256_prefix":"93a18ae852753bae","mcp_get_code":{"code_sha256":"93a18ae852753bae"}},{"arxiv_id":"1809.09478","arxiv_id_is_arxiv":true,"paper":"/paper/taking-a-closer-look-at-domain-shift-category","title":"Taking A Closer Look at Domain Shift: Category-level Adversaries for Semantics Consistent Domain Adaptation","date":"2018-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RoyalVane/CLAN","path":"CLAN_train.py","file_url":"https://github.com/RoyalVane/CLAN/blob/HEAD/CLAN_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1802.10349","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-adapt-structured-output-space-for","title":"Learning to Adapt Structured Output Space for Semantic Segmentation","date":"2018-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lym29/DASeg","path":"train_gta2cityscapes_multi.py","file_url":"https://github.com/lym29/DASeg/blob/HEAD/train_gta2cityscapes_multi.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lym29/DASeg when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1704.08509","arxiv_id_is_arxiv":true,"paper":"/paper/no-more-discrimination-cross-city-adaptation","title":"No More Discrimination: Cross City Adaptation of Road Scene Segmenters","date":"2017-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1703.01780","arxiv_id_is_arxiv":true,"paper":"/paper/mean-teachers-are-better-role-models-weight","title":"Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results","date":"2017-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1702.01105","arxiv_id_is_arxiv":true,"paper":"/paper/joint-2d-3d-semantic-data-for-indoor-scene","title":"Joint 2D-3D-Semantic Data for Indoor Scene Understanding","date":"2017-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamycheung/trans4pass","path":"adaptations/train_mpa.py","file_url":"https://github.com/jamycheung/trans4pass/blob/HEAD/adaptations/train_mpa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"1612.02646","arxiv_id_is_arxiv":true,"paper":"/paper/learning-video-object-segmentation-from","title":"Learning Video Object Segmentation from Static Images","date":"2016-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omkar13/MaskTrack","path":"training/utility_functions.py","file_url":"https://github.com/omkar13/MaskTrack/blob/HEAD/training/utility_functions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}},{"arxiv_id":"136940019","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136940019 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ETHRuiGong/TADA","path":"trainTACS_coarsetofine_addcontrastive.py","file_url":"https://github.com/ETHRuiGong/TADA/blob/HEAD/trainTACS_coarsetofine_addcontrastive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"b3b7c1c716f4ca66","code_sha256_prefix":"b3b7c1c716f4ca66","mcp_get_code":{"code_sha256":"b3b7c1c716f4ca66"}}],"record_sha256":"cea497ee2b22e6eb7690829088522631fd4645f6b6970c1f2ae88c2e716f9acc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}