{"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/init-logger","entry":"init_logger","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":50,"n_papers_ran":48,"n_papers_ran_no_instrument_failure":30,"n_papers_ran_instrument_only":18,"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":43,"n_samples_ran":41,"n_samples_constructed":0,"n_samples_ran_checked":29,"n_samples_instrument":12,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":53,"n_places_pointer_only":11,"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":1,"ran_draft_wrong":12,"ran_fixture":0,"ran":28,"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":"2607.09754","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-09754","title":"Cross-Subject Modeling for Widefield Calcium Imaging via Atlas-Aligned Spatiotemporal Tokenization","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ShanechiLab/WiCAT","path":"wicat/utility/utils.py","file_url":"https://github.com/ShanechiLab/WiCAT/blob/HEAD/wicat/utility/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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, ShanechiLab/WiCAT (NOASSERTION)","code_sha256":"54339166c6f14402","code_sha256_prefix":"54339166c6f14402","mcp_get_code":{"code_sha256":"54339166c6f14402"}},{"arxiv_id":"2607.04206","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-04206","title":"Sangam: Efficiently Serving Diffusion LLMs with the AR Stack","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"UT-InfraAI/sangam","path":"src/sangam/logger.py","file_url":"https://github.com/UT-InfraAI/sangam/blob/HEAD/src/sangam/logger.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":"ea23c66f29abec81","code_sha256_prefix":"ea23c66f29abec81","mcp_get_code":{"code_sha256":"ea23c66f29abec81"}},{"arxiv_id":"2606.31966","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-31966","title":"MECoBench: A Systematic Study of Multimodal Agent Collaboration in Embodied Environments","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"q-i-n-g/MECoBench","path":"eval/utils/logger.py","file_url":"https://github.com/q-i-n-g/MECoBench/blob/HEAD/eval/utils/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d19e5bfe8eca12b2","code_sha256_prefix":"d19e5bfe8eca12b2","mcp_get_code":{"code_sha256":"d19e5bfe8eca12b2"}},{"arxiv_id":"2605.21312","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21312","title":"Frontier: Towards Comprehensive and Accurate LLM Inference Simulation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"NetX-lab/Frontier","path":"frontier/logger.py","file_url":"https://github.com/NetX-lab/Frontier/blob/HEAD/frontier/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"197a0f338024eca9","code_sha256_prefix":"197a0f338024eca9","mcp_get_code":{"code_sha256":"197a0f338024eca9"}},{"arxiv_id":"2601.03042","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03042","title":"BaseCal: Unsupervised Confidence Calibration via Base Model Signals","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Tan-Hexiang/BaseCal","path":"src/utils.py","file_url":"https://github.com/Tan-Hexiang/BaseCal/blob/HEAD/src/utils.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, Tan-Hexiang/BaseCal when it was checked","code_sha256":"3b6e57e4e5953ce8","code_sha256_prefix":"3b6e57e4e5953ce8","mcp_get_code":{"code_sha256":"3b6e57e4e5953ce8"}},{"arxiv_id":"2507.00828","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.00828","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"ahoho/proxann","path":"src/proxann/utils/file_utils.py","file_url":"https://github.com/ahoho/proxann/blob/HEAD/src/proxann/utils/file_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":"0f5fff388b293baf","code_sha256_prefix":"0f5fff388b293baf","mcp_get_code":{"code_sha256":"0f5fff388b293baf"}},{"arxiv_id":"2505.23883","arxiv_id_is_arxiv":true,"paper":"/paper/bioclip-2-emergent-properties-from-scaling","title":"BioCLIP 2: Emergent Properties from Scaling Hierarchical Contrastive Learning","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imageomics/treeoflife-toolbox","path":"src/TreeOfLife_toolbox/main/utils.py","file_url":"https://github.com/imageomics/treeoflife-toolbox/blob/HEAD/src/TreeOfLife_toolbox/main/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":"2edc98b39c0ff429","code_sha256_prefix":"2edc98b39c0ff429","mcp_get_code":{"code_sha256":"2edc98b39c0ff429"}},{"arxiv_id":"2505.20840","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.20840","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"dooho00/agg-buffer","path":"utils/log_utils.py","file_url":"https://github.com/dooho00/agg-buffer/blob/HEAD/utils/log_utils.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":"62fb06eb1ad5bd8d","code_sha256_prefix":"62fb06eb1ad5bd8d","mcp_get_code":{"code_sha256":"62fb06eb1ad5bd8d"}},{"arxiv_id":"2502.14866","arxiv_id_is_arxiv":true,"paper":"/paper/lserve-efficient-long-sequence-llm-serving","title":"LServe: Efficient Long-sequence LLM Serving with Unified Sparse Attention","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/qserve","path":"omniserve/logger.py","file_url":"https://github.com/mit-han-lab/qserve/blob/HEAD/omniserve/logger.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":"4e6200c3c6f4170a","code_sha256_prefix":"4e6200c3c6f4170a","mcp_get_code":{"code_sha256":"4e6200c3c6f4170a"}},{"arxiv_id":"2502.14662","arxiv_id_is_arxiv":true,"paper":"/paper/instructagent-building-user-controllable","title":"iAgent: LLM Agent as a Shield between User and Recommender Systems","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujiangxu/iagent","path":"main_iagent_mp.py","file_url":"https://github.com/wujiangxu/iagent/blob/HEAD/main_iagent_mp.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, wujiangxu/iagent when it was checked","code_sha256":"7c0befbcf008cccd","code_sha256_prefix":"7c0befbcf008cccd","mcp_get_code":{"code_sha256":"7c0befbcf008cccd"}},{"arxiv_id":"2501.14808","arxiv_id_is_arxiv":true,"paper":"/paper/hygen-efficient-llm-serving-via-elastic","title":"HyGen: Efficient LLM Serving via Elastic Online-Offline Request Co-location","date":"2025-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UIUC-MLSys/HyGen","path":"hygen/logger.py","file_url":"https://github.com/UIUC-MLSys/HyGen/blob/HEAD/hygen/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"197a0f338024eca9","code_sha256_prefix":"197a0f338024eca9","mcp_get_code":{"code_sha256":"197a0f338024eca9"}},{"arxiv_id":"2410.02730","arxiv_id_is_arxiv":true,"paper":"/paper/divscene-benchmarking-lvlms-for-object","title":"DivScene: Benchmarking LVLMs for Object Navigation with Diverse Scenes and Objects","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaowei-wang-nlp/divscene","path":"agent_inference/utils.py","file_url":"https://github.com/zhaowei-wang-nlp/divscene/blob/HEAD/agent_inference/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":"4650a677e33f265a","code_sha256_prefix":"4650a677e33f265a","mcp_get_code":{"code_sha256":"4650a677e33f265a"}},{"arxiv_id":"2409.13761","arxiv_id_is_arxiv":true,"paper":"/paper/do-large-language-models-need-a-content","title":"Do Large Language Models Need a Content Delivery Network?","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmcache/lmcache","path":"lmcache/logging.py","file_url":"https://github.com/lmcache/lmcache/blob/HEAD/lmcache/logging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eda16f8e754cd24d","code_sha256_prefix":"eda16f8e754cd24d","mcp_get_code":{"code_sha256":"eda16f8e754cd24d"}},{"arxiv_id":"2409.12186","arxiv_id_is_arxiv":true,"paper":"/paper/qwen2-5-coder-technical-report","title":"Qwen2.5-Coder Technical Report","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qwenlm/qwen2.5-coder","path":"finetuning/dpo/utils.py","file_url":"https://github.com/qwenlm/qwen2.5-coder/blob/HEAD/finetuning/dpo/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, qwenlm/qwen2.5-coder when it was checked","code_sha256":"d66f3bbe198174ce","code_sha256_prefix":"d66f3bbe198174ce","mcp_get_code":{"code_sha256":"d66f3bbe198174ce"}},{"arxiv_id":"2406.19130","arxiv_id_is_arxiv":true,"paper":"/paper/evidential-concept-embedding-models-towards","title":"Evidential Concept Embedding Models: Towards Reliable Concept Explanations for Skin Disease Diagnosis","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"obiyoag/evi-cem","path":"utils.py","file_url":"https://github.com/obiyoag/evi-cem/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec1838ce50f98f86","code_sha256_prefix":"ec1838ce50f98f86","mcp_get_code":{"code_sha256":"ec1838ce50f98f86"}},{"arxiv_id":"2405.05465","arxiv_id_is_arxiv":true,"paper":"/paper/vidur-a-large-scale-simulation-framework-for","title":"Vidur: A Large-Scale Simulation Framework For LLM Inference","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/vidur","path":"vidur/logger.py","file_url":"https://github.com/microsoft/vidur/blob/HEAD/vidur/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"197a0f338024eca9","code_sha256_prefix":"197a0f338024eca9","mcp_get_code":{"code_sha256":"197a0f338024eca9"}},{"arxiv_id":"2404.13948","arxiv_id_is_arxiv":true,"paper":"/paper/typos-that-broke-the-rag-s-back-genetic","title":"Typos that Broke the RAG's Back: Genetic Attack on RAG Pipeline by Simulating Documents in the Wild via Low-level Perturbations","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zomss/garag","path":"src/util.py","file_url":"https://github.com/zomss/garag/blob/HEAD/src/util.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, zomss/garag when it was checked","code_sha256":"03ed98729e61a62a","code_sha256_prefix":"03ed98729e61a62a","mcp_get_code":{"code_sha256":"03ed98729e61a62a"}},{"arxiv_id":"2404.02015","arxiv_id_is_arxiv":true,"paper":"/paper/muxserve-flexible-multiplexing-for-efficient","title":"MuxServe: Flexible Spatial-Temporal Multiplexing for Multiple LLM Serving","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"hao-ai-lab/muxserve","path":"muxserve/logger.py","file_url":"https://github.com/hao-ai-lab/muxserve/blob/HEAD/muxserve/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"197a0f338024eca9","code_sha256_prefix":"197a0f338024eca9","mcp_get_code":{"code_sha256":"197a0f338024eca9"}},{"arxiv_id":"2403.02698","arxiv_id_is_arxiv":true,"paper":"/paper/causal-walk-debiasing-multi-hop-fact","title":"Causal Walk: Debiasing Multi-Hop Fact Verification with Front-Door Adjustment","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zcccccz/CausalWalk","path":"utils.py","file_url":"https://github.com/zcccccz/CausalWalk/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"44cae70d89ff61d4","code_sha256_prefix":"44cae70d89ff61d4","mcp_get_code":{"code_sha256":"44cae70d89ff61d4"}},{"arxiv_id":"2403.02310","arxiv_id_is_arxiv":true,"paper":"/paper/taming-throughput-latency-tradeoff-in-llm","title":"Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/sarathi-serve","path":"sarathi/logger.py","file_url":"https://github.com/microsoft/sarathi-serve/blob/HEAD/sarathi/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"197a0f338024eca9","code_sha256_prefix":"197a0f338024eca9","mcp_get_code":{"code_sha256":"197a0f338024eca9"}},{"arxiv_id":"2402.14808","arxiv_id_is_arxiv":true,"paper":"/paper/relayattention-for-efficient-large-language","title":"RelayAttention for Efficient Large Language Model Serving with Long System Prompts","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rayleizhu/vllm-ra","path":"vllm/logger.py","file_url":"https://github.com/rayleizhu/vllm-ra/blob/HEAD/vllm/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13adeb89dc2bcd5c","code_sha256_prefix":"13adeb89dc2bcd5c","mcp_get_code":{"code_sha256":"13adeb89dc2bcd5c"}},{"arxiv_id":"2402.02503","arxiv_id_is_arxiv":true,"paper":"/paper/gerea-question-aware-prompt-captions-for","title":"GeReA: Question-Aware Prompt Captions for Knowledge-based Visual Question Answering","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"upper9527/gerea","path":"src/util.py","file_url":"https://github.com/upper9527/gerea/blob/HEAD/src/util.py","status":"ran","verification_level":1,"contract_check":null,"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, upper9527/gerea when it was checked","code_sha256":"1700ba94a8342336","code_sha256_prefix":"1700ba94a8342336","mcp_get_code":{"code_sha256":"1700ba94a8342336"}},{"arxiv_id":"2401.16979","arxiv_id_is_arxiv":true,"paper":"/paper/re3val-reinforced-and-reranked-generative","title":"Re3val: Reinforced and Reranked Generative Retrieval","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/FiD","path":"src/util.py","file_url":"https://github.com/facebookresearch/FiD/blob/HEAD/src/util.py","status":"ran","verification_level":1,"contract_check":null,"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, facebookresearch/FiD when it was checked","code_sha256":"1700ba94a8342336","code_sha256_prefix":"1700ba94a8342336","mcp_get_code":{"code_sha256":"1700ba94a8342336"}},{"arxiv_id":"2401.14351","arxiv_id_is_arxiv":true,"paper":"/paper/serverlessllm-locality-enhanced-serverless","title":"ServerlessLLM: Low-Latency Serverless Inference for Large Language Models","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serverlessllm/serverlessllm","path":"sllm/logger.py","file_url":"https://github.com/serverlessllm/serverlessllm/blob/HEAD/sllm/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0ba2e0c180b4490b","code_sha256_prefix":"0ba2e0c180b4490b","mcp_get_code":{"code_sha256":"0ba2e0c180b4490b"}},{"arxiv_id":"2401.09670","arxiv_id_is_arxiv":true,"paper":"/paper/distserve-disaggregating-prefill-and-decoding","title":"DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Serving","date":null,"month_inferred_from_arxiv_id":"2024-01","title_source":"archive","repo":"LLMServe/DistServe","path":"distserve/logger.py","file_url":"https://github.com/LLMServe/DistServe/blob/HEAD/distserve/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"197a0f338024eca9","code_sha256_prefix":"197a0f338024eca9","mcp_get_code":{"code_sha256":"197a0f338024eca9"}},{"arxiv_id":"2311.17276","arxiv_id_is_arxiv":true,"paper":"/paper/machine-unlearning-in-learned-databases-an","title":"Machine Unlearning in Learned Databases: An Experimental Analysis","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"meghdadk/db_unlearning","path":"naru/train_model.py","file_url":"https://github.com/meghdadk/db_unlearning/blob/HEAD/naru/train_model.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":"546dd9e92541aecd","code_sha256_prefix":"546dd9e92541aecd","mcp_get_code":{"code_sha256":"546dd9e92541aecd"}},{"arxiv_id":"2311.17276","arxiv_id_is_arxiv":true,"paper":"/paper/machine-unlearning-in-learned-databases-an","title":"Machine Unlearning in Learned Databases: An Experimental Analysis","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"meghdadk/db_unlearning","path":"dbest/train_mdn.py","file_url":"https://github.com/meghdadk/db_unlearning/blob/HEAD/dbest/train_mdn.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":"a94224cb98b134be","code_sha256_prefix":"a94224cb98b134be","mcp_get_code":{"code_sha256":"a94224cb98b134be"}},{"arxiv_id":"2311.11114","arxiv_id_is_arxiv":true,"paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/DIDA","path":"DIDA/utils/util.py","file_url":"https://github.com/wondergo2017/DIDA/blob/HEAD/DIDA/utils/util.py","status":"ran","verification_level":1,"contract_check":null,"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, wondergo2017/DIDA when it was checked","code_sha256":"3cd9fad3aabd89b3","code_sha256_prefix":"3cd9fad3aabd89b3","mcp_get_code":{"code_sha256":"3cd9fad3aabd89b3"}},{"arxiv_id":"2310.20329","arxiv_id_is_arxiv":true,"paper":"/paper/instructcoder-empowering-language-models-for","title":"InstructCoder: Instruction Tuning Large Language Models for Code Editing","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qishenghu/CodeInstruct","path":"edit_eval/utils.py","file_url":"https://github.com/qishenghu/CodeInstruct/blob/HEAD/edit_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":"db2f749312721290","code_sha256_prefix":"db2f749312721290","mcp_get_code":{"code_sha256":"db2f749312721290"}},{"arxiv_id":"2310.19046","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-as-evolutionary","title":"Large Language Models as Evolutionary Optimizers","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cschen1205/lmea","path":"src/utils.py","file_url":"https://github.com/cschen1205/lmea/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"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, cschen1205/lmea when it was checked","code_sha256":"e574bb47fc0fc6ff","code_sha256_prefix":"e574bb47fc0fc6ff","mcp_get_code":{"code_sha256":"e574bb47fc0fc6ff"}},{"arxiv_id":"2310.00800","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.00800","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"jumxglhf/ParetoGNN","path":"src/evaluator.py","file_url":"https://github.com/jumxglhf/ParetoGNN/blob/HEAD/src/evaluator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be4b0014138164d5","code_sha256_prefix":"be4b0014138164d5","mcp_get_code":{"code_sha256":"be4b0014138164d5"}},{"arxiv_id":"2310.00800","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.00800","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"jumxglhf/ParetoGNN","path":"src/utils.py","file_url":"https://github.com/jumxglhf/ParetoGNN/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42eab89fc010d007","code_sha256_prefix":"42eab89fc010d007","mcp_get_code":{"code_sha256":"42eab89fc010d007"}},{"arxiv_id":"2309.06180","arxiv_id_is_arxiv":true,"paper":"/paper/2309-06180","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adlik/vllm","path":"vllm/logger.py","file_url":"https://github.com/adlik/vllm/blob/HEAD/vllm/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13adeb89dc2bcd5c","code_sha256_prefix":"13adeb89dc2bcd5c","mcp_get_code":{"code_sha256":"13adeb89dc2bcd5c"}},{"arxiv_id":"2308.14029","arxiv_id_is_arxiv":true,"paper":"/paper/text-matching-improves-sequential","title":"Text Matching Improves Sequential Recommendation by Reducing Popularity Biases","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/taste","path":"utils/util.py","file_url":"https://github.com/openmatch/taste/blob/HEAD/utils/util.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":"a389a3672cc46836","code_sha256_prefix":"a389a3672cc46836","mcp_get_code":{"code_sha256":"a389a3672cc46836"}},{"arxiv_id":"2211.09892","arxiv_id_is_arxiv":true,"paper":"/paper/summarizing-community-based-question-answer","title":"Summarizing Community-based Question-Answer Pairs","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpyang/BertSum","path":"src/others/logging.py","file_url":"https://github.com/nlpyang/BertSum/blob/HEAD/src/others/logging.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":"e317b188410c9032","code_sha256_prefix":"e317b188410c9032","mcp_get_code":{"code_sha256":"e317b188410c9032"}},{"arxiv_id":"2210.16870","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-efficient-and-scalable-contrastive","title":"A simple, efficient and scalable contrastive masked autoencoder for learning visual representations","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bwconrad/can","path":"src/pl_utils.py","file_url":"https://github.com/bwconrad/can/blob/HEAD/src/pl_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":"897d09cf62083d7b","code_sha256_prefix":"897d09cf62083d7b","mcp_get_code":{"code_sha256":"897d09cf62083d7b"}},{"arxiv_id":"2206.01451","arxiv_id_is_arxiv":true,"paper":"/paper/learning-distributed-and-fair-policies-for","title":"Learning Distributed and Fair Policies for Network Load Balancing as Markov Potential Game","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiyuanyaoj/marllb","path":"src/lb/env.py","file_url":"https://github.com/zhiyuanyaoj/marllb/blob/HEAD/src/lb/env.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":"d9871d88b26f7c62","code_sha256_prefix":"d9871d88b26f7c62","mcp_get_code":{"code_sha256":"d9871d88b26f7c62"}},{"arxiv_id":"2203.03315","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-entity-1","title":"Deep Reinforcement Learning for Entity Alignment","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guolingbing/RLEA","path":"run/runRLEA.py","file_url":"https://github.com/guolingbing/RLEA/blob/HEAD/run/runRLEA.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":"a1d21f61384a3aeb","code_sha256_prefix":"a1d21f61384a3aeb","mcp_get_code":{"code_sha256":"a1d21f61384a3aeb"}},{"arxiv_id":"2112.08688","arxiv_id_is_arxiv":true,"paper":"/paper/evidentiality-guided-generation-for-knowledge","title":"Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akariasai/evidentiality_qa","path":"evi_gen/src/util.py","file_url":"https://github.com/akariasai/evidentiality_qa/blob/HEAD/evi_gen/src/util.py","status":"ran","verification_level":1,"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 upper9527/gerea, and GitHub detected no licence in that repository when it was checked","code_sha256":"1700ba94a8342336","code_sha256_prefix":"1700ba94a8342336","mcp_get_code":{"code_sha256":"1700ba94a8342336"}},{"arxiv_id":"2107.01154","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-leakage-resilient-federated-learning","title":"Gradient-Leakage Resilient Federated Learning","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiyuanZh/censor","path":"run_rec.py","file_url":"https://github.com/KaiyuanZh/censor/blob/HEAD/run_rec.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":"7d2ab6b3bb65b1d1","code_sha256_prefix":"7d2ab6b3bb65b1d1","mcp_get_code":{"code_sha256":"7d2ab6b3bb65b1d1"}},{"arxiv_id":"2011.07636","arxiv_id_is_arxiv":true,"paper":"/paper/open4business-o4b-an-open-access-dataset-for","title":"Open4Business(O4B): An Open Access Dataset for Summarizing Business Documents","date":"2020-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amanpreet692/Open4Business","path":"dataset_utils.py","file_url":"https://github.com/amanpreet692/Open4Business/blob/HEAD/dataset_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e027425e8484f78","code_sha256_prefix":"5e027425e8484f78","mcp_get_code":{"code_sha256":"5e027425e8484f78"}},{"arxiv_id":"2005.13407","arxiv_id_is_arxiv":true,"paper":"/paper/causalm-causal-model-explanation-through","title":"CausaLM: Causal Model Explanation Through Counterfactual Language Models","date":"2020-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amirfeder/causalm","path":"utils.py","file_url":"https://github.com/amirfeder/causalm/blob/HEAD/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":"ad89fcb2b2636278","code_sha256_prefix":"ad89fcb2b2636278","mcp_get_code":{"code_sha256":"ad89fcb2b2636278"}},{"arxiv_id":"2004.09424","arxiv_id_is_arxiv":true,"paper":"/paper/a-review-based-transformer-model-for","title":"Learning a Fine-Grained Review-based Transformer Model for Personalized Product Search","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kepingbi/ProdSearch","path":"others/logging.py","file_url":"https://github.com/kepingbi/ProdSearch/blob/HEAD/others/logging.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":"e317b188410c9032","code_sha256_prefix":"e317b188410c9032","mcp_get_code":{"code_sha256":"e317b188410c9032"}},{"arxiv_id":"1908.08345","arxiv_id_is_arxiv":true,"paper":"/paper/text-summarization-with-pretrained-encoders","title":"Text Summarization with Pretrained Encoders","date":"2019-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aikawasho/BertSum","path":"src/others/logging.py","file_url":"https://github.com/aikawasho/BertSum/blob/HEAD/src/others/logging.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":"e317b188410c9032","code_sha256_prefix":"e317b188410c9032","mcp_get_code":{"code_sha256":"e317b188410c9032"}},{"arxiv_id":"1904.00993","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-multi-view-networks","title":"Equivariant Multi-View Networks","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daniilidis-group/emvn","path":"emvn/util.py","file_url":"https://github.com/daniilidis-group/emvn/blob/HEAD/emvn/util.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":"7ca13c0290b18e1f","code_sha256_prefix":"7ca13c0290b18e1f","mcp_get_code":{"code_sha256":"7ca13c0290b18e1f"}},{"arxiv_id":"1902.08153","arxiv_id_is_arxiv":true,"paper":"/paper/learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhutmost/lsq-net","path":"util/config.py","file_url":"https://github.com/zhutmost/lsq-net/blob/HEAD/util/config.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":"dcafab1705c6104a","code_sha256_prefix":"dcafab1705c6104a","mcp_get_code":{"code_sha256":"dcafab1705c6104a"}},{"arxiv_id":"1811.09245","arxiv_id_is_arxiv":true,"paper":"/paper/tganv2-efficient-training-of-large-models-for","title":"Train Sparsely, Generate Densely: Memory-efficient Unsupervised Training of High-resolution Temporal GAN","date":"2018-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/tgan2","path":"tgan2/datasets/motion_jpeg.py","file_url":"https://github.com/pfnet-research/tgan2/blob/HEAD/tgan2/datasets/motion_jpeg.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":"38401635d6be718f","code_sha256_prefix":"38401635d6be718f","mcp_get_code":{"code_sha256":"38401635d6be718f"}},{"arxiv_id":"1806.03146","arxiv_id_is_arxiv":true,"paper":"/paper/neural-message-passing-with-edge-updates-for","title":"Neural Message Passing with Edge Updates for Predicting Properties of Molecules and Materials","date":"2018-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toshi-k/kaggle-champs-scalar-coupling","path":"source/02_triplet_update/lib/log.py","file_url":"https://github.com/toshi-k/kaggle-champs-scalar-coupling/blob/HEAD/source/02_triplet_update/lib/log.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":"4190c7c69c0c7bcb","code_sha256_prefix":"4190c7c69c0c7bcb","mcp_get_code":{"code_sha256":"4190c7c69c0c7bcb"}},{"arxiv_id":"1806.03146","arxiv_id_is_arxiv":true,"paper":"/paper/neural-message-passing-with-edge-updates-for","title":"Neural Message Passing with Edge Updates for Predicting Properties of Molecules and Materials","date":"2018-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toshi-k/kaggle-trends-assessment-prediction","path":"source/02_edge_gnn/lib/log.py","file_url":"https://github.com/toshi-k/kaggle-trends-assessment-prediction/blob/HEAD/source/02_edge_gnn/lib/log.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":"0d5a312be60d852c","code_sha256_prefix":"0d5a312be60d852c","mcp_get_code":{"code_sha256":"0d5a312be60d852c"}},{"arxiv_id":"1611.06624","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-generative-adversarial-nets-with","title":"Temporal Generative Adversarial Nets with Singular Value Clipping","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/tgan","path":"make_ucf101.py","file_url":"https://github.com/pfnet-research/tgan/blob/HEAD/make_ucf101.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":"94cf68501cf6d38e","code_sha256_prefix":"94cf68501cf6d38e","mcp_get_code":{"code_sha256":"94cf68501cf6d38e"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengBinJin/U-Net-TensorFlow","path":"src/model.py","file_url":"https://github.com/ChengBinJin/U-Net-TensorFlow/blob/HEAD/src/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ChengBinJin/U-Net-TensorFlow when it was checked","code_sha256":"393e87cf76af0410","code_sha256_prefix":"393e87cf76af0410","mcp_get_code":{"code_sha256":"393e87cf76af0410"}},{"arxiv_id":"2022.findings-acl.190","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-acl.190","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"emorynlp/bert-2019","path":"bertsota/common/utils.py","file_url":"https://github.com/emorynlp/bert-2019/blob/HEAD/bertsota/common/utils.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":"85606c7530bde1b8","code_sha256_prefix":"85606c7530bde1b8","mcp_get_code":{"code_sha256":"85606c7530bde1b8"}},{"arxiv_id":"2021.findings-emnlp.386","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.386","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lbe0613/GCC","path":"utils/common.py","file_url":"https://github.com/lbe0613/GCC/blob/HEAD/utils/common.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":"2a3e61636ddbf35f","code_sha256_prefix":"2a3e61636ddbf35f","mcp_get_code":{"code_sha256":"2a3e61636ddbf35f"}}],"record_sha256":"09e5a59cd727d59c115594c591940d800ffcccc3481a8a152db1d15f21923b7d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}