{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/set/papers/ran/2","list_of":"/method/set","method":"SET","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":12,"rows_per_page":100,"rows":[101,200],"of":1186,"counts":{"archive_papers_tagged":13419,"with_a_code_link":4158,"where_syntology_ran_a_sample":1186,"not_listed_spam_title":0,"listed":13419,"listed_where_code_ran":1186,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1038,"every_run_a_failure_of_syntologys_instrument":148,"listed_with_a_run_with_no_instrument_failure":1038,"listed_every_run_a_failure_of_syntologys_instrument":148,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/set/papers/ran/1","prev":"/method/set/papers/ran/1","next":"/method/set/papers/ran/3","papers":[{"paper":"/paper/efficientmt-efficient-temporal-adaptation-for","slug":"efficientmt-efficient-temporal-adaptation-for","title":"EfficientMT: Efficient Temporal Adaptation for Motion Transfer in Text-to-Video Diffusion Models","date":"2025-03-25","arxiv_id":"2503.19369","n_code_links":1,"syntology":{"ran":6,"of":10,"n_ran_checked":5,"n_instrument":1,"unverified":4,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["prototypenx/efficientmt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/extracting-interpretable-logic-rules-from","slug":"extracting-interpretable-logic-rules-from","title":"Extracting Interpretable Logic Rules from Graph Neural Networks","date":"2025-03-25","arxiv_id":"2503.19476","n_code_links":0,"syntology":{"ran":6,"of":7,"n_ran_checked":0,"n_instrument":6,"unverified":1,"pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/lposs-label-propagation-over-patches-and","slug":"lposs-label-propagation-over-patches-and","title":"LPOSS: Label Propagation Over Patches and Pixels for Open-vocabulary Semantic Segmentation","date":"2025-03-25","arxiv_id":"2503.19777","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["vladan-stojnic/lposs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/excot-optimizing-reasoning-for-text-to-sql","slug":"excot-optimizing-reasoning-for-text-to-sql","title":"ExCoT: Optimizing Reasoning for Text-to-SQL with Execution Feedback","date":"2025-03-25","arxiv_id":"2503.19988","n_code_links":1,"syntology":{"ran":1,"of":5,"n_ran_checked":1,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["snowflakedb/ArcticTraining"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/minimum-volume-conformal-sets-for","slug":"minimum-volume-conformal-sets-for","title":"Minimum Volume Conformal Sets for Multivariate Regression","date":"2025-03-24","arxiv_id":"2503.19068","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ElSacho/MVCS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/does-gcl-need-a-large-number-of-negative","slug":"does-gcl-need-a-large-number-of-negative","title":"Does GCL Need a Large Number of Negative Samples? Enhancing Graph Contrastive Learning with Effective and Efficient Negative Sampling","date":"2025-03-23","arxiv_id":"2503.17908","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["hedongxiao-tju/E2Neg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/temple-temporal-preference-learning-of-video","slug":"temple-temporal-preference-learning-of-video","title":"TEMPLE:Temporal Preference Learning of Video LLMs via Difficulty Scheduling and Pre-SFT Alignment","date":"2025-03-21","arxiv_id":"2503.16929","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["lscpku/temple"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/graspcot-integrating-physical-property","slug":"graspcot-integrating-physical-property","title":"GraspCoT: Integrating Physical Property Reasoning for 6-DoF Grasping under Flexible Language Instructions","date":"2025-03-20","arxiv_id":"2503.16013","n_code_links":0,"syntology":{"ran":7,"of":8,"n_ran_checked":5,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/make-your-training-flexible-towards","slug":"make-your-training-flexible-towards","title":"Make Your Training Flexible: Towards Deployment-Efficient Video Models","date":"2025-03-18","arxiv_id":"2503.14237","n_code_links":1,"syntology":{"ran":17,"of":17,"n_ran_checked":17,"n_instrument":0,"unverified":0,"pointer_only":6,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["opengvlab/fluxvit"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/dpimagebench-a-unified-benchmark-for","slug":"dpimagebench-a-unified-benchmark-for","title":"DPImageBench: A Unified Benchmark for Differentially Private Image Synthesis","date":"2025-03-18","arxiv_id":"2503.14681","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["2019chengong/dpimagebench"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/iterative-predictor-critic-code-decoding-for","slug":"iterative-predictor-critic-code-decoding-for","title":"Iterative Predictor-Critic Code Decoding for Real-World Image Dehazing","date":"2025-03-17","arxiv_id":"2503.13147","n_code_links":0,"syntology":{"ran":12,"of":20,"n_ran_checked":11,"n_instrument":1,"unverified":8,"pointer_only":20,"phrase":"12 ran (of which 9 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":null}},{"paper":"/paper/point-cache-test-time-dynamic-and","slug":"point-cache-test-time-dynamic-and","title":"Point-Cache: Test-time Dynamic and Hierarchical Cache for Robust and Generalizable Point Cloud Analysis","date":"2025-03-15","arxiv_id":"2503.12150","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["auniquesun/point-cache"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/taming-knowledge-conflicts-in-language-models","slug":"taming-knowledge-conflicts-in-language-models","title":"Taming Knowledge Conflicts in Language Models","date":"2025-03-14","arxiv_id":"2503.10996","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["GaotangLi/JUICE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/vlog-video-language-models-by-generative","slug":"vlog-video-language-models-by-generative","title":"VLog: Video-Language Models by Generative Retrieval of Narration Vocabulary","date":"2025-03-12","arxiv_id":"2503.09402","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":5,"n_instrument":2,"unverified":3,"pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["showlab/vlog"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/rewardsds-aligning-score-distillation-via","slug":"rewardsds-aligning-score-distillation-via","title":"RewardSDS: Aligning Score Distillation via Reward-Weighted Sampling","date":"2025-03-12","arxiv_id":"2503.09601","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":5,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["itaychachy/RewardSDS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/neighboring-autoregressive-modeling-for","slug":"neighboring-autoregressive-modeling-for","title":"Neighboring Autoregressive Modeling for Efficient Visual Generation","date":"2025-03-12","arxiv_id":"2503.10696","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":5,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["thisisbillhe/nar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/parametric-point-cloud-completion-for","slug":"parametric-point-cloud-completion-for","title":"Parametric Point Cloud Completion for Polygonal Surface Reconstruction","date":"2025-03-11","arxiv_id":"2503.08363","n_code_links":1,"syntology":{"ran":12,"of":18,"n_ran_checked":12,"n_instrument":0,"unverified":6,"pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["parametric-completion/paco"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/nninteractive-redefining-3d-promptable","slug":"nninteractive-redefining-3d-promptable","title":"nnInteractive: Redefining 3D Promptable Segmentation","date":"2025-03-11","arxiv_id":"2503.08373","n_code_links":4,"syntology":{"ran":8,"of":9,"n_ran_checked":7,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["mic-dkfz/napari-nninteractive","mic-dkfz/nninteractive"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/mellow-a-small-audio-language-model-for","slug":"mellow-a-small-audio-language-model-for","title":"Mellow: a small audio language model for reasoning","date":"2025-03-11","arxiv_id":"2503.08540","n_code_links":1,"syntology":{"ran":3,"of":6,"n_ran_checked":2,"n_instrument":1,"unverified":3,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["soham97/mellow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/representing-3d-shapes-with-64-latent-vectors","slug":"representing-3d-shapes-with-64-latent-vectors","title":"Representing 3D Shapes With 64 Latent Vectors for 3D Diffusion Models","date":"2025-03-11","arxiv_id":"2503.08737","n_code_links":0,"syntology":{"ran":4,"of":9,"n_ran_checked":4,"n_instrument":0,"unverified":5,"pointer_only":9,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/group-robust-sample-reweighting-for","slug":"group-robust-sample-reweighting-for","title":"Group-robust Sample Reweighting for Subpopulation Shifts via Influence Functions","date":"2025-03-10","arxiv_id":"2503.07315","n_code_links":1,"syntology":{"ran":4,"of":14,"n_ran_checked":2,"n_instrument":2,"unverified":10,"pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","official":{"repos":["qiaoruiyt/gsr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":10,"ran_from_kinds":["official"]}}},{"paper":"/paper/repost-scalable-repository-level-coding","slug":"repost-scalable-repository-level-coding","title":"RepoST: Scalable Repository-Level Coding Environment Construction with Sandbox Testing","date":"2025-03-10","arxiv_id":"2503.07358","n_code_links":1,"syntology":{"ran":11,"of":18,"n_ran_checked":11,"n_instrument":0,"unverified":7,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","official":{"repos":["yiqingxyq/RepoST"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/bingoguard-llm-content-moderation-tools-with","slug":"bingoguard-llm-content-moderation-tools-with","title":"BingoGuard: LLM Content Moderation Tools with Risk Levels","date":"2025-03-09","arxiv_id":"2503.06550","n_code_links":0,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/automated-proof-of-polynomial-inequalities","slug":"automated-proof-of-polynomial-inequalities","title":"Automated Proof of Polynomial Inequalities via Reinforcement Learning","date":"2025-03-09","arxiv_id":"2503.06592","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["blliu6/appirl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/exploring-interpretability-for-visual-prompt","slug":"exploring-interpretability-for-visual-prompt","title":"Exploring Interpretability for Visual Prompt Tuning with Hierarchical Concepts","date":"2025-03-08","arxiv_id":"2503.06084","n_code_links":0,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":5,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/adversarial-policy-optimization-for-offline","slug":"adversarial-policy-optimization-for-offline","title":"Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning","date":"2025-03-07","arxiv_id":"2503.05306","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["oh-lab/APPO"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":"/paper/protcomposer-compositional-protein-structure","slug":"protcomposer-compositional-protein-structure","title":"ProtComposer: Compositional Protein Structure Generation with 3D Ellipsoids","date":"2025-03-06","arxiv_id":"2503.05025","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":4,"n_instrument":3,"unverified":0,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["nvlabs/protcomposer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/doracycle-domain-oriented-adaptation-of","slug":"doracycle-domain-oriented-adaptation-of","title":"DoraCycle: Domain-Oriented Adaptation of Unified Generative Model in Multimodal Cycles","date":"2025-03-05","arxiv_id":"2503.03651","n_code_links":1,"syntology":{"ran":12,"of":13,"n_ran_checked":10,"n_instrument":2,"unverified":1,"pointer_only":8,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["showlab/doracycle"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/when-can-you-get-away-with-low-memory-adam","slug":"when-can-you-get-away-with-low-memory-adam","title":"When Can You Get Away with Low Memory Adam?","date":"2025-03-03","arxiv_id":"2503.01843","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["dayal-kalra/low-memory-adam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/proteina-scaling-flow-based-protein-structure","slug":"proteina-scaling-flow-based-protein-structure","title":"Proteina: Scaling Flow-based Protein Structure Generative Models","date":"2025-03-02","arxiv_id":"2503.00710","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["NVIDIA-Digital-Bio/proteina"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":"/paper/how-to-probe-simple-yet-effective-techniques","slug":"how-to-probe-simple-yet-effective-techniques","title":"How to Probe: Simple Yet Effective Techniques for Improving Post-hoc Explanations","date":"2025-03-01","arxiv_id":"2503.00641","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["sidgairo18/how-to-probe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/reinforcement-learning-with-combinatorial-1","slug":"reinforcement-learning-with-combinatorial-1","title":"Reinforcement learning with combinatorial actions for coupled restless bandits","date":"2025-03-01","arxiv_id":"2503.01919","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lily-x/combinatorial-rmab"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/towards-practical-real-time-neural-video","slug":"towards-practical-real-time-neural-video","title":"Towards Practical Real-Time Neural Video Compression","date":"2025-02-28","arxiv_id":"2502.20762","n_code_links":1,"syntology":{"ran":23,"of":34,"n_ran_checked":14,"n_instrument":9,"unverified":11,"pointer_only":0,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 9 where Syntology's instrument failed) · 11 unverified","official":{"repos":["microsoft/dcvc"],"state":"official (archive's flag): 23 ran","n_ran":23,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":11,"ran_from_kinds":["official"]}}},{"paper":"/paper/reward-learning-from-multiple-feedback-types","slug":"reward-learning-from-multiple-feedback-types","title":"Reward Learning from Multiple Feedback Types","date":"2025-02-28","arxiv_id":"2502.21038","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":13,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["ymetz/multi-type-feedback"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/finereason-evaluating-and-improving-llms","slug":"finereason-evaluating-and-improving-llms","title":"FINEREASON: Evaluating and Improving LLMs' Deliberate Reasoning through Reflective Puzzle Solving","date":"2025-02-27","arxiv_id":"2502.20238","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["DAMO-NLP-SG/FineReason"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/big-bench-extra-hard","slug":"big-bench-extra-hard","title":"BIG-Bench Extra Hard","date":"2025-02-26","arxiv_id":"2502.19187","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["google-deepmind/bbeh"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/sassha-sharpness-aware-adaptive-second-order","slug":"sassha-sharpness-aware-adaptive-second-order","title":"SASSHA: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximation","date":"2025-02-25","arxiv_id":"2502.18153","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["LOG-postech/Sassha"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/art-anonymous-region-transformer-for-variable","slug":"art-anonymous-region-transformer-for-variable","title":"ART: Anonymous Region Transformer for Variable Multi-Layer Transparent Image Generation","date":"2025-02-25","arxiv_id":"2502.18364","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":12,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/function-space-learning-rates","slug":"function-space-learning-rates","title":"Function-Space Learning Rates","date":"2025-02-24","arxiv_id":"2502.17405","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["edwardmilsom/function-space-learning-rates-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/probe-pruning-accelerating-llms-through","slug":"probe-pruning-accelerating-llms-through","title":"Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probing","date":"2025-02-21","arxiv_id":"2502.15618","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["qi-le1/probe_pruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/sparsity-may-be-all-you-need-sparse-random","slug":"sparsity-may-be-all-you-need-sparse-random","title":"Sparsity May Be All You Need: Sparse Random Parameter Adaptation","date":"2025-02-21","arxiv_id":"2502.15975","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["IBM/SpaRTA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/scope-a-self-supervised-framework-for","slug":"scope-a-self-supervised-framework-for","title":"SCOPE: A Self-supervised Framework for Improving Faithfulness in Conditional Text Generation","date":"2025-02-19","arxiv_id":"2502.13674","n_code_links":0,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":null}},{"paper":"/paper/exploring-the-potential-of-large-language-12","slug":"exploring-the-potential-of-large-language-12","title":"Exploring the Potential of Large Language Models to Simulate Personality","date":"2025-02-12","arxiv_id":"2502.08265","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":2,"n_instrument":4,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["mary-silence/simulating_personality"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/brain-latent-progression-individual-based","slug":"brain-latent-progression-individual-based","title":"Brain Latent Progression: Individual-based Spatiotemporal Disease Progression on 3D Brain MRIs via Latent Diffusion","date":"2025-02-12","arxiv_id":"2502.08560","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["lemuelpuglisi/brlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/training-deep-learning-models-with-norm","slug":"training-deep-learning-models-with-norm","title":"Training Deep Learning Models with Norm-Constrained LMOs","date":"2025-02-11","arxiv_id":"2502.07529","n_code_links":2,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["lions-epfl/scion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/instance-dependent-early-stopping","slug":"instance-dependent-early-stopping","title":"Instance-dependent Early Stopping","date":"2025-02-11","arxiv_id":"2502.07547","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":0,"n_instrument":3,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["tmllab/2025_ICLR_IES"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/goedel-prover-a-frontier-model-for-open","slug":"goedel-prover-a-frontier-model-for-open","title":"Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving","date":"2025-02-11","arxiv_id":"2502.07640","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Goedel-LM/Goedel-Prover"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-clustering-based-prototypes-for","slug":"learning-clustering-based-prototypes-for","title":"Learning Clustering-based Prototypes for Compositional Zero-shot Learning","date":"2025-02-10","arxiv_id":"2502.06501","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["quhongyu/cluspro"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/large-language-models-meet-symbolic-provers","slug":"large-language-models-meet-symbolic-provers","title":"Large Language Models Meet Symbolic Provers for Logical Reasoning Evaluation","date":"2025-02-10","arxiv_id":"2502.06563","n_code_links":1,"syntology":{"ran":3,"of":6,"n_ran_checked":2,"n_instrument":1,"unverified":3,"pointer_only":6,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["opendatalab/provergen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/conrft-a-reinforced-fine-tuning-method-for","slug":"conrft-a-reinforced-fine-tuning-method-for","title":"ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy","date":"2025-02-08","arxiv_id":"2502.05450","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["cccedric/conrft"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-conformal-abstention-policies-for","slug":"learning-conformal-abstention-policies-for","title":"Learning Conformal Abstention Policies for Adaptive Risk Management in Large Language and Vision-Language Models","date":"2025-02-08","arxiv_id":"2502.06884","n_code_links":1,"syntology":{"ran":8,"of":16,"n_ran_checked":8,"n_instrument":0,"unverified":8,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","official":{"repos":["sinatayebati/vlm-uncertainty"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/sirius-self-improving-multi-agent-systems-via","slug":"sirius-self-improving-multi-agent-systems-via","title":"SiriuS: Self-improving Multi-agent Systems via Bootstrapped Reasoning","date":"2025-02-07","arxiv_id":"2502.04780","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["zou-group/sirius"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/itbench-evaluating-ai-agents-across-diverse","slug":"itbench-evaluating-ai-agents-across-diverse","title":"ITBench: Evaluating AI Agents across Diverse Real-World IT Automation Tasks","date":"2025-02-07","arxiv_id":"2502.05352","n_code_links":2,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["IBM/itbench-sample-scenarios","IBM/itbench-sre-agent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/speculative-prefill-turbocharging-ttft-with","slug":"speculative-prefill-turbocharging-ttft-with","title":"Speculative Prefill: Turbocharging TTFT with Lightweight and Training-Free Token Importance Estimation","date":"2025-02-05","arxiv_id":"2502.02789","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["Jingyu6/speculative_prefill"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-probabilistic-inference-approach-to","slug":"a-probabilistic-inference-approach-to","title":"A Probabilistic Inference Approach to Inference-Time Scaling of LLMs using Particle-Based Monte Carlo Methods","date":"2025-02-03","arxiv_id":"2502.01618","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Red-Hat-AI-Innovation-Team/its_hub"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/beyond-the-permutation-symmetry-of","slug":"beyond-the-permutation-symmetry-of","title":"Beyond the Permutation Symmetry of Transformers: The Role of Rotation for Model Fusion","date":"2025-02-01","arxiv_id":"2502.00264","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":0,"n_instrument":5,"unverified":3,"pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","official":{"repos":["zhengzaiyi/rotationsymmetry"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/redefining-machine-unlearning-a-conformal","slug":"redefining-machine-unlearning-a-conformal","title":"Redefining Machine Unlearning: A Conformal Prediction-Motivated Approach","date":"2025-01-31","arxiv_id":"2501.19403","n_code_links":0,"syntology":{"ran":10,"of":13,"n_ran_checked":10,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/diversity-by-design-leveraging-distribution","slug":"diversity-by-design-leveraging-distribution","title":"Diversity By Design: Leveraging Distribution Matching for Offline Model-Based Optimization","date":"2025-01-30","arxiv_id":"2501.18768","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":8,"n_instrument":2,"unverified":2,"pointer_only":0,"phrase":"10 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["michael-s-yao/dynamo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":4,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/improving-genetic-programming-for-symbolic","slug":"improving-genetic-programming-for-symbolic","title":"Improving Genetic Programming for Symbolic Regression with Equality Graphs","date":"2025-01-29","arxiv_id":"2501.17848","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["folivetti/eggp_paper_GECCO","folivetti/srtree"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/towards-general-purpose-model-free","slug":"towards-general-purpose-model-free","title":"Towards General-Purpose Model-Free Reinforcement Learning","date":"2025-01-27","arxiv_id":"2501.16142","n_code_links":0,"syntology":{"ran":5,"of":9,"n_ran_checked":4,"n_instrument":1,"unverified":4,"pointer_only":4,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":"/paper/causal-discovery-via-bayesian-optimization","slug":"causal-discovery-via-bayesian-optimization","title":"Causal Discovery via Bayesian Optimization","date":"2025-01-25","arxiv_id":"2501.14997","n_code_links":1,"syntology":{"ran":13,"of":16,"n_ran_checked":9,"n_instrument":4,"unverified":3,"pointer_only":1,"phrase":"13 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","official":{"repos":["baosws/drbo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/leveraging-online-olympiad-level-math","slug":"leveraging-online-olympiad-level-math","title":"Leveraging Online Olympiad-Level Math Problems for LLMs Training and Contamination-Resistant Evaluation","date":"2025-01-24","arxiv_id":"2501.14275","n_code_links":2,"syntology":{"ran":10,"of":11,"n_ran_checked":10,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["dsl-lab/aops"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/investigating-the-de-composition-capabilities","slug":"investigating-the-de-composition-capabilities","title":"Investigating the (De)Composition Capabilities of Large Language Models in Natural-to-Formal Language Conversion","date":"2025-01-24","arxiv_id":"2501.14649","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["xzy-xzy/dedc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/beyond-task-diversity-provable-representation","slug":"beyond-task-diversity-provable-representation","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","date":"2025-01-23","arxiv_id":"2501.13390","n_code_links":1,"syntology":{"ran":11,"of":13,"n_ran_checked":4,"n_instrument":7,"unverified":2,"pointer_only":0,"phrase":"11 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","official":{"repos":["duongnhatthang/BOSS"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/automating-high-quality-rt-planning-at-scale","slug":"automating-high-quality-rt-planning-at-scale","title":"Automating High Quality RT Planning at Scale","date":"2025-01-21","arxiv_id":"2501.11803","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["riqianggao/gdp-hmm_aapmchallenge"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/edgetam-on-device-track-anything-model","slug":"edgetam-on-device-track-anything-model","title":"EdgeTAM: On-Device Track Anything Model","date":"2025-01-13","arxiv_id":"2501.07256","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":4,"n_instrument":3,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["facebookresearch/edgetam"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"paper":"/paper/enhancing-unsupervised-graph-few-shot","slug":"enhancing-unsupervised-graph-few-shot","title":"Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport","date":"2025-01-10","arxiv_id":"2501.05635","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["keaml-jlu/star"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/interpretable-enzyme-function-prediction-via","slug":"interpretable-enzyme-function-prediction-via","title":"Interpretable Enzyme Function Prediction via Residue-Level Detection","date":"2025-01-10","arxiv_id":"2501.05644","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":7,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["yangzhao1230/protdetr"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","slug":"q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","arxiv_id":"2501.05906","n_code_links":1,"syntology":{"ran":5,"of":10,"n_ran_checked":5,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["JayC1208/Q-MAML"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/demystifying-domain-adaptive-post-training","slug":"demystifying-domain-adaptive-post-training","title":"Demystifying Domain-adaptive Post-training for Financial LLMs","date":"2025-01-09","arxiv_id":"2501.04961","n_code_links":1,"syntology":{"ran":9,"of":13,"n_ran_checked":7,"n_instrument":2,"unverified":4,"pointer_only":13,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["salesforceairesearch/findap"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/registering-source-tokens-to-target-language","slug":"registering-source-tokens-to-target-language","title":"Registering Source Tokens to Target Language Spaces in Multilingual Neural Machine Translation","date":"2025-01-06","arxiv_id":"2501.02979","n_code_links":3,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zhiqu22/mitre","huggingface.co/naist-nlp/mitre_466m","huggingface.co/naist-nlp/mitre_913m"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/unifying-specialized-visual-encoders-for","slug":"unifying-specialized-visual-encoders-for","title":"Unifying Specialized Visual Encoders for Video Language Models","date":"2025-01-02","arxiv_id":"2501.01426","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["princetonvisualai/merv"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/ocrbench-v2-an-improved-benchmark-for","slug":"ocrbench-v2-an-improved-benchmark-for","title":"OCRBench v2: An Improved Benchmark for Evaluating Large Multimodal Models on Visual Text Localization and Reasoning","date":"2024-12-31","arxiv_id":"2501.00321","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":9,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["yuliang-liu/multimodalocr"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/rag-instruct-boosting-llms-with-diverse","slug":"rag-instruct-boosting-llms-with-diverse","title":"RAG-Instruct: Boosting LLMs with Diverse Retrieval-Augmented Instructions","date":"2024-12-31","arxiv_id":"2501.00353","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":0,"n_instrument":6,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","official":{"repos":["freedomintelligence/rag-instruct"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/free-the-design-space-of-equivariant-graph","slug":"free-the-design-space-of-equivariant-graph","title":"High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces","date":"2024-12-24","arxiv_id":"2412.18263","n_code_links":1,"syntology":{"ran":2,"of":7,"n_ran_checked":2,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["shihaoshao-gh/ict-decomposition-and-equivariant-bases"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/citebart-learning-to-generate-citations-for","slug":"citebart-learning-to-generate-citations-for","title":"CiteBART: Learning to Generate Citations for Local Citation Recommendation","date":"2024-12-23","arxiv_id":"2412.17534","n_code_links":1,"syntology":{"ran":12,"of":16,"n_ran_checked":12,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["eyclk/citationrecommendation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/reconstructing-people-places-and-cameras","slug":"reconstructing-people-places-and-cameras","title":"Reconstructing People, Places, and Cameras","date":"2024-12-23","arxiv_id":"2412.17806","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hongsukchoi/hsfm_release"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/pre-training-graph-neural-networks-on-1","slug":"pre-training-graph-neural-networks-on-1","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2024-12-20","arxiv_id":"2412.15589","n_code_links":2,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["NSLab-CUK/S-CGIB"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/multi-concept-model-immunization-through","slug":"multi-concept-model-immunization-through","title":"Multi-concept Model Immunization through Differentiable Model Merging","date":"2024-12-19","arxiv_id":"2412.15320","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["amberyzheng/MIMA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/offline-safe-reinforcement-learning-using","slug":"offline-safe-reinforcement-learning-using","title":"Offline Safe Reinforcement Learning Using Trajectory Classification","date":"2024-12-19","arxiv_id":"2412.15429","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zgong11/TraC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/when-should-we-prefer-state-to-visual-dagger","slug":"when-should-we-prefer-state-to-visual-dagger","title":"When Should We Prefer State-to-Visual DAgger Over Visual Reinforcement Learning?","date":"2024-12-18","arxiv_id":"2412.13662","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":0,"n_instrument":2,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["tongzhoumu/s2v-dagger"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/llava-uhd-v2-an-mllm-integrating-high","slug":"llava-uhd-v2-an-mllm-integrating-high","title":"LLaVA-UHD v2: an MLLM Integrating High-Resolution Feature Pyramid via Hierarchical Window Transformer","date":"2024-12-18","arxiv_id":"2412.13871","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":5,"n_instrument":2,"unverified":4,"pointer_only":5,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["thunlp/llava-uhd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/benchmarking-and-understanding-compositional","slug":"benchmarking-and-understanding-compositional","title":"Benchmarking and Understanding Compositional Relational Reasoning of LLMs","date":"2024-12-17","arxiv_id":"2412.12841","n_code_links":1,"syntology":{"ran":1,"of":5,"n_ran_checked":0,"n_instrument":1,"unverified":4,"pointer_only":5,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["caiyun-ai/gar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/concept-rot-poisoning-concepts-in-large","slug":"concept-rot-poisoning-concepts-in-large","title":"Concept-ROT: Poisoning Concepts in Large Language Models with Model Editing","date":"2024-12-17","arxiv_id":"2412.13341","n_code_links":1,"syntology":{"ran":8,"of":10,"n_ran_checked":7,"n_instrument":1,"unverified":2,"pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["keltin13/concept-rot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-policy-adaptation-with-contrastive-1","slug":"efficient-policy-adaptation-with-contrastive-1","title":"Efficient Policy Adaptation with Contrastive Prompt Ensemble for Embodied Agents","date":"2024-12-16","arxiv_id":"2412.11484","n_code_links":0,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":null}},{"paper":"/paper/going-beyond-feature-similarity-effective","slug":"going-beyond-feature-similarity-effective","title":"Going Beyond Feature Similarity: Effective Dataset Distillation based on Class-Aware Conditional Mutual Information","date":"2024-12-13","arxiv_id":"2412.09945","n_code_links":1,"syntology":{"ran":8,"of":9,"n_ran_checked":7,"n_instrument":1,"unverified":1,"pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["ndhg1213/cmidd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/covered-forest-fine-grained-generalization","slug":"covered-forest-fine-grained-generalization","title":"Covered Forest: Fine-grained generalization analysis of graph neural networks","date":"2024-12-10","arxiv_id":"2412.07106","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":4,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["benfinkelshtein/CoveredForests"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-method-for-evaluating-hyperparameter","slug":"a-method-for-evaluating-hyperparameter","title":"A Method for Evaluating Hyperparameter Sensitivity in Reinforcement Learning","date":"2024-12-10","arxiv_id":"2412.07165","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jadkins99/hyperparameter_sensitivity"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/bayesian-optimization-of-antibodies-informed","slug":"bayesian-optimization-of-antibodies-informed","title":"Bayesian Optimization of Antibodies Informed by a Generative Model of Evolving Sequences","date":"2024-12-10","arxiv_id":"2412.07763","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":6,"n_instrument":3,"unverified":3,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["alannawzadamin/clonebo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-diffusion-posterior-sampling-via","slug":"on-diffusion-posterior-sampling-via","title":"On Diffusion Posterior Sampling via Sequential Monte Carlo for Zero-Shot Scaffolding of Protein Motifs","date":"2024-12-08","arxiv_id":"2412.05788","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["matsagad/mres-project"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/post-hoc-probabilistic-vision-language-models","slug":"post-hoc-probabilistic-vision-language-models","title":"Post-hoc Probabilistic Vision-Language Models","date":"2024-12-08","arxiv_id":"2412.06014","n_code_links":1,"syntology":{"ran":7,"of":13,"n_ran_checked":2,"n_instrument":5,"unverified":6,"pointer_only":5,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","official":{"repos":["AaltoML/BayesVLM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/kasa-knowledge-aware-singular-value","slug":"kasa-knowledge-aware-singular-value","title":"KaSA: Knowledge-Aware Singular-Value Adaptation of Large Language Models","date":"2024-12-08","arxiv_id":"2412.06071","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":4,"n_instrument":0,"unverified":4,"pointer_only":8,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["juyongjiang/kasa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/smoothie-label-free-language-model-routing","slug":"smoothie-label-free-language-model-routing","title":"Smoothie: Label Free Language Model Routing","date":"2024-12-06","arxiv_id":"2412.04692","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hazyresearch/smoothie"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/towards-effective-genai-multi-agent","slug":"towards-effective-genai-multi-agent","title":"Towards Effective GenAI Multi-Agent Collaboration: Design and Evaluation for Enterprise Applications","date":"2024-12-06","arxiv_id":"2412.05449","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["aws-samples/multiagent-collab-scenario-benchmark"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/zipar-accelerating-autoregressive-image","slug":"zipar-accelerating-autoregressive-image","title":"ZipAR: Accelerating Auto-regressive Image Generation through Spatial Locality","date":"2024-12-05","arxiv_id":"2412.04062","n_code_links":1,"syntology":{"ran":7,"of":12,"n_ran_checked":6,"n_instrument":1,"unverified":5,"pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["ThisisBillhe/ZipAR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/pangaea-a-global-and-inclusive-benchmark-for","slug":"pangaea-a-global-and-inclusive-benchmark-for","title":"PANGAEA: A Global and Inclusive Benchmark for Geospatial Foundation Models","date":"2024-12-05","arxiv_id":"2412.04204","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["vmarsocci/pangaea-bench"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/3d-part-segmentation-via-geometric","slug":"3d-part-segmentation-via-geometric","title":"3D Part Segmentation via Geometric Aggregation of 2D Visual Features","date":"2024-12-05","arxiv_id":"2412.04247","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["marco-garosi/COPS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/visionzip-longer-is-better-but-not-necessary","slug":"visionzip-longer-is-better-but-not-necessary","title":"VisionZip: Longer is Better but Not Necessary in Vision Language Models","date":"2024-12-05","arxiv_id":"2412.04467","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":7,"n_instrument":1,"unverified":3,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["dvlab-research/visionzip"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/arc-prize-2024-technical-report","slug":"arc-prize-2024-technical-report","title":"ARC Prize 2024: Technical Report","date":"2024-12-05","arxiv_id":"2412.04604","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["michaelhodel/re-arc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/accdiffusion-v2-towards-more-accurate-higher","slug":"accdiffusion-v2-towards-more-accurate-higher","title":"AccDiffusion v2: Towards More Accurate Higher-Resolution Diffusion Extrapolation","date":"2024-12-03","arxiv_id":"2412.02099","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":3,"n_instrument":2,"unverified":1,"pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["lzhxmu/accdiffusion_v2"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"12e48f782ab42b2486ac7e571dae27075a43354e2ed17328ea7834454c8ce277","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}