{"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":"/task/computational-efficiency/papers/ran/1","list_of":"/task/computational-efficiency","task":"Computational Efficiency","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_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 run it on this task or check it against the task's benchmarks.","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":1,"pages_in_order":4,"rows_per_page":100,"rows":[1,100],"of":369,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"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":"/task/computational-efficiency/papers/ran/1","prev":null,"next":"/task/computational-efficiency/papers/ran/2","papers":[{"url":"/paper/u-rwkv-lightweight-medical-image-segmentation","slug":"u-rwkv-lightweight-medical-image-segmentation","title":"U-RWKV: Lightweight medical image segmentation with direction-adaptive RWKV","date":"2025-07-15","arxiv_id":"2507.11415","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/u-rwkv-lightweight-medical-image-segmentation#ran","syntology_url":"https://syntology.ai/paper/2507.11415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.11415"}},"official":{"repos":["hbyecoding/u-rwkv"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fadrm-fast-and-accurate-data-residual","slug":"fadrm-fast-and-accurate-data-residual","title":"FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation","date":"2025-06-30","arxiv_id":"2506.24125","repositories_listed":1,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":14,"n_pointer_only":3,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 1 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fadrm-fast-and-accurate-data-residual#ran","syntology_url":"https://syntology.ai/paper/2506.24125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.24125"}},"official":{"repos":["jiacheng8/fadrm"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/expressive-score-based-priors-for","slug":"expressive-score-based-priors-for","title":"Expressive Score-Based Priors for Distribution Matching with Geometry-Preserving Regularization","date":"2025-06-17","arxiv_id":"2506.14607","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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","sample_list":"/paper/expressive-score-based-priors-for#ran","syntology_url":"https://syntology.ai/paper/2506.14607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14607"}},"official":{"repos":["inouye-lab/saub"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-four-color-theorem-for-cell-instance","slug":"the-four-color-theorem-for-cell-instance","title":"The Four Color Theorem for Cell Instance Segmentation","date":"2025-06-11","arxiv_id":"2506.09724","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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","sample_list":"/paper/the-four-color-theorem-for-cell-instance#ran","syntology_url":"https://syntology.ai/paper/2506.09724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.09724"}},"official":{"repos":["zhangye-zoe/fcis"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/offline-rl-with-smooth-ood-generalization-in","slug":"offline-rl-with-smooth-ood-generalization-in","title":"Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood","date":"2025-06-10","arxiv_id":"2506.08417","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/offline-rl-with-smooth-ood-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2506.08417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08417"}},"official":{"repos":["yqpqry/sqog"],"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"]}}},{"url":"/paper/rulereasoner-reinforced-rule-based-reasoning","slug":"rulereasoner-reinforced-rule-based-reasoning","title":"RuleReasoner: Reinforced Rule-based Reasoning via Domain-aware Dynamic Sampling","date":"2025-06-10","arxiv_id":"2506.08672","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/rulereasoner-reinforced-rule-based-reasoning#ran","syntology_url":"https://syntology.ai/paper/2506.08672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08672"}},"official":{"repos":["bigai-nlco/rulereasoner"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-wavelet-diffusion-enabling-4k-image","slug":"latent-wavelet-diffusion-enabling-4k-image","title":"Latent Wavelet Diffusion: Enabling 4K Image Synthesis for Free","date":"2025-05-31","arxiv_id":"2506.00433","repositories_listed":0,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/latent-wavelet-diffusion-enabling-4k-image#ran","syntology_url":"https://syntology.ai/paper/2506.00433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.00433"}},"official":null}},{"url":"/paper/hyperbolic-dataset-distillation","slug":"hyperbolic-dataset-distillation","title":"Hyperbolic Dataset Distillation","date":"2025-05-30","arxiv_id":"2505.24623","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/hyperbolic-dataset-distillation#ran","syntology_url":"https://syntology.ai/paper/2505.24623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24623"}},"official":{"repos":["Guang000/Awesome-Dataset-Distillation"],"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"]}}},{"url":"/paper/k-2-ie-kernel-method-based-kernel-intensity","slug":"k-2-ie-kernel-method-based-kernel-intensity","title":"K$^2$IE: Kernel Method-based Kernel Intensity Estimators for Inhomogeneous Poisson Processes","date":"2025-05-30","arxiv_id":"2505.24704","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/k-2-ie-kernel-method-based-kernel-intensity#ran","syntology_url":"https://syntology.ai/paper/2505.24704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24704"}},"official":{"repos":["hidkim/k2ie"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/geo-sign-hyperbolic-contrastive-1","slug":"geo-sign-hyperbolic-contrastive-1","title":"Geo-Sign: Hyperbolic Contrastive Regularisation for Geometrically Aware Sign Language Translation","date":"2025-05-30","arxiv_id":"2506.00129","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/geo-sign-hyperbolic-contrastive-1#ran","syntology_url":"https://syntology.ai/paper/2506.00129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.00129"}},"official":{"repos":["ed-fish/Geo-Sign"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/faithful-group-shapley-value","slug":"faithful-group-shapley-value","title":"Faithful Group Shapley Value","date":"2025-05-25","arxiv_id":"2505.19013","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/faithful-group-shapley-value#ran","syntology_url":"https://syntology.ai/paper/2505.19013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19013"}},"official":{"repos":["kiljael/faithful_gsv"],"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"]}}},{"url":"/paper/limopro-reasoning-refinement-for-efficient","slug":"limopro-reasoning-refinement-for-efficient","title":"LIMOPro: Reasoning Refinement for Efficient and Effective Test-time Scaling","date":"2025-05-25","arxiv_id":"2505.19187","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 2 unverified","sample_list":"/paper/limopro-reasoning-refinement-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2505.19187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19187"}},"official":{"repos":["gair-nlp/limopro"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/partition-generative-modeling-masked-modeling","slug":"partition-generative-modeling-masked-modeling","title":"Partition Generative Modeling: Masked Modeling Without Masks","date":"2025-05-24","arxiv_id":"2505.18883","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":12,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/partition-generative-modeling-masked-modeling#ran","syntology_url":"https://syntology.ai/paper/2505.18883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.18883"}},"official":{"repos":["kuleshov-group/mdlm"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/attributing-response-to-context-a-jensen","slug":"attributing-response-to-context-a-jensen","title":"Attributing Response to Context: A Jensen-Shannon Divergence Driven Mechanistic Study of Context Attribution in Retrieval-Augmented Generation","date":"2025-05-22","arxiv_id":"2505.16415","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/attributing-response-to-context-a-jensen#ran","syntology_url":"https://syntology.ai/paper/2505.16415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16415"}},"official":null}},{"url":"/paper/neighbour-driven-gaussian-process-variational","slug":"neighbour-driven-gaussian-process-variational","title":"Neighbour-Driven Gaussian Process Variational Autoencoders for Scalable Structured Latent Modelling","date":"2025-05-22","arxiv_id":"2505.16481","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/neighbour-driven-gaussian-process-variational#ran","syntology_url":"https://syntology.ai/paper/2505.16481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16481"}},"official":{"repos":["shixinxing/nngpvae-official"],"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"]}}},{"url":"/paper/monosplat-generalizable-3d-gaussian-splatting","slug":"monosplat-generalizable-3d-gaussian-splatting","title":"MonoSplat: Generalizable 3D Gaussian Splatting from Monocular Depth Foundation Models","date":"2025-05-21","arxiv_id":"2505.15185","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 5 unverified","sample_list":"/paper/monosplat-generalizable-3d-gaussian-splatting#ran","syntology_url":"https://syntology.ai/paper/2505.15185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.15185"}},"official":{"repos":["cuhk-aim-group/monosplat"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/quantum-optimization-via-gradient-based","slug":"quantum-optimization-via-gradient-based","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","date":"2025-05-20","arxiv_id":"2505.14670","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":1,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":9,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 9 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantum-optimization-via-gradient-based#ran","syntology_url":"https://syntology.ai/paper/2505.14670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14670"}},"official":{"repos":["jiaqileng/gradient-based-qhd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/continuous-thought-machines","slug":"continuous-thought-machines","title":"Continuous Thought Machines","date":"2025-05-08","arxiv_id":"2505.05522","repositories_listed":1,"syntology":{"n":34,"n_ran":21,"n_constructed":9,"n_ran_checked":16,"n_instrument":5,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":1,"phrase":"21 ran (of which 9 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 5 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/continuous-thought-machines#ran","syntology_url":"https://syntology.ai/paper/2505.05522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.05522"}},"official":{"repos":["SakanaAI/continuous-thought-machines"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":9,"n_ran_no_instrument_failure":11,"n_unverified":8,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/sand-one-shot-feature-selection-with-additive","slug":"sand-one-shot-feature-selection-with-additive","title":"SAND: One-Shot Feature Selection with Additive Noise Distortion","date":"2025-05-06","arxiv_id":"2505.03923","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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","sample_list":"/paper/sand-one-shot-feature-selection-with-additive#ran","syntology_url":"https://syntology.ai/paper/2505.03923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03923"}},"official":null}},{"url":"/paper/fast-and-low-cost-genomic-foundation-models","slug":"fast-and-low-cost-genomic-foundation-models","title":"Fast and Low-Cost Genomic Foundation Models via Outlier Removal","date":"2025-05-01","arxiv_id":"2505.00598","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/fast-and-low-cost-genomic-foundation-models#ran","syntology_url":"https://syntology.ai/paper/2505.00598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.00598"}},"official":{"repos":["MAGICS-LAB/GERM"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lensllm-unveiling-fine-tuning-dynamics-for","slug":"lensllm-unveiling-fine-tuning-dynamics-for","title":"LENSLLM: Unveiling Fine-Tuning Dynamics for LLM Selection","date":"2025-05-01","arxiv_id":"2505.03793","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lensllm-unveiling-fine-tuning-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/2505.03793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03793"}},"official":{"repos":["susan571/lensllm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/embracing-collaboration-over-competition","slug":"embracing-collaboration-over-competition","title":"Embracing Collaboration Over Competition: Condensing Multiple Prompts for Visual In-Context Learning","date":"2025-04-30","arxiv_id":"2504.21263","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/embracing-collaboration-over-competition#ran","syntology_url":"https://syntology.ai/paper/2504.21263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.21263"}},"official":{"repos":["gimpong/CVPR25-Condenser"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/high-performance-training-and-inference-for","slug":"high-performance-training-and-inference-for","title":"High-performance training and inference for deep equivariant interatomic potentials","date":"2025-04-22","arxiv_id":"2504.16068","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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) · 2 unverified","sample_list":"/paper/high-performance-training-and-inference-for#ran","syntology_url":"https://syntology.ai/paper/2504.16068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.16068"}},"official":{"repos":["mir-group/allegro","mir-group/nequip"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-ell-0-sparsification-for-inference","slug":"exploring-ell-0-sparsification-for-inference","title":"Exploring $\\ell_0$ Sparsification for Inference-free Sparse Retrievers","date":"2025-04-21","arxiv_id":"2504.14839","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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) · 1 unverified","sample_list":"/paper/exploring-ell-0-sparsification-for-inference#ran","syntology_url":"https://syntology.ai/paper/2504.14839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.14839"}},"official":{"repos":["zhichao-aws/opensearch-sparse-model-tuning-sample"],"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"]}}},{"url":"/paper/mask-image-watermarking","slug":"mask-image-watermarking","title":"Mask Image Watermarking","date":"2025-04-17","arxiv_id":"2504.12739","repositories_listed":1,"syntology":{"n":23,"n_ran":12,"n_constructed":5,"n_ran_checked":7,"n_instrument":5,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"12 ran (of which 5 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/mask-image-watermarking#ran","syntology_url":"https://syntology.ai/paper/2504.12739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.12739"}},"official":{"repos":["hurunyi/maskmark"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":11,"ran_from_kinds":["community","official"]}}},{"url":"/paper/leave-one-out-stable-conformal-prediction","slug":"leave-one-out-stable-conformal-prediction","title":"Leave-One-Out Stable Conformal Prediction","date":"2025-04-16","arxiv_id":"2504.12189","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/leave-one-out-stable-conformal-prediction#ran","syntology_url":"https://syntology.ai/paper/2504.12189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.12189"}},"official":{"repos":["KiljaeL/LOO-StabCP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/focus-on-local-finding-reliable-1","slug":"focus-on-local-finding-reliable-1","title":"Focus on Local: Finding Reliable Discriminative Regions for Visual Place Recognition","date":"2025-04-14","arxiv_id":"2504.09881","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/focus-on-local-finding-reliable-1#ran","syntology_url":"https://syntology.ai/paper/2504.09881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.09881"}},"official":{"repos":["chenshunpeng/FoL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/re-thinking-temporal-search-for-long-form","slug":"re-thinking-temporal-search-for-long-form","title":"Re-thinking Temporal Search for Long-Form Video Understanding","date":"2025-04-03","arxiv_id":"2504.02259","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_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","sample_list":"/paper/re-thinking-temporal-search-for-long-form#ran","syntology_url":"https://syntology.ai/paper/2504.02259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.02259"}},"official":{"repos":["longvideohaystack/tstar"],"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"]}}},{"url":"/paper/scaling-video-language-models-to-10k-frames","slug":"scaling-video-language-models-to-10k-frames","title":"Scaling Video-Language Models to 10K Frames via Hierarchical Differential Distillation","date":"2025-04-03","arxiv_id":"2504.02438","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/scaling-video-language-models-to-10k-frames#ran","syntology_url":"https://syntology.ai/paper/2504.02438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.02438"}},"official":{"repos":["steven-ccq/vilamp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/comatch-dynamic-covisibility-aware","slug":"comatch-dynamic-covisibility-aware","title":"CoMatch: Dynamic Covisibility-Aware Transformer for Bilateral Subpixel-Level Semi-Dense Image Matching","date":"2025-03-31","arxiv_id":"2503.23925","repositories_listed":0,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/comatch-dynamic-covisibility-aware#ran","syntology_url":"https://syntology.ai/paper/2503.23925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.23925"}},"official":null}},{"url":"/paper/adarank-adaptive-rank-pruning-for-enhanced","slug":"adarank-adaptive-rank-pruning-for-enhanced","title":"AdaRank: Adaptive Rank Pruning for Enhanced Model Merging","date":"2025-03-28","arxiv_id":"2503.22178","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adarank-adaptive-rank-pruning-for-enhanced#ran","syntology_url":"https://syntology.ai/paper/2503.22178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.22178"}},"official":{"repos":["david3684/adarank"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-fourier-neural-operators-with-local","slug":"enhancing-fourier-neural-operators-with-local","title":"Enhancing Fourier Neural Operators with Local Spatial Features","date":"2025-03-22","arxiv_id":"2503.17797","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/enhancing-fourier-neural-operators-with-local#ran","syntology_url":"https://syntology.ai/paper/2503.17797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.17797"}},"official":{"repos":["neuraloperator/neuraloperator"],"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"]}}},{"url":"/paper/learning-distributions-of-complex-fluid","slug":"learning-distributions-of-complex-fluid","title":"Learning Distributions of Complex Fluid Simulations with Diffusion Graph Networks","date":"2025-03-19","arxiv_id":"2504.02843","repositories_listed":0,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_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) · 0 unverified","sample_list":"/paper/learning-distributions-of-complex-fluid#ran","syntology_url":"https://syntology.ai/paper/2504.02843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.02843"}},"official":null}},{"url":"/paper/distance-based-tree-sliced-wasserstein","slug":"distance-based-tree-sliced-wasserstein","title":"Distance-Based Tree-Sliced Wasserstein Distance","date":"2025-03-14","arxiv_id":"2503.11050","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":2,"n_no_contract":12,"n_pointer_only":4,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 2 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/distance-based-tree-sliced-wasserstein#ran","syntology_url":"https://syntology.ai/paper/2503.11050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.11050"}},"official":{"repos":["Fsoft-AIC/DbTSW"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/lvagent-long-video-understanding-by-multi","slug":"lvagent-long-video-understanding-by-multi","title":"LVAgent: Long Video Understanding by Multi-Round Dynamical Collaboration of MLLM Agents","date":"2025-03-13","arxiv_id":"2503.10200","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/lvagent-long-video-understanding-by-multi#ran","syntology_url":"https://syntology.ai/paper/2503.10200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.10200"}},"official":null}},{"url":"/paper/mindgym-enhancing-vision-language-models-via","slug":"mindgym-enhancing-vision-language-models-via","title":"MindGYM: Enhancing Vision-Language Models via Synthetic Self-Challenging Questions","date":"2025-03-12","arxiv_id":"2503.09499","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mindgym-enhancing-vision-language-models-via#ran","syntology_url":"https://syntology.ai/paper/2503.09499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09499"}},"official":{"repos":["modelscope/data-juicer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/electra-a-symmetry-breaking-cartesian-network","slug":"electra-a-symmetry-breaking-cartesian-network","title":"ELECTRA: A Cartesian Network for 3D Charge Density Prediction with Floating Orbitals","date":"2025-03-11","arxiv_id":"2503.08305","repositories_listed":0,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/electra-a-symmetry-breaking-cartesian-network#ran","syntology_url":"https://syntology.ai/paper/2503.08305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.08305"}},"official":null}},{"url":"/paper/temporal-separation-with-entropy","slug":"temporal-separation-with-entropy","title":"Temporal Separation with Entropy Regularization for Knowledge Distillation in Spiking Neural Networks","date":"2025-03-05","arxiv_id":"2503.03144","repositories_listed":0,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/temporal-separation-with-entropy#ran","syntology_url":"https://syntology.ai/paper/2503.03144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03144"}},"official":null}},{"url":"/paper/taet-two-stage-adversarial-equalization","slug":"taet-two-stage-adversarial-equalization","title":"TAET: Two-Stage Adversarial Equalization Training on Long-Tailed Distributions","date":"2025-03-02","arxiv_id":"2503.01924","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/taet-two-stage-adversarial-equalization#ran","syntology_url":"https://syntology.ai/paper/2503.01924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01924"}},"official":{"repos":["buhuiok/taet-two-stage-adversarial-equalization-training-on-long-tailed-distributions"],"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"]}}},{"url":"/paper/comet-fine-grained-computation-communication","slug":"comet-fine-grained-computation-communication","title":"Comet: Fine-grained Computation-communication Overlapping for Mixture-of-Experts","date":"2025-02-27","arxiv_id":"2502.19811","repositories_listed":4,"syntology":{"n":20,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_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) · 11 unverified","sample_list":"/paper/comet-fine-grained-computation-communication#ran","syntology_url":"https://syntology.ai/paper/2502.19811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19811"}},"official":{"repos":["bytedance/flux"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":11,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/can-rlhf-be-more-efficient-with-imperfect","slug":"can-rlhf-be-more-efficient-with-imperfect","title":"Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective","date":"2025-02-26","arxiv_id":"2502.19255","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/can-rlhf-be-more-efficient-with-imperfect#ran","syntology_url":"https://syntology.ai/paper/2502.19255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19255"}},"official":{"repos":["jiaweihhuang/rlhf_rewardtransfer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/optimal-brain-apoptosis","slug":"optimal-brain-apoptosis","title":"Optimal Brain Apoptosis","date":"2025-02-25","arxiv_id":"2502.17941","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/optimal-brain-apoptosis#ran","syntology_url":"https://syntology.ai/paper/2502.17941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17941"}},"official":{"repos":["neu-real/oba"],"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"]}}},{"url":"/paper/erwin-a-tree-based-hierarchical-transformer","slug":"erwin-a-tree-based-hierarchical-transformer","title":"Erwin: A Tree-based Hierarchical Transformer for Large-scale Physical Systems","date":"2025-02-24","arxiv_id":"2502.17019","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/erwin-a-tree-based-hierarchical-transformer#ran","syntology_url":"https://syntology.ai/paper/2502.17019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17019"}},"official":{"repos":["maxxxzdn/erwin"],"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"]}}},{"url":"/paper/fast-and-accurate-blind-flexible-docking","slug":"fast-and-accurate-blind-flexible-docking","title":"Fast and Accurate Blind Flexible Docking","date":"2025-02-20","arxiv_id":"2502.14934","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-blind-flexible-docking#ran","syntology_url":"https://syntology.ai/paper/2502.14934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14934"}},"official":{"repos":["tmlr-group/fabflex"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/don-t-get-lost-in-the-trees-streamlining-llm","slug":"don-t-get-lost-in-the-trees-streamlining-llm","title":"Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls","date":"2025-02-16","arxiv_id":"2502.11183","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/don-t-get-lost-in-the-trees-streamlining-llm#ran","syntology_url":"https://syntology.ai/paper/2502.11183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11183"}},"official":{"repos":["soistesimmer/fetch"],"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"]}}},{"url":"/paper/calibquant-1-bit-kv-cache-quantization-for","slug":"calibquant-1-bit-kv-cache-quantization-for","title":"CalibQuant: 1-Bit KV Cache Quantization for Multimodal LLMs","date":"2025-02-15","arxiv_id":"2502.14882","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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","sample_list":"/paper/calibquant-1-bit-kv-cache-quantization-for#ran","syntology_url":"https://syntology.ai/paper/2502.14882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14882"}},"official":{"repos":["insuhan/calibquant"],"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"]}}},{"url":"/paper/metade-evolving-differential-evolution-by","slug":"metade-evolving-differential-evolution-by","title":"MetaDE: Evolving Differential Evolution by Differential Evolution","date":"2025-02-13","arxiv_id":"2502.10470","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/metade-evolving-differential-evolution-by#ran","syntology_url":"https://syntology.ai/paper/2502.10470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10470"}},"official":{"repos":["emi-group/metade"],"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"]}}},{"url":"/paper/linear-transformers-as-var-models-aligning","slug":"linear-transformers-as-var-models-aligning","title":"Linear Transformers as VAR Models: Aligning Autoregressive Attention Mechanisms with Autoregressive Forecasting","date":"2025-02-11","arxiv_id":"2502.07244","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_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) · 2 unverified","sample_list":"/paper/linear-transformers-as-var-models-aligning#ran","syntology_url":"https://syntology.ai/paper/2502.07244","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.07244"}},"official":{"repos":["ljc-fvnr/structural-aligned-mixture-of-var"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/calibrating-llms-with-information-theoretic","slug":"calibrating-llms-with-information-theoretic","title":"Calibrating LLMs with Information-Theoretic Evidential Deep Learning","date":"2025-02-10","arxiv_id":"2502.06351","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 0 unverified","sample_list":"/paper/calibrating-llms-with-information-theoretic#ran","syntology_url":"https://syntology.ai/paper/2502.06351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.06351"}},"official":{"repos":["sandylaker/ib-edl"],"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"]}}},{"url":"/paper/cached-multi-lora-composition-for-multi","slug":"cached-multi-lora-composition-for-multi","title":"Cached Multi-Lora Composition for Multi-Concept Image Generation","date":"2025-02-07","arxiv_id":"2502.04923","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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) · 0 unverified","sample_list":"/paper/cached-multi-lora-composition-for-multi#ran","syntology_url":"https://syntology.ai/paper/2502.04923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04923"}},"official":{"repos":["Yqcca/CMLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/flashvideo-flowing-fidelity-to-detail-for","slug":"flashvideo-flowing-fidelity-to-detail-for","title":"FlashVideo:Flowing Fidelity to Detail for Efficient High-Resolution Video Generation","date":"2025-02-07","arxiv_id":"2502.05179","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":3,"n_no_contract":8,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 3 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flashvideo-flowing-fidelity-to-detail-for#ran","syntology_url":"https://syntology.ai/paper/2502.05179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.05179"}},"official":{"repos":["foundationvision/flashvideo"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/uni-sign-toward-unified-sign-language","slug":"uni-sign-toward-unified-sign-language","title":"Uni-Sign: Toward Unified Sign Language Understanding at Scale","date":"2025-01-25","arxiv_id":"2501.15187","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":8,"n_ran_checked":10,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"14 ran (of which 8 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/uni-sign-toward-unified-sign-language#ran","syntology_url":"https://syntology.ai/paper/2501.15187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15187"}},"official":{"repos":["zechengli19/uni-sign"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":8,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/video-depth-anything-consistent-depth","slug":"video-depth-anything-consistent-depth","title":"Video Depth Anything: Consistent Depth Estimation for Super-Long Videos","date":"2025-01-21","arxiv_id":"2501.12375","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/video-depth-anything-consistent-depth#ran","syntology_url":"https://syntology.ai/paper/2501.12375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.12375"}},"official":null}},{"url":"/paper/finer-cam-spotting-the-difference-reveals","slug":"finer-cam-spotting-the-difference-reveals","title":"Finer-CAM: Spotting the Difference Reveals Finer Details for Visual Explanation","date":"2025-01-20","arxiv_id":"2501.11309","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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","sample_list":"/paper/finer-cam-spotting-the-difference-reveals#ran","syntology_url":"https://syntology.ai/paper/2501.11309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.11309"}},"official":{"repos":["imageomics/finer-cam"],"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"]}}},{"url":"/paper/flowhigh-towards-efficient-and-high-quality","slug":"flowhigh-towards-efficient-and-high-quality","title":"FLowHigh: Towards Efficient and High-Quality Audio Super-Resolution with Single-Step Flow Matching","date":"2025-01-09","arxiv_id":"2501.04926","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":2,"n_honours":2,"n_violates":3,"n_no_contract":7,"n_pointer_only":6,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 3 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flowhigh-towards-efficient-and-high-quality#ran","syntology_url":"https://syntology.ai/paper/2501.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.04926"}},"official":{"repos":["jjunak-yun/FLowHigh_code"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/camp-collaborative-attention-model-with","slug":"camp-collaborative-attention-model-with","title":"CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems","date":"2025-01-06","arxiv_id":"2501.02977","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/camp-collaborative-attention-model-with#ran","syntology_url":"https://syntology.ai/paper/2501.02977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.02977"}},"official":{"repos":["ai4co/camp"],"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"]}}},{"url":"/paper/hcma-unet-a-hybrid-cnn-mamba-unet-with-inter","slug":"hcma-unet-a-hybrid-cnn-mamba-unet-with-inter","title":"HCMA-UNet: A Hybrid CNN-Mamba UNet with Axial Self-Attention for Efficient Breast Cancer Segmentation","date":"2025-01-01","arxiv_id":"2501.00751","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/hcma-unet-a-hybrid-cnn-mamba-unet-with-inter#ran","syntology_url":"https://syntology.ai/paper/2501.00751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.00751"}},"official":{"repos":["haoxuanli-thu/hcma-unet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-uncertainty-estimation-in-natural","slug":"rethinking-uncertainty-estimation-in-natural","title":"Rethinking Uncertainty Estimation in Natural Language Generation","date":"2024-12-19","arxiv_id":"2412.15176","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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","sample_list":"/paper/rethinking-uncertainty-estimation-in-natural#ran","syntology_url":"https://syntology.ai/paper/2412.15176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15176"}},"official":null}},{"url":"/paper/the-dark-side-of-the-forces-assessing-non","slug":"the-dark-side-of-the-forces-assessing-non","title":"The dark side of the forces: assessing non-conservative force models for atomistic machine learning","date":"2024-12-16","arxiv_id":"2412.11569","repositories_listed":1,"syntology":{"n":16,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":12,"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) · 7 unverified","sample_list":"/paper/the-dark-side-of-the-forces-assessing-non#ran","syntology_url":"https://syntology.ai/paper/2412.11569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.11569"}},"official":null}},{"url":"/paper/dynamic-vlm-simple-dynamic-visual-token","slug":"dynamic-vlm-simple-dynamic-visual-token","title":"Dynamic-VLM: Simple Dynamic Visual Token Compression for VideoLLM","date":"2024-12-12","arxiv_id":"2412.09530","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/dynamic-vlm-simple-dynamic-visual-token#ran","syntology_url":"https://syntology.ai/paper/2412.09530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09530"}},"official":{"repos":["hon-wong/bytevideollm"],"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"]}}},{"url":"/paper/flexdit-dynamic-token-density-control-for","slug":"flexdit-dynamic-token-density-control-for","title":"FlexDiT: Dynamic Token Density Control for Diffusion Transformer","date":"2024-12-08","arxiv_id":"2412.06028","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 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; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/flexdit-dynamic-token-density-control-for#ran","syntology_url":"https://syntology.ai/paper/2412.06028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.06028"}},"official":{"repos":["changsn/FlexDiT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rilq-rank-insensitive-lora-based-quantization","slug":"rilq-rank-insensitive-lora-based-quantization","title":"RILQ: Rank-Insensitive LoRA-based Quantization Error Compensation for Boosting 2-bit Large Language Model Accuracy","date":"2024-12-02","arxiv_id":"2412.01129","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rilq-rank-insensitive-lora-based-quantization#ran","syntology_url":"https://syntology.ai/paper/2412.01129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.01129"}},"official":{"repos":["aiha-lab/rilq"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/2dmamba-efficient-state-space-model-for-image","slug":"2dmamba-efficient-state-space-model-for-image","title":"2DMamba: Efficient State Space Model for Image Representation with Applications on Giga-Pixel Whole Slide Image Classification","date":"2024-12-01","arxiv_id":"2412.00678","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/2dmamba-efficient-state-space-model-for-image#ran","syntology_url":"https://syntology.ai/paper/2412.00678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.00678"}},"official":{"repos":["atlasanalyticslab/2dmamba"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-offline-reinforcement-learning-with-1","slug":"robust-offline-reinforcement-learning-with-1","title":"Robust Offline Reinforcement Learning with Linearly Structured $f$-Divergence Regularization","date":"2024-11-27","arxiv_id":"2411.18612","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/robust-offline-reinforcement-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2411.18612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.18612"}},"official":null}},{"url":"/paper/star-attention-efficient-llm-inference-over","slug":"star-attention-efficient-llm-inference-over","title":"Star Attention: Efficient LLM Inference over Long Sequences","date":"2024-11-26","arxiv_id":"2411.17116","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 2 unverified","sample_list":"/paper/star-attention-efficient-llm-inference-over#ran","syntology_url":"https://syntology.ai/paper/2411.17116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17116"}},"official":{"repos":["NVIDIA/Star-Attention"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mambairv2-attentive-state-space-restoration","slug":"mambairv2-attentive-state-space-restoration","title":"MambaIRv2: Attentive State Space Restoration","date":"2024-11-22","arxiv_id":"2411.15269","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"8 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mambairv2-attentive-state-space-restoration#ran","syntology_url":"https://syntology.ai/paper/2411.15269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15269"}},"official":{"repos":["csguoh/mambair"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sefd-semantic-enhanced-framework-for","slug":"sefd-semantic-enhanced-framework-for","title":"SEFD: Semantic-Enhanced Framework for Detecting LLM-Generated Text","date":"2024-11-17","arxiv_id":"2411.12764","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/sefd-semantic-enhanced-framework-for#ran","syntology_url":"https://syntology.ai/paper/2411.12764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.12764"}},"official":{"repos":["hwq0726/sefd"],"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"]}}},{"url":"/paper/large-scale-moral-machine-experiment-on-large","slug":"large-scale-moral-machine-experiment-on-large","title":"Large-scale moral machine experiment on large language models","date":"2024-11-11","arxiv_id":"2411.06790","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/large-scale-moral-machine-experiment-on-large#ran","syntology_url":"https://syntology.ai/paper/2411.06790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06790"}},"official":{"repos":["kztakemoto/mmllm"],"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"]}}},{"url":"/paper/beyond-the-rainbow-high-performance-deep","slug":"beyond-the-rainbow-high-performance-deep","title":"Beyond The Rainbow: High Performance Deep Reinforcement Learning on a Desktop PC","date":"2024-11-06","arxiv_id":"2411.03820","repositories_listed":3,"syntology":{"n":25,"n_ran":16,"n_constructed":10,"n_ran_checked":13,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":21,"phrase":"16 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/beyond-the-rainbow-high-performance-deep#ran","syntology_url":"https://syntology.ai/paper/2411.03820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03820"}},"official":{"repos":["viptankz/btr"],"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":["listed","official"]}}},{"url":"/paper/privacy-preserving-graph-based-machine","slug":"privacy-preserving-graph-based-machine","title":"Privacy-Preserving Graph-Based Machine Learning with Fully Homomorphic Encryption for Collaborative Anti-Money Laundering","date":"2024-11-05","arxiv_id":"2411.02926","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/privacy-preserving-graph-based-machine#ran","syntology_url":"https://syntology.ai/paper/2411.02926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02926"}},"official":{"repos":["fabecode/GraphML-FHE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tddbench-a-benchmark-for-training-data","slug":"tddbench-a-benchmark-for-training-data","title":"TDDBench: A Benchmark for Training data detection","date":"2024-11-05","arxiv_id":"2411.03363","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/tddbench-a-benchmark-for-training-data#ran","syntology_url":"https://syntology.ai/paper/2411.03363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03363"}},"official":null}},{"url":"/paper/ps-dag-projected-stochastic-approximation","slug":"ps-dag-projected-stochastic-approximation","title":"$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning","date":"2024-10-31","arxiv_id":"2410.23862","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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) · 2 unverified","sample_list":"/paper/ps-dag-projected-stochastic-approximation#ran","syntology_url":"https://syntology.ai/paper/2410.23862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23862"}},"official":{"repos":["kz29/-psiDAG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bidirectional-recurrence-for-cardiac-motion","slug":"bidirectional-recurrence-for-cardiac-motion","title":"Bidirectional Recurrence for Cardiac Motion Tracking with Gaussian Process Latent Coding","date":"2024-10-28","arxiv_id":"2410.20752","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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","sample_list":"/paper/bidirectional-recurrence-for-cardiac-motion#ran","syntology_url":"https://syntology.ai/paper/2410.20752","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.20752"}},"official":{"repos":["xmed-lab/gptrack"],"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"]}}},{"url":"/paper/not-all-heads-matter-a-head-level-kv-cache","slug":"not-all-heads-matter-a-head-level-kv-cache","title":"Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning","date":"2024-10-25","arxiv_id":"2410.19258","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/not-all-heads-matter-a-head-level-kv-cache#ran","syntology_url":"https://syntology.ai/paper/2410.19258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.19258"}},"official":{"repos":["fyyfu/headkv"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-partial-gromov-wasserstein-embedding","slug":"linear-partial-gromov-wasserstein-embedding","title":"Linear Partial Gromov-Wasserstein Embedding","date":"2024-10-22","arxiv_id":"2410.16669","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/linear-partial-gromov-wasserstein-embedding#ran","syntology_url":"https://syntology.ai/paper/2410.16669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16669"}},"official":{"repos":["mint-vu/linearized_partial_gromov_wasserstein"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lora-ir-taming-low-rank-experts-for-efficient","slug":"lora-ir-taming-low-rank-experts-for-efficient","title":"LoRA-IR: Taming Low-Rank Experts for Efficient All-in-One Image Restoration","date":"2024-10-20","arxiv_id":"2410.15385","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/lora-ir-taming-low-rank-experts-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2410.15385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15385"}},"official":{"repos":["shallowdream204/lora-ir"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/quamba-a-post-training-quantization-recipe","slug":"quamba-a-post-training-quantization-recipe","title":"Quamba: A Post-Training Quantization Recipe for Selective State Space Models","date":"2024-10-17","arxiv_id":"2410.13229","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/quamba-a-post-training-quantization-recipe#ran","syntology_url":"https://syntology.ai/paper/2410.13229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13229"}},"official":{"repos":["enyac-group/quamba"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/supervised-kernel-thinning","slug":"supervised-kernel-thinning","title":"Supervised Kernel Thinning","date":"2024-10-17","arxiv_id":"2410.13749","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_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) · 4 unverified","sample_list":"/paper/supervised-kernel-thinning#ran","syntology_url":"https://syntology.ai/paper/2410.13749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13749"}},"official":{"repos":["ag2435/npr"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-prototype-evolving-for-test-time","slug":"dual-prototype-evolving-for-test-time","title":"Dual Prototype Evolving for Test-Time Generalization of Vision-Language Models","date":"2024-10-16","arxiv_id":"2410.12790","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/dual-prototype-evolving-for-test-time#ran","syntology_url":"https://syntology.ai/paper/2410.12790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12790"}},"official":{"repos":["zhangce01/DPE-CLIP"],"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"]}}},{"url":"/paper/adaptive-data-optimization-dynamic-sample","slug":"adaptive-data-optimization-dynamic-sample","title":"Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws","date":"2024-10-15","arxiv_id":"2410.11820","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-data-optimization-dynamic-sample#ran","syntology_url":"https://syntology.ai/paper/2410.11820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11820"}},"official":{"repos":["yidingjiang/ado"],"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":["listed","official"]}}},{"url":"/paper/a-dpo-adaptive-reward-margin-is-what-direct","slug":"a-dpo-adaptive-reward-margin-is-what-direct","title":"$α$-DPO: Adaptive Reward Margin is What Direct Preference Optimization Needs","date":"2024-10-14","arxiv_id":"2410.10148","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-dpo-adaptive-reward-margin-is-what-direct#ran","syntology_url":"https://syntology.ai/paper/2410.10148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10148"}},"official":{"repos":["junkangwu/alpha-dpo"],"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"]}}},{"url":"/paper/simba-simplicity-bias-for-scaling-up","slug":"simba-simplicity-bias-for-scaling-up","title":"SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learning","date":"2024-10-13","arxiv_id":"2410.09754","repositories_listed":4,"syntology":{"n":6,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 2 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) · 0 unverified","sample_list":"/paper/simba-simplicity-bias-for-scaling-up#ran","syntology_url":"https://syntology.ai/paper/2410.09754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09754"}},"official":{"repos":["sonyresearch/simba"],"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":["listed","official"]}}},{"url":"/paper/predicting-molecular-ground-state","slug":"predicting-molecular-ground-state","title":"WGFormer: An SE(3)-Transformer Driven by Wasserstein Gradient Flows for Molecular Ground-State Conformation Prediction","date":"2024-10-13","arxiv_id":"2410.09795","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/predicting-molecular-ground-state#ran","syntology_url":"https://syntology.ai/paper/2410.09795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09795"}},"official":null}},{"url":"/paper/improving-temporal-link-prediction-via","slug":"improving-temporal-link-prediction-via","title":"Improving Temporal Link Prediction via Temporal Walk Matrix Projection","date":"2024-10-05","arxiv_id":"2410.04013","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_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) · 4 unverified","sample_list":"/paper/improving-temporal-link-prediction-via#ran","syntology_url":"https://syntology.ai/paper/2410.04013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04013"}},"official":{"repos":["lxd99/tpnet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-structured-representations-by","slug":"learning-structured-representations-by","title":"Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport","date":"2024-10-04","arxiv_id":"2410.03052","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-structured-representations-by#ran","syntology_url":"https://syntology.ai/paper/2410.03052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03052"}},"official":{"repos":["uiuctml/OTCPCC"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/flashmask-efficient-and-rich-mask-extension","slug":"flashmask-efficient-and-rich-mask-extension","title":"FlashMask: Efficient and Rich Mask Extension of FlashAttention","date":"2024-10-02","arxiv_id":"2410.01359","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/flashmask-efficient-and-rich-mask-extension#ran","syntology_url":"https://syntology.ai/paper/2410.01359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01359"}},"official":{"repos":["PaddlePaddle/Paddle"],"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"]}}},{"url":"/paper/tpp-llm-modeling-temporal-point-processes-by","slug":"tpp-llm-modeling-temporal-point-processes-by","title":"TPP-LLM: Modeling Temporal Point Processes by Efficiently Fine-Tuning Large Language Models","date":"2024-10-02","arxiv_id":"2410.02062","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 0 unverified","sample_list":"/paper/tpp-llm-modeling-temporal-point-processes-by#ran","syntology_url":"https://syntology.ai/paper/2410.02062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02062"}},"official":{"repos":["zefang-liu/TPP-LLM"],"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"]}}},{"url":"/paper/most-influential-subset-selection-challenges","slug":"most-influential-subset-selection-challenges","title":"Most Influential Subset Selection: Challenges, Promises, and Beyond","date":"2024-09-25","arxiv_id":"2409.18153","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"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) · 2 unverified","sample_list":"/paper/most-influential-subset-selection-challenges#ran","syntology_url":"https://syntology.ai/paper/2409.18153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.18153"}},"official":{"repos":["sleepymalc/miss"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/time-moe-billion-scale-time-series-foundation","slug":"time-moe-billion-scale-time-series-foundation","title":"Time-MoE: Billion-Scale Time Series Foundation Models with Mixture of Experts","date":"2024-09-24","arxiv_id":"2409.16040","repositories_listed":1,"syntology":{"n":20,"n_ran":14,"n_constructed":9,"n_ran_checked":11,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"14 ran (of which 9 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/time-moe-billion-scale-time-series-foundation#ran","syntology_url":"https://syntology.ai/paper/2409.16040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.16040"}},"official":{"repos":["time-moe/time-moe"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":9,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/apollo-band-sequence-modeling-for-high","slug":"apollo-band-sequence-modeling-for-high","title":"Apollo: Band-sequence Modeling for High-Quality Audio Restoration","date":"2024-09-13","arxiv_id":"2409.08514","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/apollo-band-sequence-modeling-for-high#ran","syntology_url":"https://syntology.ai/paper/2409.08514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.08514"}},"official":{"repos":["jusperlee/apollo"],"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"]}}},{"url":"/paper/ferret-federated-full-parameter-tuning-at","slug":"ferret-federated-full-parameter-tuning-at","title":"Ferret: Federated Full-Parameter Tuning at Scale for Large Language Models","date":"2024-09-10","arxiv_id":"2409.06277","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"4 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ferret-federated-full-parameter-tuning-at#ran","syntology_url":"https://syntology.ai/paper/2409.06277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.06277"}},"official":{"repos":["allen4747/Ferret"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["community"]}}},{"url":"/paper/alt-moe-multimodal-alignment-via-alternating","slug":"alt-moe-multimodal-alignment-via-alternating","title":"M3-Jepa: Multimodal Alignment via Multi-directional MoE based on the JEPA framework","date":"2024-09-09","arxiv_id":"2409.05929","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 0 unverified","sample_list":"/paper/alt-moe-multimodal-alignment-via-alternating#ran","syntology_url":"https://syntology.ai/paper/2409.05929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05929"}},"official":{"repos":["HongyangLL/M3-JEPA"],"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"]}}},{"url":"/paper/cross-attention-inspired-selective-state","slug":"cross-attention-inspired-selective-state","title":"Cross-attention Inspired Selective State Space Models for Target Sound Extraction","date":"2024-09-07","arxiv_id":"2409.04803","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/cross-attention-inspired-selective-state#ran","syntology_url":"https://syntology.ai/paper/2409.04803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.04803"}},"official":{"repos":["WuDH2000/CrossMamba"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parco-learning-parallel-autoregressive","slug":"parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 2 unverified","sample_list":"/paper/parco-learning-parallel-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2409.03811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.03811"}},"official":{"repos":["ai4co/parco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/prompt-compression-with-context-aware","slug":"prompt-compression-with-context-aware","title":"Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference","date":"2024-09-02","arxiv_id":"2409.01227","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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) · 2 unverified","sample_list":"/paper/prompt-compression-with-context-aware#ran","syntology_url":"https://syntology.ai/paper/2409.01227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.01227"}},"official":{"repos":["workday/cpc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-free-variational-learning-with","slug":"gradient-free-variational-learning-with","title":"Gradient-free variational learning with conditional mixture networks","date":"2024-08-29","arxiv_id":"2408.16429","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-free-variational-learning-with#ran","syntology_url":"https://syntology.ai/paper/2408.16429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16429"}},"official":{"repos":["versestech/cavi-cmn"],"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"]}}},{"url":"/paper/llava-mod-making-llava-tiny-via-moe-knowledge","slug":"llava-mod-making-llava-tiny-via-moe-knowledge","title":"LLaVA-MoD: Making LLaVA Tiny via MoE Knowledge Distillation","date":"2024-08-28","arxiv_id":"2408.15881","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 6 unverified","sample_list":"/paper/llava-mod-making-llava-tiny-via-moe-knowledge#ran","syntology_url":"https://syntology.ai/paper/2408.15881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15881"}},"official":{"repos":["shufangxun/llava-mod"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/data-driven-parametrization-of-molecular","slug":"data-driven-parametrization-of-molecular","title":"Data-Driven Parametrization of Molecular Mechanics Force Fields for Expansive Chemical Space Coverage","date":"2024-08-23","arxiv_id":"2408.12817","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_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) · 3 unverified","sample_list":"/paper/data-driven-parametrization-of-molecular#ran","syntology_url":"https://syntology.ai/paper/2408.12817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.12817"}},"official":{"repos":["bytedance/byteff"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/spectralearth-training-hyperspectral","slug":"spectralearth-training-hyperspectral","title":"SpectralEarth: Training Hyperspectral Foundation Models at Scale","date":"2024-08-15","arxiv_id":"2408.08447","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spectralearth-training-hyperspectral#ran","syntology_url":"https://syntology.ai/paper/2408.08447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08447"}},"official":null}},{"url":"/paper/learn-from-the-learnt-source-free-active","slug":"learn-from-the-learnt-source-free-active","title":"Learn from the Learnt: Source-Free Active Domain Adaptation via Contrastive Sampling and Visual Persistence","date":"2024-07-26","arxiv_id":"2407.18899","repositories_listed":0,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learn-from-the-learnt-source-free-active#ran","syntology_url":"https://syntology.ai/paper/2407.18899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18899"}},"official":null}}],"record_sha256":"77399b94d4a1ca83c7daef4f079a798f51d383379ab2d75afefd80d6c25316e1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}