{"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/interleave","entry":"interleave","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":6,"n_papers_ran_no_instrument_failure":1,"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":8,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":1,"ran":1,"unverified":3},"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":"2510.03993","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03993","title":"Keep It on a Leash: Controllable Pseudo-label Generation Towards Realistic Long-Tailed Semi-Supervised Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"yaxinhou/CPG","path":"semilearn/algorithms/utils/ops.py","file_url":"https://github.com/yaxinhou/CPG/blob/HEAD/semilearn/algorithms/utils/ops.py","status":"unverified","verification_level":0,"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, yaxinhou/CPG when it was checked","code_sha256":"c56b7c3374c4b9cc","code_sha256_prefix":"c56b7c3374c4b9cc","mcp_get_code":{"code_sha256":"c56b7c3374c4b9cc"}},{"arxiv_id":"2405.11756","arxiv_id_is_arxiv":true,"paper":"/paper/erasing-the-bias-fine-tuning-foundation","title":"Erasing the Bias: Fine-Tuning Foundation Models for Semi-Supervised Learning","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gank0078/FineSSL","path":"trainer.py","file_url":"https://github.com/Gank0078/FineSSL/blob/HEAD/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Gank0078/FineSSL when it was checked","code_sha256":"f6043e7798bcabbd","code_sha256_prefix":"f6043e7798bcabbd","mcp_get_code":{"code_sha256":"f6043e7798bcabbd"}},{"arxiv_id":"2404.11003","arxiv_id_is_arxiv":true,"paper":"/paper/infomatch-entropy-neural-estimation-for-semi","title":"InfoMatch: Entropy Neural Estimation for Semi-Supervised Image Classification","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kunzhan/InfoMatch","path":"infoMatch_STL.py","file_url":"https://github.com/kunzhan/InfoMatch/blob/HEAD/infoMatch_STL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, kunzhan/InfoMatch when it was checked","code_sha256":"f6043e7798bcabbd","code_sha256_prefix":"f6043e7798bcabbd","mcp_get_code":{"code_sha256":"f6043e7798bcabbd"}},{"arxiv_id":"2308.14575","arxiv_id_is_arxiv":true,"paper":"/paper/referring-image-segmentation-using-text","title":"Referring Image Segmentation Using Text Supervision","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fawnliu/tris","path":"IRNet/torch_utils.py","file_url":"https://github.com/fawnliu/tris/blob/HEAD/IRNet/torch_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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 kunzhan/InfoMatch, and GitHub detected no licence in that repository when it was checked","code_sha256":"f6043e7798bcabbd","code_sha256_prefix":"f6043e7798bcabbd","mcp_get_code":{"code_sha256":"f6043e7798bcabbd"}},{"arxiv_id":"1911.06393","arxiv_id_is_arxiv":true,"paper":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for","title":"Seq-U-Net: A One-Dimensional Causal U-Net for Efficient Sequence Modelling","date":"2019-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"f90/Seq-U-Net","path":"sequnet_utils.py","file_url":"https://github.com/f90/Seq-U-Net/blob/HEAD/sequnet_utils.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":"0356ec7f2f97ed82","code_sha256_prefix":"0356ec7f2f97ed82","mcp_get_code":{"code_sha256":"0356ec7f2f97ed82"}},{"arxiv_id":"1905.02249","arxiv_id_is_arxiv":true,"paper":"/paper/mixmatch-a-holistic-approach-to-semi","title":"MixMatch: A Holistic Approach to Semi-Supervised Learning","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smkim7-kr/albu-MixMatch-pytorch","path":"src/utils.py","file_url":"https://github.com/smkim7-kr/albu-MixMatch-pytorch/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"87035ef75e16edc6","code_sha256_prefix":"87035ef75e16edc6","mcp_get_code":{"code_sha256":"87035ef75e16edc6"}},{"arxiv_id":"1905.02249","arxiv_id_is_arxiv":true,"paper":"/paper/mixmatch-a-holistic-approach-to-semi","title":"MixMatch: A Holistic Approach to Semi-Supervised Learning","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntozer/mixmatch-tensorflow2.0","path":"mixmatch.py","file_url":"https://github.com/ntozer/mixmatch-tensorflow2.0/blob/HEAD/mixmatch.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":"dc463911b8db674e","code_sha256_prefix":"dc463911b8db674e","mcp_get_code":{"code_sha256":"dc463911b8db674e"}},{"arxiv_id":"1903.12087","arxiv_id_is_arxiv":true,"paper":"/paper/a-real-time-wideband-neural-vocoder-at-16-kbs","title":"A Real-Time Wideband Neural Vocoder at 1.6 kb/s Using LPCNet","date":"2019-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mozilla/LPCNet","path":"training_tf2/lpcnet.py","file_url":"https://github.com/mozilla/LPCNet/blob/HEAD/training_tf2/lpcnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"462214bb0c5c4921","code_sha256_prefix":"462214bb0c5c4921","mcp_get_code":{"code_sha256":"462214bb0c5c4921"}},{"arxiv_id":"1804.02747","arxiv_id_is_arxiv":true,"paper":"/paper/fast-conditional-independence-test-for-vector","title":"Fast Conditional Independence Test for Vector Variables with Large Sample Sizes","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kjchalup/fcit","path":"fcit/fcit.py","file_url":"https://github.com/kjchalup/fcit/blob/HEAD/fcit/fcit.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28c086173a0a9308","code_sha256_prefix":"28c086173a0a9308","mcp_get_code":{"code_sha256":"28c086173a0a9308"}},{"arxiv_id":"1606.00373","arxiv_id_is_arxiv":true,"paper":"/paper/deeper-depth-prediction-with-fully","title":"Deeper Depth Prediction with Fully Convolutional Residual Networks","date":"2016-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iro-cp/FCRN-DepthPrediction","path":"tensorflow/models/network.py","file_url":"https://github.com/iro-cp/FCRN-DepthPrediction/blob/HEAD/tensorflow/models/network.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95ceecbd3deb30dc","code_sha256_prefix":"95ceecbd3deb30dc","mcp_get_code":{"code_sha256":"95ceecbd3deb30dc"}}],"record_sha256":"3e5a586cd4ab65c3b00a0abeb81c4392c8921a90ab625151365bdd28a5c65733","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}