{"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/safe-div","entry":"safe_div","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":29,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":24,"n_papers_ran_instrument_only":5,"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":26,"n_samples_ran":26,"n_samples_constructed":0,"n_samples_ran_checked":23,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":26,"n_places":32,"n_places_pointer_only":10,"n_places_pointer_only_link_open":2,"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":12,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":11,"unverified":0},"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":"2608.13711","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-13711","title":"TRUE-Colon: Exposing a Consistent Transfer Asymmetry in Real-Time Polyp Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"sdoerrich97/true-colon","path":"true_colon/_geometry.py","file_url":"https://github.com/sdoerrich97/true-colon/blob/HEAD/true_colon/_geometry.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sdoerrich97/true-colon (NOASSERTION)","code_sha256":"4b0c75892257414a","code_sha256_prefix":"4b0c75892257414a","mcp_get_code":{"code_sha256":"4b0c75892257414a"}},{"arxiv_id":"2606.29920","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29920","title":"Can LLM-as-a-Judge Reliably Verify Rubrics in Agentic Scenarios?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"THU-KEG/RuVerBench","path":"code/main_leaderboard/compute_main_leaderboard.py","file_url":"https://github.com/THU-KEG/RuVerBench/blob/HEAD/code/main_leaderboard/compute_main_leaderboard.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, THU-KEG/RuVerBench (NOASSERTION)","code_sha256":"ac5092c48c172431","code_sha256_prefix":"ac5092c48c172431","mcp_get_code":{"code_sha256":"ac5092c48c172431"}},{"arxiv_id":"2606.17506","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-17506","title":"Evaluating Second-Order Bias of LLMs Through Epistemic Entitlement","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"uofthcdslab/second-order-bias","path":"utils/scoring.py","file_url":"https://github.com/uofthcdslab/second-order-bias/blob/HEAD/utils/scoring.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09dd661bb8e1619e","code_sha256_prefix":"09dd661bb8e1619e","mcp_get_code":{"code_sha256":"09dd661bb8e1619e"}},{"arxiv_id":"2605.30415","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30415","title":"Domain Adaptation and Reasoning Frameworks in Language Models: A Controlled Experiment with Historical Cosmology","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fdeberna/chat-ptolemaic","path":"evaluation/summarize_eval.py","file_url":"https://github.com/fdeberna/chat-ptolemaic/blob/HEAD/evaluation/summarize_eval.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, fdeberna/chat-ptolemaic when it was checked","code_sha256":"83443ae8f887fd48","code_sha256_prefix":"83443ae8f887fd48","mcp_get_code":{"code_sha256":"83443ae8f887fd48"}},{"arxiv_id":"2605.30415","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30415","title":"Domain Adaptation and Reasoning Frameworks in Language Models: A Controlled Experiment with Historical Cosmology","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fdeberna/chat-ptolemaic","path":"evaluation/summarize_qwen_judgments.py","file_url":"https://github.com/fdeberna/chat-ptolemaic/blob/HEAD/evaluation/summarize_qwen_judgments.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, fdeberna/chat-ptolemaic when it was checked","code_sha256":"d161ea6d061fc352","code_sha256_prefix":"d161ea6d061fc352","mcp_get_code":{"code_sha256":"d161ea6d061fc352"}},{"arxiv_id":"2605.25924","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25924","title":"Does Continued Pretraining on a Learner Corpus Improve Automated Essay Scoring on English Proficiency Tests? Evidence from EFCAMDAT","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"tanloong/neosca","path":"src/neosca/ns_utils.py","file_url":"https://github.com/tanloong/neosca/blob/HEAD/src/neosca/ns_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, tanloong/neosca, is not in the permissive set Syntology serves inline","code_sha256":"e7469e71b8f7c59c","code_sha256_prefix":"e7469e71b8f7c59c","mcp_get_code":{"code_sha256":"e7469e71b8f7c59c"}},{"arxiv_id":"2605.25816","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25816","title":"Fine-Tuning Over Architectural Complexity: Broad-Coverage PII Detection on PIIBench with DeBERTa","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pritesh-2711/pii-bench","path":"run_streaming_model_benchmark.py","file_url":"https://github.com/pritesh-2711/pii-bench/blob/HEAD/run_streaming_model_benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"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 fdeberna/chat-ptolemaic, and GitHub detected no licence in that repository when it was checked","code_sha256":"d161ea6d061fc352","code_sha256_prefix":"d161ea6d061fc352","mcp_get_code":{"code_sha256":"d161ea6d061fc352"}},{"arxiv_id":"2604.22937","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22937","title":"AutoPyVerifier: Learning Compact Executable Verifiers for Large Language Model Outputs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"megagonlabs/AutoPyVerifier","path":"src/autopyverifier/search.py","file_url":"https://github.com/megagonlabs/AutoPyVerifier/blob/HEAD/src/autopyverifier/search.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"595c73a18c71d375","code_sha256_prefix":"595c73a18c71d375","mcp_get_code":{"code_sha256":"595c73a18c71d375"}},{"arxiv_id":"2604.20043","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20043","title":"TriEx: A Game-based Tri-View Framework for Explaining Internal Reasoning in Multi-Agent LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Einsam1819/TriEx","path":"experiments/exp1_rulebase/exp1_rulebase.py","file_url":"https://github.com/Einsam1819/TriEx/blob/HEAD/experiments/exp1_rulebase/exp1_rulebase.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2bba255a9e44ab2a","code_sha256_prefix":"2bba255a9e44ab2a","mcp_get_code":{"code_sha256":"2bba255a9e44ab2a"}},{"arxiv_id":"2604.20043","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20043","title":"TriEx: A Game-based Tri-View Framework for Explaining Internal Reasoning in Multi-Agent LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Einsam1819/TriEx","path":"experiments/exp2b_profiling/2B_analysis.py","file_url":"https://github.com/Einsam1819/TriEx/blob/HEAD/experiments/exp2b_profiling/2B_analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52e0ce4db065ae0b","code_sha256_prefix":"52e0ce4db065ae0b","mcp_get_code":{"code_sha256":"52e0ce4db065ae0b"}},{"arxiv_id":"2604.20043","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20043","title":"TriEx: A Game-based Tri-View Framework for Explaining Internal Reasoning in Multi-Agent LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Einsam1819/TriEx","path":"experiments/exp3b_window/3b_deepseek.py","file_url":"https://github.com/Einsam1819/TriEx/blob/HEAD/experiments/exp3b_window/3b_deepseek.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33077ae16f5751b8","code_sha256_prefix":"33077ae16f5751b8","mcp_get_code":{"code_sha256":"33077ae16f5751b8"}},{"arxiv_id":"2601.19430","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19430","title":"Unveiling Perceptual Artifacts: A Fine-Grained Benchmark for Interpretable AI-Generated Image Detection","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Coxy7/X-AIGD","path":"metrics/instance.py","file_url":"https://github.com/Coxy7/X-AIGD/blob/HEAD/metrics/instance.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d792e06e4d5a34e","code_sha256_prefix":"0d792e06e4d5a34e","mcp_get_code":{"code_sha256":"0d792e06e4d5a34e"}},{"arxiv_id":"2506.14087","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-finetuning-for-encoder-based-time","title":"Multi-Scale Finetuning for Encoder-based Time Series Foundation Models","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zqiao11/MSFT","path":"src/uni2ts/common/torch_util.py","file_url":"https://github.com/zqiao11/MSFT/blob/HEAD/src/uni2ts/common/torch_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zqiao11/MSFT (NOASSERTION)","code_sha256":"5ae38533a6777347","code_sha256_prefix":"5ae38533a6777347","mcp_get_code":{"code_sha256":"5ae38533a6777347"}},{"arxiv_id":"2410.12409","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-the-barriers-of-language-agents-in","title":"Revealing the Barriers of Language Agents in Planning","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsaest/Agent-Planning-Analysis","path":"code/captum/captum/_utils/common.py","file_url":"https://github.com/hsaest/Agent-Planning-Analysis/blob/HEAD/code/captum/captum/_utils/common.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, hsaest/Agent-Planning-Analysis when it was checked","code_sha256":"0e5cf30aeea28b18","code_sha256_prefix":"0e5cf30aeea28b18","mcp_get_code":{"code_sha256":"0e5cf30aeea28b18"}},{"arxiv_id":"2405.17211","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-refiner-fine-tuning-of-accurate","title":"Spectral-Refiner: Accurate Fine-Tuning of Spatiotemporal Fourier Neural Operator for Turbulent Flows","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scaomath/torch-cfd","path":"torch_cfd/advection.py","file_url":"https://github.com/scaomath/torch-cfd/blob/HEAD/torch_cfd/advection.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":"f23abec4f65ce479","code_sha256_prefix":"f23abec4f65ce479","mcp_get_code":{"code_sha256":"f23abec4f65ce479"}},{"arxiv_id":"2310.17256","arxiv_id_is_arxiv":true,"paper":"/paper/fairret-a-framework-for-differentiable","title":"fairret: a Framework for Differentiable Fairness Regularization Terms","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aida-ugent/fairret","path":"fairret/utils.py","file_url":"https://github.com/aida-ugent/fairret/blob/HEAD/fairret/utils.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":"185ae857514041a2","code_sha256_prefix":"185ae857514041a2","mcp_get_code":{"code_sha256":"185ae857514041a2"}},{"arxiv_id":"2306.16819","arxiv_id_is_arxiv":true,"paper":"/paper/graph-denoising-diffusion-for-inverse-protein","title":"Graph Denoising Diffusion for Inverse Protein Folding","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykiiiiii/GraDe_IF","path":"diffusion/model/egnn_pytorch/egnn_pytorch.py","file_url":"https://github.com/ykiiiiii/GraDe_IF/blob/HEAD/diffusion/model/egnn_pytorch/egnn_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d92b80051870e976","code_sha256_prefix":"d92b80051870e976","mcp_get_code":{"code_sha256":"d92b80051870e976"}},{"arxiv_id":"2304.11633","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-chatgpt-s-information-extraction","title":"Evaluating ChatGPT's Information Extraction Capabilities: An Assessment of Performance, Explainability, Calibration, and Faithfulness","date":"2023-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkuserc/chatgpt_for_ie","path":"Code/EAE/score_EAE_E+.py","file_url":"https://github.com/pkuserc/chatgpt_for_ie/blob/HEAD/Code/EAE/score_EAE_E%2B.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":"ac4edaf53cf349f7","code_sha256_prefix":"ac4edaf53cf349f7","mcp_get_code":{"code_sha256":"ac4edaf53cf349f7"}},{"arxiv_id":"2304.11327","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-feature-learning-1","title":"Understanding and Improving Feature Learning for Out-of-Distribution Generalization","date":"2023-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/captum","path":"captum/_utils/common.py","file_url":"https://github.com/pytorch/captum/blob/HEAD/captum/_utils/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from hsaest/Agent-Planning-Analysis, and GitHub detected no licence in that repository when it was checked","code_sha256":"0e5cf30aeea28b18","code_sha256_prefix":"0e5cf30aeea28b18","mcp_get_code":{"code_sha256":"0e5cf30aeea28b18"}},{"arxiv_id":"2211.17192","arxiv_id_is_arxiv":true,"paper":"/paper/fast-inference-from-transformers-via","title":"Fast Inference from Transformers via Speculative Decoding","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/speculative-decoding","path":"speculative_decoding/speculative_decoding.py","file_url":"https://github.com/lucidrains/speculative-decoding/blob/HEAD/speculative_decoding/speculative_decoding.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"806a4b61f4218c4b","code_sha256_prefix":"806a4b61f4218c4b","mcp_get_code":{"code_sha256":"806a4b61f4218c4b"}},{"arxiv_id":"2211.00593","arxiv_id_is_arxiv":true,"paper":"/paper/interpretability-in-the-wild-a-circuit-for","title":"Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/transformer-debugger","path":"neuron_explainer/models/transformer.py","file_url":"https://github.com/openai/transformer-debugger/blob/HEAD/neuron_explainer/models/transformer.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":"16add703a8e2471b","code_sha256_prefix":"16add703a8e2471b","mcp_get_code":{"code_sha256":"16add703a8e2471b"}},{"arxiv_id":"2210.12582","arxiv_id_is_arxiv":true,"paper":"/paper/language-model-pre-training-with-sparse","title":"Language Model Pre-Training with Sparse Latent Typing","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renll/sparselt","path":"evaluations/supervised-ie/scorer.py","file_url":"https://github.com/renll/sparselt/blob/HEAD/evaluations/supervised-ie/scorer.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":"ac4edaf53cf349f7","code_sha256_prefix":"ac4edaf53cf349f7","mcp_get_code":{"code_sha256":"ac4edaf53cf349f7"}},{"arxiv_id":"2203.14957","arxiv_id_is_arxiv":true,"paper":"/paper/frame-wise-action-representations-for-long","title":"Frame-wise Action Representations for Long Videos via Sequence Contrastive Learning","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minghchen/carl_code","path":"algos/scl.py","file_url":"https://github.com/minghchen/carl_code/blob/HEAD/algos/scl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"329c51463aaa95b9","code_sha256_prefix":"329c51463aaa95b9","mcp_get_code":{"code_sha256":"329c51463aaa95b9"}},{"arxiv_id":"2106.15838","arxiv_id_is_arxiv":true,"paper":"/paper/hyspa-hybrid-span-generation-for-scalable","title":"HySPA: Hybrid Span Generation for Scalable Text-to-Graph Extraction","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwadden/dygiepp","path":"dygie/training/f1.py","file_url":"https://github.com/dwadden/dygiepp/blob/HEAD/dygie/training/f1.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":"ac4edaf53cf349f7","code_sha256_prefix":"ac4edaf53cf349f7","mcp_get_code":{"code_sha256":"ac4edaf53cf349f7"}},{"arxiv_id":"2104.05919","arxiv_id_is_arxiv":true,"paper":"/paper/document-level-event-argument-extraction-by","title":"Document-Level Event Argument Extraction by Conditional Generation","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raspberryice/gen-arg","path":"src/genie/utils.py","file_url":"https://github.com/raspberryice/gen-arg/blob/HEAD/src/genie/utils.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":"ac4edaf53cf349f7","code_sha256_prefix":"ac4edaf53cf349f7","mcp_get_code":{"code_sha256":"ac4edaf53cf349f7"}},{"arxiv_id":"2102.09844","arxiv_id_is_arxiv":true,"paper":"/paper/e-n-equivariant-graph-neural-networks","title":"E(n) Equivariant Graph Neural Networks","date":"2021-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/egnn-pytorch","path":"egnn_pytorch/egnn_pytorch.py","file_url":"https://github.com/lucidrains/egnn-pytorch/blob/HEAD/egnn_pytorch/egnn_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d92b80051870e976","code_sha256_prefix":"d92b80051870e976","mcp_get_code":{"code_sha256":"d92b80051870e976"}},{"arxiv_id":"2010.12697","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-saturation-effects-in","title":"Investigating Saturation Effects in Integrated Gradients","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vivekmig/captum-1","path":"captum/_utils/common.py","file_url":"https://github.com/vivekmig/captum-1/blob/HEAD/captum/_utils/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ab3e82f6c1ff9ce","code_sha256_prefix":"4ab3e82f6c1ff9ce","mcp_get_code":{"code_sha256":"4ab3e82f6c1ff9ce"}},{"arxiv_id":"2004.12989","arxiv_id_is_arxiv":true,"paper":"/paper/corenet-coherent-3d-scene-reconstruction-from","title":"CoReNet: Coherent 3D scene reconstruction from a single RGB image","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/corenet","path":"src/corenet/misc_util.py","file_url":"https://github.com/google-research/corenet/blob/HEAD/src/corenet/misc_util.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":"b2b477cdb750bc2e","code_sha256_prefix":"b2b477cdb750bc2e","mcp_get_code":{"code_sha256":"b2b477cdb750bc2e"}},{"arxiv_id":"1905.07830","arxiv_id_is_arxiv":true,"paper":"/paper/hellaswag-can-a-machine-really-finish-your","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/text_characterization_toolkit","path":"text_characterization/utils.py","file_url":"https://github.com/facebookresearch/text_characterization_toolkit/blob/HEAD/text_characterization/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/text_characterization_toolkit, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"2fe1321cdb7f774d","code_sha256_prefix":"2fe1321cdb7f774d","mcp_get_code":{"code_sha256":"2fe1321cdb7f774d"}},{"arxiv_id":"1806.04067","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-mechanism-design-learning-to-promote","title":"Adaptive Mechanism Design: Learning to Promote Cooperation","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longtermrisk/marltoolbox","path":"marltoolbox/algos/alternating_offers/logging_utils.py","file_url":"https://github.com/longtermrisk/marltoolbox/blob/HEAD/marltoolbox/algos/alternating_offers/logging_utils.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":"acb5dbef1523670c","code_sha256_prefix":"acb5dbef1523670c","mcp_get_code":{"code_sha256":"acb5dbef1523670c"}},{"arxiv_id":"openreview_OdrEcfMogy","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_OdrEcfMogy","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YuanGao-YG/OneForecast","path":"my_utils/darcy_loss.py","file_url":"https://github.com/YuanGao-YG/OneForecast/blob/HEAD/my_utils/darcy_loss.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":"a37fc73546fd330f","code_sha256_prefix":"a37fc73546fd330f","mcp_get_code":{"code_sha256":"a37fc73546fd330f"}},{"arxiv_id":"ijcai2024_0687","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0687","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zjunlp/FactCHD","path":"evaluate/metrics_plus.py","file_url":"https://github.com/zjunlp/FactCHD/blob/HEAD/evaluate/metrics_plus.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":"ca7c2787eb27a6d7","code_sha256_prefix":"ca7c2787eb27a6d7","mcp_get_code":{"code_sha256":"ca7c2787eb27a6d7"}}],"record_sha256":"05c6a21d3600f7d5c638409c99cc018db47d84cfbe15c7b4586eae0b597e23de","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}