{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/main","entry":"main","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":235,"n_papers_ran":14,"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":282,"n_samples_ran":14,"n_samples_fingerprinted":0,"n_places":293,"n_places_pointer_only":124,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":12,"unverified":268},"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":"2609.14872","paper":"/paper/arxiv-2609-14872","title":"AgentKV: Phase-Aware KV Eviction for Agentic LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"LiuTaowen-Tony/agentkv","path":"experiment/runners/bfcl.py","file_url":"https://github.com/LiuTaowen-Tony/agentkv/blob/HEAD/experiment/runners/bfcl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8c62fac91d309ed8","mcp_get_code":{"code_sha256":"8c62fac91d309ed8"}},{"arxiv_id":"2609.14872","paper":"/paper/arxiv-2609-14872","title":"AgentKV: Phase-Aware KV Eviction for Agentic LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"LiuTaowen-Tony/agentkv","path":"experiment/runners/tau2.py","file_url":"https://github.com/LiuTaowen-Tony/agentkv/blob/HEAD/experiment/runners/tau2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9e4112999274379f","mcp_get_code":{"code_sha256":"9e4112999274379f"}},{"arxiv_id":"2609.01839","paper":"/paper/arxiv-2609-01839","title":"Import What You Need: Learning When and How to Augment EHR Graphs with External Knowledge","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"ChenC2002/ReTA","path":"reta/knowledge/release.py","file_url":"https://github.com/ChenC2002/ReTA/blob/HEAD/reta/knowledge/release.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0b64df57e6173100","mcp_get_code":{"code_sha256":"0b64df57e6173100"}},{"arxiv_id":"2608.25419","paper":"/paper/arxiv-2608-25419","title":"BVR Sim: An Open and High-Throughput Environment for Heterogeneous Air-Combat Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lizi-Margin/bvr_sim","path":"bvr_sim_rl/ppo.py","file_url":"https://github.com/lizi-Margin/bvr_sim/blob/HEAD/bvr_sim_rl/ppo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"28689982c3c87971","mcp_get_code":{"code_sha256":"28689982c3c87971"}},{"arxiv_id":"2608.21365","paper":"/paper/arxiv-2608-21365","title":"KSE-Web: An Analysis of Hybrid Retrieval and LLM-Assisted Query Expansion for Low-Resource Khmer Semantic Search","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"back-kh/Khmer-Semantic-Search","path":"codes/evaluate_retrieval.py","file_url":"https://github.com/back-kh/Khmer-Semantic-Search/blob/HEAD/codes/evaluate_retrieval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b84f26eda680ba83","mcp_get_code":{"code_sha256":"b84f26eda680ba83"}},{"arxiv_id":"2608.15286","paper":"/paper/arxiv-2608-15286","title":"No Task Fails Every Time: Why One-Shot Audits Are Structurally Blind to Agent Damage","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"shivenkk/agentrelbench","path":"src/agentrelbench/inner_runner.py","file_url":"https://github.com/shivenkk/agentrelbench/blob/HEAD/src/agentrelbench/inner_runner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b401e33d37927494","mcp_get_code":{"code_sha256":"b401e33d37927494"}},{"arxiv_id":"2608.06477","paper":"/paper/arxiv-2608-06477","title":"StepJack: Benchmarking Computer-Use Agent Safety Against Multi-Step Indirect Prompt Injection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"BorealisAI/StepJack","path":"auto_decomp/iterative_refinement.py","file_url":"https://github.com/BorealisAI/StepJack/blob/HEAD/auto_decomp/iterative_refinement.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"cc25050cda173203","mcp_get_code":{"code_sha256":"cc25050cda173203"}},{"arxiv_id":"2608.00979","paper":"/paper/arxiv-2608-00979","title":"Passing Coarse Marginal Checks Can Be Cheap: Persona Mixtures and Imprecise Treatment-Response Estimates in an LLM Persona Panel","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"yoheinakajima/synthetic-players","path":"artifacts/api-server/engine/freeze_lint.py","file_url":"https://github.com/yoheinakajima/synthetic-players/blob/HEAD/artifacts/api-server/engine/freeze_lint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"ddd3209334fa1bad","mcp_get_code":{"code_sha256":"ddd3209334fa1bad"}},{"arxiv_id":"2607.28434","paper":"/paper/arxiv-2607-28434","title":"Metaphor Tracer: A Theory-Informed Analysis of Hidden States","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"HermeneuticAI/MetaphorTracer","path":"structural_attractor_scanV2.py","file_url":"https://github.com/HermeneuticAI/MetaphorTracer/blob/HEAD/structural_attractor_scanV2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1d187e5adf3abcce","mcp_get_code":{"code_sha256":"1d187e5adf3abcce"}},{"arxiv_id":"2607.26643","paper":"/paper/arxiv-2607-26643","title":"Rethinking Self-Evolution: A Constrained Exploration-Exploitation Process for Mitigating Skill Overfitting","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"HQ-Lin/SkillBoost","path":"src/skillboost/evolve.py","file_url":"https://github.com/HQ-Lin/SkillBoost/blob/HEAD/src/skillboost/evolve.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff93879d3f1270a5","mcp_get_code":{"code_sha256":"ff93879d3f1270a5"}},{"arxiv_id":"2607.25765","paper":"/paper/arxiv-2607-25765","title":"WorkSurface-Bench: Benchmarking Enterprise Agents on Multi-Surface Knowledge Routing","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"haolpku/WorkSurface-Bench","path":"worksurface/derive_tasks.py","file_url":"https://github.com/haolpku/WorkSurface-Bench/blob/HEAD/worksurface/derive_tasks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"662806b1db61b796","mcp_get_code":{"code_sha256":"662806b1db61b796"}},{"arxiv_id":"2607.23519","paper":"/paper/arxiv-2607-23519","title":"Auditing Alignment Controllability in LLMs via Political Axes","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"mbrcic/llm-political-steerability","path":"ingestion/01_collect/bundle_compound_pilot_raw.py","file_url":"https://github.com/mbrcic/llm-political-steerability/blob/HEAD/ingestion/01_collect/bundle_compound_pilot_raw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f00153f9d94c3f2","mcp_get_code":{"code_sha256":"3f00153f9d94c3f2"}},{"arxiv_id":"2607.23519","paper":"/paper/arxiv-2607-23519","title":"Auditing Alignment Controllability in LLMs via Political Axes","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"mbrcic/llm-political-steerability","path":"ingestion/01_collect/bundle_compound_pilot_scty_raw.py","file_url":"https://github.com/mbrcic/llm-political-steerability/blob/HEAD/ingestion/01_collect/bundle_compound_pilot_scty_raw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bec89bcd5c26b16a","mcp_get_code":{"code_sha256":"bec89bcd5c26b16a"}},{"arxiv_id":"2607.21885","paper":"/paper/arxiv-2607-21885","title":"Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"vasile-paskardlgm/ACE","path":"refined_projector.py","file_url":"https://github.com/vasile-paskardlgm/ACE/blob/HEAD/refined_projector.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fae6ee332c2fa1b7","mcp_get_code":{"code_sha256":"fae6ee332c2fa1b7"}},{"arxiv_id":"2607.17653","paper":"/paper/arxiv-2607-17653","title":"LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"iamjingli/LFM","path":"train_target.py","file_url":"https://github.com/iamjingli/LFM/blob/HEAD/train_target.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51b1a343a1c5c316","mcp_get_code":{"code_sha256":"51b1a343a1c5c316"}},{"arxiv_id":"2607.16268","paper":"/paper/arxiv-2607-16268","title":"PsiLogic: Chaos-Aware Active Cancellation for Adam with a Fair Cross-Domain Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Troxter222/psilogic","path":"benchmark_nlp_5000_psilogic.py","file_url":"https://github.com/Troxter222/psilogic/blob/HEAD/benchmark_nlp_5000_psilogic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4055d49d30e44912","mcp_get_code":{"code_sha256":"4055d49d30e44912"}},{"arxiv_id":"2607.16228","paper":"/paper/arxiv-2607-16228","title":"Operator-Aware Mixed-Precision Tolerance Calibration for Tensor Kernels","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"sarkar-dipankar/gpuemu-corpus","path":"analysis/p2_calibrate.py","file_url":"https://github.com/sarkar-dipankar/gpuemu-corpus/blob/HEAD/analysis/p2_calibrate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a474017039931f46","mcp_get_code":{"code_sha256":"a474017039931f46"}},{"arxiv_id":"2607.10569","paper":"/paper/arxiv-2607-10569","title":"When Does Restricting a Coding Agent to execute_code Help? A Regime × Agent-Design Ablation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"hyang0129/onlycodes","path":"paper/lint.py","file_url":"https://github.com/hyang0129/onlycodes/blob/HEAD/paper/lint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19cc996c6da2baf9","mcp_get_code":{"code_sha256":"19cc996c6da2baf9"}},{"arxiv_id":"2607.10569","paper":"/paper/arxiv-2607-10569","title":"When Does Restricting a Coding Agent to execute_code Help? A Regime × Agent-Design Ablation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"hyang0129/onlycodes","path":"swebench/_artifact_grade_runner.py","file_url":"https://github.com/hyang0129/onlycodes/blob/HEAD/swebench/_artifact_grade_runner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9c3a8620e1fa9c13","mcp_get_code":{"code_sha256":"9c3a8620e1fa9c13"}},{"arxiv_id":"2607.03381","paper":"/paper/arxiv-2607-03381","title":"Large-scale dataset of automatically classified rhetorical sections in scientific papers","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"daniel-verdi/section-splitter","path":"section_classifier.py","file_url":"https://github.com/daniel-verdi/section-splitter/blob/HEAD/section_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"da7bfb7eb2774dd8","mcp_get_code":{"code_sha256":"da7bfb7eb2774dd8"}},{"arxiv_id":"2606.30560","paper":"/paper/arxiv-2606-30560","title":"TraceLab: Characterizing Coding Agent Workloads for LLM Serving","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"uw-syfi/TraceLab","path":"artifacts/utils/png_sidecar.py","file_url":"https://github.com/uw-syfi/TraceLab/blob/HEAD/artifacts/utils/png_sidecar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9751953fbd7bb868","mcp_get_code":{"code_sha256":"9751953fbd7bb868"}},{"arxiv_id":"2606.29493","paper":"/paper/arxiv-2606-29493","title":"Faults in Our Formal Benchmarking: Dataset Defects and Evaluation Failures in Lean Theorem Proving","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"leanprover/lean4","path":"script/gen_constants_cpp.py","file_url":"https://github.com/leanprover/lean4/blob/HEAD/script/gen_constants_cpp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"687def3c02ea528c","mcp_get_code":{"code_sha256":"687def3c02ea528c"}},{"arxiv_id":"2606.29493","paper":"/paper/arxiv-2606-29493","title":"Faults in Our Formal Benchmarking: Dataset Defects and Evaluation Failures in Lean Theorem Proving","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"leanprover/lean4","path":"script/gen_tokens_cpp.py","file_url":"https://github.com/leanprover/lean4/blob/HEAD/script/gen_tokens_cpp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"193ca90e21e7f2eb","mcp_get_code":{"code_sha256":"193ca90e21e7f2eb"}},{"arxiv_id":"2606.26071","paper":"/paper/arxiv-2606-26071","title":"Model Forensics: Investigating Whether Concerning Behavior Reflects Misalignment","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"gkroiz/agent-interp-envs","path":"environments/code_summary_honesty/run_eval.py","file_url":"https://github.com/gkroiz/agent-interp-envs/blob/HEAD/environments/code_summary_honesty/run_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1cc1526945db6851","mcp_get_code":{"code_sha256":"1cc1526945db6851"}},{"arxiv_id":"2606.08414","paper":"/paper/arxiv-2606-08414","title":"PACT: Self-Evolving Physical Safety Alignment for Diffusion Policies in Embodied Manipulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"robotwin-Platform/RoboTwin","path":"code_gen/task_generation.py","file_url":"https://github.com/robotwin-Platform/RoboTwin/blob/HEAD/code_gen/task_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39b0deb7b86b112d","mcp_get_code":{"code_sha256":"39b0deb7b86b112d"}},{"arxiv_id":"2606.08414","paper":"/paper/arxiv-2606-08414","title":"PACT: Self-Evolving Physical Safety Alignment for Diffusion Policies in Embodied Manipulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"robotwin-Platform/RoboTwin","path":"code_gen/task_generation_mm.py","file_url":"https://github.com/robotwin-Platform/RoboTwin/blob/HEAD/code_gen/task_generation_mm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0712e9a6f1819e1d","mcp_get_code":{"code_sha256":"0712e9a6f1819e1d"}},{"arxiv_id":"2606.08414","paper":"/paper/arxiv-2606-08414","title":"PACT: Self-Evolving Physical Safety Alignment for Diffusion Policies in Embodied Manipulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"robotwin-Platform/RoboTwin","path":"code_gen/task_generation_simple.py","file_url":"https://github.com/robotwin-Platform/RoboTwin/blob/HEAD/code_gen/task_generation_simple.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab268ff8e80c132c","mcp_get_code":{"code_sha256":"ab268ff8e80c132c"}},{"arxiv_id":"2606.05859","paper":"/paper/arxiv-2606-05859","title":"TARPO: Token-Wise Latent-Explicit Reasoning via Action-Routing Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"unslothai/unsloth","path":"docker/unsloth_nb_content_sig.py","file_url":"https://github.com/unslothai/unsloth/blob/HEAD/docker/unsloth_nb_content_sig.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6b380b9c888dc9d8","mcp_get_code":{"code_sha256":"6b380b9c888dc9d8"}},{"arxiv_id":"2606.05859","paper":"/paper/arxiv-2606-05859","title":"TARPO: Token-Wise Latent-Explicit Reasoning via Action-Routing Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"unslothai/unsloth","path":"docker/unsloth_nb_strip_colab.py","file_url":"https://github.com/unslothai/unsloth/blob/HEAD/docker/unsloth_nb_strip_colab.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"97ce574c0c7a8f63","mcp_get_code":{"code_sha256":"97ce574c0c7a8f63"}},{"arxiv_id":"2606.03940","paper":"/paper/arxiv-2606-03940","title":"SEAOTTER: Sensor Embedded Autoencoding with One-Time Transcode for Efficient Reconstruction","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"UT-SysML/seaotter","path":"src/seaotter/eval/encode_complexity.py","file_url":"https://github.com/UT-SysML/seaotter/blob/HEAD/src/seaotter/eval/encode_complexity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cca8f4086ee700d3","mcp_get_code":{"code_sha256":"cca8f4086ee700d3"}},{"arxiv_id":"2606.03919","paper":"/paper/arxiv-2606-03919","title":"Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-diffusion","path":"pipeline/sub117_compare.py","file_url":"https://github.com/wazaahhh/breakthroughs-diffusion/blob/HEAD/pipeline/sub117_compare.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1033bdf6627a64dd","mcp_get_code":{"code_sha256":"1033bdf6627a64dd"}},{"arxiv_id":"2606.03919","paper":"/paper/arxiv-2606-03919","title":"Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-diffusion","path":"pipeline/index_snapshot.py","file_url":"https://github.com/wazaahhh/breakthroughs-diffusion/blob/HEAD/pipeline/index_snapshot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"4a813ada24e52bdc","mcp_get_code":{"code_sha256":"4a813ada24e52bdc"}},{"arxiv_id":"2606.03919","paper":"/paper/arxiv-2606-03919","title":"Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-diffusion","path":"pipeline/run_subdomain.py","file_url":"https://github.com/wazaahhh/breakthroughs-diffusion/blob/HEAD/pipeline/run_subdomain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"78be75c1b1451a79","mcp_get_code":{"code_sha256":"78be75c1b1451a79"}},{"arxiv_id":"2606.03919","paper":"/paper/arxiv-2606-03919","title":"Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-diffusion","path":"pipeline/sub71_compare.py","file_url":"https://github.com/wazaahhh/breakthroughs-diffusion/blob/HEAD/pipeline/sub71_compare.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"d9d1e65c3f28a160","mcp_get_code":{"code_sha256":"d9d1e65c3f28a160"}},{"arxiv_id":"2606.03864","paper":"/paper/arxiv-2606-03864","title":"Explainable Forecasting of Scientific Breakthroughs from Concept Network Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-forecasting","path":"pipeline/sub117_compare.py","file_url":"https://github.com/wazaahhh/breakthroughs-forecasting/blob/HEAD/pipeline/sub117_compare.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1033bdf6627a64dd","mcp_get_code":{"code_sha256":"1033bdf6627a64dd"}},{"arxiv_id":"2606.03864","paper":"/paper/arxiv-2606-03864","title":"Explainable Forecasting of Scientific Breakthroughs from Concept Network Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-forecasting","path":"pipeline/index_snapshot.py","file_url":"https://github.com/wazaahhh/breakthroughs-forecasting/blob/HEAD/pipeline/index_snapshot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a813ada24e52bdc","mcp_get_code":{"code_sha256":"4a813ada24e52bdc"}},{"arxiv_id":"2606.03864","paper":"/paper/arxiv-2606-03864","title":"Explainable Forecasting of Scientific Breakthroughs from Concept Network Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wazaahhh/breakthroughs-forecasting","path":"pipeline/run_subdomain.py","file_url":"https://github.com/wazaahhh/breakthroughs-forecasting/blob/HEAD/pipeline/run_subdomain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78be75c1b1451a79","mcp_get_code":{"code_sha256":"78be75c1b1451a79"}},{"arxiv_id":"2606.02134","paper":"/paper/arxiv-2606-02134","title":"Rethinking Evaluation Paradigms in IBP-based Certified Training","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ADA-research/CTRAIN","path":"CTRAIN/install_git_dependencies.py","file_url":"https://github.com/ADA-research/CTRAIN/blob/HEAD/CTRAIN/install_git_dependencies.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0fc1a98116d544e4","mcp_get_code":{"code_sha256":"0fc1a98116d544e4"}},{"arxiv_id":"2606.00579","paper":"/paper/arxiv-2606-00579","title":"Sandboxed Coding Agents are Competitive Omni-modal Task Solvers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Dongping-Chen/OmniCoding","path":"src/omnicoding/rl/run_trajectory.py","file_url":"https://github.com/Dongping-Chen/OmniCoding/blob/HEAD/src/omnicoding/rl/run_trajectory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"90c11597a7c38f09","mcp_get_code":{"code_sha256":"90c11597a7c38f09"}},{"arxiv_id":"2605.28222","paper":"/paper/arxiv-2605-28222","title":"Analyzing Quality-Latency-Resource Trade-offs in a Technical Documentation RAG Assistant Using LoRA Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"EugPal/rag-lora-tradeoffs","path":"src/data_pipeline/build_kubernetes_qa_dataset.py","file_url":"https://github.com/EugPal/rag-lora-tradeoffs/blob/HEAD/src/data_pipeline/build_kubernetes_qa_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db5a7fb870b0bea9","mcp_get_code":{"code_sha256":"db5a7fb870b0bea9"}},{"arxiv_id":"2605.25750","paper":"/paper/arxiv-2605-25750","title":"Invariant-Based Weight Sharing for Message Passing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fseiffarth/SimpleGNN","path":"src/simplegnn/utils/lrgb_splits.py","file_url":"https://github.com/fseiffarth/SimpleGNN/blob/HEAD/src/simplegnn/utils/lrgb_splits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7ec64e6104befe90","mcp_get_code":{"code_sha256":"7ec64e6104befe90"}},{"arxiv_id":"2605.21404","paper":"/paper/arxiv-2605-21404","title":"What Twelve LLM Agent Benchmark Papers Disclose About Themselves: A Pilot Audit and an Open Scoring Schema","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mahdinaser/reprobe-audit","path":"score_corpus.py","file_url":"https://github.com/mahdinaser/reprobe-audit/blob/HEAD/score_corpus.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2361a1729fd5ac46","mcp_get_code":{"code_sha256":"2361a1729fd5ac46"}},{"arxiv_id":"2605.17932","paper":"/paper/arxiv-2605-17932","title":"Prompt Compression for Diffusion Large Language Models: An Empirical Evaluation of LLMLingua-2 and LLaDA","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"axxx129-ops/DLLM-Compression","path":"evaluation/check_exact_match.py","file_url":"https://github.com/axxx129-ops/DLLM-Compression/blob/HEAD/evaluation/check_exact_match.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c67ec6398e695ef0","mcp_get_code":{"code_sha256":"c67ec6398e695ef0"}},{"arxiv_id":"2605.08517","paper":"/paper/arxiv-2605-08517","title":"A Deep Risk Estimator for Known Operator Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"akmaier/KnownOperatorCT","path":"src/fc_ko_sample_efficiency.py","file_url":"https://github.com/akmaier/KnownOperatorCT/blob/HEAD/src/fc_ko_sample_efficiency.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e43fdee48655eb5","mcp_get_code":{"code_sha256":"5e43fdee48655eb5"}},{"arxiv_id":"2605.07177","paper":"/paper/arxiv-2605-07177","title":"HyperEyes: Dual-Grained Efficiency-Aware Reinforcement Learning for Parallel Multimodal Search Agents","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DeepExperience/HyperEyes","path":"RL/relax-hypereyes/Relax/.pre-commit-hooks/check_conflict_markers.py","file_url":"https://github.com/DeepExperience/HyperEyes/blob/HEAD/RL/relax-hypereyes/Relax/.pre-commit-hooks/check_conflict_markers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c25120c9239a61ab","mcp_get_code":{"code_sha256":"c25120c9239a61ab"}},{"arxiv_id":"2605.00538","paper":"/paper/arxiv-2605-00538","title":"Vesselpose: Vessel Graph Reconstruction from Learned Voxel-wise Direction Vectors in 3D Vascular Images","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Kainmueller-Lab/Vesselpose","path":"vector/vector_generation.py","file_url":"https://github.com/Kainmueller-Lab/Vesselpose/blob/HEAD/vector/vector_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14d2110d81843986","mcp_get_code":{"code_sha256":"14d2110d81843986"}},{"arxiv_id":"2604.17396","paper":"/paper/arxiv-2604-17396","title":"Representation-Guided Parameter-Efficient LLM Unlearning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"sustech-nlp/ReGLU","path":"src/reglu/validation.py","file_url":"https://github.com/sustech-nlp/ReGLU/blob/HEAD/src/reglu/validation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1045e5778dc8f70b","mcp_get_code":{"code_sha256":"1045e5778dc8f70b"}},{"arxiv_id":"2603.27303","paper":"/paper/arxiv-2603-27303","title":"Self-evolving AI agents for protein discovery and directed evolution","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ai4protein/VenusFactory2","path":"install.py","file_url":"https://github.com/ai4protein/VenusFactory2/blob/HEAD/install.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"20079f2e4d7b2523","mcp_get_code":{"code_sha256":"20079f2e4d7b2523"}},{"arxiv_id":"2603.25981","paper":"/paper/arxiv-2603-25981","title":"Policy-Guided World Model Planning for Language-Conditioned Visual Navigation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AmirhoseinCh/PiJEPA","path":"jepa_wms/app/scaffold.py","file_url":"https://github.com/AmirhoseinCh/PiJEPA/blob/HEAD/jepa_wms/app/scaffold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2004d0e6ae873f2e","mcp_get_code":{"code_sha256":"2004d0e6ae873f2e"}},{"arxiv_id":"2603.12478","paper":"/paper/arxiv-2603-12478","title":"Less Data, Faster Convergence: Goal-Driven Data Optimization for Multimodal Instruction Tuning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"rujiewu/GDO","path":"gdo/extract_six_metrics.py","file_url":"https://github.com/rujiewu/GDO/blob/HEAD/gdo/extract_six_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3968b3aa5d9e95e8","mcp_get_code":{"code_sha256":"3968b3aa5d9e95e8"}},{"arxiv_id":"2603.10876","paper":"/paper/arxiv-2603-10876","title":"An Extreme Multi-label Text Classification (XMTC) Library Dataset: What if we took \"Use of Practical AI in Digital Libraries\" seriously?","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"sciknoworg/tib-sid","path":"library-records-dataset/data-analysis/analysis3/gnd_embed_and_polysemy.py","file_url":"https://github.com/sciknoworg/tib-sid/blob/HEAD/library-records-dataset/data-analysis/analysis3/gnd_embed_and_polysemy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"3549bc73614fe724","mcp_get_code":{"code_sha256":"3549bc73614fe724"}},{"arxiv_id":"2602.07098","paper":"/paper/arxiv-2602-07098","title":"BayesFlow 2: Multi-Backend Amortized Bayesian Inference in Python","date":"2026-02-06","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"bayesflow-org/bf2-paper-case-study","path":"case-study.py","file_url":"https://github.com/bayesflow-org/bf2-paper-case-study/blob/HEAD/case-study.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7bb03261008ef54e","mcp_get_code":{"code_sha256":"7bb03261008ef54e"}},{"arxiv_id":"2602.03411","paper":"/paper/arxiv-2602-03411","title":"SWE-Master: Unleashing the Potential of Software Engineering Agents via Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RUCAIBox/SWE-Master","path":"R2E-Gym/SWE-smith/swesmith/bug_gen/get_cost.py","file_url":"https://github.com/RUCAIBox/SWE-Master/blob/HEAD/R2E-Gym/SWE-smith/swesmith/bug_gen/get_cost.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"241ab2afb5b092fe","mcp_get_code":{"code_sha256":"241ab2afb5b092fe"}},{"arxiv_id":"2602.02495","paper":"/paper/arxiv-2602-02495","title":"Reward-free Alignment for Conflicting Objectives","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"PeterLauLukChen/RACO","path":"eval/new_score.py","file_url":"https://github.com/PeterLauLukChen/RACO/blob/HEAD/eval/new_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9072e64887215a81","mcp_get_code":{"code_sha256":"9072e64887215a81"}},{"arxiv_id":"2602.02495","paper":"/paper/arxiv-2602-02495","title":"Reward-free Alignment for Conflicting Objectives","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"PeterLauLukChen/RACO","path":"eval/new_score_beaver.py","file_url":"https://github.com/PeterLauLukChen/RACO/blob/HEAD/eval/new_score_beaver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"78304958ed3d9382","mcp_get_code":{"code_sha256":"78304958ed3d9382"}},{"arxiv_id":"2602.02495","paper":"/paper/arxiv-2602-02495","title":"Reward-free Alignment for Conflicting Objectives","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"PeterLauLukChen/RACO","path":"eval/vllm_generate_and_score.py","file_url":"https://github.com/PeterLauLukChen/RACO/blob/HEAD/eval/vllm_generate_and_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0591481280db58e2","mcp_get_code":{"code_sha256":"0591481280db58e2"}},{"arxiv_id":"2602.00104","paper":"/paper/arxiv-2602-00104","title":"R3G: A Reasoning-Retrieval-Reranking Framework for Vision-Centric Answer Generation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"czh24/R3G","path":"src/pipeline.py","file_url":"https://github.com/czh24/R3G/blob/HEAD/src/pipeline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"288113dc9b24b8e9","mcp_get_code":{"code_sha256":"288113dc9b24b8e9"}},{"arxiv_id":"2601.20336","paper":"/paper/arxiv-2601-20336","title":"Are Whitepaper Claims Reflected in Market Structure? A Contamination-Aware Pipeline and a Power-Limited Null","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"studiofarzulla/whitepaper-claims","path":"src/alignment/matched_dimension_analysis.py","file_url":"https://github.com/studiofarzulla/whitepaper-claims/blob/HEAD/src/alignment/matched_dimension_analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"ac707b13d276c29b","mcp_get_code":{"code_sha256":"ac707b13d276c29b"}},{"arxiv_id":"2601.20104","paper":"/paper/arxiv-2601-20104","title":"NucFuseRank: Dataset Fusion and Performance Ranking for Nuclei Instance Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"masih4/NucleiAnalysis","path":"datasets_stats.py","file_url":"https://github.com/masih4/NucleiAnalysis/blob/HEAD/datasets_stats.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28a2dcba7477caee","mcp_get_code":{"code_sha256":"28a2dcba7477caee"}},{"arxiv_id":"2601.16629","paper":"/paper/arxiv-2601-16629","title":"Typologically Informed Parameter Aggregation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"stefaccou/TIPA","path":"1_tipa_adapters.py","file_url":"https://github.com/stefaccou/TIPA/blob/HEAD/1_tipa_adapters.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"938ce6ad1ec1e4d3","mcp_get_code":{"code_sha256":"938ce6ad1ec1e4d3"}},{"arxiv_id":"2601.06519","paper":"/paper/arxiv-2601-06519","title":"MedRAGChecker: Claim-Level Verification for Biomedical Retrieval-Augmented Generation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JoyDajunSpaceCraft/MedicalRagChecker","path":"DistillChecker/train_checker_grpo.py","file_url":"https://github.com/JoyDajunSpaceCraft/MedicalRagChecker/blob/HEAD/DistillChecker/train_checker_grpo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c31a4f29f9c5f375","mcp_get_code":{"code_sha256":"c31a4f29f9c5f375"}},{"arxiv_id":"2601.04185","paper":"/paper/arxiv-2601-04185","title":"ImLoc: Revisiting Visual Localization with Image-based Representation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"cvg/Hierarchical-Localization","path":"hloc/extract_features.py","file_url":"https://github.com/cvg/Hierarchical-Localization/blob/HEAD/hloc/extract_features.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"18761bb93ffb8441","mcp_get_code":{"code_sha256":"18761bb93ffb8441"}},{"arxiv_id":"2601.02906","paper":"/paper/arxiv-2601-02906","title":"Linear Script Representations in Speech Foundation Models Enable Zero-Shot Transliteration","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"unicode-org/icu","path":"icu4c/source/python/icutools/databuilder/__main__.py","file_url":"https://github.com/unicode-org/icu/blob/HEAD/icu4c/source/python/icutools/databuilder/__main__.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"264544e3e0f52aae","mcp_get_code":{"code_sha256":"264544e3e0f52aae"}},{"arxiv_id":"2512.14395","paper":"/paper/arxiv-2512-14395","title":"Massive Editing for Large Language Models Based on Dynamic Weight Generation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"RodeWayne/MeG-for-Knowledge-Editing","path":"merge_results.py","file_url":"https://github.com/RodeWayne/MeG-for-Knowledge-Editing/blob/HEAD/merge_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5a29951e70ee65e","mcp_get_code":{"code_sha256":"a5a29951e70ee65e"}},{"arxiv_id":"2512.05119","paper":"/paper/arxiv-2512-05119","title":"RAG-IGBench: Innovative Evaluation for RAG-based Interleaved Generation in Open-domain Question Answering","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"USTC-StarTeam/RAG-IGBench","path":"download_images.py","file_url":"https://github.com/USTC-StarTeam/RAG-IGBench/blob/HEAD/download_images.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"422100d6c65e4729","mcp_get_code":{"code_sha256":"422100d6c65e4729"}},{"arxiv_id":"2511.04934","paper":"/paper/arxiv-2511-04934","title":"Leak@k: Unlearning Does Not Make LLMs Forget Under Probabilistic Decoding","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"OptimAI-Lab/Leak-k","path":"MUSE/RULE/training_muse/baselines/RULE.py","file_url":"https://github.com/OptimAI-Lab/Leak-k/blob/HEAD/MUSE/RULE/training_muse/baselines/RULE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7cc7e7d9fb61ea51","mcp_get_code":{"code_sha256":"7cc7e7d9fb61ea51"}},{"arxiv_id":"2510.21300","paper":"/paper/arxiv-2510-21300","title":"Amortized Variational Inference for Partial-Label Learning: A Probabilistic Approach to Label Disambiguation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"mathefuchs/vi-pll","path":"vi_results.py","file_url":"https://github.com/mathefuchs/vi-pll/blob/HEAD/vi_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"005695f982f5e386","mcp_get_code":{"code_sha256":"005695f982f5e386"}},{"arxiv_id":"2510.03276","paper":"/paper/arxiv-2510-03276","title":"QuadEnhancer: Leveraging Quadratic Transformations to Enhance Deep Neural Networks","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"chitar/QuadEnhancer","path":"LLM-finetuning/commonsense_evaluate.py","file_url":"https://github.com/chitar/QuadEnhancer/blob/HEAD/LLM-finetuning/commonsense_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"415f46d8a341e28d","mcp_get_code":{"code_sha256":"415f46d8a341e28d"}},{"arxiv_id":"2510.03276","paper":"/paper/arxiv-2510-03276","title":"QuadEnhancer: Leveraging Quadratic Transformations to Enhance Deep Neural Networks","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"chitar/QuadEnhancer","path":"LLM-finetuning/evaluate.py","file_url":"https://github.com/chitar/QuadEnhancer/blob/HEAD/LLM-finetuning/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3398969fc7af6ff7","mcp_get_code":{"code_sha256":"3398969fc7af6ff7"}},{"arxiv_id":"2510.00549","paper":"/paper/arxiv-2510-00549","title":"EMR-AGENT: Automating Cohort and Feature Extraction from EMR Databases","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"AITRICS/EMR-AGENT","path":"EMR-Agent/featureMap_evaluation.py","file_url":"https://github.com/AITRICS/EMR-AGENT/blob/HEAD/EMR-Agent/featureMap_evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c358139bc207e774","mcp_get_code":{"code_sha256":"c358139bc207e774"}},{"arxiv_id":"2509.25729","paper":"/paper/arxiv-2509-25729","title":"Controlled Generation for Private Synthetic Text","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zzhao71/Controlled-Generation-for-Private-Synthetic-Text","path":"run_experiments.py","file_url":"https://github.com/zzhao71/Controlled-Generation-for-Private-Synthetic-Text/blob/HEAD/run_experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c45aaaffcbb1a729","mcp_get_code":{"code_sha256":"c45aaaffcbb1a729"}},{"arxiv_id":"2509.13399","paper":"/paper/arxiv-2509-13399","title":"EdiVal-Agent: An Object-Centric Framework for Automated, Fine-Grained Evaluation of Multi-Turn Editing","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"TianyuCodings/EdiVal","path":"baseline_generate/gpt4o.py","file_url":"https://github.com/TianyuCodings/EdiVal/blob/HEAD/baseline_generate/gpt4o.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f05a8bb234c77122","mcp_get_code":{"code_sha256":"f05a8bb234c77122"}},{"arxiv_id":"2506.20941","paper":"/paper/model-state-arithmetic-for-machine-unlearning","title":"Model State Arithmetic for Machine Unlearning","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mehrdadsaberi/msa_unlearning","path":"src/tv_unlearn.py","file_url":"https://github.com/mehrdadsaberi/msa_unlearning/blob/HEAD/src/tv_unlearn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"aa93c2f32ef7df6c","mcp_get_code":{"code_sha256":"aa93c2f32ef7df6c"}},{"arxiv_id":"2506.20639","paper":"/paper/diffucoder-understanding-and-improving-masked","title":"DiffuCoder: Understanding and Improving Masked Diffusion Models for Code Generation","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-diffucoder","path":"recipes/process_data.py","file_url":"https://github.com/apple/ml-diffucoder/blob/HEAD/recipes/process_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f32a6b72ed50b5fa","mcp_get_code":{"code_sha256":"f32a6b72ed50b5fa"}},{"arxiv_id":"2506.09985","paper":"/paper/v-jepa-2-self-supervised-video-models-enable","title":"V-JEPA 2: Self-Supervised Video Models Enable Understanding, Prediction and Planning","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/vjepa2","path":"app/scaffold.py","file_url":"https://github.com/facebookresearch/vjepa2/blob/HEAD/app/scaffold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"2004d0e6ae873f2e","mcp_get_code":{"code_sha256":"2004d0e6ae873f2e"}},{"arxiv_id":"2506.07001","paper":"/paper/adversarial-paraphrasing-a-universal-attack","title":"Adversarial Paraphrasing: A Universal Attack for Humanizing AI-Generated Text","date":"2025-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chengez/adversarial-paraphrasing","path":"paraphrase_and_detect.py","file_url":"https://github.com/chengez/adversarial-paraphrasing/blob/HEAD/paraphrase_and_detect.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0d612568417dbdae","mcp_get_code":{"code_sha256":"0d612568417dbdae"}},{"arxiv_id":"2505.19474","paper":"/paper/causal-llava-causal-disentanglement-for","title":"Causal-LLaVA: Causal Disentanglement for Mitigating Hallucination in Multimodal Large Language Models","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignisavium/causal-llava","path":"confounders/get_projector_confounders.py","file_url":"https://github.com/ignisavium/causal-llava/blob/HEAD/confounders/get_projector_confounders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a7d0d350746fb32","mcp_get_code":{"code_sha256":"4a7d0d350746fb32"}},{"arxiv_id":"2504.13416","paper":"/paper/stamp-your-content-proving-dataset-membership","title":"STAMP Your Content: Proving Dataset Membership via Watermarked Rephrasings","date":"2025-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"codeboy5/stamp","path":"src/rephrase_dataset.py","file_url":"https://github.com/codeboy5/stamp/blob/HEAD/src/rephrase_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5d24c302b06c761b","mcp_get_code":{"code_sha256":"5d24c302b06c761b"}},{"arxiv_id":"2504.03553","paper":"/paper/agentic-knowledgeable-self-awareness","title":"Agentic Knowledgeable Self-awareness","date":"2025-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/knowself","path":"train/train_stage1.py","file_url":"https://github.com/zjunlp/knowself/blob/HEAD/train/train_stage1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bbf3791e217df26","mcp_get_code":{"code_sha256":"5bbf3791e217df26"}},{"arxiv_id":"2504.02199","paper":"/paper/esc-erasing-space-concept-for-knowledge","title":"ESC: Erasing Space Concept for Knowledge Deletion","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-VGI/ESC","path":"unlearn.py","file_url":"https://github.com/KU-VGI/ESC/blob/HEAD/unlearn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a31522fb137cd85a","mcp_get_code":{"code_sha256":"a31522fb137cd85a"}},{"arxiv_id":"2502.21271","paper":null,"title":"arXiv:2502.21271","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"ncTimTang/AKS","path":"frame_select.py","file_url":"https://github.com/ncTimTang/AKS/blob/HEAD/frame_select.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7b2234adf426836f","mcp_get_code":{"code_sha256":"7b2234adf426836f"}},{"arxiv_id":"2502.20082","paper":"/paper/longrope2-near-lossless-llm-context-window","title":"LongRoPE2: Near-Lossless LLM Context Window Scaling","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/longrope","path":"utils/tokenize_dataset.py","file_url":"https://github.com/microsoft/longrope/blob/HEAD/utils/tokenize_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6db116407605786c","mcp_get_code":{"code_sha256":"6db116407605786c"}},{"arxiv_id":"2502.15677","paper":"/paper/fleke-federated-locate-then-edit-knowledge","title":"FLEKE: Federated Locate-then-Edit Knowledge Editing","date":"2025-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zongkaiz/fleke","path":"FedEdit/summarize.py","file_url":"https://github.com/zongkaiz/fleke/blob/HEAD/FedEdit/summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c92a4c8c2ffc80f","mcp_get_code":{"code_sha256":"4c92a4c8c2ffc80f"}},{"arxiv_id":"2502.15676","paper":"/paper/autotom-automated-bayesian-inverse-planning","title":"AutoToM: Automated Bayesian Inverse Planning and Model Discovery for Open-ended Theory of Mind","date":"2025-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuanyangjin/MMToM-QA","path":"BIP-ALM/inverse_symbolic_planner.py","file_url":"https://github.com/chuanyangjin/MMToM-QA/blob/HEAD/BIP-ALM/inverse_symbolic_planner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"15217c48be12b1ec","mcp_get_code":{"code_sha256":"15217c48be12b1ec"}},{"arxiv_id":"2502.13834","paper":"/paper/proving-olympiad-inequalities-by-synergizing","title":"Proving Olympiad Inequalities by Synergizing LLMs and Symbolic Reasoning","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lizn-zn/NeqLIPS","path":"viz.py","file_url":"https://github.com/Lizn-zn/NeqLIPS/blob/HEAD/viz.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec2913a87bc45c5c","mcp_get_code":{"code_sha256":"ec2913a87bc45c5c"}},{"arxiv_id":"2502.13533","paper":"/paper/train-small-infer-large-memory-efficient-lora","title":"Train Small, Infer Large: Memory-Efficient LoRA Training for Large Language Models","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junzhang-zj/LoRAM","path":"loram/2_pruned_low_rank_matrix_training.py","file_url":"https://github.com/junzhang-zj/LoRAM/blob/HEAD/loram/2_pruned_low_rank_matrix_training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1382890bcd6d3bc9","mcp_get_code":{"code_sha256":"1382890bcd6d3bc9"}},{"arxiv_id":"2502.11191","paper":"/paper/primus-a-pioneering-collection-of-open-source","title":"Primus: A Pioneering Collection of Open-Source Datasets for Cybersecurity LLM Training","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/cosmopedia","path":"classification/run_edu_bert.py","file_url":"https://github.com/huggingface/cosmopedia/blob/HEAD/classification/run_edu_bert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6d7f9ea09392e2a8","mcp_get_code":{"code_sha256":"6d7f9ea09392e2a8"}},{"arxiv_id":"2502.08691","paper":"/paper/agentsociety-large-scale-simulation-of-llm","title":"AgentSociety: Large-Scale Simulation of LLM-Driven Generative Agents Advances Understanding of Human Behaviors and Society","date":"2025-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/AgentSociety","path":"extension/runtime/agentsociety/bin/ags.py","file_url":"https://github.com/tsinghua-fib-lab/AgentSociety/blob/HEAD/extension/runtime/agentsociety/bin/ags.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"90fa4d60b1313975","mcp_get_code":{"code_sha256":"90fa4d60b1313975"}},{"arxiv_id":"2502.03397","paper":null,"title":"arXiv:2502.03397","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"honglizhan/SPRI-public","path":"stage1_gen_principles/02_refine_principles.py","file_url":"https://github.com/honglizhan/SPRI-public/blob/HEAD/stage1_gen_principles/02_refine_principles.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cc3134c9d977d49c","mcp_get_code":{"code_sha256":"cc3134c9d977d49c"}},{"arxiv_id":"2412.09243","paper":"/paper/sprec-leveraging-self-play-to-debias","title":"SPRec: Leveraging Self-Play to Debias Preference Alignment for Large Language Model-based Recommendations","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"regionch/sprec","path":"eval/inference.py","file_url":"https://github.com/regionch/sprec/blob/HEAD/eval/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"42ea65e48852f658","mcp_get_code":{"code_sha256":"42ea65e48852f658"}},{"arxiv_id":"2412.09243","paper":"/paper/sprec-leveraging-self-play-to-debias","title":"SPRec: Leveraging Self-Play to Debias Preference Alignment for Large Language Model-based Recommendations","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"regionch/sprec","path":"train/data_generate.py","file_url":"https://github.com/regionch/sprec/blob/HEAD/train/data_generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0b117d807444bd80","mcp_get_code":{"code_sha256":"0b117d807444bd80"}},{"arxiv_id":"2411.18263","paper":"/paper/tsd-sr-one-step-diffusion-with-target-score","title":"TSD-SR: One-Step Diffusion with Target Score Distillation for Real-World Image Super-Resolution","date":"2024-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microtreei/TSD-SR","path":"test/test_tsdsr.py","file_url":"https://github.com/Microtreei/TSD-SR/blob/HEAD/test/test_tsdsr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ef8e881c60cb2521","mcp_get_code":{"code_sha256":"ef8e881c60cb2521"}},{"arxiv_id":"2411.16955","paper":"/paper/probing-the-limitations-of-multimodal","title":"Probing the limitations of multimodal language models for chemistry and materials research","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamalab-org/mac-bench","path":"plots/table_models.py","file_url":"https://github.com/lamalab-org/mac-bench/blob/HEAD/plots/table_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a3db863da80a39c5","mcp_get_code":{"code_sha256":"a3db863da80a39c5"}},{"arxiv_id":"2411.04358","paper":"/paper/robust-and-efficient-fine-tuning-of-llms-with","title":"Robust and Efficient Fine-tuning of LLMs with Bayesian Reparameterization of Low-Rank Adaptation","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lcs2-iiitd/monteclora","path":"commonsense_evaluate.py","file_url":"https://github.com/lcs2-iiitd/monteclora/blob/HEAD/commonsense_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"93ae876f7bcc5547","mcp_get_code":{"code_sha256":"93ae876f7bcc5547"}},{"arxiv_id":"2411.04358","paper":"/paper/robust-and-efficient-fine-tuning-of-llms-with","title":"Robust and Efficient Fine-tuning of LLMs with Bayesian Reparameterization of Low-Rank Adaptation","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lcs2-iiitd/monteclora","path":"evaluate.py","file_url":"https://github.com/lcs2-iiitd/monteclora/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2982bc8c318ebd42","mcp_get_code":{"code_sha256":"2982bc8c318ebd42"}},{"arxiv_id":"2411.03554","paper":"/paper/benchmarking-vision-language-model-unlearning","title":"Benchmarking Vision Language Model Unlearning via Fictitious Facial Identity Dataset","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"safolab-wisc/fiubench","path":"aggregate_eval_stat.py","file_url":"https://github.com/safolab-wisc/fiubench/blob/HEAD/aggregate_eval_stat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1090886208057542","mcp_get_code":{"code_sha256":"1090886208057542"}},{"arxiv_id":"2411.03387","paper":"/paper/quantifying-aleatoric-uncertainty-of-the","title":"Quantifying Aleatoric Uncertainty of the Treatment Effect: A Novel Orthogonal Learner","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valentyn1997/au-cnfs","path":"runnables/train_lockdown.py","file_url":"https://github.com/valentyn1997/au-cnfs/blob/HEAD/runnables/train_lockdown.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b354bae6f4dff6f","mcp_get_code":{"code_sha256":"5b354bae6f4dff6f"}},{"arxiv_id":"2411.00394","paper":"/paper/right-this-way-can-vlms-guide-us-to-see-more","title":"Right this way: Can VLMs Guide Us to See More to Answer Questions?","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeoLee7/Directional_guidance","path":"generate_train_dataset_main.py","file_url":"https://github.com/LeoLee7/Directional_guidance/blob/HEAD/generate_train_dataset_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ca535421a0f566a","mcp_get_code":{"code_sha256":"2ca535421a0f566a"}},{"arxiv_id":"2410.24198","paper":"/paper/selfcodealign-self-alignment-for-code","title":"SelfCodeAlign: Self-Alignment for Code Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/selfcodealign","path":"src/star_align/self_ossinstruct.py","file_url":"https://github.com/bigcode-project/selfcodealign/blob/HEAD/src/star_align/self_ossinstruct.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5c02c0de38a6ae98","mcp_get_code":{"code_sha256":"5c02c0de38a6ae98"}},{"arxiv_id":"2410.19123","paper":"/paper/read-me-refactorizing-llms-as-router","title":"Read-ME: Refactorizing LLMs as Router-Decoupled Mixture of Experts with System Co-Design","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/READ-ME","path":"moe_fication/train_red.py","file_url":"https://github.com/VITA-Group/READ-ME/blob/HEAD/moe_fication/train_red.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"01f915e04e3d24d0","mcp_get_code":{"code_sha256":"01f915e04e3d24d0"}},{"arxiv_id":"2410.15661","paper":"/paper/scalable-data-ablation-approximations-for","title":"Scalable Data Ablation Approximations for Language Models through Modular Training and Merging","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clarana/ez-data-ablations","path":"save_uniform_avg_model.py","file_url":"https://github.com/clarana/ez-data-ablations/blob/HEAD/save_uniform_avg_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"feda6cc4a9b1ac61","mcp_get_code":{"code_sha256":"feda6cc4a9b1ac61"}},{"arxiv_id":"2410.13788","paper":"/paper/modeling-future-conversation-turns-to-teach","title":"Modeling Future Conversation Turns to Teach LLMs to Ask Clarifying Questions","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikejqzhang/clarifying_questions","path":"src/clarifying_rewards.py","file_url":"https://github.com/mikejqzhang/clarifying_questions/blob/HEAD/src/clarifying_rewards.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5516bbeb1337ab04","mcp_get_code":{"code_sha256":"5516bbeb1337ab04"}},{"arxiv_id":"2410.09508","paper":"/paper/collabedit-towards-non-destructive","title":"CollabEdit: Towards Non-destructive Collaborative Knowledge Editing","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/collabedit","path":"experiments/CollabEdit_summarize.py","file_url":"https://github.com/lins-lab/collabedit/blob/HEAD/experiments/CollabEdit_summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3da2cb78951884b7","mcp_get_code":{"code_sha256":"3da2cb78951884b7"}},{"arxiv_id":"2410.09437","paper":"/paper/mtl-lora-low-rank-adaptation-for-multi-task","title":"MTL-LoRA: Low-Rank Adaptation for Multi-Task Learning","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pumpkin-co/mtl-lora","path":"lora_evaluate.py","file_url":"https://github.com/pumpkin-co/mtl-lora/blob/HEAD/lora_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9b2aa09fa1644193","mcp_get_code":{"code_sha256":"9b2aa09fa1644193"}},{"arxiv_id":"2410.07985","paper":"/paper/omni-math-a-universal-olympiad-level","title":"Omni-MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kbsdjames/omni-math","path":"Omni-Judge_eval/detailed_evaluation/difficulty_specific_evaluation.py","file_url":"https://github.com/kbsdjames/omni-math/blob/HEAD/Omni-Judge_eval/detailed_evaluation/difficulty_specific_evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a2095803e48965a1","mcp_get_code":{"code_sha256":"a2095803e48965a1"}},{"arxiv_id":"2410.07985","paper":"/paper/omni-math-a-universal-olympiad-level","title":"Omni-MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kbsdjames/omni-math","path":"GPT_eval/detailed_evaluation/difficulty_specific_evaluation.py","file_url":"https://github.com/kbsdjames/omni-math/blob/HEAD/GPT_eval/detailed_evaluation/difficulty_specific_evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b7f72b95c867a1ec","mcp_get_code":{"code_sha256":"b7f72b95c867a1ec"}},{"arxiv_id":"2410.05165","paper":"/paper/efficient-inference-for-large-language-model","title":"Efficient Inference for Large Language Model-based Generative Recommendation","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Linxyhaha/AtSpeed","path":"code/generate_teacher_data.py","file_url":"https://github.com/Linxyhaha/AtSpeed/blob/HEAD/code/generate_teacher_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e2f64861d2469ffb","mcp_get_code":{"code_sha256":"e2f64861d2469ffb"}},{"arxiv_id":"2410.04197","paper":"/paper/cs4-measuring-the-creativity-of-large","title":"CS4: Measuring the Creativity of Large Language Models Automatically by Controlling the Number of Story-Writing Constraints","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anirudhlakkaraju/cs4_benchmark","path":"evaluation/constraint_satisfaction.py","file_url":"https://github.com/anirudhlakkaraju/cs4_benchmark/blob/HEAD/evaluation/constraint_satisfaction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1a773a549f580915","mcp_get_code":{"code_sha256":"1a773a549f580915"}},{"arxiv_id":"2410.04197","paper":"/paper/cs4-measuring-the-creativity-of-large","title":"CS4: Measuring the Creativity of Large Language Models Automatically by Controlling the Number of Story-Writing Constraints","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anirudhlakkaraju/cs4_benchmark","path":"evaluation/diversity_calculation.py","file_url":"https://github.com/anirudhlakkaraju/cs4_benchmark/blob/HEAD/evaluation/diversity_calculation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5baffd5407078613","mcp_get_code":{"code_sha256":"5baffd5407078613"}},{"arxiv_id":"2410.04197","paper":"/paper/cs4-measuring-the-creativity-of-large","title":"CS4: Measuring the Creativity of Large Language Models Automatically by Controlling the Number of Story-Writing Constraints","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anirudhlakkaraju/cs4_benchmark","path":"evaluation/diversity_graphs.py","file_url":"https://github.com/anirudhlakkaraju/cs4_benchmark/blob/HEAD/evaluation/diversity_graphs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c811600eab5c3bf7","mcp_get_code":{"code_sha256":"c811600eab5c3bf7"}},{"arxiv_id":"2410.04010","paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"commonsense_evaluate_gemma.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/commonsense_evaluate_gemma.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"27ce6e249f9b1a82","mcp_get_code":{"code_sha256":"27ce6e249f9b1a82"}},{"arxiv_id":"2410.04010","paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"commonsense_evaluate_qwen.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/commonsense_evaluate_qwen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e563b8e4282a0c32","mcp_get_code":{"code_sha256":"e563b8e4282a0c32"}},{"arxiv_id":"2410.04010","paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/HypLLM","path":"evaluate.py","file_url":"https://github.com/marlin-codes/HypLLM/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"11971b0db65e9e75","mcp_get_code":{"code_sha256":"11971b0db65e9e75"}},{"arxiv_id":"2410.02116","paper":"/paper/dataset-distillation-via-knowledge","title":"Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networks","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigml-cs-ucla/mkdt","path":"distill.py","file_url":"https://github.com/bigml-cs-ucla/mkdt/blob/HEAD/distill.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6e3eefbc9e2d6162","mcp_get_code":{"code_sha256":"6e3eefbc9e2d6162"}},{"arxiv_id":"2409.11844","paper":"/paper/meow-memory-supervised-llm-unlearning-via","title":"MEOW: MEMOry Supervised LLM Unlearning Via Inverted Facts","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carol-gutianle/meow","path":"meow/tofu/aggregate.py","file_url":"https://github.com/carol-gutianle/meow/blob/HEAD/meow/tofu/aggregate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"956672833b0ef856","mcp_get_code":{"code_sha256":"956672833b0ef856"}},{"arxiv_id":"2409.04409","paper":"/paper/train-till-you-drop-towards-stable-and-robust","title":"Train Till You Drop: Towards Stable and Robust Source-free Unsupervised 3D Domain Adaptation","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/TTYD","path":"train_ttyd_st.py","file_url":"https://github.com/valeoai/TTYD/blob/HEAD/train_ttyd_st.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"14efea405afb2bd4","mcp_get_code":{"code_sha256":"14efea405afb2bd4"}},{"arxiv_id":"2409.04409","paper":"/paper/train-till-you-drop-towards-stable-and-robust","title":"Train Till You Drop: Towards Stable and Robust Source-free Unsupervised 3D Domain Adaptation","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/ttyd","path":"train_ttyd_core.py","file_url":"https://github.com/valeoai/ttyd/blob/HEAD/train_ttyd_core.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8410a4af7b88726","mcp_get_code":{"code_sha256":"b8410a4af7b88726"}},{"arxiv_id":"2409.01035","paper":"/paper/unleashing-the-power-of-task-specific","title":"Task-Specific Directions: Definition, Exploration, and Utilization in Parameter Efficient Fine-Tuning","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chongjie-Si/Subspace-Tuning","path":"CR_MR/commonsense_evaluate.py","file_url":"https://github.com/Chongjie-Si/Subspace-Tuning/blob/HEAD/CR_MR/commonsense_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"415f46d8a341e28d","mcp_get_code":{"code_sha256":"415f46d8a341e28d"}},{"arxiv_id":"2409.01035","paper":"/paper/unleashing-the-power-of-task-specific","title":"Task-Specific Directions: Definition, Exploration, and Utilization in Parameter Efficient Fine-Tuning","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chongjie-Si/Subspace-Tuning","path":"CR_MR/math_evaluate.py","file_url":"https://github.com/Chongjie-Si/Subspace-Tuning/blob/HEAD/CR_MR/math_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4740c3e235eedfb4","mcp_get_code":{"code_sha256":"4740c3e235eedfb4"}},{"arxiv_id":"2408.13679","paper":"/paper/segment-any-mesh-zero-shot-mesh-part","title":"Segment Any Mesh: Zero-shot Mesh Part Segmentation via Lifting Segment Anything 2 to 3D","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtangg12/samesh","path":"src/samesh/__main__.py","file_url":"https://github.com/gtangg12/samesh/blob/HEAD/src/samesh/__main__.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"59cc1ae133a0c105","mcp_get_code":{"code_sha256":"59cc1ae133a0c105"}},{"arxiv_id":"2408.08754","paper":"/paper/se-sgformer-a-self-explainable-signed-graph","title":"Self-Explainable Graph Transformer for Link Sign Prediction","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liule66/SE-SGformer","path":"discriminator.py","file_url":"https://github.com/liule66/SE-SGformer/blob/HEAD/discriminator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2de872249d4741db","mcp_get_code":{"code_sha256":"2de872249d4741db"}},{"arxiv_id":"2408.04872","paper":"/paper/scoi-syntax-augmented-coverage-based-in","title":"SCOI: Syntax-augmented Coverage-based In-context Example Selection for Machine Translation","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hplt-project/sacremoses","path":"audit/differential.py","file_url":"https://github.com/hplt-project/sacremoses/blob/HEAD/audit/differential.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6fe46bed16bd015","mcp_get_code":{"code_sha256":"c6fe46bed16bd015"}},{"arxiv_id":"2407.16997","paper":"/paper/revisiting-who-s-harry-potter-towards","title":"Revisiting Who's Harry Potter: Towards Targeted Unlearning from a Causal Intervention Perspective","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsb-nlp-chang/causal_unlearn","path":"aggregate_eval_tofu.py","file_url":"https://github.com/ucsb-nlp-chang/causal_unlearn/blob/HEAD/aggregate_eval_tofu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"060156a110cfcc2e","mcp_get_code":{"code_sha256":"060156a110cfcc2e"}},{"arxiv_id":"2407.12443","paper":"/paper/preventing-catastrophic-overfitting-in-fast","title":"Preventing Catastrophic Overfitting in Fast Adversarial Training: A Bi-level Optimization Perspective","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HandingWangXDGroup/FGSM-PCO","path":"FGSM-PCO.py","file_url":"https://github.com/HandingWangXDGroup/FGSM-PCO/blob/HEAD/FGSM-PCO.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9bf5d16916540519","mcp_get_code":{"code_sha256":"9bf5d16916540519"}},{"arxiv_id":"2407.09946","paper":"/paper/low-rank-interconnected-adaptation-across","title":"Low-Rank Interconnected Adaptation across Layers","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yibozhong/lily","path":"commonsense-reasoning/evaluate_llama.py","file_url":"https://github.com/yibozhong/lily/blob/HEAD/commonsense-reasoning/evaluate_llama.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e69377cf4c6f413","mcp_get_code":{"code_sha256":"8e69377cf4c6f413"}},{"arxiv_id":"2407.09946","paper":"/paper/low-rank-interconnected-adaptation-across","title":"Low-Rank Interconnected Adaptation across Layers","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yibozhong/lily","path":"commonsense-reasoning/evaluate_mamba.py","file_url":"https://github.com/yibozhong/lily/blob/HEAD/commonsense-reasoning/evaluate_mamba.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b0b4ac66dc9563ab","mcp_get_code":{"code_sha256":"b0b4ac66dc9563ab"}},{"arxiv_id":"2407.09274","paper":"/paper/unifying-sequences-structures-and","title":"Unifying Sequences, Structures, and Descriptions for Any-to-Any Protein Generation with the Large Multimodal Model HelixProtX","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaddlePaddle/PaddleHelix","path":"pahelix/cmdline.py","file_url":"https://github.com/PaddlePaddle/PaddleHelix/blob/HEAD/pahelix/cmdline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"2f166c1fd0719e77","mcp_get_code":{"code_sha256":"2f166c1fd0719e77"}},{"arxiv_id":"2407.01470","paper":"/paper/dogerm-equipping-reward-models-with-domain","title":"DogeRM: Equipping Reward Models with Domain Knowledge through Model Merging","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MiuLab/DogeRM","path":"src/merge_linear.py","file_url":"https://github.com/MiuLab/DogeRM/blob/HEAD/src/merge_linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c7d640dfbb505ed4","mcp_get_code":{"code_sha256":"c7d640dfbb505ed4"}},{"arxiv_id":"2406.19380","paper":"/paper/tabred-a-benchmark-of-tabular-machine","title":"TabReD: Analyzing Pitfalls and Filling the Gaps in Tabular Deep Learning Benchmarks","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/tabred","path":"preprocessing/ecom_offers.py","file_url":"https://github.com/yandex-research/tabred/blob/HEAD/preprocessing/ecom_offers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0d04eeccf62abd98","mcp_get_code":{"code_sha256":"0d04eeccf62abd98"}},{"arxiv_id":"2406.19380","paper":"/paper/tabred-a-benchmark-of-tabular-machine","title":"TabReD: Analyzing Pitfalls and Filling the Gaps in Tabular Deep Learning Benchmarks","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/tabred","path":"preprocessing/homesite.py","file_url":"https://github.com/yandex-research/tabred/blob/HEAD/preprocessing/homesite.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c5805b170effb016","mcp_get_code":{"code_sha256":"c5805b170effb016"}},{"arxiv_id":"2406.18139","paper":"/paper/look-m-look-once-optimization-in-kv-cache-for","title":"LOOK-M: Look-Once Optimization in KV Cache for Efficient Multimodal Long-Context Inference","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sustechbruce/look-m","path":"score.py","file_url":"https://github.com/sustechbruce/look-m/blob/HEAD/score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4e3113001afa6cb","mcp_get_code":{"code_sha256":"d4e3113001afa6cb"}},{"arxiv_id":"2406.16330","paper":"/paper/pruning-via-merging-compressing-llms-via","title":"Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Merging","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sempraety/pruning-via-merging","path":"pipeline.py","file_url":"https://github.com/sempraety/pruning-via-merging/blob/HEAD/pipeline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e604505814490b1","mcp_get_code":{"code_sha256":"7e604505814490b1"}},{"arxiv_id":"2406.12952","paper":"/paper/code-agents-are-state-of-the-art-software","title":"SWT-Bench: Testing and Validating Real-World Bug-Fixes with Code Agents","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"logic-star-ai/swt-bench","path":"dataset/swt_bench_cross_validation.py","file_url":"https://github.com/logic-star-ai/swt-bench/blob/HEAD/dataset/swt_bench_cross_validation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"551579b16737ab25","mcp_get_code":{"code_sha256":"551579b16737ab25"}},{"arxiv_id":"2406.11909","paper":"/paper/mixture-of-subspaces-in-low-rank-adaptation","title":"Mixture-of-Subspaces in Low-Rank Adaptation","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wutaiqiang/moslora","path":"commonsense_reasoning/commonsense_evaluate.py","file_url":"https://github.com/wutaiqiang/moslora/blob/HEAD/commonsense_reasoning/commonsense_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8da7d64c2442014","mcp_get_code":{"code_sha256":"b8da7d64c2442014"}},{"arxiv_id":"2406.18561","paper":"/paper/selmatch-effectively-scaling-up-dataset","title":"SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matching","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yongalls/SelMatch","path":"distill.py","file_url":"https://github.com/Yongalls/SelMatch/blob/HEAD/distill.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8ae07679993c03b6","mcp_get_code":{"code_sha256":"8ae07679993c03b6"}},{"arxiv_id":"2405.19985","paper":"/paper/targeted-sequential-indirect-experiment","title":"Targeted Sequential Indirect Experiment Design","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EAiler/targeted-iv-experiments","path":"src/run_strategy.py","file_url":"https://github.com/EAiler/targeted-iv-experiments/blob/HEAD/src/run_strategy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ecface40dc0fc397","mcp_get_code":{"code_sha256":"ecface40dc0fc397"}},{"arxiv_id":"2405.17743","paper":"/paper/orlm-training-large-language-models-for","title":"ORLM: A Customizable Framework in Training Large Models for Automated Optimization Modeling","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cardinal-operations/orlm","path":"eval/execute.py","file_url":"https://github.com/cardinal-operations/orlm/blob/HEAD/eval/execute.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1f4b645f64ce77b0","mcp_get_code":{"code_sha256":"1f4b645f64ce77b0"}},{"arxiv_id":"2405.16821","paper":"/paper/perturbation-restrained-sequential-model","title":"Perturbation-Restrained Sequential Model Editing","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mjy1111/prune","path":"experiments/summarize.py","file_url":"https://github.com/mjy1111/prune/blob/HEAD/experiments/summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d697759222eb008","mcp_get_code":{"code_sha256":"0d697759222eb008"}},{"arxiv_id":"2405.14394","paper":"/paper/instruction-tuning-with-loss-over","title":"Instruction Tuning With Loss Over Instructions","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengxiangshi/instructionmodelling","path":"src/compute_loss.py","file_url":"https://github.com/zhengxiangshi/instructionmodelling/blob/HEAD/src/compute_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5ce78b681258794","mcp_get_code":{"code_sha256":"e5ce78b681258794"}},{"arxiv_id":"2405.13967","paper":"/paper/detox-toxic-subspace-projection-for-model","title":"Model Editing as a Robust and Denoised variant of DPO: A Case Study on Toxicity","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Uppaal/detox-edit","path":"utils/startup.py","file_url":"https://github.com/Uppaal/detox-edit/blob/HEAD/utils/startup.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cfb7124a6f05db32","mcp_get_code":{"code_sha256":"cfb7124a6f05db32"}},{"arxiv_id":"2405.13226","paper":"/paper/dataset-decomposition-faster-llm-training","title":"Dataset Decomposition: Faster LLM Training with Variable Sequence Length Curriculum","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-dataset-decomposition","path":"scripts/get_dd_params.py","file_url":"https://github.com/apple/ml-dataset-decomposition/blob/HEAD/scripts/get_dd_params.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"e356c67d9744ecf1","mcp_get_code":{"code_sha256":"e356c67d9744ecf1"}},{"arxiv_id":"2405.12617","paper":"/paper/quantifying-emergence-in-large-language","title":"Quantifying Semantic Emergence in Language Models","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zodiark-ch/emergence-of-llms","path":"GEMMA/MINE_for_LLMs.py","file_url":"https://github.com/zodiark-ch/emergence-of-llms/blob/HEAD/GEMMA/MINE_for_LLMs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97fe543c8f929340","mcp_get_code":{"code_sha256":"97fe543c8f929340"}},{"arxiv_id":"2405.12617","paper":"/paper/quantifying-emergence-in-large-language","title":"Quantifying Semantic Emergence in Language Models","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zodiark-ch/emergence-of-llms","path":"GPT2/MINE_for_LLMs.py","file_url":"https://github.com/zodiark-ch/emergence-of-llms/blob/HEAD/GPT2/MINE_for_LLMs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fdaa46782e6db761","mcp_get_code":{"code_sha256":"fdaa46782e6db761"}},{"arxiv_id":"2405.12617","paper":"/paper/quantifying-emergence-in-large-language","title":"Quantifying Semantic Emergence in Language Models","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zodiark-ch/emergence-of-llms","path":"OpenLlama/MINE_for_LLMs.py","file_url":"https://github.com/zodiark-ch/emergence-of-llms/blob/HEAD/OpenLlama/MINE_for_LLMs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b67229533c2ca1ff","mcp_get_code":{"code_sha256":"b67229533c2ca1ff"}},{"arxiv_id":"2405.05466","paper":"/paper/poser-unmasking-alignment-faking-llms-by","title":"Poser: Unmasking Alignment Faking LLMs by Manipulating Their Internals","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sevdeawesome/POSER","path":"src/run_strategy.py","file_url":"https://github.com/sevdeawesome/POSER/blob/HEAD/src/run_strategy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d3933be5eee5165","mcp_get_code":{"code_sha256":"5d3933be5eee5165"}},{"arxiv_id":"2404.11672","paper":"/paper/memllm-finetuning-llms-to-use-an-explicit","title":"MemLLM: Finetuning LLMs to Use An Explicit Read-Write Memory","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amodaresi/memllm","path":"training/main_read_w_augmented.py","file_url":"https://github.com/amodaresi/memllm/blob/HEAD/training/main_read_w_augmented.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c8cd0cb0e1c44f07","mcp_get_code":{"code_sha256":"c8cd0cb0e1c44f07"}},{"arxiv_id":"2404.11672","paper":"/paper/memllm-finetuning-llms-to-use-an-explicit","title":"MemLLM: Finetuning LLMs to Use An Explicit Read-Write Memory","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amodaresi/memllm","path":"training/main_write_mistral_w_annotated_w_augmented.py","file_url":"https://github.com/amodaresi/memllm/blob/HEAD/training/main_write_mistral_w_annotated_w_augmented.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24875a8dcf1c1fdc","mcp_get_code":{"code_sha256":"24875a8dcf1c1fdc"}},{"arxiv_id":"2404.03196","paper":"/paper/okay-let-s-do-this-modeling-event-coreference","title":"Okay, Let's Do This! Modeling Event Coreference with Generated Rationales and Knowledge Distillation","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csu-signal/llama_cdcr","path":"cluster_analysis.py","file_url":"https://github.com/csu-signal/llama_cdcr/blob/HEAD/cluster_analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0e7bf1603e345cd4","mcp_get_code":{"code_sha256":"0e7bf1603e345cd4"}},{"arxiv_id":"2403.19154","paper":"/paper/star-gate-teaching-language-models-to-ask","title":"STaR-GATE: Teaching Language Models to Ask Clarifying Questions","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scandukuri/assistant-gate","path":"experiments/star-gate-gemma-ablation/instruct-questions/extract-questions.py","file_url":"https://github.com/scandukuri/assistant-gate/blob/HEAD/experiments/star-gate-gemma-ablation/instruct-questions/extract-questions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66fd4b46def3ecdd","mcp_get_code":{"code_sha256":"66fd4b46def3ecdd"}},{"arxiv_id":"2403.17823","paper":"/paper/efficient-image-pre-training-with-siamese","title":"Efficient Image Pre-Training with Siamese Cropped Masked Autoencoders","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexandre-eymael/cropmae","path":"downstreams/propagation/davis_evaluation/evaluation_method.py","file_url":"https://github.com/alexandre-eymael/cropmae/blob/HEAD/downstreams/propagation/davis_evaluation/evaluation_method.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"718a42749c76f61d","mcp_get_code":{"code_sha256":"718a42749c76f61d"}},{"arxiv_id":"2403.01432","paper":"/paper/fine-tuning-vs-retrieval-augmented-generation","title":"Fine Tuning vs. Retrieval Augmented Generation for Less Popular Knowledge","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heydarsoudani/ragvsft","path":"component1_retrieval/data_postprocessing.py","file_url":"https://github.com/heydarsoudani/ragvsft/blob/HEAD/component1_retrieval/data_postprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d8772189b543b83f","mcp_get_code":{"code_sha256":"d8772189b543b83f"}},{"arxiv_id":"2404.08471","paper":"/paper/revisiting-feature-prediction-for-learning-1","title":"Revisiting Feature Prediction for Learning Visual Representations from Video","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/jepa","path":"app/scaffold.py","file_url":"https://github.com/facebookresearch/jepa/blob/HEAD/app/scaffold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2004d0e6ae873f2e","mcp_get_code":{"code_sha256":"2004d0e6ae873f2e"}},{"arxiv_id":"2404.08471","paper":"/paper/revisiting-feature-prediction-for-learning-1","title":"Revisiting Feature Prediction for Learning Visual Representations from Video","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/jepa","path":"evals/scaffold.py","file_url":"https://github.com/facebookresearch/jepa/blob/HEAD/evals/scaffold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"16d0113b5f3ab648","mcp_get_code":{"code_sha256":"16d0113b5f3ab648"}},{"arxiv_id":"2402.18752","paper":"/paper/pre-training-differentially-private-models","title":"Pre-training Differentially Private Models with Limited Public Data","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"1fbb306860e852f7","mcp_get_code":{"code_sha256":"1fbb306860e852f7"}},{"arxiv_id":"2402.18752","paper":"/paper/pre-training-differentially-private-models","title":"Pre-training Differentially Private Models with Limited Public Data","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/fast-differential-privacy","path":"examples/image_classification/CIFAR_TIMM.py","file_url":"https://github.com/awslabs/fast-differential-privacy/blob/HEAD/examples/image_classification/CIFAR_TIMM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"cd53567f8d66c13e","mcp_get_code":{"code_sha256":"cd53567f8d66c13e"}},{"arxiv_id":"2402.15813","paper":"/paper/measuring-bargaining-abilities-of-llms-a","title":"Measuring Bargaining Abilities of LLMs: A Benchmark and A Buyer-Enhancement Method","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianxiasjtu/amazonpricehistory","path":"dataset_analysis/analyse.py","file_url":"https://github.com/tianxiasjtu/amazonpricehistory/blob/HEAD/dataset_analysis/analyse.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1a5a2fa363648b84","mcp_get_code":{"code_sha256":"1a5a2fa363648b84"}},{"arxiv_id":"2402.15017","paper":"/paper/towards-few-shot-adaptation-of-foundation","title":"Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuning","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oliverxuzy/foudation-model_multitask","path":"finetune.py","file_url":"https://github.com/oliverxuzy/foudation-model_multitask/blob/HEAD/finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"19ca843d619cc77a","mcp_get_code":{"code_sha256":"19ca843d619cc77a"}},{"arxiv_id":"2402.13956","paper":"/paper/can-you-learn-semantics-through-next-word","title":"Can You Learn Semantics Through Next-Word Prediction? The Case of Entailment","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaofengwu/entailment-from-lm","path":"write_nli_data.py","file_url":"https://github.com/zhaofengwu/entailment-from-lm/blob/HEAD/write_nli_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79fcad06171a7835","mcp_get_code":{"code_sha256":"79fcad06171a7835"}},{"arxiv_id":"2402.11095","paper":"/paper/gim-learning-generalizable-image-matcher-from","title":"GIM: Learning Generalizable Image Matcher From Internet Videos","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuelunshen/gim","path":"hloc/extract_features.py","file_url":"https://github.com/xuelunshen/gim/blob/HEAD/hloc/extract_features.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f12182269ed0b51","mcp_get_code":{"code_sha256":"5f12182269ed0b51"}},{"arxiv_id":"2402.09353","paper":"/paper/dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/DoRA","path":"commonsense_reasoning/commonsense_evaluate.py","file_url":"https://github.com/NVlabs/DoRA/blob/HEAD/commonsense_reasoning/commonsense_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"415f46d8a341e28d","mcp_get_code":{"code_sha256":"415f46d8a341e28d"}},{"arxiv_id":"2402.09353","paper":"/paper/dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/DoRA","path":"commonsense_reasoning/evaluate.py","file_url":"https://github.com/NVlabs/DoRA/blob/HEAD/commonsense_reasoning/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3398969fc7af6ff7","mcp_get_code":{"code_sha256":"3398969fc7af6ff7"}},{"arxiv_id":"2402.08831","paper":"/paper/ecellm-generalizing-large-language-models-for","title":"eCeLLM: Generalizing Large Language Models for E-commerce from Large-scale, High-quality Instruction Data","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninglab/ecellm","path":"evaluate.py","file_url":"https://github.com/ninglab/ecellm/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"542f689c20f3299b","mcp_get_code":{"code_sha256":"542f689c20f3299b"}},{"arxiv_id":"2402.08831","paper":"/paper/ecellm-generalizing-large-language-models-for","title":"eCeLLM: Generalizing Large Language Models for E-commerce from Large-scale, High-quality Instruction Data","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninglab/ecellm","path":"evaluate_T5.py","file_url":"https://github.com/ninglab/ecellm/blob/HEAD/evaluate_T5.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"dd34e5279e3526c7","mcp_get_code":{"code_sha256":"dd34e5279e3526c7"}},{"arxiv_id":"2402.08679","paper":"/paper/cold-attack-jailbreaking-llms-with","title":"COLD-Attack: Jailbreaking LLMs with Stealthiness and Controllability","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-fangxu/cold-attack","path":"cold_decoding.py","file_url":"https://github.com/yu-fangxu/cold-attack/blob/HEAD/cold_decoding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dac727bfcfa835e4","mcp_get_code":{"code_sha256":"dac727bfcfa835e4"}},{"arxiv_id":"2402.07226","paper":"/paper/stitching-sub-trajectories-with-conditional","title":"Stitching Sub-Trajectories with Conditional Diffusion Model for Goal-Conditioned Offline RL","date":"2024-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlatjddbs/SSD","path":"dc/dc.py","file_url":"https://github.com/rlatjddbs/SSD/blob/HEAD/dc/dc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77cff4b5b63e486e","mcp_get_code":{"code_sha256":"77cff4b5b63e486e"}},{"arxiv_id":"2402.02104","paper":"/paper/learning-structure-aware-representations-of","title":"Learning Structure-Aware Representations of Dependent Types","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"konstantinosKokos/neural-agda","path":"src/quill/api/serve.py","file_url":"https://github.com/konstantinosKokos/neural-agda/blob/HEAD/src/quill/api/serve.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e3cd096e3e751de","mcp_get_code":{"code_sha256":"3e3cd096e3e751de"}},{"arxiv_id":"2402.00835","paper":"/paper/alison-fast-and-effective-stylometric","title":"ALISON: Fast and Effective Stylometric Authorship Obfuscation","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricX003/ALISON","path":"Obfuscate.py","file_url":"https://github.com/EricX003/ALISON/blob/HEAD/Obfuscate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b29ae8b2894becf","mcp_get_code":{"code_sha256":"6b29ae8b2894becf"}},{"arxiv_id":"2401.17809","paper":"/paper/swea-changing-factual-knowledge-in-large","title":"SWEA: Updating Factual Knowledge in Large Language Models via Subject Word Embedding Altering","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpq-tech/swea","path":"summarize.py","file_url":"https://github.com/xpq-tech/swea/blob/HEAD/summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"242f4ddd4428a4a6","mcp_get_code":{"code_sha256":"242f4ddd4428a4a6"}},{"arxiv_id":"2401.11035","paper":"/paper/image-safeguarding-reasoning-with-conditional","title":"Image Safeguarding: Reasoning with Conditional Vision Language Model and Obfuscating Unsafe Content Counterfactually","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SecureAIAutonomyLab/ConditionalVLM","path":"CSE/src/cse/__main__.py","file_url":"https://github.com/SecureAIAutonomyLab/ConditionalVLM/blob/HEAD/CSE/src/cse/__main__.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2684e3caff3c9539","mcp_get_code":{"code_sha256":"2684e3caff3c9539"}},{"arxiv_id":"2401.06197","paper":"/paper/efficient-deformable-convnets-rethinking","title":"Efficient Deformable ConvNets: Rethinking Dynamic and Sparse Operator for Vision Applications","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/dcnv4","path":"classification/extract_feature.py","file_url":"https://github.com/opengvlab/dcnv4/blob/HEAD/classification/extract_feature.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"67cdd6568078cc51","mcp_get_code":{"code_sha256":"67cdd6568078cc51"}},{"arxiv_id":"2401.06121","paper":"/paper/tofu-a-task-of-fictitious-unlearning-for-llms","title":"TOFU: A Task of Fictitious Unlearning for LLMs","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/tofu","path":"aggregate_eval_stat.py","file_url":"https://github.com/locuslab/tofu/blob/HEAD/aggregate_eval_stat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76eaabd6bddc940d","mcp_get_code":{"code_sha256":"76eaabd6bddc940d"}},{"arxiv_id":"2312.15268","paper":"/paper/mgdepth-motion-guided-cost-volume-for-self","title":"Manydepth2: Motion-Aware Self-Supervised Multi-Frame Monocular Depth Estimation in Dynamic Scenes","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaichen-z/rad","path":"methods/adaclip/rad_dataset.py","file_url":"https://github.com/kaichen-z/rad/blob/HEAD/methods/adaclip/rad_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e96095b79389d1f","mcp_get_code":{"code_sha256":"0e96095b79389d1f"}},{"arxiv_id":"2312.15166","paper":"/paper/solar-10-7b-scaling-large-language-models","title":"SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scaling","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jquesnelle/yarn","path":"tokenization.py","file_url":"https://github.com/jquesnelle/yarn/blob/HEAD/tokenization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e20d68d7fd93604b","mcp_get_code":{"code_sha256":"e20d68d7fd93604b"}},{"arxiv_id":"2312.15166","paper":"/paper/solar-10-7b-scaling-large-language-models","title":"SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scaling","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jquesnelle/yarn","path":"truncate.py","file_url":"https://github.com/jquesnelle/yarn/blob/HEAD/truncate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d86c0fdf41294d9","mcp_get_code":{"code_sha256":"6d86c0fdf41294d9"}},{"arxiv_id":"2312.15166","paper":"/paper/solar-10-7b-scaling-large-language-models","title":"SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scaling","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jquesnelle/yarn","path":"eval/perplexity.py","file_url":"https://github.com/jquesnelle/yarn/blob/HEAD/eval/perplexity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51e316fb0b5e2246","mcp_get_code":{"code_sha256":"51e316fb0b5e2246"}},{"arxiv_id":"2312.07132","paper":"/paper/image-content-generation-with-causal","title":"Image Content Generation with Causal Reasoning","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ieit-agi/mix-shannon","path":"validate.py","file_url":"https://github.com/ieit-agi/mix-shannon/blob/HEAD/validate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"525aaa24d3342b71","mcp_get_code":{"code_sha256":"525aaa24d3342b71"}},{"arxiv_id":"2312.02619","paper":"/paper/rethinking-and-simplifying-bootstrapped-graph","title":"Rethinking and Simplifying Bootstrapped Graph Latents","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zszszs25/sgcl","path":"train_transductive_mag.py","file_url":"https://github.com/zszszs25/sgcl/blob/HEAD/train_transductive_mag.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b6414af5c8cd06ec","mcp_get_code":{"code_sha256":"b6414af5c8cd06ec"}},{"arxiv_id":"2312.02619","paper":"/paper/rethinking-and-simplifying-bootstrapped-graph","title":"Rethinking and Simplifying Bootstrapped Graph Latents","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zszszs25/sgcl","path":"train_transductive_products.py","file_url":"https://github.com/zszszs25/sgcl/blob/HEAD/train_transductive_products.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3205accf4eb263b9","mcp_get_code":{"code_sha256":"3205accf4eb263b9"}},{"arxiv_id":"2311.09053","paper":"/paper/assessing-knowledge-editing-in-language","title":"Assessing Knowledge Editing in Language Models via Relation Perspective","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiyifan1023/RaKE","path":"experiments/summarize.py","file_url":"https://github.com/weiyifan1023/RaKE/blob/HEAD/experiments/summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bc3ad506e968adf7","mcp_get_code":{"code_sha256":"bc3ad506e968adf7"}},{"arxiv_id":"2311.08718","paper":"/paper/decomposing-uncertainty-for-large-language","title":"Decomposing Uncertainty for Large Language Models through Input Clarification Ensembling","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsb-nlp-chang/llm_uncertainty","path":"forward.py","file_url":"https://github.com/ucsb-nlp-chang/llm_uncertainty/blob/HEAD/forward.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"100e5f60e5811f8f","mcp_get_code":{"code_sha256":"100e5f60e5811f8f"}},{"arxiv_id":"2311.04333","paper":"/paper/practical-parallel-algorithms-for-near","title":"Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"pattaras/gbbs","path":"benchmarks/ApproximateDensestSubgraph/GreedyPlusPlus/run_experiment.py","file_url":"https://github.com/pattaras/gbbs/blob/HEAD/benchmarks/ApproximateDensestSubgraph/GreedyPlusPlus/run_experiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"085d8727fb8b27ee","mcp_get_code":{"code_sha256":"085d8727fb8b27ee"}},{"arxiv_id":"2310.16040","paper":"/paper/instruct-and-extract-instruction-tuning-for","title":"Instruct and Extract: Instruction Tuning for On-Demand Information Extraction","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzjiao/On-Demand-IE","path":"training/inference.py","file_url":"https://github.com/yzjiao/On-Demand-IE/blob/HEAD/training/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a64c18f13070bb1b","mcp_get_code":{"code_sha256":"a64c18f13070bb1b"}},{"arxiv_id":"2310.15719","paper":"/paper/recurrent-linear-transformers","title":"AGaLiTe: Approximate Gated Linear Transformers for Online Reinforcement Learning","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"subho406/Recurrent-Linear-Transformers","path":"trainer_pure.py","file_url":"https://github.com/subho406/Recurrent-Linear-Transformers/blob/HEAD/trainer_pure.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"10be38ccb17045ea","mcp_get_code":{"code_sha256":"10be38ccb17045ea"}},{"arxiv_id":"2310.12024","paper":"/paper/core-a-few-shot-company-relation","title":"CORE: A Few-Shot Company Relation Classification Dataset for Robust Domain Adaptation","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnborchert/CORE","path":"benchmark/fs/sample_configuration.py","file_url":"https://github.com/pnborchert/CORE/blob/HEAD/benchmark/fs/sample_configuration.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2122ba20600b45e1","mcp_get_code":{"code_sha256":"2122ba20600b45e1"}},{"arxiv_id":"2310.12024","paper":"/paper/core-a-few-shot-company-relation","title":"CORE: A Few-Shot Company Relation Classification Dataset for Robust Domain Adaptation","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnborchert/CORE","path":"benchmark/fs/sample_fewrel_configuration.py","file_url":"https://github.com/pnborchert/CORE/blob/HEAD/benchmark/fs/sample_fewrel_configuration.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"317ef4363a9778b4","mcp_get_code":{"code_sha256":"317ef4363a9778b4"}},{"arxiv_id":"2310.07015","paper":"/paper/neural-relational-inference-with-fast-modular-1","title":"Neural Relational Inference with Fast Modular Meta-learning","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FerranAlet/modular-metalearning","path":"create_functions_datasets.py","file_url":"https://github.com/FerranAlet/modular-metalearning/blob/HEAD/create_functions_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4edc80407ebe0206","mcp_get_code":{"code_sha256":"4edc80407ebe0206"}},{"arxiv_id":"2310.06987","paper":"/paper/catastrophic-jailbreak-of-open-source-llms","title":"Catastrophic Jailbreak of Open-source LLMs via Exploiting Generation","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-sysml/jailbreak_llm","path":"attack.py","file_url":"https://github.com/princeton-sysml/jailbreak_llm/blob/HEAD/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1791f231faab1a9d","mcp_get_code":{"code_sha256":"1791f231faab1a9d"}},{"arxiv_id":"2310.00093","paper":"/paper/datadam-efficient-dataset-distillation-with-1","title":"DataDAM: Efficient Dataset Distillation with Attention Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datadistillation/datadam","path":"main_DataDAM.py","file_url":"https://github.com/datadistillation/datadam/blob/HEAD/main_DataDAM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a34fe411a5565754","mcp_get_code":{"code_sha256":"a34fe411a5565754"}},{"arxiv_id":"2308.10168","paper":"/paper/head-to-tail-how-knowledgeable-are-large","title":"Head-to-Tail: How Knowledgeable are Large Language Models (LLMs)? A.K.A. Will LLMs Replace Knowledge Graphs?","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/head-to-tail","path":"head_to_tail_dbpedia.py","file_url":"https://github.com/facebookresearch/head-to-tail/blob/HEAD/head_to_tail_dbpedia.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"cf183e5793906ad6","mcp_get_code":{"code_sha256":"cf183e5793906ad6"}},{"arxiv_id":"2308.09583","paper":"/paper/wizardmath-empowering-mathematical-reasoning","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpxucan/WizardLM","path":"WizardLM/src/infer_wizardlm13b.py","file_url":"https://github.com/nlpxucan/WizardLM/blob/HEAD/WizardLM/src/infer_wizardlm13b.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e7c8e0d548af8b2f","mcp_get_code":{"code_sha256":"e7c8e0d548af8b2f"}},{"arxiv_id":"2308.08742","paper":"/paper/pmet-precise-model-editing-in-a-transformer","title":"PMET: Precise Model Editing in a Transformer","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpq-tech/pmet","path":"edit/summarize.py","file_url":"https://github.com/xpq-tech/pmet/blob/HEAD/edit/summarize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"86fbadf73973b931","mcp_get_code":{"code_sha256":"86fbadf73973b931"}},{"arxiv_id":"2308.08434","paper":"/paper/a-bi-step-grounding-paradigm-for-large","title":"A Bi-Step Grounding Paradigm for Large Language Models in Recommendation Systems","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sai990323/grounding4rec","path":"inference.py","file_url":"https://github.com/sai990323/grounding4rec/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5c33bf64407255e4","mcp_get_code":{"code_sha256":"5c33bf64407255e4"}},{"arxiv_id":"2308.06782","paper":"/paper/pentestgpt-an-llm-empowered-automatic","title":"PentestGPT: An LLM-empowered Automatic Penetration Testing Tool","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":"archive","repo":"greydgl/pentestgpt","path":"pentestgpt_agent/src/pentestgpt_agent/audit.py","file_url":"https://github.com/greydgl/pentestgpt/blob/HEAD/pentestgpt_agent/src/pentestgpt_agent/audit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2785444ccf4813e","mcp_get_code":{"code_sha256":"a2785444ccf4813e"}},{"arxiv_id":"2307.08875","paper":"/paper/natural-actor-critic-for-robust-reinforcement","title":"Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tliu1997/rnac","path":"train_rnac.py","file_url":"https://github.com/tliu1997/rnac/blob/HEAD/train_rnac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"787f96a4f64c5b9d","mcp_get_code":{"code_sha256":"787f96a4f64c5b9d"}},{"arxiv_id":"2307.01532","paper":"/paper/analyzing-intentional-behavior-in-autonomous","title":"Analyzing Intentional Behavior in Autonomous Agents under Uncertainty","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"filipcano/intentional-autonomous-agents","path":"trace_convert.py","file_url":"https://github.com/filipcano/intentional-autonomous-agents/blob/HEAD/trace_convert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fabcfb1183832b3f","mcp_get_code":{"code_sha256":"fabcfb1183832b3f"}},{"arxiv_id":"2306.09035","paper":"/paper/improving-explainability-of-disentangled","title":"Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iml-dkfz/m-pax_lib","path":"run_eval.py","file_url":"https://github.com/iml-dkfz/m-pax_lib/blob/HEAD/run_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1fbb2f377c3568f1","mcp_get_code":{"code_sha256":"1fbb2f377c3568f1"}},{"arxiv_id":"2306.09035","paper":"/paper/improving-explainability-of-disentangled","title":"Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iml-dkfz/m-pax_lib","path":"run_head.py","file_url":"https://github.com/iml-dkfz/m-pax_lib/blob/HEAD/run_head.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9f547bdc38fad1b9","mcp_get_code":{"code_sha256":"9f547bdc38fad1b9"}},{"arxiv_id":"2306.09035","paper":"/paper/improving-explainability-of-disentangled","title":"Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iml-dkfz/m-pax_lib","path":"run_tcvae.py","file_url":"https://github.com/iml-dkfz/m-pax_lib/blob/HEAD/run_tcvae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"00510feab827eb87","mcp_get_code":{"code_sha256":"00510feab827eb87"}},{"arxiv_id":"2306.04618","paper":"/paper/revisiting-out-of-distribution-robustness-in","title":"Revisiting Out-of-distribution Robustness in NLP: Benchmark, Analysis, and LLMs Evaluations","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/OOD_NLP","path":"src/evaluations/llm.py","file_url":"https://github.com/lifan-yuan/OOD_NLP/blob/HEAD/src/evaluations/llm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"32eb6c58d201b588","mcp_get_code":{"code_sha256":"32eb6c58d201b588"}},{"arxiv_id":"2305.00447","paper":"/paper/tallrec-an-effective-and-efficient-tuning","title":"TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendation","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sai990323/tallrec","path":"evaluate.py","file_url":"https://github.com/sai990323/tallrec/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5749594cb7ae83d4","mcp_get_code":{"code_sha256":"5749594cb7ae83d4"}},{"arxiv_id":"2305.00041","paper":"/paper/vip-nerf-visibility-prior-for-sparse-input","title":"ViP-NeRF: Visibility Prior for Sparse Input Neural Radiance Fields","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NagabhushanSN95/ViP-NeRF","path":"src/qa/01_RMSE/src/RMSE02_NeRF_LLFF.py","file_url":"https://github.com/NagabhushanSN95/ViP-NeRF/blob/HEAD/src/qa/01_RMSE/src/RMSE02_NeRF_LLFF.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f7a32b6fe532883","mcp_get_code":{"code_sha256":"4f7a32b6fe532883"}},{"arxiv_id":"2303.13824","paper":"/paper/k-nn-prompting-beyond-context-learning-with","title":"$k$NN Prompting: Beyond-Context Learning with Calibration-Free Nearest Neighbor Inference","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benfengxu/knnprompting","path":"knn_prompting.py","file_url":"https://github.com/benfengxu/knnprompting/blob/HEAD/knn_prompting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"14353319f8ba9318","mcp_get_code":{"code_sha256":"14353319f8ba9318"}},{"arxiv_id":"2303.04011","paper":"/paper/one-4-all-neural-potential-fields-for","title":"One-4-All: Neural Potential Fields for Embodied Navigation","date":"2023-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"montrealrobotics/one4all","path":"run_habitat.py","file_url":"https://github.com/montrealrobotics/one4all/blob/HEAD/run_habitat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b633a5acdd5e19ef","mcp_get_code":{"code_sha256":"b633a5acdd5e19ef"}},{"arxiv_id":"2303.04011","paper":"/paper/one-4-all-neural-potential-fields-for","title":"One-4-All: Neural Potential Fields for Embodied Navigation","date":"2023-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"montrealrobotics/one4all","path":"run_maze.py","file_url":"https://github.com/montrealrobotics/one4all/blob/HEAD/run_maze.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4cafe9021261fe0d","mcp_get_code":{"code_sha256":"4cafe9021261fe0d"}},{"arxiv_id":"2302.14705","paper":"/paper/acceltran-a-sparsity-aware-accelerator-for","title":"AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformers","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jha-lab/acceltran","path":"simulator/src/dict2ops.py","file_url":"https://github.com/jha-lab/acceltran/blob/HEAD/simulator/src/dict2ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"8532da00c39e5882","mcp_get_code":{"code_sha256":"8532da00c39e5882"}},{"arxiv_id":"2302.03269","paper":"/paper/places-prompting-language-models-for-social","title":"PLACES: Prompting Language Models for Social Conversation Synthesis","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexa/places","path":"conversation_synthesis.py","file_url":"https://github.com/alexa/places/blob/HEAD/conversation_synthesis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"3645452717ef817e","mcp_get_code":{"code_sha256":"3645452717ef817e"}},{"arxiv_id":"2301.04195","paper":"/paper/orbit-a-unified-simulation-framework-for","title":"Orbit: A Unified Simulation Framework for Interactive Robot Learning Environments","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA-Omniverse/Orbit","path":".github/actions/_lib/setup-docker-config/strip_registry_auth.py","file_url":"https://github.com/NVIDIA-Omniverse/Orbit/blob/HEAD/.github/actions/_lib/setup-docker-config/strip_registry_auth.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"e8b6f1ee81e61506","mcp_get_code":{"code_sha256":"e8b6f1ee81e61506"}},{"arxiv_id":"2301.03028","paper":"/paper/generative-time-series-forecasting-with","title":"Generative Time Series Forecasting with Diffusion, Denoise, and Disentanglement","date":"2023-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paddlepaddle/paddlespatial","path":"paddlespatial/cmdline.py","file_url":"https://github.com/paddlepaddle/paddlespatial/blob/HEAD/paddlespatial/cmdline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2f166c1fd0719e77","mcp_get_code":{"code_sha256":"2f166c1fd0719e77"}},{"arxiv_id":"2212.10554","paper":"/paper/a-length-extrapolatable-transformer","title":"A Length-Extrapolatable Transformer","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"conceptofmind/palm","path":"build_dataset.py","file_url":"https://github.com/conceptofmind/palm/blob/HEAD/build_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7ae63aa96bbc8af","mcp_get_code":{"code_sha256":"a7ae63aa96bbc8af"}},{"arxiv_id":"2211.05778","paper":"/paper/internimage-exploring-large-scale-vision","title":"InternImage: Exploring Large-Scale Vision Foundation Models with Deformable Convolutions","date":"2022-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/internimage","path":"classification/extract_feature.py","file_url":"https://github.com/opengvlab/internimage/blob/HEAD/classification/extract_feature.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f9bbcaceee97948","mcp_get_code":{"code_sha256":"5f9bbcaceee97948"}},{"arxiv_id":"2211.03779","paper":"/paper/cripp-vqa-counterfactual-reasoning-about","title":"CRIPP-VQA: Counterfactual Reasoning about Implicit Physical Properties via Video Question Answering","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maitreyapatel/CRIPP-VQA","path":"evaluation/eval_regular_qa.py","file_url":"https://github.com/Maitreyapatel/CRIPP-VQA/blob/HEAD/evaluation/eval_regular_qa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"74e9503d785fb1c2","mcp_get_code":{"code_sha256":"74e9503d785fb1c2"}},{"arxiv_id":"2211.03595","paper":"/paper/from-denoising-diffusions-to-denoising-markov","title":"From Denoising Diffusions to Denoising Markov Models","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyang-shi/generalized-diffusion","path":"main_score_sde.py","file_url":"https://github.com/yuyang-shi/generalized-diffusion/blob/HEAD/main_score_sde.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91d84e04b4ba6c0b","mcp_get_code":{"code_sha256":"91d84e04b4ba6c0b"}},{"arxiv_id":"2210.13103","paper":"/paper/deep-grey-box-modeling-with-adaptive-data","title":"Deep Grey-Box Modeling With Adaptive Data-Driven Models Toward Trustworthy Estimation of Theory-Driven Models","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"n-takeishi/deepgreybox","path":"pendulum/build_features.py","file_url":"https://github.com/n-takeishi/deepgreybox/blob/HEAD/pendulum/build_features.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07d485fe2a927d9f","mcp_get_code":{"code_sha256":"07d485fe2a927d9f"}},{"arxiv_id":"2210.13103","paper":"/paper/deep-grey-box-modeling-with-adaptive-data","title":"Deep Grey-Box Modeling With Adaptive Data-Driven Models Toward Trustworthy Estimation of Theory-Driven Models","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"n-takeishi/deepgreybox","path":"predator-prey/build_features.py","file_url":"https://github.com/n-takeishi/deepgreybox/blob/HEAD/predator-prey/build_features.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"073d8b436fdbb16e","mcp_get_code":{"code_sha256":"073d8b436fdbb16e"}},{"arxiv_id":"2210.13103","paper":"/paper/deep-grey-box-modeling-with-adaptive-data","title":"Deep Grey-Box Modeling With Adaptive Data-Driven Models Toward Trustworthy Estimation of Theory-Driven Models","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"n-takeishi/deepgreybox","path":"reaction-diffusion/build_features.py","file_url":"https://github.com/n-takeishi/deepgreybox/blob/HEAD/reaction-diffusion/build_features.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b24ab59dee88fddf","mcp_get_code":{"code_sha256":"b24ab59dee88fddf"}},{"arxiv_id":"2210.11222","paper":"/paper/private-algorithms-with-private-predictions","title":"Learning-Augmented Private Algorithms for Multiple Quantile Release","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkhodak/private-quantiles","path":"dpftrl/ftrl_noise.py","file_url":"https://github.com/mkhodak/private-quantiles/blob/HEAD/dpftrl/ftrl_noise.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0062f12dc0940a81","mcp_get_code":{"code_sha256":"0062f12dc0940a81"}},{"arxiv_id":"2210.00038","paper":"/paper/differentially-private-optimization-on-large","title":"Differentially Private Optimization on Large Model at Small Cost","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"cd53567f8d66c13e","mcp_get_code":{"code_sha256":"cd53567f8d66c13e"}},{"arxiv_id":"2210.00036","paper":"/paper/differentially-private-bias-term-only-fine","title":"Differentially Private Bias-Term Fine-tuning of Foundation Models","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/fast-differential-privacy","path":"examples/image_classification/CIFAR_TIMM.py","file_url":"https://github.com/awslabs/fast-differential-privacy/blob/HEAD/examples/image_classification/CIFAR_TIMM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1fbb306860e852f7","mcp_get_code":{"code_sha256":"1fbb306860e852f7"}},{"arxiv_id":"2208.01230","paper":"/paper/a-multifaceted-benchmarking-of-synthetic","title":"A Multifaceted Benchmarking of Synthetic Electronic Health Record Generation Models","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yy6linda/synthetic-ehr-benchmarking","path":"data_generation/uw/ae.py","file_url":"https://github.com/yy6linda/synthetic-ehr-benchmarking/blob/HEAD/data_generation/uw/ae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9fddf4e63945063","mcp_get_code":{"code_sha256":"a9fddf4e63945063"}},{"arxiv_id":"2207.08859","paper":"/paper/prior-guided-adversarial-initialization-for","title":"Prior-Guided Adversarial Initialization for Fast Adversarial Training","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiaojunQAQ/FGSM-PGI","path":"FGSM_MEP.py","file_url":"https://github.com/jiaxiaojunQAQ/FGSM-PGI/blob/HEAD/FGSM_MEP.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1ee03925b8eef465","mcp_get_code":{"code_sha256":"1ee03925b8eef465"}},{"arxiv_id":"2205.12598","paper":"/paper/robustlr-evaluating-robustness-to-logical","title":"RobustLR: Evaluating Robustness to Logical Perturbation in Deductive Reasoning","date":"2022-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/robustlr","path":"src/eval_consistency_f1.py","file_url":"https://github.com/ink-usc/robustlr/blob/HEAD/src/eval_consistency_f1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b84f4e35d56f7d5d","mcp_get_code":{"code_sha256":"b84f4e35d56f7d5d"}},{"arxiv_id":"2205.08987","paper":"/paper/trading-positional-complexity-vs-deepness-in","title":"Trading Positional Complexity vs. Deepness in Coordinate Networks","date":"2022-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osiriszjq/complex_encoding","path":"2D_random_points.py","file_url":"https://github.com/osiriszjq/complex_encoding/blob/HEAD/2D_random_points.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7746ecdd4b4e6d3","mcp_get_code":{"code_sha256":"d7746ecdd4b4e6d3"}},{"arxiv_id":"2205.08987","paper":"/paper/trading-positional-complexity-vs-deepness-in","title":"Trading Positional Complexity vs. Deepness in Coordinate Networks","date":"2022-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osiriszjq/complex_encoding","path":"2D_separable_points.py","file_url":"https://github.com/osiriszjq/complex_encoding/blob/HEAD/2D_separable_points.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"80bda3a1667c4cca","mcp_get_code":{"code_sha256":"80bda3a1667c4cca"}},{"arxiv_id":"2205.08987","paper":"/paper/trading-positional-complexity-vs-deepness-in","title":"Trading Positional Complexity vs. Deepness in Coordinate Networks","date":"2022-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osiriszjq/complex_encoding","path":"3D_random_points_GD.py","file_url":"https://github.com/osiriszjq/complex_encoding/blob/HEAD/3D_random_points_GD.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a884cd96321f23e2","mcp_get_code":{"code_sha256":"a884cd96321f23e2"}},{"arxiv_id":"2205.08987","paper":"/paper/trading-positional-complexity-vs-deepness-in","title":"Trading Positional Complexity vs. Deepness in Coordinate Networks","date":"2022-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osiriszjq/complex_encoding","path":"3D_separable_points_GD.py","file_url":"https://github.com/osiriszjq/complex_encoding/blob/HEAD/3D_separable_points_GD.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8fa27028f4b7a1e4","mcp_get_code":{"code_sha256":"8fa27028f4b7a1e4"}},{"arxiv_id":"2205.01898","paper":"/paper/go-back-in-time-generating-flashbacks-in","title":"Go Back in Time: Generating Flashbacks in Stories with Event Temporal Prompts","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PlusLabNLP/flashback_gen","path":"code/run_story_generation_pipeline_rl.py","file_url":"https://github.com/PlusLabNLP/flashback_gen/blob/HEAD/code/run_story_generation_pipeline_rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e6d898c238ea88fe","mcp_get_code":{"code_sha256":"e6d898c238ea88fe"}},{"arxiv_id":"2204.08887","paper":"/paper/cross-lingual-phrase-retrieval","title":"Cross-Lingual Phrase Retrieval","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"artetxem/vecmap","path":"map_embeddings.py","file_url":"https://github.com/artetxem/vecmap/blob/HEAD/map_embeddings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"b176513812f649dc","mcp_get_code":{"code_sha256":"b176513812f649dc"}},{"arxiv_id":"2204.01906","paper":"/paper/dynatask-a-framework-for-creating-dynamic-ai","title":"Dynatask: A Framework for Creating Dynamic AI Benchmark Tasks","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/dynabench","path":"detect_aws_credentials.py","file_url":"https://github.com/facebookresearch/dynabench/blob/HEAD/detect_aws_credentials.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"13456ae90e37a6c9","mcp_get_code":{"code_sha256":"13456ae90e37a6c9"}},{"arxiv_id":"2204.01906","paper":"/paper/dynatask-a-framework-for-creating-dynamic-ai","title":"Dynatask: A Framework for Creating Dynamic AI Benchmark Tasks","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/dynabench","path":"detect_insecure_cors_configuration.py","file_url":"https://github.com/facebookresearch/dynabench/blob/HEAD/detect_insecure_cors_configuration.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"68c90eec631e1d98","mcp_get_code":{"code_sha256":"68c90eec631e1d98"}},{"arxiv_id":"2203.01531","paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7b2a4be6c55f2514","mcp_get_code":{"code_sha256":"7b2a4be6c55f2514"}},{"arxiv_id":"2202.10054","paper":"/paper/fine-tuning-can-distort-pretrained-features","title":"Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distribution","date":"2022-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skhnha/daft","path":"ft_sgd.py","file_url":"https://github.com/skhnha/daft/blob/HEAD/ft_sgd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d3bf4b33434cf07","mcp_get_code":{"code_sha256":"0d3bf4b33434cf07"}},{"arxiv_id":"2202.00395","paper":"/paper/is-the-performance-of-my-deep-network-too","title":"Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classification","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"takashiishida/irreducible","path":"be_iclr.py","file_url":"https://github.com/takashiishida/irreducible/blob/HEAD/be_iclr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"4e3d0511afa06c49","mcp_get_code":{"code_sha256":"4e3d0511afa06c49"}},{"arxiv_id":"2111.15664","paper":"/paper/donut-document-understanding-transformer","title":"OCR-free Document Understanding Transformer","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"impira/docquery","path":"src/docquery/cmd/__main__.py","file_url":"https://github.com/impira/docquery/blob/HEAD/src/docquery/cmd/__main__.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"67438118b555068e","mcp_get_code":{"code_sha256":"67438118b555068e"}},{"arxiv_id":"2111.06283","paper":"/paper/dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karolismart/dropgnn","path":"gin-synthetic.py","file_url":"https://github.com/karolismart/dropgnn/blob/HEAD/gin-synthetic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0245c4edf22b808d","mcp_get_code":{"code_sha256":"0245c4edf22b808d"}},{"arxiv_id":"2111.05529","paper":"/paper/understanding-the-generalization-benefit-of","title":"Understanding the Generalization Benefit of Model Invariance from a Data Perspective","date":"2021-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bangann/understanding-invariance","path":"scn/run_scn.py","file_url":"https://github.com/bangann/understanding-invariance/blob/HEAD/scn/run_scn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e7df360f81b536c7","mcp_get_code":{"code_sha256":"e7df360f81b536c7"}},{"arxiv_id":"2107.09044","paper":"/paper/just-train-twice-improving-group-robustness","title":"Just Train Twice: Improving Group Robustness without Training Group Information","date":"2021-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anniesch/jtt","path":"process_training.py","file_url":"https://github.com/anniesch/jtt/blob/HEAD/process_training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"064ac4275a65d39b","mcp_get_code":{"code_sha256":"064ac4275a65d39b"}},{"arxiv_id":"2106.02190","paper":"/paper/spatial-graph-attention-and-curiosity-driven","title":"Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"njchoma/DGAPN","path":"src/dataset/preprocess.py","file_url":"https://github.com/njchoma/DGAPN/blob/HEAD/src/dataset/preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f050755aee6bf591","mcp_get_code":{"code_sha256":"f050755aee6bf591"}},{"arxiv_id":"2106.02011","paper":"/paper/provably-secure-generative-linguistic","title":"Provably Secure Generative Linguistic Steganography","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mhzzzzz/ADG-steganography","path":"adg-stega.py","file_url":"https://github.com/Mhzzzzz/ADG-steganography/blob/HEAD/adg-stega.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"316e88dce087c6c7","mcp_get_code":{"code_sha256":"316e88dce087c6c7"}},{"arxiv_id":"2105.12841","paper":"/paper/dnnv-a-framework-for-deep-neural-network","title":"DNNV: A Framework for Deep Neural Network Verification","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlshriver/DNNV","path":"dnnv/__main__.py","file_url":"https://github.com/dlshriver/DNNV/blob/HEAD/dnnv/__main__.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4c69d4ac1d0715d","mcp_get_code":{"code_sha256":"e4c69d4ac1d0715d"}},{"arxiv_id":"2105.07910","paper":"/paper/rapid-probabilistic-estimation-of-type-ia","title":"Probabilistic Reconstruction of Type Ia Supernova SN 2002bo","date":null,"month_inferred_from_arxiv_id":"2021-05","title_source":"archive","repo":"wkerzendorf/wsynphot","path":"ez_setup.py","file_url":"https://github.com/wkerzendorf/wsynphot/blob/HEAD/ez_setup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"ed75c7fad81f0b32","mcp_get_code":{"code_sha256":"ed75c7fad81f0b32"}},{"arxiv_id":"2102.11585","paper":"/paper/road-the-road-event-awareness-dataset-for","title":"ROAD: The ROad event Awareness Dataset for Autonomous Driving","date":"2021-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gurkirt/road-dataset","path":"extract_videos2jpgs.py","file_url":"https://github.com/gurkirt/road-dataset/blob/HEAD/extract_videos2jpgs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"9bb3d4f06c8a5365","mcp_get_code":{"code_sha256":"9bb3d4f06c8a5365"}},{"arxiv_id":"2012.02295","paper":"/paper/adversarial-counterfactual-learning-and-1","title":"Adversarial Counterfactual Learning and Evaluation for Recommender System","date":"2020-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StatsDLMathsRecomSys/Adversarial-Counterfactual-Learning-and-Evaluation-for-Recommender-System","path":"train_on_real.py","file_url":"https://github.com/StatsDLMathsRecomSys/Adversarial-Counterfactual-Learning-and-Evaluation-for-Recommender-System/blob/HEAD/train_on_real.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"667bf93e03cad4ad","mcp_get_code":{"code_sha256":"667bf93e03cad4ad"}},{"arxiv_id":"2012.02295","paper":"/paper/adversarial-counterfactual-learning-and-1","title":"Adversarial Counterfactual Learning and Evaluation for Recommender System","date":"2020-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StatsDLMathsRecomSys/Adversarial-Counterfactual-Learning-and-Evaluation-for-Recommender-System","path":"train_on_simulation.py","file_url":"https://github.com/StatsDLMathsRecomSys/Adversarial-Counterfactual-Learning-and-Evaluation-for-Recommender-System/blob/HEAD/train_on_simulation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7c6c618a6d1181b","mcp_get_code":{"code_sha256":"d7c6c618a6d1181b"}},{"arxiv_id":"2010.09163","paper":"/paper/d2rl-deep-dense-architectures-in-1","title":"D2RL: Deep Dense Architectures in Reinforcement Learning","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clvrai/furniture","path":"furniture/demo_rl.py","file_url":"https://github.com/clvrai/furniture/blob/HEAD/furniture/demo_rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b84ffefce914974f","mcp_get_code":{"code_sha256":"b84ffefce914974f"}},{"arxiv_id":"2008.02447","paper":"/paper/functional-regularization-for-representation","title":"Functional Regularization for Representation Learning: A Unified Theoretical Perspective","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sid7954/functional-regularization","path":"auto-encoder/func_reg.py","file_url":"https://github.com/sid7954/functional-regularization/blob/HEAD/auto-encoder/func_reg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c68fe9ee3926d757","mcp_get_code":{"code_sha256":"c68fe9ee3926d757"}},{"arxiv_id":"2008.02275","paper":"/paper/aligning-ai-with-shared-human-values","title":"Aligning AI With Shared Human Values","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/ethics","path":"commonsense/tune.py","file_url":"https://github.com/hendrycks/ethics/blob/HEAD/commonsense/tune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8010ef859ce47492","mcp_get_code":{"code_sha256":"8010ef859ce47492"}},{"arxiv_id":"2008.02275","paper":"/paper/aligning-ai-with-shared-human-values","title":"Aligning AI With Shared Human Values","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/ethics","path":"utilitarianism/tune.py","file_url":"https://github.com/hendrycks/ethics/blob/HEAD/utilitarianism/tune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2a3ad482bd3ab0de","mcp_get_code":{"code_sha256":"2a3ad482bd3ab0de"}},{"arxiv_id":"2007.13465","paper":"/paper/self-supervised-contrastive-learning-for","title":"Self-Supervised Contrastive Learning for Unsupervised Phoneme Segmentation","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felixkreuk/UnsupSeg","path":"scripts/make_timit.py","file_url":"https://github.com/felixkreuk/UnsupSeg/blob/HEAD/scripts/make_timit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5be8a66381f50a80","mcp_get_code":{"code_sha256":"5be8a66381f50a80"}},{"arxiv_id":"2006.04662","paper":"/paper/rethinking-importance-weighting-for-deep","title":"Rethinking Importance Weighting for Deep Learning under Distribution Shift","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TongtongFANG/DIW","path":"diw.py","file_url":"https://github.com/TongtongFANG/DIW/blob/HEAD/diw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"08246f66c17ce87a","mcp_get_code":{"code_sha256":"08246f66c17ce87a"}},{"arxiv_id":"2006.00873","paper":"/paper/a-generalised-signature-method-for-time","title":"A Generalised Signature Method for Multivariate Time Series Feature Extraction","date":"2020-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jambo6/generalised-signature-method","path":"get_data/human_activity.py","file_url":"https://github.com/jambo6/generalised-signature-method/blob/HEAD/get_data/human_activity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"553f187d34cf6171","mcp_get_code":{"code_sha256":"553f187d34cf6171"}},{"arxiv_id":"2005.13948","paper":"/paper/generalised-interpretable-shapelets-for","title":"Generalised Interpretable Shapelets for Irregular Time Series","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jambo6/generalised_shapelets","path":"experiments/parse_results.py","file_url":"https://github.com/jambo6/generalised_shapelets/blob/HEAD/experiments/parse_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ef3431b86d55701","mcp_get_code":{"code_sha256":"8ef3431b86d55701"}},{"arxiv_id":"2005.11041","paper":"/paper/a-survey-of-information-cascade-analysis","title":"A Survey of Information Cascade Analysis: Models, Predictions, and Recent Advances","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xovee/ccgl","path":"src/distilling.py","file_url":"https://github.com/Xovee/ccgl/blob/HEAD/src/distilling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b5ac074fd9e0047","mcp_get_code":{"code_sha256":"8b5ac074fd9e0047"}},{"arxiv_id":"2005.11041","paper":"/paper/a-survey-of-information-cascade-analysis","title":"A Survey of Information Cascade Analysis: Models, Predictions, and Recent Advances","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xovee/ccgl","path":"src/gene_emb.py","file_url":"https://github.com/Xovee/ccgl/blob/HEAD/src/gene_emb.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"103bb5930b2e4aa5","mcp_get_code":{"code_sha256":"103bb5930b2e4aa5"}},{"arxiv_id":"2005.10213","paper":"/paper/applying-the-transformer-to-character-level","title":"Applying the Transformer to Character-level Transduction","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aso-UniMelb/neural-fieldwork-guide","path":"guide/exp4_cycle1-2.py","file_url":"https://github.com/Aso-UniMelb/neural-fieldwork-guide/blob/HEAD/guide/exp4_cycle1-2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b08554160cd3bf2c","mcp_get_code":{"code_sha256":"b08554160cd3bf2c"}},{"arxiv_id":"2005.00115","paper":"/paper/learning-to-faithfully-rationalize-by","title":"Learning to Faithfully Rationalize by Construction","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"successar/FRESH","path":"Datasets/get_dataset_statistics.py","file_url":"https://github.com/successar/FRESH/blob/HEAD/Datasets/get_dataset_statistics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff594b5da33b1042","mcp_get_code":{"code_sha256":"ff594b5da33b1042"}},{"arxiv_id":"2004.06063","paper":"/paper/bleu-might-be-guilty-but-references-are-not","title":"BLEU might be Guilty but References are not Innocent","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atreyasha/semantic-isometry-nmt","path":"src/evaluate_paraphrase_detection_wmt19_paraphrases_de_en.py","file_url":"https://github.com/atreyasha/semantic-isometry-nmt/blob/HEAD/src/evaluate_paraphrase_detection_wmt19_paraphrases_de_en.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f11de371a82d101","mcp_get_code":{"code_sha256":"6f11de371a82d101"}},{"arxiv_id":"2004.05160","paper":"/paper/on-the-language-neutrality-of-pre-trained","title":"On the Language Neutrality of Pre-trained Multilingual Representations","date":"2020-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jlibovicky/assess-multilingual-bert","path":"save_centroids.py","file_url":"https://github.com/jlibovicky/assess-multilingual-bert/blob/HEAD/save_centroids.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"f141e5aaf7d9dd5b","mcp_get_code":{"code_sha256":"f141e5aaf7d9dd5b"}},{"arxiv_id":"2002.01093","paper":"/paper/on-the-interaction-between-supervision-and-1","title":"On the interaction between supervision and self-play in emergent communication","date":"2020-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"backpropper/s2p","path":"ibr_game/finetune.py","file_url":"https://github.com/backpropper/s2p/blob/HEAD/ibr_game/finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5dffc621e220f31f","mcp_get_code":{"code_sha256":"5dffc621e220f31f"}},{"arxiv_id":"1910.10683","paper":"/paper/exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nimesh-Patel/text-to-text-transfer-transformer","path":"t5/transform_checkpoints.py","file_url":"https://github.com/Nimesh-Patel/text-to-text-transfer-transformer/blob/HEAD/t5/transform_checkpoints.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"753651997d048cba","mcp_get_code":{"code_sha256":"753651997d048cba"}},{"arxiv_id":"1908.05547","paper":"/paper/beyond-cartesian-representations-for-local","title":"Beyond Cartesian Representations for Local Descriptors","date":"2019-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-epfl/log-polar-descriptors","path":"baselines/geodesc/image_matching_utils.py","file_url":"https://github.com/cvlab-epfl/log-polar-descriptors/blob/HEAD/baselines/geodesc/image_matching_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"efe5a9906bb5c441","mcp_get_code":{"code_sha256":"efe5a9906bb5c441"}},{"arxiv_id":"1905.00561","paper":"/paper/large-scale-weakly-supervised-pre-training","title":"Large-scale weakly-supervised pre-training for video action recognition","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moabitcoin/ig65m-pytorch","path":"ig65m/cli/server.py","file_url":"https://github.com/moabitcoin/ig65m-pytorch/blob/HEAD/ig65m/cli/server.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1a80caf172692d16","mcp_get_code":{"code_sha256":"1a80caf172692d16"}},{"arxiv_id":"1903.12394","paper":"/paper/informed-machine-learning-towards-a-taxonomy","title":"Informed Machine Learning -- A Taxonomy and Survey of Integrating Knowledge into Learning Systems","date":"2019-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tvhahn/weibull-knowledge-informed-ml","path":"src/models/summarize_model_results.py","file_url":"https://github.com/tvhahn/weibull-knowledge-informed-ml/blob/HEAD/src/models/summarize_model_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dae397e2987ec77f","mcp_get_code":{"code_sha256":"dae397e2987ec77f"}},{"arxiv_id":"1902.07638","paper":"/paper/random-search-and-reproducibility-for-neural","title":"Random Search and Reproducibility for Neural Architecture Search","date":"2019-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liamcli/randomNAS_release","path":"searchers/random_weight_share.py","file_url":"https://github.com/liamcli/randomNAS_release/blob/HEAD/searchers/random_weight_share.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4be4b8fdd0aa0d3a","mcp_get_code":{"code_sha256":"4be4b8fdd0aa0d3a"}},{"arxiv_id":"1811.00866","paper":"/paper/efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhaoyangLyu/FROWN","path":"train_model.py","file_url":"https://github.com/ZhaoyangLyu/FROWN/blob/HEAD/train_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"05f24c1d58d4690a","mcp_get_code":{"code_sha256":"05f24c1d58d4690a"}},{"arxiv_id":"1807.03888","paper":"/paper/a-simple-unified-framework-for-detecting-out","title":"A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attacks","date":"2018-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pokaxpoka/deep_Mahalanobis_detector","path":"OOD_Generate_Mahalanobis.py","file_url":"https://github.com/pokaxpoka/deep_Mahalanobis_detector/blob/HEAD/OOD_Generate_Mahalanobis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e950644c44d7e448","mcp_get_code":{"code_sha256":"e950644c44d7e448"}},{"arxiv_id":"1806.00271","paper":"/paper/learning-neural-random-fields-with-inclusive","title":"Generative Modeling by Inclusive Neural Random Fields with Applications in Image Generation and Anomaly Detection","date":"2018-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-spmi/Inclusive-NRF","path":"anomaly_detection/CIFAR/cifar_dec.py","file_url":"https://github.com/thu-spmi/Inclusive-NRF/blob/HEAD/anomaly_detection/CIFAR/cifar_dec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"71d9f55f1b7965c7","mcp_get_code":{"code_sha256":"71d9f55f1b7965c7"}},{"arxiv_id":"1804.02767","paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"euske/derpyolo","path":"categories.py","file_url":"https://github.com/euske/derpyolo/blob/HEAD/categories.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4870ba968478dbba","mcp_get_code":{"code_sha256":"4870ba968478dbba"}},{"arxiv_id":"1803.03635","paper":"/paper/the-lottery-ticket-hypothesis-finding-sparse","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","date":"2018-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phiandark/SiftingFeatures","path":"src/IMP.py","file_url":"https://github.com/phiandark/SiftingFeatures/blob/HEAD/src/IMP.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"37d9fe25cec668ef","mcp_get_code":{"code_sha256":"37d9fe25cec668ef"}},{"arxiv_id":"1803.02781","paper":"/paper/fast-dawid-skene-a-fast-vote-aggregation","title":"Fast Dawid-Skene: A Fast Vote Aggregation Scheme for Sentiment Classification","date":"2018-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sukrutrao/Fast-Dawid-Skene","path":"fast_dawid_skene/algorithms.py","file_url":"https://github.com/sukrutrao/Fast-Dawid-Skene/blob/HEAD/fast_dawid_skene/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c38f4d99943e145e","mcp_get_code":{"code_sha256":"c38f4d99943e145e"}},{"arxiv_id":"1710.10891","paper":"/paper/open-set-logo-detection-and-retrieval","title":"Open Set Logo Detection and Retrieval","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilmonteux/logohunter","path":"src/fetch_LogosInTheWild.py","file_url":"https://github.com/ilmonteux/logohunter/blob/HEAD/src/fetch_LogosInTheWild.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df42c201399d3c60","mcp_get_code":{"code_sha256":"df42c201399d3c60"}},{"arxiv_id":"1702.05464","paper":"/paper/adversarial-discriminative-domain-adaptation","title":"Adversarial Discriminative Domain Adaptation","date":"2017-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jvanvugt/pytorch-domain-adaptation","path":"adda.py","file_url":"https://github.com/jvanvugt/pytorch-domain-adaptation/blob/HEAD/adda.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bd934517a6aa265","mcp_get_code":{"code_sha256":"1bd934517a6aa265"}},{"arxiv_id":"1701.02720","paper":"/paper/towards-end-to-end-speech-recognition-with","title":"Towards End-to-End Speech Recognition with Deep Convolutional Neural Networks","date":"2017-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sdrobert/more-or-let","path":"stats.py","file_url":"https://github.com/sdrobert/more-or-let/blob/HEAD/stats.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fda094b2a766ba51","mcp_get_code":{"code_sha256":"fda094b2a766ba51"}},{"arxiv_id":"1606.02185","paper":"/paper/towards-a-neural-statistician","title":"Towards a Neural Statistician","date":"2016-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lupalab/flowscan","path":"demos/flowscan_demo.py","file_url":"https://github.com/lupalab/flowscan/blob/HEAD/demos/flowscan_demo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b2874edcc99ce4e6","mcp_get_code":{"code_sha256":"b2874edcc99ce4e6"}},{"arxiv_id":"1601.02655","paper":"/paper/proper-image-subtraction-optimal-transient","title":"Proper image subtraction - optimal transient detection, photometry and hypothesis testing","date":null,"month_inferred_from_arxiv_id":"2016-01","title_source":"archive","repo":"astro-sean/autophot","path":"batch_main.py","file_url":"https://github.com/astro-sean/autophot/blob/HEAD/batch_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f3450606d3b8cc5","mcp_get_code":{"code_sha256":"3f3450606d3b8cc5"}},{"arxiv_id":"1409.7495","paper":"/paper/unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jvanvugt/pytorch-domain-adaptation","path":"revgrad.py","file_url":"https://github.com/jvanvugt/pytorch-domain-adaptation/blob/HEAD/revgrad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5d9d0d6569a4d75","mcp_get_code":{"code_sha256":"b5d9d0d6569a4d75"}},{"arxiv_id":"ijcai2023_0637","paper":null,"title":"arXiv:ijcai2023_0637","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wenchiyang/pls","path":"pls/algorithms/pretrain.py","file_url":"https://github.com/wenchiyang/pls/blob/HEAD/pls/algorithms/pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"47ecc46cbb81ca47","mcp_get_code":{"code_sha256":"47ecc46cbb81ca47"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"noiseInjectionMethods/Dropout.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/noiseInjectionMethods/Dropout.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d3e4c4e4bf50b5df","mcp_get_code":{"code_sha256":"d3e4c4e4bf50b5df"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"noiseInjectionMethods/channelsShuffling.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/noiseInjectionMethods/channelsShuffling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2a26628513c31a21","mcp_get_code":{"code_sha256":"2a26628513c31a21"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"noiseInjectionMethods/maskChannels.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/noiseInjectionMethods/maskChannels.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8eb7fb79ce2b0648","mcp_get_code":{"code_sha256":"8eb7fb79ce2b0648"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"noiseInjectionMethods/maskTimeSteps.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/noiseInjectionMethods/maskTimeSteps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"00ea62a650674aad","mcp_get_code":{"code_sha256":"00ea62a650674aad"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"T-SNE/generatePlotByTSNE.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/T-SNE/generatePlotByTSNE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"17e5d811e8116768","mcp_get_code":{"code_sha256":"17e5d811e8116768"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"ablation/withoutBothMixAndNoise.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/ablation/withoutBothMixAndNoise.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7cde92138cf55291","mcp_get_code":{"code_sha256":"7cde92138cf55291"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"ablation/withoutNoise.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/ablation/withoutNoise.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b266d68b9e3d9924","mcp_get_code":{"code_sha256":"b266d68b9e3d9924"}},{"arxiv_id":"aaai_27819","paper":null,"title":"arXiv:aaai_27819","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeBreathing/DMMR","path":"ablation/witoutMix.py","file_url":"https://github.com/CodeBreathing/DMMR/blob/HEAD/ablation/witoutMix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"48019d310d735233","mcp_get_code":{"code_sha256":"48019d310d735233"}},{"arxiv_id":"2025.naacl-long.579","paper":null,"title":"arXiv:2025.naacl-long.579","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DAMO-NLP-SG/VideoLLaMA2","path":"videollama2/eval/eval_video_oqa_activitynet.py","file_url":"https://github.com/DAMO-NLP-SG/VideoLLaMA2/blob/HEAD/videollama2/eval/eval_video_oqa_activitynet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4894ebc510428b2a","mcp_get_code":{"code_sha256":"4894ebc510428b2a"}},{"arxiv_id":"2025.findings-acl.923","paper":null,"title":"arXiv:2025.findings-acl.923","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LCS2-IIITD/KD_generalization","path":"generative/commonsense_evaluate.py","file_url":"https://github.com/LCS2-IIITD/KD_generalization/blob/HEAD/generative/commonsense_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"cb4d70fedfc6772d","mcp_get_code":{"code_sha256":"cb4d70fedfc6772d"}},{"arxiv_id":"2025.findings-acl.923","paper":null,"title":"arXiv:2025.findings-acl.923","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LCS2-IIITD/KD_generalization","path":"generative/evaluate.py","file_url":"https://github.com/LCS2-IIITD/KD_generalization/blob/HEAD/generative/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0aee73d46e6a7509","mcp_get_code":{"code_sha256":"0aee73d46e6a7509"}},{"arxiv_id":"2025.emnlp-main.796","paper":null,"title":"arXiv:2025.emnlp-main.796","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yukyunglee/CheckEval","path":"src/inference_checkeval.py","file_url":"https://github.com/yukyunglee/CheckEval/blob/HEAD/src/inference_checkeval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f9dcffbc5d18908","mcp_get_code":{"code_sha256":"2f9dcffbc5d18908"}},{"arxiv_id":"2025.acl-long.289","paper":null,"title":"arXiv:2025.acl-long.289","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUC-GSAI/Llama-3-SynE","path":"src/save_hf_dataset.py","file_url":"https://github.com/RUC-GSAI/Llama-3-SynE/blob/HEAD/src/save_hf_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b801b1ed3904b7e6","mcp_get_code":{"code_sha256":"b801b1ed3904b7e6"}},{"arxiv_id":"2024.findings-emnlp.565","paper":null,"title":"arXiv:2024.findings-emnlp.565","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shroglck/llm_hallucination","path":"eval_custom_llm.py","file_url":"https://github.com/shroglck/llm_hallucination/blob/HEAD/eval_custom_llm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7de4e4c6e32cbd88","mcp_get_code":{"code_sha256":"7de4e4c6e32cbd88"}},{"arxiv_id":"2024.findings-emnlp.565","paper":null,"title":"arXiv:2024.findings-emnlp.565","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shroglck/llm_hallucination","path":"ucf_crime_llm_eval.py","file_url":"https://github.com/shroglck/llm_hallucination/blob/HEAD/ucf_crime_llm_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7f9b3cbbbbf1632b","mcp_get_code":{"code_sha256":"7f9b3cbbbbf1632b"}},{"arxiv_id":"2024.findings-acl.574","paper":null,"title":"arXiv:2024.findings-acl.574","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"euske/pdfminer","path":"pdfminer/ccitt.py","file_url":"https://github.com/euske/pdfminer/blob/HEAD/pdfminer/ccitt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b75f503cba69e4d1","mcp_get_code":{"code_sha256":"b75f503cba69e4d1"}},{"arxiv_id":"2020.findings-emnlp.444","paper":null,"title":"arXiv:2020.findings-emnlp.444","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"baidu/lac","path":"python/LAC/cmdline.py","file_url":"https://github.com/baidu/lac/blob/HEAD/python/LAC/cmdline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1f6e4eab52182c72","mcp_get_code":{"code_sha256":"1f6e4eab52182c72"}}]}