{"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/masked-cross-entropy","entry":"masked_cross_entropy","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":6,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":6,"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":"2306.12941","arxiv_id_is_arxiv":true,"paper":"/paper/robust-semantic-segmentation-strong","title":"Towards Reliable Evaluation and Fast Training of Robust Semantic Segmentation Models","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szegedai/robust-segmentation-evaluation","path":"rse/_sea.py","file_url":"https://github.com/szegedai/robust-segmentation-evaluation/blob/HEAD/rse/_sea.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":"566c54f62254e6a1","code_sha256_prefix":"566c54f62254e6a1","mcp_get_code":{"code_sha256":"566c54f62254e6a1"}},{"arxiv_id":"2305.01938","arxiv_id_is_arxiv":true,"paper":"/paper/doc2soargraph-discrete-reasoning-over","title":"Doc2SoarGraph: Discrete Reasoning over Visually-Rich Table-Text Documents via Semantic-Oriented Hierarchical Graphs","date":"2023-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fengbinzhu/doc2soargraph","path":"etr/model/tree_model.py","file_url":"https://github.com/fengbinzhu/doc2soargraph/blob/HEAD/etr/model/tree_model.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":"06efa6795b7a9514","code_sha256_prefix":"06efa6795b7a9514","mcp_get_code":{"code_sha256":"06efa6795b7a9514"}},{"arxiv_id":"2210.11694","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-reasoning-consistent-contrastive","title":"Multi-View Reasoning: Consistent Contrastive Learning for Math Word Problem","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwq2018/multi-view-consistency-for-mwp","path":"src/model/tree_decoder.py","file_url":"https://github.com/zwq2018/multi-view-consistency-for-mwp/blob/HEAD/src/model/tree_decoder.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":"80f5fed9c34adca3","code_sha256_prefix":"80f5fed9c34adca3","mcp_get_code":{"code_sha256":"80f5fed9c34adca3"}},{"arxiv_id":"2109.00799","arxiv_id_is_arxiv":true,"paper":"/paper/mwptoolkit-an-open-source-framework-for-deep","title":"MWPToolkit: An Open-Source Framework for Deep Learning-Based Math Word Problem Solvers","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyh-yf/mwptoolkit","path":"mwptoolkit/loss/masked_cross_entropy_loss.py","file_url":"https://github.com/lyh-yf/mwptoolkit/blob/HEAD/mwptoolkit/loss/masked_cross_entropy_loss.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":"c15247b2cb5daabc","code_sha256_prefix":"c15247b2cb5daabc","mcp_get_code":{"code_sha256":"c15247b2cb5daabc"}},{"arxiv_id":"2108.06721","arxiv_id_is_arxiv":true,"paper":"/paper/training-for-the-future-a-simple-gradient","title":"Training for the Future: A Simple Gradient Interpolation Loss to Generalize Along Time","date":"2021-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anshuln/training-for-the-future","path":"src/CIDA/utils.py","file_url":"https://github.com/anshuln/training-for-the-future/blob/HEAD/src/CIDA/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":"1272a3ba576cd814","code_sha256_prefix":"1272a3ba576cd814","mcp_get_code":{"code_sha256":"1272a3ba576cd814"}},{"arxiv_id":"2104.07908","arxiv_id_is_arxiv":true,"paper":"/paper/metaxl-meta-representation-transformation-for","title":"MetaXL: Meta Representation Transformation for Low-resource Cross-lingual Learning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/MetaXL","path":"mlt.py","file_url":"https://github.com/microsoft/MetaXL/blob/HEAD/mlt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c561bc9240f884c","code_sha256_prefix":"3c561bc9240f884c","mcp_get_code":{"code_sha256":"3c561bc9240f884c"}},{"arxiv_id":"2104.07908","arxiv_id_is_arxiv":true,"paper":"/paper/metaxl-meta-representation-transformation-for","title":"MetaXL: Meta Representation Transformation for Low-resource Cross-lingual Learning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liatb282/metaxlr","path":"models.py","file_url":"https://github.com/liatb282/metaxlr/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, liatb282/metaxlr, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"9ba80da0d76244fa","code_sha256_prefix":"9ba80da0d76244fa","mcp_get_code":{"code_sha256":"9ba80da0d76244fa"}},{"arxiv_id":"2004.06871","arxiv_id_is_arxiv":true,"paper":"/paper/tod-bert-pre-trained-natural-language","title":"TOD-BERT: Pre-trained Natural Language Understanding for Task-Oriented Dialogue","date":"2020-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonwu0731/ToD-BERT","path":"utils/loss_function/masked_cross_entropy.py","file_url":"https://github.com/jasonwu0731/ToD-BERT/blob/HEAD/utils/loss_function/masked_cross_entropy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-2-Clause, as GitHub detects it on this paper's repository, jasonwu0731/ToD-BERT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c43122df579b6d8b","code_sha256_prefix":"c43122df579b6d8b","mcp_get_code":{"code_sha256":"c43122df579b6d8b"}},{"arxiv_id":"1901.04713","arxiv_id_is_arxiv":true,"paper":"/paper/global-to-local-memory-pointer-networks-for","title":"Global-to-local Memory Pointer Networks for Task-Oriented Dialogue","date":"2019-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scoyer/fg2seq","path":"utils/masked_cross_entropy.py","file_url":"https://github.com/scoyer/fg2seq/blob/HEAD/utils/masked_cross_entropy.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":"65711d37e56e3636","code_sha256_prefix":"65711d37e56e3636","mcp_get_code":{"code_sha256":"65711d37e56e3636"}},{"arxiv_id":"1804.08217","arxiv_id_is_arxiv":true,"paper":"/paper/mem2seq-effectively-incorporating-knowledge","title":"Mem2Seq: Effectively Incorporating Knowledge Bases into End-to-End Task-Oriented Dialog Systems","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/Mem2Seq","path":"utils/masked_cross_entropy.py","file_url":"https://github.com/HLTCHKUST/Mem2Seq/blob/HEAD/utils/masked_cross_entropy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 jasonwu0731/ToD-BERT, and BSD-2-Clause, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"c43122df579b6d8b","code_sha256_prefix":"c43122df579b6d8b","mcp_get_code":{"code_sha256":"c43122df579b6d8b"}}],"record_sha256":"a149abb0504bc8f57eda1d2c775848c95ac090a35b9b272dd7dedaf8867ae79f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}