{"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/to-list","entry":"to_list","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":62,"n_papers_ran":61,"n_papers_ran_no_instrument_failure":18,"n_papers_ran_instrument_only":43,"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":16,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":62,"n_places_pointer_only":48,"n_places_pointer_only_link_open":24,"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":5,"ran_violates":2,"ran_draft_wrong":2,"ran_fixture":0,"ran":6,"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":"2603.28572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28572","title":"Unrestrained Simplex Denoising for Discrete Data A Non-Markovian Approach Applied to Graph Generation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cvignac/DiGress","path":"src/datasets/guacamol_dataset.py","file_url":"https://github.com/cvignac/DiGress/blob/HEAD/src/datasets/guacamol_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85832bcd5531c861","code_sha256_prefix":"85832bcd5531c861","mcp_get_code":{"code_sha256":"85832bcd5531c861"}},{"arxiv_id":"2603.20017","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20017","title":"RouterKGQA: Specialized-General Model Routing for Constraint-Aware Knowledge Graph Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Oldcircle/RouterKGQA","path":"config.py","file_url":"https://github.com/Oldcircle/RouterKGQA/blob/HEAD/config.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2412.05586","arxiv_id_is_arxiv":true,"paper":"/paper/towards-learning-to-reason-comparing-llms","title":"Towards Learning to Reason: Comparing LLMs with Neuro-Symbolic on Arithmetic Relations in Abstract Reasoning","date":"2024-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"03884bb215982e58","code_sha256_prefix":"03884bb215982e58","mcp_get_code":{"code_sha256":"03884bb215982e58"}},{"arxiv_id":"2411.07279","arxiv_id_is_arxiv":true,"paper":"/paper/the-surprising-effectiveness-of-test-time","title":"The Surprising Effectiveness of Test-Time Training for Few-Shot Learning","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ekinakyurek/marc","path":"arclib/arc.py","file_url":"https://github.com/ekinakyurek/marc/blob/HEAD/arclib/arc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95bd0d71a136300c","code_sha256_prefix":"95bd0d71a136300c","mcp_get_code":{"code_sha256":"95bd0d71a136300c"}},{"arxiv_id":"2411.03766","arxiv_id_is_arxiv":true,"paper":"/paper/number-cookbook-number-understanding-of","title":"Number Cookbook: Number Understanding of Language Models and How to Improve It","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphpku/number_cookbook","path":"src/datagen/data_utils.py","file_url":"https://github.com/graphpku/number_cookbook/blob/HEAD/src/datagen/data_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, graphpku/number_cookbook, is not in the permissive set Syntology serves inline","code_sha256":"bf77b7b6b3302960","code_sha256_prefix":"bf77b7b6b3302960","mcp_get_code":{"code_sha256":"bf77b7b6b3302960"}},{"arxiv_id":"2410.04263","arxiv_id_is_arxiv":true,"paper":"/paper/defog-discrete-flow-matching-for-graph","title":"DeFoG: Discrete Flow Matching for Graph Generation","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manuelmlmadeira/DeFoG","path":"src/datasets/guacamol_dataset.py","file_url":"https://github.com/manuelmlmadeira/DeFoG/blob/HEAD/src/datasets/guacamol_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85832bcd5531c861","code_sha256_prefix":"85832bcd5531c861","mcp_get_code":{"code_sha256":"85832bcd5531c861"}},{"arxiv_id":"2410.03531","arxiv_id_is_arxiv":true,"paper":"/paper/mare-multi-aspect-rationale-extractor-on","title":"MARE: Multi-Aspect Rationale Extractor on Unsupervised Rationale Extraction","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSU-NLP-Group/MARE","path":"src/run_classification.py","file_url":"https://github.com/CSU-NLP-Group/MARE/blob/HEAD/src/run_classification.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, CSU-NLP-Group/MARE when it was checked","code_sha256":"0c72c32ab74575ea","code_sha256_prefix":"0c72c32ab74575ea","mcp_get_code":{"code_sha256":"0c72c32ab74575ea"}},{"arxiv_id":"2403.13268","arxiv_id_is_arxiv":true,"paper":"/paper/unifews-unified-entry-wise-sparsification-for","title":"Unifews: Unified Entry-Wise Sparsification for Efficient Graph Neural Network","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gdmnl/Unifews","path":"utils/loader.py","file_url":"https://github.com/gdmnl/Unifews/blob/HEAD/utils/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, gdmnl/Unifews when it was checked","code_sha256":"d3c1c834450b93e0","code_sha256_prefix":"d3c1c834450b93e0","mcp_get_code":{"code_sha256":"d3c1c834450b93e0"}},{"arxiv_id":"2403.06020","arxiv_id_is_arxiv":true,"paper":"/paper/multi-conditioned-graph-diffusion-for-neural","title":"Multi-conditioned Graph Diffusion for Neural Architecture Search","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohanasthana/dinas","path":"src/generate_samples.py","file_url":"https://github.com/rohanasthana/dinas/blob/HEAD/src/generate_samples.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85832bcd5531c861","code_sha256_prefix":"85832bcd5531c861","mcp_get_code":{"code_sha256":"85832bcd5531c861"}},{"arxiv_id":"2402.02175","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-complex-question-answering-over","title":"Enhancing Complex Question Answering over Knowledge Graphs through Evidence Pattern Retrieval","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/epr-kgqa","path":"evidence_pattern_retrieval/BERT_Ranker/model_config.py","file_url":"https://github.com/nju-websoft/epr-kgqa/blob/HEAD/evidence_pattern_retrieval/BERT_Ranker/model_config.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2401.15855","arxiv_id_is_arxiv":true,"paper":"/paper/cross-scale-mae-a-tale-of-multi-scale","title":"Cross-Scale MAE: A Tale of Multi-Scale Exploitation in Remote Sensing","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aicip/Cross-Scale-MAE","path":"main_finetune.py","file_url":"https://github.com/aicip/Cross-Scale-MAE/blob/HEAD/main_finetune.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, aicip/Cross-Scale-MAE (NOASSERTION)","code_sha256":"d81d71b5c9d1e4c7","code_sha256_prefix":"d81d71b5c9d1e4c7","mcp_get_code":{"code_sha256":"d81d71b5c9d1e4c7"}},{"arxiv_id":"2312.17397","arxiv_id_is_arxiv":true,"paper":"/paper/classifier-free-graph-diffusion-for-molecular","title":"Classifier-free graph diffusion for molecular property targeting","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asduffo/freegress","path":"src/datasets/guacamol_dataset.py","file_url":"https://github.com/asduffo/freegress/blob/HEAD/src/datasets/guacamol_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85832bcd5531c861","code_sha256_prefix":"85832bcd5531c861","mcp_get_code":{"code_sha256":"85832bcd5531c861"}},{"arxiv_id":"2310.15817","arxiv_id_is_arxiv":true,"paper":"/paper/discriminator-guidance-for-autoregressive","title":"Discriminator Guidance for Autoregressive Diffusion Models","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"filipekstrm/graph_ardm","path":"src/dataset/moses_dataset.py","file_url":"https://github.com/filipekstrm/graph_ardm/blob/HEAD/src/dataset/moses_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, filipekstrm/graph_ardm when it was checked","code_sha256":"85832bcd5531c861","code_sha256_prefix":"85832bcd5531c861","mcp_get_code":{"code_sha256":"85832bcd5531c861"}},{"arxiv_id":"2310.09754","arxiv_id_is_arxiv":true,"paper":"/paper/ex-fever-a-dataset-for-multi-hop-explainable","title":"EX-FEVER: A Dataset for Multi-hop Explainable Fact Verification","date":"2023-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dependentsign/EX-FEVER","path":"run_hover.py","file_url":"https://github.com/dependentsign/EX-FEVER/blob/HEAD/run_hover.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2310.08975","arxiv_id_is_arxiv":true,"paper":"/paper/chatkbqa-a-generate-then-retrieve-framework","title":"ChatKBQA: A Generate-then-Retrieve Framework for Knowledge Base Question Answering with Fine-tuned Large Language Models","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhrlab/chatkbqa","path":"config.py","file_url":"https://github.com/lhrlab/chatkbqa/blob/HEAD/config.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2310.05185","arxiv_id_is_arxiv":true,"paper":"/paper/text2nkg-fine-grained-n-ary-relation","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2307.06933","arxiv_id_is_arxiv":true,"paper":"/paper/fdapt-federated-domain-adaptive-pre-training","title":"FDAPT: Federated Domain-adaptive Pre-training for Language Models","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scylj1/FDAPT","path":"downstream-task/question-answering/run_factoid.py","file_url":"https://github.com/scylj1/FDAPT/blob/HEAD/downstream-task/question-answering/run_factoid.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, scylj1/FDAPT when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2305.17626","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-analogical-reasoning-with-pre","title":"In-Context Analogical Reasoning with Pre-Trained Language Models","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hxiaoyang/lm-raven","path":"task.py","file_url":"https://github.com/hxiaoyang/lm-raven/blob/HEAD/task.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03884bb215982e58","code_sha256_prefix":"03884bb215982e58","mcp_get_code":{"code_sha256":"03884bb215982e58"}},{"arxiv_id":"2303.08137","arxiv_id_is_arxiv":true,"paper":"/paper/layoutdm-discrete-diffusion-model-for","title":"LayoutDM: Discrete Diffusion Model for Controllable Layout Generation","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CyberAgentAILab/layout-dm","path":"src/trainer/trainer/datasets/dataset.py","file_url":"https://github.com/CyberAgentAILab/layout-dm/blob/HEAD/src/trainer/trainer/datasets/dataset.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":"a9178e09ab2d3a5a","code_sha256_prefix":"a9178e09ab2d3a5a","mcp_get_code":{"code_sha256":"a9178e09ab2d3a5a"}},{"arxiv_id":"2210.15048","arxiv_id_is_arxiv":true,"paper":"/paper/dyrex-dynamic-query-representation-for","title":"DyREx: Dynamic Query Representation for Extractive Question Answering","date":"2022-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2208.14111","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-with-learnable-activation","title":"Transformers with Learnable Activation Functions","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2206.12562","arxiv_id_is_arxiv":true,"paper":"/paper/platon-pruning-large-transformer-models-with","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2206.06602","arxiv_id_is_arxiv":true,"paper":"/paper/deep-isolation-forest-for-anomaly-detection","title":"Deep Isolation Forest for Anomaly Detection","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/deep-iforest","path":"pyg_old/pyg_old_dataset.py","file_url":"https://github.com/xuhongzuo/deep-iforest/blob/HEAD/pyg_old/pyg_old_dataset.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":"d32004b35c3fd2b9","code_sha256_prefix":"d32004b35c3fd2b9","mcp_get_code":{"code_sha256":"d32004b35c3fd2b9"}},{"arxiv_id":"2204.03243","arxiv_id_is_arxiv":true,"paper":"/paper/pretraining-text-encoders-with-adversarial-1","title":"Pretraining Text Encoders with Adversarial Mixture of Training Signal Generators","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/amos","path":"huggingface/run_squad.py","file_url":"https://github.com/microsoft/amos/blob/HEAD/huggingface/run_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2202.09381","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-disinformation-attacks-on-automated","title":"Synthetic Disinformation Attacks on Automated Fact Verification Systems","date":"2022-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yibing-du/adversarial-factcheck","path":"fever/corefbert/Pretrain/run_pretrain.py","file_url":"https://github.com/yibing-du/adversarial-factcheck/blob/HEAD/fever/corefbert/Pretrain/run_pretrain.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2110.01799","arxiv_id_is_arxiv":true,"paper":"/paper/contractnli-a-dataset-for-document-level","title":"ContractNLI: A Dataset for Document-level Natural Language Inference for Contracts","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordnlp/contract-nli-bert","path":"contract_nli/predictor.py","file_url":"https://github.com/stanfordnlp/contract-nli-bert/blob/HEAD/contract_nli/predictor.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2109.08133","arxiv_id_is_arxiv":true,"paper":"/paper/phrase-retrieval-learns-passage-retrieval-too","title":"Phrase Retrieval Learns Passage Retrieval, Too","date":"2021-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/DensePhrases","path":"densephrases/utils/single_utils.py","file_url":"https://github.com/princeton-nlp/DensePhrases/blob/HEAD/densephrases/utils/single_utils.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2109.06067","arxiv_id_is_arxiv":true,"paper":"/paper/pack-together-entity-and-relation-extraction","title":"Packed Levitated Marker for Entity and Relation Extraction","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/pl-marker","path":"run_levitatedpair.py","file_url":"https://github.com/thunlp/pl-marker/blob/HEAD/run_levitatedpair.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2109.04223","arxiv_id_is_arxiv":true,"paper":"/paper/kelm-knowledge-enhanced-pre-trained-language","title":"KELM: Knowledge Enhanced Pre-Trained Language Representations with Message Passing on Hierarchical Relational Graphs","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlp-anonymous-happy/anonymous-kg-guided-nlp","path":"src/run_copa.py","file_url":"https://github.com/nlp-anonymous-happy/anonymous-kg-guided-nlp/blob/HEAD/src/run_copa.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2109.04096","arxiv_id_is_arxiv":true,"paper":"/paper/a-three-stage-learning-framework-for-low","title":"A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neukg/kat-tslf","path":"run_kat.py","file_url":"https://github.com/neukg/kat-tslf/blob/HEAD/run_kat.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2105.14682","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-fact-verification-by-claim","title":"Zero-shot Fact Verification by Claim Generation","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2105.03938","arxiv_id_is_arxiv":true,"paper":"/paper/passage-retrieval-for-outside-knowledge","title":"Passage Retrieval for Outside-Knowledge Visual Question Answering","date":"2021-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prdwb/okvqa-release","path":"train_retriever.py","file_url":"https://github.com/prdwb/okvqa-release/blob/HEAD/train_retriever.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, prdwb/okvqa-release when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2105.02692","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-perturb-word-embeddings-for-out","title":"Learning to Perturb Word Embeddings for Out-of-distribution QA","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seanie12/SWEP","path":"run_squad.py","file_url":"https://github.com/seanie12/SWEP/blob/HEAD/run_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2101.00063","arxiv_id_is_arxiv":true,"paper":"/paper/earlybert-efficient-bert-training-via-early-1","title":"EarlyBERT: Efficient BERT Training via Early-bird Lottery Tickets","date":"2020-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2010.07003","arxiv_id_is_arxiv":true,"paper":"/paper/length-adaptive-transformer-train-once-with-1","title":"Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Search","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/length-adaptive-transformer","path":"run_squad.py","file_url":"https://github.com/clovaai/length-adaptive-transformer/blob/HEAD/run_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2010.05315","arxiv_id_is_arxiv":true,"paper":"/paper/smyrf-efficient-attention-using-asymmetric","title":"SMYRF: Efficient Attention using Asymmetric Clustering","date":"2020-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2010.02329","arxiv_id_is_arxiv":true,"paper":"/paper/infobert-improving-robustness-of-language-1","title":"InfoBERT: Improving Robustness of Language Models from An Information Theoretic Perspective","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-secure/InfoBERT","path":"SQuAD/run_squad.py","file_url":"https://github.com/AI-secure/InfoBERT/blob/HEAD/SQuAD/run_squad.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, AI-secure/InfoBERT when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2010.00490","arxiv_id_is_arxiv":true,"paper":"/paper/towards-question-answering-as-an-automatic","title":"Towards Question-Answering as an Automatic Metric for Evaluating the Content Quality of a Summary","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2007.12223","arxiv_id_is_arxiv":true,"paper":"/paper/the-lottery-ticket-hypothesis-for-pre-trained","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","date":"2020-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAMU-VITA/BERT-Tickets","path":"LT_squad.py","file_url":"https://github.com/TAMU-VITA/BERT-Tickets/blob/HEAD/LT_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2007.00398","arxiv_id_is_arxiv":true,"paper":"/paper/docvqa-a-dataset-for-vqa-on-document-images","title":"DocVQA: A Dataset for VQA on Document Images","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anisha2102/docvqa","path":"run_docvqa.py","file_url":"https://github.com/anisha2102/docvqa/blob/HEAD/run_docvqa.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2006.07409","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-avoid-being-eaten-by-a-grue-structured","title":"How to Avoid Being Eaten by a Grue: Structured Exploration Strategies for Textual Worlds","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2006.05009","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-generative-conversational-query","title":"Few-Shot Generative Conversational Query Rewriting","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2005.11364","arxiv_id_is_arxiv":true,"paper":"/paper/open-retrieval-conversational-question","title":"Open-Retrieval Conversational Question Answering","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2005.07683","arxiv_id_is_arxiv":true,"paper":"/paper/movement-pruning-adaptive-sparsity-by-fine","title":"Movement Pruning: Adaptive Sparsity by Fine-Tuning","date":"2020-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2005.00770","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-and-predicting-transferability","title":"Exploring and Predicting Transferability across NLP Tasks","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuvuumass/task-transferability","path":"run_finetuning_QA.py","file_url":"https://github.com/tuvuumass/task-transferability/blob/HEAD/run_finetuning_QA.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2004.10964","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-stop-pretraining-adapt-language-models","title":"Don't Stop Pretraining: Adapt Language Models to Domains and Tasks","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2004.01571","arxiv_id_is_arxiv":true,"paper":"/paper/tramp-compositional-inference-with-tree","title":"Tree-AMP: Compositional Inference with Tree Approximate Message Passing","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sphinxteam/tramp","path":"tramp/models/base_model.py","file_url":"https://github.com/sphinxteam/tramp/blob/HEAD/tramp/models/base_model.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":"af14d7277a84f3eb","code_sha256_prefix":"af14d7277a84f3eb","mcp_get_code":{"code_sha256":"af14d7277a84f3eb"}},{"arxiv_id":"2002.08795","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-avoid-being-eaten-by-a-grue","title":"How To Avoid Being Eaten By a Grue: Exploration Strategies for Text-Adventure Agents","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"1911.02984","arxiv_id_is_arxiv":true,"paper":"/paper/the-techqa-dataset","title":"The TechQA Dataset","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/techqa","path":"techqa_metrics.py","file_url":"https://github.com/ibm/techqa/blob/HEAD/techqa_metrics.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"1910.06379","arxiv_id_is_arxiv":true,"paper":"/paper/dual-path-rnn-efficient-long-sequence","title":"Dual-path RNN: efficient long sequence modeling for time-domain single-channel speech separation","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fgnt/padertorch","path":"padertorch/utils.py","file_url":"https://github.com/fgnt/padertorch/blob/HEAD/padertorch/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":"9bb35d2d16d87796","code_sha256_prefix":"9bb35d2d16d87796","mcp_get_code":{"code_sha256":"9bb35d2d16d87796"}},{"arxiv_id":"1910.06188","arxiv_id_is_arxiv":true,"paper":"/paper/q8bert-quantized-8bit-bert","title":"Q8BERT: Quantized 8Bit BERT","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"1902.01718","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-open-domain-question-answering","title":"End-to-End Open-Domain Question Answering with BERTserini","date":"2019-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rsvp-ai/bertserini","path":"bertserini/train/run_squad.py","file_url":"https://github.com/rsvp-ai/bertserini/blob/HEAD/bertserini/train/run_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"1812.05055","arxiv_id_is_arxiv":true,"paper":"/paper/graph-networks-as-a-universal-machine","title":"Graph Networks as a Universal Machine Learning Framework for Molecules and Crystals","date":null,"month_inferred_from_arxiv_id":"2018-12","title_source":"archive","repo":"materialsvirtuallab/megnet","path":"megnet/utils/general.py","file_url":"https://github.com/materialsvirtuallab/megnet/blob/HEAD/megnet/utils/general.py","status":"ran","verification_level":1,"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":"5b8cd0953f2acd70","code_sha256_prefix":"5b8cd0953f2acd70","mcp_get_code":{"code_sha256":"5b8cd0953f2acd70"}},{"arxiv_id":"1708.04782","arxiv_id_is_arxiv":true,"paper":"/paper/starcraft-ii-a-new-challenge-for","title":"StarCraft II: A New Challenge for Reinforcement Learning","date":"2017-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/pysc2","path":"pysc2/env/sc2_env.py","file_url":"https://github.com/google-deepmind/pysc2/blob/HEAD/pysc2/env/sc2_env.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d26ef3681029c3e","code_sha256_prefix":"5d26ef3681029c3e","mcp_get_code":{"code_sha256":"5d26ef3681029c3e"}},{"arxiv_id":"aaai_16733","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16733","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"rajammanabrolu/WorldGeneration","path":"neural-based/KG-extraction/run_squad.py","file_url":"https://github.com/rajammanabrolu/WorldGeneration/blob/HEAD/neural-based/KG-extraction/run_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"Liu_UNOPose_Unseen_Object_Pose_Estimation_with_an_Unposed_RGB-D_Reference_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Liu_UNOPose_Unseen_Object_Pose_Estimation_with_an_Unposed_RGB-D_Reference_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shanice-l/UNOPose","path":"core/unopose/engine/bop_eval_utils.py","file_url":"https://github.com/shanice-l/UNOPose/blob/HEAD/core/unopose/engine/bop_eval_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":"9efdf0b6d42d9e45","code_sha256_prefix":"9efdf0b6d42d9e45","mcp_get_code":{"code_sha256":"9efdf0b6d42d9e45"}},{"arxiv_id":"2025.findings-emnlp.1354","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-emnlp.1354","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"basiralab/DP-ERE","path":"DP-ERE/dp_ere_PL_Marker.py","file_url":"https://github.com/basiralab/DP-ERE/blob/HEAD/DP-ERE/dp_ere_PL_Marker.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2025.findings-acl.931","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.931","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bebing93/devil-in-details","path":"AccAlign/aer.py","file_url":"https://github.com/bebing93/devil-in-details/blob/HEAD/AccAlign/aer.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":"b1ea1c1a0b203c9a","code_sha256_prefix":"b1ea1c1a0b203c9a","mcp_get_code":{"code_sha256":"b1ea1c1a0b203c9a"}},{"arxiv_id":"2024.naacl-long.345","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.345","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"arashardakani/SlimFit","path":"BERT/SQuAD.py","file_url":"https://github.com/arashardakani/SlimFit/blob/HEAD/BERT/SQuAD.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2023.emnlp-main.803","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.803","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yisunlp/Anti-CF","path":"AntiCF.py","file_url":"https://github.com/yisunlp/Anti-CF/blob/HEAD/AntiCF.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2021.findings-emnlp.119","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.119","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/bridging-resolution","path":"BARQA/transformer_squad/run_squad.py","file_url":"https://github.com/IBM/bridging-resolution/blob/HEAD/BARQA/transformer_squad/run_squad.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}},{"arxiv_id":"2021.acl-long.48","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.acl-long.48","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PluviophileYU/COSY","path":"XQA/src/train_eval.py","file_url":"https://github.com/PluviophileYU/COSY/blob/HEAD/XQA/src/train_eval.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 AI-secure/InfoBERT, and GitHub detected no licence in that repository when it was checked","code_sha256":"9df40357afea56cc","code_sha256_prefix":"9df40357afea56cc","mcp_get_code":{"code_sha256":"9df40357afea56cc"}}],"record_sha256":"3c8c7801df3a4048cffa03e9f103fdfff488e9a5bb2ea78c2f84ff190f13add5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}