{"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/read-vocab","entry":"read_vocab","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"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":2,"ran_fixture":0,"ran":5,"unverified":1},"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":"2412.06474","arxiv_id_is_arxiv":true,"paper":"/paper/from-uncertainty-to-trust-enhancing","title":"From Uncertainty to Trust: Enhancing Reliability in Vision-Language Models with Uncertainty-Guided Dropout Decoding","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kigb/DropoutDecoding","path":"chair_test/chair_metrics/lm_consistency.py","file_url":"https://github.com/kigb/DropoutDecoding/blob/HEAD/chair_test/chair_metrics/lm_consistency.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kigb/DropoutDecoding when it was checked","code_sha256":"3fda39b99e8fcada","code_sha256_prefix":"3fda39b99e8fcada","mcp_get_code":{"code_sha256":"3fda39b99e8fcada"}},{"arxiv_id":"2209.10335","arxiv_id_is_arxiv":true,"paper":"/paper/bias-at-a-second-glance-a-deep-dive-into-bias","title":"Bias at a Second Glance: A Deep Dive into Bias for German Educational Peer-Review Data Modeling","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfl-ml4ed/unraveling-llm-bias","path":"GenBit/fixed_context_bias_score.py","file_url":"https://github.com/epfl-ml4ed/unraveling-llm-bias/blob/HEAD/GenBit/fixed_context_bias_score.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":"86d1d101e6fcfe84","code_sha256_prefix":"86d1d101e6fcfe84","mcp_get_code":{"code_sha256":"86d1d101e6fcfe84"}},{"arxiv_id":"2205.11502","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-paradox-of-learning-to-reason-from","title":"On the Paradox of Learning to Reason from Data","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshuacnf/paradox-learning2reason","path":"logic_bert/evaluate.py","file_url":"https://github.com/joshuacnf/paradox-learning2reason/blob/HEAD/logic_bert/evaluate.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":"226b198cd6845403","code_sha256_prefix":"226b198cd6845403","mcp_get_code":{"code_sha256":"226b198cd6845403"}},{"arxiv_id":"2205.11502","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-paradox-of-learning-to-reason-from","title":"On the Paradox of Learning to Reason from Data","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshuacnf/paradox-learning2reason","path":"sample/sample.py","file_url":"https://github.com/joshuacnf/paradox-learning2reason/blob/HEAD/sample/sample.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":"ec26eefbcd67387b","code_sha256_prefix":"ec26eefbcd67387b","mcp_get_code":{"code_sha256":"ec26eefbcd67387b"}},{"arxiv_id":"2010.04592","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-with-hard-negative-1","title":"Contrastive Learning with Hard Negative Samples","date":"2020-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lajanugen/S2V","path":"src/s2v_model.py","file_url":"https://github.com/lajanugen/S2V/blob/HEAD/src/s2v_model.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":"3b50276530bcaf11","code_sha256_prefix":"3b50276530bcaf11","mcp_get_code":{"code_sha256":"3b50276530bcaf11"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flyliu2017/bert","path":"cal_scores.py","file_url":"https://github.com/flyliu2017/bert/blob/HEAD/cal_scores.py","status":"ran","verification_level":1,"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":"9b5d82a07fa47ec4","code_sha256_prefix":"9b5d82a07fa47ec4","mcp_get_code":{"code_sha256":"9b5d82a07fa47ec4"}},{"arxiv_id":"1601.01280","arxiv_id_is_arxiv":true,"paper":"/paper/language-to-logical-form-with-neural","title":"Language to Logical Form with Neural Attention","date":"2016-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"halecakir/Sent2LogicalForm","path":"Dynet/Seq2Seq.py","file_url":"https://github.com/halecakir/Sent2LogicalForm/blob/HEAD/Dynet/Seq2Seq.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, halecakir/Sent2LogicalForm when it was checked","code_sha256":"6fd61b26b725b4e9","code_sha256_prefix":"6fd61b26b725b4e9","mcp_get_code":{"code_sha256":"6fd61b26b725b4e9"}},{"arxiv_id":"2022.findings-emnlp.97","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.97","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tshi04/AspDecSSCL","path":"AspDec/SSCL/utils.py","file_url":"https://github.com/tshi04/AspDecSSCL/blob/HEAD/AspDec/SSCL/utils.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":"9f7e17540488d403","code_sha256_prefix":"9f7e17540488d403","mcp_get_code":{"code_sha256":"9f7e17540488d403"}}],"record_sha256":"1430e2521bedf6e87c72c64c5ea8ac3689632007cabd86c1ab4c3fcfe227c19c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}