{"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/feature-engineering/papers/ran/1","list_of":"/task/feature-engineering","task":"Feature Engineering","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":1,"rows_per_page":100,"rows":[1,60],"of":60,"counts":{"archive_papers_tagged":1706,"with_a_code_link":472,"where_syntology_ran_a_sample":60,"not_listed_spam_title":0,"listed":1706,"listed_where_code_ran":60,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":51,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":51,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/feature-engineering/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/the-catechol-benchmark-time-series-solvent","slug":"the-catechol-benchmark-time-series-solvent","title":"The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning","date":"2025-06-09","arxiv_id":"2506.07619","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":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-catechol-benchmark-time-series-solvent#ran","syntology_url":"https://syntology.ai/paper/2506.07619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07619"}},"official":{"repos":["jpfolch/catechol_solvent_selection"],"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/latte-transfering-llms-latent-level-knowledge","slug":"latte-transfering-llms-latent-level-knowledge","title":"Latte: Transfering LLMs` Latent-level Knowledge for Few-shot Tabular Learning","date":"2025-05-08","arxiv_id":"2505.05237","repositories_listed":0,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/latte-transfering-llms-latent-level-knowledge#ran","syntology_url":"https://syntology.ai/paper/2505.05237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.05237"}},"official":null}},{"url":"/paper/llm-fe-automated-feature-engineering-for","slug":"llm-fe-automated-feature-engineering-for","title":"LLM-FE: Automated Feature Engineering for Tabular Data with LLMs as Evolutionary Optimizers","date":"2025-03-18","arxiv_id":"2503.14434","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llm-fe-automated-feature-engineering-for#ran","syntology_url":"https://syntology.ai/paper/2503.14434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.14434"}},"official":{"repos":["nikhilsab/llmfe"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-tabular-foundation-model-tabpfn","slug":"the-tabular-foundation-model-tabpfn","title":"The Tabular Foundation Model TabPFN Outperforms Specialized Time Series Forecasting Models Based on Simple Features","date":"2025-01-06","arxiv_id":"2501.02945","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/the-tabular-foundation-model-tabpfn#ran","syntology_url":"https://syntology.ai/paper/2501.02945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.02945"}},"official":{"repos":["liam-sbhoo/tabpfn-time-series"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autokaggle-a-multi-agent-framework-for","slug":"autokaggle-a-multi-agent-framework-for","title":"AutoKaggle: A Multi-Agent Framework for Autonomous Data Science Competitions","date":"2024-10-27","arxiv_id":"2410.20424","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/autokaggle-a-multi-agent-framework-for#ran","syntology_url":"https://syntology.ai/paper/2410.20424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.20424"}},"official":{"repos":["multimodal-art-projection/AutoKaggle"],"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/large-language-models-engineer-too-many","slug":"large-language-models-engineer-too-many","title":"Large Language Models Engineer Too Many Simple Features For Tabular Data","date":"2024-10-23","arxiv_id":"2410.17787","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/large-language-models-engineer-too-many#ran","syntology_url":"https://syntology.ai/paper/2410.17787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17787"}},"official":{"repos":["automl/llms_feature_engineering_bias"],"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/elf-gym-evaluating-large-language-models","slug":"elf-gym-evaluating-large-language-models","title":"ELF-Gym: Evaluating Large Language Models Generated Features for Tabular Prediction","date":"2024-10-13","arxiv_id":"2410.12865","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/elf-gym-evaluating-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2410.12865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12865"}},"official":{"repos":["Lilyzhangyanlin/ELF-Gym"],"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/relbench-a-benchmark-for-deep-learning-on","slug":"relbench-a-benchmark-for-deep-learning-on","title":"RelBench: A Benchmark for Deep Learning on Relational Databases","date":"2024-07-29","arxiv_id":"2407.20060","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"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, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relbench-a-benchmark-for-deep-learning-on#ran","syntology_url":"https://syntology.ai/paper/2407.20060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20060"}},"official":{"repos":["snap-stanford/relbench","snap-stanford/relbench-user-study"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-data-centric-perspective-on-evaluating","slug":"a-data-centric-perspective-on-evaluating","title":"A Data-Centric Perspective on Evaluating Machine Learning Models for Tabular Data","date":"2024-07-02","arxiv_id":"2407.02112","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/a-data-centric-perspective-on-evaluating#ran","syntology_url":"https://syntology.ai/paper/2407.02112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02112"}},"official":{"repos":["atschalz/dc_tabeval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tabred-a-benchmark-of-tabular-machine","slug":"tabred-a-benchmark-of-tabular-machine","title":"TabReD: Analyzing Pitfalls and Filling the Gaps in Tabular Deep Learning Benchmarks","date":"2024-06-27","arxiv_id":"2406.19380","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/tabred-a-benchmark-of-tabular-machine#ran","syntology_url":"https://syntology.ai/paper/2406.19380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19380"}},"official":{"repos":["yandex-research/tabred"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/patholm-identifying-pathogenicity-from-the","slug":"patholm-identifying-pathogenicity-from-the","title":"PathoLM: Identifying pathogenicity from the DNA sequence through the Genome Foundation Model","date":"2024-06-19","arxiv_id":"2406.13133","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/patholm-identifying-pathogenicity-from-the#ran","syntology_url":"https://syntology.ai/paper/2406.13133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13133"}},"official":{"repos":["Sajib-006/Patho-LM"],"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/optimized-feature-generation-for-tabular-data","slug":"optimized-feature-generation-for-tabular-data","title":"Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoning","date":"2024-06-12","arxiv_id":"2406.08527","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimized-feature-generation-for-tabular-data#ran","syntology_url":"https://syntology.ai/paper/2406.08527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08527"}},"official":{"repos":["jaehyun513/octree"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-skeleton-based-motion-encoder","slug":"benchmarking-skeleton-based-motion-encoder","title":"Benchmarking Skeleton-based Motion Encoder Models for Clinical Applications: Estimating Parkinson's Disease Severity in Walking Sequences","date":"2024-05-28","arxiv_id":"2405.17817","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"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, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarking-skeleton-based-motion-encoder#ran","syntology_url":"https://syntology.ai/paper/2405.17817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17817"}},"official":{"repos":["taatiteam/motionencoders_parkinsonism_benchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vcr-graphormer-a-mini-batch-graph-transformer","slug":"vcr-graphormer-a-mini-batch-graph-transformer","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","date":"2024-03-24","arxiv_id":"2403.16030","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/vcr-graphormer-a-mini-batch-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2403.16030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16030"}},"official":{"repos":["dongqifu/vcr-graphormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dreamsampler-unifying-diffusion-sampling-and","slug":"dreamsampler-unifying-diffusion-sampling-and","title":"DreamSampler: Unifying Diffusion Sampling and Score Distillation for Image Manipulation","date":"2024-03-18","arxiv_id":"2403.11415","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dreamsampler-unifying-diffusion-sampling-and#ran","syntology_url":"https://syntology.ai/paper/2403.11415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11415"}},"official":{"repos":["dreamsampler/dream-sampler"],"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/descriptive-kernel-convolution-network-with","slug":"descriptive-kernel-convolution-network-with","title":"Descriptive Kernel Convolution Network with Improved Random Walk Kernel","date":"2024-02-08","arxiv_id":"2402.06087","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"5 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/descriptive-kernel-convolution-network-with#ran","syntology_url":"https://syntology.ai/paper/2402.06087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06087"}},"official":{"repos":["mengchillee/rwk_plus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/smutf-schema-matching-using-generative-tags","slug":"smutf-schema-matching-using-generative-tags","title":"SMUTF: Schema Matching Using Generative Tags and Hybrid Features","date":"2024-01-22","arxiv_id":"2402.01685","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/smutf-schema-matching-using-generative-tags#ran","syntology_url":"https://syntology.ai/paper/2402.01685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01685"}},"official":{"repos":["fireindark707/python-schema-matching"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/faser-binary-code-similarity-search-through","slug":"faser-binary-code-similarity-search-through","title":"FASER: Binary Code Similarity Search through the use of Intermediate Representations","date":"2023-10-05","arxiv_id":"2310.03605","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/faser-binary-code-similarity-search-through#ran","syntology_url":"https://syntology.ai/paper/2310.03605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03605"}},"official":{"repos":["br0kej/FASER"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"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/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"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/benchmarks-and-custom-package-for-electrical","slug":"benchmarks-and-custom-package-for-electrical","title":"Benchmarks and Custom Package for Energy Forecasting","date":"2023-07-14","arxiv_id":"2307.07191","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarks-and-custom-package-for-electrical#ran","syntology_url":"https://syntology.ai/paper/2307.07191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07191"}},"official":{"repos":["leo-vk/proenfo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-end-to-end-reinforcement-learning-approach","slug":"an-end-to-end-reinforcement-learning-approach","title":"An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming","date":"2023-06-09","arxiv_id":"2306.05747","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/an-end-to-end-reinforcement-learning-approach#ran","syntology_url":"https://syntology.ai/paper/2306.05747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05747"}},"official":{"repos":["ingambe/End2End-Job-Shop-Scheduling-CP"],"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/large-language-models-for-automated-data-1","slug":"large-language-models-for-automated-data-1","title":"Large Language Models for Automated Data Science: Introducing CAAFE for Context-Aware Automated Feature Engineering","date":"2023-05-05","arxiv_id":"2305.03403","repositories_listed":2,"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/large-language-models-for-automated-data-1#ran","syntology_url":"https://syntology.ai/paper/2305.03403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.03403"}},"official":{"repos":["automl/caafe"],"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/winning-solution-of-real-robot-challenge-iii","slug":"winning-solution-of-real-robot-challenge-iii","title":"Identifying Expert Behavior in Offline Training Datasets Improves Behavioral Cloning of Robotic Manipulation Policies","date":"2023-01-30","arxiv_id":"2301.13019","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/winning-solution-of-real-robot-challenge-iii#ran","syntology_url":"https://syntology.ai/paper/2301.13019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13019"}},"official":{"repos":["wq13552463699/real-robot-challenge-2022"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/caspr-customer-activity-sequence-based","slug":"caspr-customer-activity-sequence-based","title":"CASPR: Customer Activity Sequence-based Prediction and Representation","date":"2022-11-16","arxiv_id":"2211.09174","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/caspr-customer-activity-sequence-based#ran","syntology_url":"https://syntology.ai/paper/2211.09174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09174"}},"official":{"repos":["microsoft/caspr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unihpf-universal-healthcare-predictive","slug":"unihpf-universal-healthcare-predictive","title":"GenHPF: General Healthcare Predictive Framework with Multi-task Multi-source Learning","date":"2022-07-20","arxiv_id":"2207.09858","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/unihpf-universal-healthcare-predictive#ran","syntology_url":"https://syntology.ai/paper/2207.09858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09858"}},"official":{"repos":["hoon9405/genhpf","hoon9405/unihpf"],"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/sequence-to-sequence-learning-with-latent","slug":"sequence-to-sequence-learning-with-latent","title":"Sequence-to-Sequence Learning with Latent Neural Grammars","date":"2021-09-02","arxiv_id":"2109.01135","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequence-to-sequence-learning-with-latent#ran","syntology_url":"https://syntology.ai/paper/2109.01135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01135"}},"official":{"repos":["yoonkim/neural-qcfg"],"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":["found_in_text","official"]}}},{"url":"/paper/volcanoml-speeding-up-end-to-end-automl-via","slug":"volcanoml-speeding-up-end-to-end-automl-via","title":"VolcanoML: Speeding up End-to-End AutoML via Scalable Search Space Decomposition","date":"2021-07-19","arxiv_id":"2107.08861","repositories_listed":3,"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/volcanoml-speeding-up-end-to-end-automl-via#ran","syntology_url":"https://syntology.ai/paper/2107.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08861"}},"official":{"repos":["PKU-DAIR/mindware"],"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":["listed","official"]}}},{"url":"/paper/autogl-a-library-for-automated-graph-learning","slug":"autogl-a-library-for-automated-graph-learning","title":"AutoGL: A Library for Automated Graph Learning","date":"2021-04-11","arxiv_id":"2104.04987","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autogl-a-library-for-automated-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2104.04987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04987"}},"official":{"repos":["THUMNLab/AutoGL","thumnlab/autogl-light"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-based-deep-reinforcement-learning-for-1","slug":"memory-based-deep-reinforcement-learning-for-1","title":"Memory-based Deep Reinforcement Learning for POMDPs","date":"2021-02-24","arxiv_id":"2102.12344","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/memory-based-deep-reinforcement-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2102.12344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12344"}},"official":{"repos":["LinghengMeng/LSTM-TD3"],"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/knowledge-preserving-incremental-social-event","slug":"knowledge-preserving-incremental-social-event","title":"Knowledge-Preserving Incremental Social Event Detection via Heterogeneous GNNs","date":"2021-01-21","arxiv_id":"2101.08747","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-preserving-incremental-social-event#ran","syntology_url":"https://syntology.ai/paper/2101.08747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08747"}},"official":{"repos":["RingBDStack/KPGNN"],"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/classification-of-periodic-variable-stars","slug":"classification-of-periodic-variable-stars","title":"Classification of Periodic Variable Stars with Novel Cyclic-Permutation Invariant Neural Networks","date":"2020-11-02","arxiv_id":"2011.01243","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":4,"n_ran_checked":4,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"7 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/classification-of-periodic-variable-stars#ran","syntology_url":"https://syntology.ai/paper/2011.01243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01243"}},"official":{"repos":["kmzzhang/periodicnetwork"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["community","official"]}}},{"url":"/paper/aradic-arabic-document-classification-using-1","slug":"aradic-arabic-document-classification-using-1","title":"AraDIC: Arabic Document Classification using Image-Based Character Embeddings and Class-Balanced Loss","date":"2020-06-20","arxiv_id":"2006.11586","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/aradic-arabic-document-classification-using-1#ran","syntology_url":"https://syntology.ai/paper/2006.11586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11586"}},"official":{"repos":["mahmouddaif/AraDIC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-of-information-cascade-analysis","slug":"a-survey-of-information-cascade-analysis","title":"A Survey of Information Cascade Analysis: Models, Predictions, and Recent Advances","date":"2020-05-22","arxiv_id":"2005.11041","repositories_listed":3,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-survey-of-information-cascade-analysis#ran","syntology_url":"https://syntology.ai/paper/2005.11041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11041"}},"official":null}},{"url":"/paper/chexbert-combining-automatic-labelers-and","slug":"chexbert-combining-automatic-labelers-and","title":"CheXbert: Combining Automatic Labelers and Expert Annotations for Accurate Radiology Report Labeling Using BERT","date":"2020-04-20","arxiv_id":"2004.09167","repositories_listed":7,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":11,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/chexbert-combining-automatic-labelers-and#ran","syntology_url":"https://syntology.ai/paper/2004.09167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09167"}},"official":{"repos":["stanfordmlgroup/CheXbert"],"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/drocc-deep-robust-one-class-classification","slug":"drocc-deep-robust-one-class-classification","title":"DROCC: Deep Robust One-Class Classification","date":"2020-02-28","arxiv_id":"2002.12718","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/drocc-deep-robust-one-class-classification#ran","syntology_url":"https://syntology.ai/paper/2002.12718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12718"}},"official":{"repos":["Microsoft/EdgeML"],"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/supervised-learning-on-relational-databases","slug":"supervised-learning-on-relational-databases","title":"Supervised Learning on Relational Databases with Graph Neural Networks","date":"2020-02-06","arxiv_id":"2002.02046","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/supervised-learning-on-relational-databases#ran","syntology_url":"https://syntology.ai/paper/2002.02046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02046"}},"official":{"repos":["mwcvitkovic/Supervised-Learning-on-Relational-Databases-with-GNNs"],"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/optimization-guided-binary-diversification-to","slug":"optimization-guided-binary-diversification-to","title":"Malware Makeover: Breaking ML-based Static Analysis by Modifying Executable Bytes","date":"2019-12-19","arxiv_id":"1912.09064","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/optimization-guided-binary-diversification-to#ran","syntology_url":"https://syntology.ai/paper/1912.09064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09064"}},"official":{"repos":["pwwl/enhanced-binary-diversification"],"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/automl-a-survey-of-the-state-of-the-art","slug":"automl-a-survey-of-the-state-of-the-art","title":"AutoML: A Survey of the State-of-the-Art","date":"2019-08-02","arxiv_id":"1908.00709","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/automl-a-survey-of-the-state-of-the-art#ran","syntology_url":"https://syntology.ai/paper/1908.00709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00709"}},"official":{"repos":["marsggbo/automl_a_survey_of_state_of_the_art"],"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/encoding-high-cardinality-string-categorical","slug":"encoding-high-cardinality-string-categorical","title":"Encoding high-cardinality string categorical variables","date":"2019-07-03","arxiv_id":"1907.01860","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/encoding-high-cardinality-string-categorical#ran","syntology_url":"https://syntology.ai/paper/1907.01860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01860"}},"official":{"repos":["pcerda/string_categorical_encoders"],"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/190600586","slug":"190600586","title":"Discovering Neural Wirings","date":"2019-06-03","arxiv_id":"1906.00586","repositories_listed":4,"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/190600586#ran","syntology_url":"https://syntology.ai/paper/1906.00586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00586"}},"official":{"repos":["allenai/dnw"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/disentangled-attribution-curves-for","slug":"disentangled-attribution-curves-for","title":"Disentangled Attribution Curves for Interpreting Random Forests and Boosted Trees","date":"2019-05-18","arxiv_id":"1905.07631","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/disentangled-attribution-curves-for#ran","syntology_url":"https://syntology.ai/paper/1905.07631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07631"}},"official":{"repos":["csinva/disentangled-attribution-curves"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"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/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/the-autofeat-python-library-for-automatic","slug":"the-autofeat-python-library-for-automatic","title":"The autofeat Python Library for Automated Feature Engineering and Selection","date":"2019-01-22","arxiv_id":"1901.07329","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":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-autofeat-python-library-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1901.07329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07329"}},"official":{"repos":["cod3licious/autofeat"],"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/weakly-supervised-hierarchical-text","slug":"weakly-supervised-hierarchical-text","title":"Weakly-Supervised Hierarchical Text Classification","date":"2018-12-29","arxiv_id":"1812.11270","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/weakly-supervised-hierarchical-text#ran","syntology_url":"https://syntology.ai/paper/1812.11270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.11270"}},"official":{"repos":["yumeng5/WeSHClass"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deepinf-social-influence-prediction-with-deep","slug":"deepinf-social-influence-prediction-with-deep","title":"DeepInf: Social Influence Prediction with Deep Learning","date":"2018-07-15","arxiv_id":"1807.05560","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/deepinf-social-influence-prediction-with-deep#ran","syntology_url":"https://syntology.ai/paper/1807.05560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05560"}},"official":{"repos":["xptree/DeepInf"],"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/easing-embedding-learning-by-comprehensive","slug":"easing-embedding-learning-by-comprehensive","title":"Easing Embedding Learning by Comprehensive Transcription of Heterogeneous Information Networks","date":"2018-07-10","arxiv_id":"1807.03490","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easing-embedding-learning-by-comprehensive#ran","syntology_url":"https://syntology.ai/paper/1807.03490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03490"}},"official":{"repos":["GentleZhu/HEER"],"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/deepfm-an-end-to-end-wide-deep-learning","slug":"deepfm-an-end-to-end-wide-deep-learning","title":"DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction","date":"2018-04-12","arxiv_id":"1804.04950","repositories_listed":8,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deepfm-an-end-to-end-wide-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1804.04950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04950"}},"official":null}},{"url":"/paper/voxelnet-end-to-end-learning-for-point-cloud","slug":"voxelnet-end-to-end-learning-for-point-cloud","title":"VoxelNet: End-to-End Learning for Point Cloud Based 3D Object Detection","date":"2017-11-17","arxiv_id":"1711.06396","repositories_listed":44,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/voxelnet-end-to-end-learning-for-point-cloud#ran","syntology_url":"https://syntology.ai/paper/1711.06396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.06396"}},"official":null}},{"url":"/paper/identifying-quantum-phase-transitions-with","slug":"identifying-quantum-phase-transitions-with","title":"Identifying Quantum Phase Transitions with Adversarial Neural Networks","date":"2017-10-11","arxiv_id":"1710.08382","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/identifying-quantum-phase-transitions-with#ran","syntology_url":"https://syntology.ai/paper/1710.08382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.08382"}},"official":{"repos":["PatrickHuembeli/Adversarial-Domain-Adaptation-for-Identifying-Phase-Transitions"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-cross-network-for-ad-click-predictions","slug":"deep-cross-network-for-ad-click-predictions","title":"Deep & Cross Network for Ad Click Predictions","date":"2017-08-17","arxiv_id":"1708.05123","repositories_listed":16,"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/deep-cross-network-for-ad-click-predictions#ran","syntology_url":"https://syntology.ai/paper/1708.05123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.05123"}},"official":null}},{"url":"/paper/interpretable-predictions-of-tree-based","slug":"interpretable-predictions-of-tree-based","title":"Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweaking","date":"2017-06-20","arxiv_id":"1706.06691","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/interpretable-predictions-of-tree-based#ran","syntology_url":"https://syntology.ai/paper/1706.06691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.06691"}},"official":null}},{"url":"/paper/transfer-learning-for-sequence-tagging-with","slug":"transfer-learning-for-sequence-tagging-with","title":"Transfer Learning for Sequence Tagging with Hierarchical Recurrent Networks","date":"2017-03-18","arxiv_id":"1703.06345","repositories_listed":4,"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/transfer-learning-for-sequence-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1703.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06345"}},"official":{"repos":["kimiyoung/transfer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepfm-a-factorization-machine-based-neural","slug":"deepfm-a-factorization-machine-based-neural","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","date":"2017-03-13","arxiv_id":"1703.04247","repositories_listed":23,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deepfm-a-factorization-machine-based-neural#ran","syntology_url":"https://syntology.ai/paper/1703.04247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04247"}},"official":{"repos":["xue-pai/FuxiCTR"],"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/deep-voice-real-time-neural-text-to-speech","slug":"deep-voice-real-time-neural-text-to-speech","title":"Deep Voice: Real-time Neural Text-to-Speech","date":"2017-02-25","arxiv_id":"1702.07825","repositories_listed":3,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/deep-voice-real-time-neural-text-to-speech#ran","syntology_url":"https://syntology.ai/paper/1702.07825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.07825"}},"official":null}},{"url":"/paper/an-empirical-analysis-of-feature-engineering","slug":"an-empirical-analysis-of-feature-engineering","title":"An Empirical Analysis of Feature Engineering for Predictive Modeling","date":"2017-01-26","arxiv_id":"1701.07852","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":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/an-empirical-analysis-of-feature-engineering#ran","syntology_url":"https://syntology.ai/paper/1701.07852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.07852"}},"official":{"repos":["jeffheaton/papers"],"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/wide-deep-learning-for-recommender-systems","slug":"wide-deep-learning-for-recommender-systems","title":"Wide & Deep Learning for Recommender Systems","date":"2016-06-24","arxiv_id":"1606.07792","repositories_listed":39,"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":5,"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/wide-deep-learning-for-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/1606.07792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07792"}},"official":null}},{"url":"/paper/de-identification-of-patient-notes-with","slug":"de-identification-of-patient-notes-with","title":"De-identification of Patient Notes with Recurrent Neural Networks","date":"2016-06-10","arxiv_id":"1606.03475","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/de-identification-of-patient-notes-with#ran","syntology_url":"https://syntology.ai/paper/1606.03475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.03475"}},"official":null}},{"url":"/paper/deepsurv-personalized-treatment-recommender","slug":"deepsurv-personalized-treatment-recommender","title":"DeepSurv: Personalized Treatment Recommender System Using A Cox Proportional Hazards Deep Neural Network","date":"2016-06-02","arxiv_id":"1606.00931","repositories_listed":4,"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/deepsurv-personalized-treatment-recommender#ran","syntology_url":"https://syntology.ai/paper/1606.00931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00931"}},"official":{"repos":["jaredleekatzman/DeepSurv"],"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/end-to-end-sequence-labeling-via-bi","slug":"end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","arxiv_id":"1603.01354","repositories_listed":25,"syntology":{"n":24,"n_ran":24,"n_constructed":0,"n_ran_checked":22,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":20,"n_pointer_only":3,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 0 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-sequence-labeling-via-bi#ran","syntology_url":"https://syntology.ai/paper/1603.01354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01354"}},"official":null}},{"url":"/paper/named-entity-recognition-with-bidirectional","slug":"named-entity-recognition-with-bidirectional","title":"Named Entity Recognition with Bidirectional LSTM-CNNs","date":"2015-11-26","arxiv_id":"1511.08308","repositories_listed":14,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/named-entity-recognition-with-bidirectional#ran","syntology_url":"https://syntology.ai/paper/1511.08308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.08308"}},"official":null}}],"record_sha256":"af41bc3fab23c0656bb2a0db352d5fcbdb179b595447dd3af9c707b9f2c4cb8a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}