{"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/entropy-from-logits","entry":"entropy_from_logits","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":13,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":13,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":2,"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":"2602.13551","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13551","title":"Small Reward Models via Backward Inference","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yikee/FLIP","path":"open-instruct/open_instruct/model_utils.py","file_url":"https://github.com/yikee/FLIP/blob/HEAD/open-instruct/open_instruct/model_utils.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","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, yikee/FLIP when it was checked","code_sha256":"3ca03473e153b197","code_sha256_prefix":"3ca03473e153b197","mcp_get_code":{"code_sha256":"3ca03473e153b197"}},{"arxiv_id":"2512.12997","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-12997","title":"Calibrating Uncertainty for Zero-Shot Adversarial CLIP","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"VivienLu/UCAT","path":"slip-ucat.py","file_url":"https://github.com/VivienLu/UCAT/blob/HEAD/slip-ucat.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, VivienLu/UCAT when it was checked","code_sha256":"d2d06e2a020d4fc5","code_sha256_prefix":"d2d06e2a020d4fc5","mcp_get_code":{"code_sha256":"d2d06e2a020d4fc5"}},{"arxiv_id":"2504.08837","arxiv_id_is_arxiv":true,"paper":"/paper/vl-rethinker-incentivizing-self-reflection-of","title":"VL-Rethinker: Incentivizing Self-Reflection of Vision-Language Models with Reinforcement Learning","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiger-ai-lab/vl-rethinker","path":"openrlhf/models/actor.py","file_url":"https://github.com/tiger-ai-lab/vl-rethinker/blob/HEAD/openrlhf/models/actor.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":"c710eef68603bd62","code_sha256_prefix":"c710eef68603bd62","mcp_get_code":{"code_sha256":"c710eef68603bd62"}},{"arxiv_id":"2306.04751","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-can-camels-go-exploring-the-state-of","title":"How Far Can Camels Go? Exploring the State of Instruction Tuning on Open Resources","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/open-instruct","path":"open_instruct/model_utils.py","file_url":"https://github.com/allenai/open-instruct/blob/HEAD/open_instruct/model_utils.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ca03473e153b197","code_sha256_prefix":"3ca03473e153b197","mcp_get_code":{"code_sha256":"3ca03473e153b197"}},{"arxiv_id":"2302.08582","arxiv_id_is_arxiv":true,"paper":"/paper/pretraining-language-models-with-human","title":"Pretraining Language Models with Human Preferences","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomekkorbak/pretraining-with-human-feedback","path":"apo/utils.py","file_url":"https://github.com/tomekkorbak/pretraining-with-human-feedback/blob/HEAD/apo/utils.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":"355ef5e59cc3a74f","code_sha256_prefix":"355ef5e59cc3a74f","mcp_get_code":{"code_sha256":"355ef5e59cc3a74f"}},{"arxiv_id":"2206.14923","arxiv_id_is_arxiv":true,"paper":"/paper/on-non-random-missing-labels-in-semi-1","title":"On Non-Random Missing Labels in Semi-Supervised Learning","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joyhuyy1412/cadr-fixmatch","path":"libml/layers.py","file_url":"https://github.com/joyhuyy1412/cadr-fixmatch/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0802d913d5d3694d","code_sha256_prefix":"0802d913d5d3694d","mcp_get_code":{"code_sha256":"0802d913d5d3694d"}},{"arxiv_id":"2112.00791","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-conditional-language-models-with","title":"Controlling Conditional Language Models without Catastrophic Forgetting","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/gdc","path":"cdpg/cdpg/pointwise_gdc.py","file_url":"https://github.com/naver/gdc/blob/HEAD/cdpg/cdpg/pointwise_gdc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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, naver/gdc (NOASSERTION)","code_sha256":"499346faba26ea21","code_sha256_prefix":"499346faba26ea21","mcp_get_code":{"code_sha256":"499346faba26ea21"}},{"arxiv_id":"2107.11635","arxiv_id_is_arxiv":true,"paper":"/paper/clustering-by-maximizing-mutual-information","title":"Clustering by Maximizing Mutual Information Across Views","date":"2021-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/remixmatch","path":"libml/layers.py","file_url":"https://github.com/google-research/remixmatch/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0802d913d5d3694d","code_sha256_prefix":"0802d913d5d3694d","mcp_get_code":{"code_sha256":"0802d913d5d3694d"}},{"arxiv_id":"2106.16209","arxiv_id_is_arxiv":true,"paper":"/paper/s2c2-an-orthogonal-method-for-semi-supervised","title":"A data-centric approach for improving ambiguous labels with combined semi-supervised classification and clustering","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emprime/dc3","path":"libml/layers.py","file_url":"https://github.com/emprime/dc3/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0802d913d5d3694d","code_sha256_prefix":"0802d913d5d3694d","mcp_get_code":{"code_sha256":"0802d913d5d3694d"}},{"arxiv_id":"2001.07685","arxiv_id_is_arxiv":true,"paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnchenresearch/SSL","path":"libml/layers.py","file_url":"https://github.com/johnchenresearch/SSL/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0802d913d5d3694d","code_sha256_prefix":"0802d913d5d3694d","mcp_get_code":{"code_sha256":"0802d913d5d3694d"}},{"arxiv_id":"1912.08766","arxiv_id_is_arxiv":true,"paper":"/paper/realmix-towards-realistic-semi-supervised","title":"RealMix: Towards Realistic Semi-Supervised Deep Learning Algorithms","date":"2019-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uizard-technologies/realmix","path":"libml/layers.py","file_url":"https://github.com/uizard-technologies/realmix/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0802d913d5d3694d","code_sha256_prefix":"0802d913d5d3694d","mcp_get_code":{"code_sha256":"0802d913d5d3694d"}},{"arxiv_id":"1912.00594","arxiv_id_is_arxiv":true,"paper":"/paper/combining-mixmatch-and-active-learning-for-1","title":"Combining MixMatch and Active Learning for Better Accuracy with Fewer Labels","date":"2019-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/mma","path":"libml/layers.py","file_url":"https://github.com/google-research/mma/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b71a50832a4d7c7","code_sha256_prefix":"1b71a50832a4d7c7","mcp_get_code":{"code_sha256":"1b71a50832a4d7c7"}},{"arxiv_id":"1911.09785","arxiv_id_is_arxiv":true,"paper":"/paper/remixmatch-semi-supervised-learning-with-1","title":"ReMixMatch: Semi-Supervised Learning with Distribution Alignment and Augmentation Anchoring","date":"2019-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/mixmatch","path":"libml/layers.py","file_url":"https://github.com/google-research/mixmatch/blob/HEAD/libml/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0802d913d5d3694d","code_sha256_prefix":"0802d913d5d3694d","mcp_get_code":{"code_sha256":"0802d913d5d3694d"}}],"record_sha256":"07ddcc4f264818499dedabf5f72494738779f65eb78e9bfac7a6ee918bc64e0b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}