{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/masked-log-softmax","entry":"masked_log_softmax","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":4,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":2},"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":"2305.12191","paper":"/paper/pointwise-mutual-information-based-metric-and","title":"Pointwise Mutual Information Based Metric and Decoding Strategy for Faithful Generation in Document Grounded Dialogs","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ynandwan/pmi-faith","path":"faithful-decode/models/modeling_nce.py","file_url":"https://github.com/ynandwan/pmi-faith/blob/HEAD/faithful-decode/models/modeling_nce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"20cb1e1782f60309","mcp_get_code":{"code_sha256":"20cb1e1782f60309"}},{"arxiv_id":"2208.14565","paper":"/paper/optimizing-bi-encoder-for-named-entity","title":"Optimizing Bi-Encoder for Named Entity Recognition via Contrastive Learning","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/binder","path":"src/model.py","file_url":"https://github.com/microsoft/binder/blob/HEAD/src/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1609cd13cd5232f1","mcp_get_code":{"code_sha256":"1609cd13cd5232f1"}},{"arxiv_id":"2204.10757","paper":"/paper/faithdial-a-faithful-benchmark-for","title":"FaithDial: A Faithful Benchmark for Information-Seeking Dialogue","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcgill-nlp/faithdial","path":"models/modeling_nce.py","file_url":"https://github.com/mcgill-nlp/faithdial/blob/HEAD/models/modeling_nce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20cb1e1782f60309","mcp_get_code":{"code_sha256":"20cb1e1782f60309"}},{"arxiv_id":"2106.11575","paper":"/paper/learn-to-resolve-conversational-dependency-a","title":"Learn to Resolve Conversational Dependency: A Consistency Training Framework for Conversational Question Answering","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmis-lab/excord","path":"excord.py","file_url":"https://github.com/dmis-lab/excord/blob/HEAD/excord.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6475a89b863b68b7","mcp_get_code":{"code_sha256":"6475a89b863b68b7"}},{"arxiv_id":"2005.14672","paper":"/paper/massive-choice-ample-tasks-machamp-a-toolkit","title":"Massive Choice, Ample Tasks (MaChAmp): A Toolkit for Multi-task Learning in NLP","date":"2020-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"machamp-nlp/machamp","path":"machamp/model/dependency_decoder.py","file_url":"https://github.com/machamp-nlp/machamp/blob/HEAD/machamp/model/dependency_decoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"506962e219c252c4","mcp_get_code":{"code_sha256":"506962e219c252c4"}}]}