{"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":"/dataset/mnist/papers/ran/1","list_of":"/dataset/mnist","dataset":"MNIST","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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 dataset or check it against this dataset'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.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,78],"of":78,"counts":{"papers_with_a_benchmark_row":216,"with_a_code_link":180,"where_syntology_ran_a_sample":78,"not_listed_spam_title":0,"listed":216,"listed_where_code_ran":78,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":66,"every_run_a_failure_of_syntologys_instrument":12,"listed_with_a_run_with_no_instrument_failure":66,"listed_every_run_a_failure_of_syntologys_instrument":12,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/mnist/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":3,"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}}}},{"paper":"/paper/hierarchical-vae-with-a-diffusion-based","slug":"hierarchical-vae-with-a-diffusion-based","title":"Hierarchical VAE with a Diffusion-based VampPrior","date":"2024-12-02","arxiv_id":"2412.01373","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["akuzina/dvp_vae"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-vae-with-a-diffusion-based#ran","syntology_url":"https://syntology.ai/paper/2412.01373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.01373"}}}},{"paper":"/paper/rkan-rational-kolmogorov-arnold-networks","slug":"rkan-rational-kolmogorov-arnold-networks","title":"rKAN: Rational Kolmogorov-Arnold Networks","date":"2024-06-20","arxiv_id":"2406.14495","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["alirezaafzalaghaei/rkan"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rkan-rational-kolmogorov-arnold-networks#ran","syntology_url":"https://syntology.ai/paper/2406.14495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14495"}}}},{"paper":"/paper/let-go-of-your-labels-with-unsupervised-1","slug":"let-go-of-your-labels-with-unsupervised-1","title":"Let Go of Your Labels with Unsupervised Transfer","date":"2024-06-11","arxiv_id":"2406.07236","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["mlbio-epfl/turtle"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/let-go-of-your-labels-with-unsupervised-1#ran","syntology_url":"https://syntology.ai/paper/2406.07236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07236"}}}},{"paper":"/paper/fkan-fractional-kolmogorov-arnold-networks","slug":"fkan-fractional-kolmogorov-arnold-networks","title":"fKAN: Fractional Kolmogorov-Arnold Networks with trainable Jacobi basis functions","date":"2024-06-11","arxiv_id":"2406.07456","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["alirezaafzalaghaei/fKAN"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fkan-fractional-kolmogorov-arnold-networks#ran","syntology_url":"https://syntology.ai/paper/2406.07456","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07456"}}}},{"paper":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}}}},{"paper":"/paper/ckgconv-general-graph-convolution-with","slug":"ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","arxiv_id":"2404.13604","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":11,"official":{"repos":["networkslab/ckgconv"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}}}},{"paper":"/paper/topology-informed-graph-transformer","slug":"topology-informed-graph-transformer","title":"Topology-Informed Graph Transformer","date":"2024-02-03","arxiv_id":"2402.02005","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":17,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":21,"official":{"repos":["leemingo/tigt"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/topology-informed-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2402.02005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02005"}}}},{"paper":"/paper/graph-inductive-biases-in-transformers","slug":"graph-inductive-biases-in-transformers","title":"Graph Inductive Biases in Transformers without Message Passing","date":"2023-05-27","arxiv_id":"2305.17589","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":1,"official":{"repos":["liamma/grit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-inductive-biases-in-transformers#ran","syntology_url":"https://syntology.ai/paper/2305.17589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17589"}}}},{"paper":"/paper/smpconv-self-moving-point-representations-for","slug":"smpconv-self-moving-point-representations-for","title":"SMPConv: Self-moving Point Representations for Continuous Convolution","date":"2023-04-05","arxiv_id":"2304.02330","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["sangnekim/smpconv"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/smpconv-self-moving-point-representations-for#ran","syntology_url":"https://syntology.ai/paper/2304.02330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02330"}}}},{"paper":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["hamed1375/exphormer"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}}}},{"paper":"/paper/accelerating-spiking-neural-network-training","slug":"accelerating-spiking-neural-network-training","title":"Robust and accelerated single-spike spiking neural network training with applicability to challenging temporal tasks","date":"2022-05-30","arxiv_id":"2205.15286","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["webstorms/fastsnn"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/accelerating-spiking-neural-network-training#ran","syntology_url":"https://syntology.ai/paper/2205.15286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15286"}}}},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":18,"pointer_only_for_licence":0,"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}}}},{"paper":"/paper/wavemix-resource-efficient-token-mixing-for","slug":"wavemix-resource-efficient-token-mixing-for","title":"WaveMix: Resource-efficient Token Mixing for Images","date":"2022-03-07","arxiv_id":"2203.03689","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["pranavphoenix/WaveMix"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wavemix-resource-efficient-token-mixing-for#ran","syntology_url":"https://syntology.ai/paper/2203.03689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03689"}}}},{"paper":"/paper/efficiently-modeling-long-sequences-with-1","slug":"efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","arxiv_id":"2111.00396","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":55,"samples_ran":37,"samples_constructed":8,"samples_ran_checked":21,"samples_ran_instrument_failed":16,"samples_unverified":18,"pointer_only_for_licence":3,"official":{"repos":["state-spaces/s4"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficiently-modeling-long-sequences-with-1#ran","syntology_url":"https://syntology.ai/paper/2111.00396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.00396"}}}},{"paper":"/paper/combining-recurrent-convolutional-and","slug":"combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","arxiv_id":"2110.13985","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":53,"samples_ran":19,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":14,"samples_unverified":34,"pointer_only_for_licence":0,"official":{"repos":["hazyresearch/state-spaces"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":16,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/combining-recurrent-convolutional-and#ran","syntology_url":"https://syntology.ai/paper/2110.13985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13985"}}}},{"paper":"/paper/long-expressive-memory-for-sequence-modeling-1","slug":"long-expressive-memory-for-sequence-modeling-1","title":"Long Expressive Memory for Sequence Modeling","date":"2021-10-10","arxiv_id":"2110.04744","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":5,"samples_constructed":1,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":1,"official":{"repos":["tk-rusch/lem"],"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":["found_in_text","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/long-expressive-memory-for-sequence-modeling-1#ran","syntology_url":"https://syntology.ai/paper/2110.04744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04744"}}}},{"paper":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}}}},{"paper":"/paper/robust-training-in-high-dimensions-via-block","slug":"robust-training-in-high-dimensions-via-block","title":"Robust Training in High Dimensions via Block Coordinate Geometric Median Descent","date":"2021-06-16","arxiv_id":"2106.08882","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["anishacharya/Optimization-Mavericks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/robust-training-in-high-dimensions-via-block#ran","syntology_url":"https://syntology.ai/paper/2106.08882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08882"}}}},{"paper":"/paper/dasvdd-deep-autoencoding-support-vector-data","slug":"dasvdd-deep-autoencoding-support-vector-data","title":"DASVDD: Deep Autoencoding Support Vector Data Descriptor for Anomaly Detection","date":"2021-06-09","arxiv_id":"2106.05410","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["Armanfard-Lab/DASVDD"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dasvdd-deep-autoencoding-support-vector-data#ran","syntology_url":"https://syntology.ai/paper/2106.05410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05410"}}}},{"paper":"/paper/boosting-a-model-zoo-for-multi-task-and","slug":"boosting-a-model-zoo-for-multi-task-and","title":"Model Zoo: A Growing \"Brain\" That Learns Continually","date":"2021-06-06","arxiv_id":"2106.03027","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["grasp-lyrl/modelzoo_continual","rahul13ramesh/modelzoo_continual"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/boosting-a-model-zoo-for-multi-task-and#ran","syntology_url":"https://syntology.ai/paper/2106.03027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03027"}}}},{"paper":"/paper/dranet-disentangling-representation-and","slug":"dranet-disentangling-representation-and","title":"DRANet: Disentangling Representation and Adaptation Networks for Unsupervised Cross-Domain Adaptation","date":"2021-03-24","arxiv_id":"2103.13447","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["Seung-Hun-Lee/DRANet"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dranet-disentangling-representation-and#ran","syntology_url":"https://syntology.ai/paper/2103.13447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13447"}}}},{"paper":"/paper/unicornn-a-recurrent-model-for-learning-very","slug":"unicornn-a-recurrent-model-for-learning-very","title":"UnICORNN: A recurrent model for learning very long time dependencies","date":"2021-03-09","arxiv_id":"2103.05487","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["tk-rusch/unicornn"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unicornn-a-recurrent-model-for-learning-very#ran","syntology_url":"https://syntology.ai/paper/2103.05487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05487"}}}},{"paper":"/paper/unsupervised-anomaly-detection-and","slug":"unsupervised-anomaly-detection-and","title":"Deep One-Class Classification via Interpolated Gaussian Descriptor","date":"2021-01-25","arxiv_id":"2101.10043","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["tianyu0207/IGD"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-anomaly-detection-and#ran","syntology_url":"https://syntology.ai/paper/2101.10043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.10043"}}}},{"paper":"/paper/probabilistic-numeric-convolutional-neural-1","slug":"probabilistic-numeric-convolutional-neural-1","title":"Probabilistic Numeric Convolutional Neural Networks","date":"2020-10-21","arxiv_id":"2010.10876","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/probabilistic-numeric-convolutional-neural-1#ran","syntology_url":"https://syntology.ai/paper/2010.10876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10876"}}}},{"paper":"/paper/coupled-oscillatory-recurrent-neural-network","slug":"coupled-oscillatory-recurrent-neural-network","title":"Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependencies","date":"2020-10-02","arxiv_id":"2010.00951","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["tk-rusch/coRNN"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/coupled-oscillatory-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/2010.00951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00951"}}}},{"paper":"/paper/hippo-recurrent-memory-with-optimal","slug":"hippo-recurrent-memory-with-optimal","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","date":"2020-08-17","arxiv_id":"2008.07669","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":5,"official":{"repos":["HazyResearch/hippo-code"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hippo-recurrent-memory-with-optimal#ran","syntology_url":"https://syntology.ai/paper/2008.07669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07669"}}}},{"paper":"/paper/sliced-iterative-generator","slug":"sliced-iterative-generator","title":"Sliced Iterative Normalizing Flows","date":"2020-07-01","arxiv_id":"2007.00674","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["biweidai/SIG"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sliced-iterative-generator#ran","syntology_url":"https://syntology.ai/paper/2007.00674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00674"}}}},{"paper":"/paper/deep-transformation-invariant-clustering","slug":"deep-transformation-invariant-clustering","title":"Deep Transformation-Invariant Clustering","date":"2020-06-19","arxiv_id":"2006.11132","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["monniert/dti-clustering"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-transformation-invariant-clustering#ran","syntology_url":"https://syntology.ai/paper/2006.11132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11132"}}}},{"paper":"/paper/on-second-order-behaviour-in-augmented-neural","slug":"on-second-order-behaviour-in-augmented-neural","title":"On Second Order Behaviour in Augmented Neural ODEs","date":"2020-06-12","arxiv_id":"2006.07220","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/on-second-order-behaviour-in-augmented-neural#ran","syntology_url":"https://syntology.ai/paper/2006.07220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07220"}}}},{"paper":"/paper/old-is-mathbf-mathcal-g-old-redefining-the","slug":"old-is-mathbf-mathcal-g-old-redefining-the","title":"Old is Gold: Redefining the Adversarially Learned One-Class Classifier Training Paradigm","date":"2020-04-16","arxiv_id":"2004.07657","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["xaggi/OGNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/old-is-mathbf-mathcal-g-old-redefining-the#ran","syntology_url":"https://syntology.ai/paper/2004.07657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07657"}}}},{"paper":"/paper/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","rows_on_this_dataset":1,"code_links":15,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":23,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":13,"pointer_only_for_licence":1,"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}}}},{"paper":"/paper/do-we-really-need-to-access-the-source-data","slug":"do-we-really-need-to-access-the-source-data","title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","date":"2020-02-20","arxiv_id":"2002.08546","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["tim-learn/SHOT"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/do-we-really-need-to-access-the-source-data#ran","syntology_url":"https://syntology.ai/paper/2002.08546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08546"}}}},{"paper":"/paper/how-to-train-your-neural-ode","slug":"how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","arxiv_id":"2002.02798","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":1,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-to-train-your-neural-ode#ran","syntology_url":"https://syntology.ai/paper/2002.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02798"}}}},{"paper":"/paper/n2dnot-too-deep-clustering-via-clustering-the","slug":"n2dnot-too-deep-clustering-via-clustering-the","title":"N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding","date":"2019-08-16","arxiv_id":"1908.05968","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["rymc/n2d"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/n2dnot-too-deep-clustering-via-clustering-the#ran","syntology_url":"https://syntology.ai/paper/1908.05968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05968"}}}},{"paper":"/paper/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["DSE-MSU/R-transformer"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}}}},{"paper":"/paper/residual-flows-for-invertible-generative","slug":"residual-flows-for-invertible-generative","title":"Residual Flows for Invertible Generative Modeling","date":"2019-06-06","arxiv_id":"1906.02735","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["rtqichen/residual-flows"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/residual-flows-for-invertible-generative#ran","syntology_url":"https://syntology.ai/paper/1906.02735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02735"}}}},{"paper":"/paper/generative-latent-flow-a-framework-for-non","slug":"generative-latent-flow-a-framework-for-non","title":"Generative Latent Flow","date":"2019-05-24","arxiv_id":"1905.10485","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generative-latent-flow-a-framework-for-non#ran","syntology_url":"https://syntology.ai/paper/1905.10485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10485"}}}},{"paper":"/paper/augmented-neural-odes","slug":"augmented-neural-odes","title":"Augmented Neural ODEs","date":"2019-04-02","arxiv_id":"1904.01681","rows_on_this_dataset":2,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["EmilienDupont/augmented-neural-odes"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmented-neural-odes#ran","syntology_url":"https://syntology.ai/paper/1904.01681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01681"}}}},{"paper":"/paper/cluster-alignment-with-a-teacher-for","slug":"cluster-alignment-with-a-teacher-for","title":"Cluster Alignment with a Teacher for Unsupervised Domain Adaptation","date":"2019-03-24","arxiv_id":"1903.09980","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["thudzj/CAT"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cluster-alignment-with-a-teacher-for#ran","syntology_url":"https://syntology.ai/paper/1903.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09980"}}}},{"paper":"/paper/concrete-autoencoders-for-differentiable","slug":"concrete-autoencoders-for-differentiable","title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","date":"2019-01-27","arxiv_id":"1901.09346","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}}}},{"paper":"/paper/learning-to-remember-more-with-less","slug":"learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","arxiv_id":"1901.01347","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-remember-more-with-less#ran","syntology_url":"https://syntology.ai/paper/1901.01347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01347"}}}},{"paper":"/paper/invertible-residual-networks","slug":"invertible-residual-networks","title":"Invertible Residual Networks","date":"2018-11-02","arxiv_id":"1811.00995","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":7,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/invertible-residual-networks#ran","syntology_url":"https://syntology.ai/paper/1811.00995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00995"}}}},{"paper":"/paper/ffjord-free-form-continuous-dynamics-for","slug":"ffjord-free-form-continuous-dynamics-for","title":"FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Models","date":"2018-10-02","arxiv_id":"1810.01367","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ffjord-free-form-continuous-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/1810.01367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01367"}}}},{"paper":"/paper/invariant-information-distillation-for","slug":"invariant-information-distillation-for","title":"Invariant Information Clustering for Unsupervised Image Classification and Segmentation","date":"2018-07-17","arxiv_id":"1807.06653","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":18,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["xu-ji/IIC"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/invariant-information-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1807.06653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06653"}}}},{"paper":"/paper/defense-gan-protecting-classifiers-against","slug":"defense-gan-protecting-classifiers-against","title":"Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models","date":"2018-05-17","arxiv_id":"1805.06605","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["kabkabm/defensegan"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/defense-gan-protecting-classifiers-against#ran","syntology_url":"https://syntology.ai/paper/1805.06605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06605"}}}},{"paper":"/paper/the-tsetlin-machine-a-game-theoretic-bandit","slug":"the-tsetlin-machine-a-game-theoretic-bandit","title":"The Tsetlin Machine - A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic","date":"2018-04-04","arxiv_id":"1804.01508","rows_on_this_dataset":1,"code_links":16,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cair/TsetlinMachine","cair/fast-tsetlin-machine-with-mnist-demo"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-tsetlin-machine-a-game-theoretic-bandit#ran","syntology_url":"https://syntology.ai/paper/1804.01508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.01508"}}}},{"paper":"/paper/deepjdot-deep-joint-distribution-optimal","slug":"deepjdot-deep-joint-distribution-optimal","title":"DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation","date":"2018-03-27","arxiv_id":"1803.10081","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":17,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepjdot-deep-joint-distribution-optimal#ran","syntology_url":"https://syntology.ai/paper/1803.10081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10081"}}}},{"paper":"/paper/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}}}},{"paper":"/paper/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","rows_on_this_dataset":1,"code_links":35,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["locuslab/TCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}}}},{"paper":"/paper/maximum-classifier-discrepancy-for","slug":"maximum-classifier-discrepancy-for","title":"Maximum Classifier Discrepancy for Unsupervised Domain Adaptation","date":"2017-12-07","arxiv_id":"1712.02560","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["mil-tokyo/MCD_DA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/maximum-classifier-discrepancy-for#ran","syntology_url":"https://syntology.ai/paper/1712.02560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02560"}}}},{"paper":"/paper/cycada-cycle-consistent-adversarial-domain","slug":"cycada-cycle-consistent-adversarial-domain","title":"CyCADA: Cycle-Consistent Adversarial Domain Adaptation","date":"2017-11-08","arxiv_id":"1711.03213","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jhoffman/cycada_release"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cycada-cycle-consistent-adversarial-domain#ran","syntology_url":"https://syntology.ai/paper/1711.03213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03213"}}}},{"paper":"/paper/dynamic-routing-between-capsules","slug":"dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","arxiv_id":"1710.09829","rows_on_this_dataset":1,"code_links":77,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":118,"samples_ran":75,"samples_constructed":0,"samples_ran_checked":58,"samples_ran_instrument_failed":17,"samples_unverified":43,"pointer_only_for_licence":13,"official":{"repos":["Sarasra/models"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-routing-between-capsules#ran","syntology_url":"https://syntology.ai/paper/1710.09829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.09829"}}}},{"paper":"/paper/dilated-recurrent-neural-networks","slug":"dilated-recurrent-neural-networks","title":"Dilated Recurrent Neural Networks","date":"2017-10-05","arxiv_id":"1710.02224","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["code-terminator/DilatedRNN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dilated-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1710.02224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.02224"}}}},{"paper":"/paper/masked-autoregressive-flow-for-density","slug":"masked-autoregressive-flow-for-density","title":"Masked Autoregressive Flow for Density Estimation","date":"2017-05-19","arxiv_id":"1705.07057","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":28,"samples_ran":22,"samples_constructed":14,"samples_ran_checked":22,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":9,"official":{"repos":["gpapamak/maf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/masked-autoregressive-flow-for-density#ran","syntology_url":"https://syntology.ai/paper/1705.07057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07057"}}}},{"paper":"/paper/adversarial-discriminative-domain-adaptation","slug":"adversarial-discriminative-domain-adaptation","title":"Adversarial Discriminative Domain Adaptation","date":"2017-02-17","arxiv_id":"1702.05464","rows_on_this_dataset":2,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":48,"samples_ran":14,"samples_constructed":5,"samples_ran_checked":7,"samples_ran_instrument_failed":7,"samples_unverified":34,"pointer_only_for_licence":12,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adversarial-discriminative-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1702.05464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05464"}}}},{"paper":"/paper/geometric-deep-learning-on-graphs-and","slug":"geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","arxiv_id":"1611.08402","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/geometric-deep-learning-on-graphs-and#ran","syntology_url":"https://syntology.ai/paper/1611.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08402"}}}},{"paper":"/paper/unsupervised-cross-domain-image-generation","slug":"unsupervised-cross-domain-image-generation","title":"Unsupervised Cross-Domain Image Generation","date":"2016-11-07","arxiv_id":"1611.02200","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":18,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":6,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-cross-domain-image-generation#ran","syntology_url":"https://syntology.ai/paper/1611.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.02200"}}}},{"paper":"/paper/domain-separation-networks","slug":"domain-separation-networks","title":"Domain Separation Networks","date":"2016-08-22","arxiv_id":"1608.06019","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":5,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["tensorflow/models"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-separation-networks#ran","syntology_url":"https://syntology.ai/paper/1608.06019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.06019"}}}},{"paper":"/paper/lets-keep-it-simple-using-simple","slug":"lets-keep-it-simple-using-simple","title":"Lets keep it simple, Using simple architectures to outperform deeper and more complex architectures","date":"2016-08-22","arxiv_id":"1608.06037","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["Coderx7/SimpleNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lets-keep-it-simple-using-simple#ran","syntology_url":"https://syntology.ai/paper/1608.06037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.06037"}}}},{"paper":"/paper/infogan-interpretable-representation-learning","slug":"infogan-interpretable-representation-learning","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","date":"2016-06-12","arxiv_id":"1606.03657","rows_on_this_dataset":1,"code_links":38,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/infogan-interpretable-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1606.03657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.03657"}}}},{"paper":"/paper/joint-unsupervised-learning-of-deep","slug":"joint-unsupervised-learning-of-deep","title":"Joint Unsupervised Learning of Deep Representations and Image Clusters","date":"2016-04-13","arxiv_id":"1604.03628","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jwyang/joint-unsupervised-learning"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/joint-unsupervised-learning-of-deep#ran","syntology_url":"https://syntology.ai/paper/1604.03628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.03628"}}}},{"paper":"/paper/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}}}},{"paper":"/paper/unitary-evolution-recurrent-neural-networks","slug":"unitary-evolution-recurrent-neural-networks","title":"Unitary Evolution Recurrent Neural Networks","date":"2015-11-20","arxiv_id":"1511.06464","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unitary-evolution-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.06464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06464"}}}},{"paper":"/paper/all-you-need-is-a-good-init","slug":"all-you-need-is-a-good-init","title":"All you need is a good init","date":"2015-11-19","arxiv_id":"1511.06422","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":19,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":9,"pointer_only_for_licence":2,"official":{"repos":["ducha-aiki/LSUVinit"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/all-you-need-is-a-good-init#ran","syntology_url":"https://syntology.ai/paper/1511.06422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06422"}}}},{"paper":"/paper/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","rows_on_this_dataset":1,"code_links":29,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":9,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}}}},{"paper":"/paper/batch-normalized-maxout-network-in-network","slug":"batch-normalized-maxout-network-in-network","title":"Batch-normalized Maxout Network in Network","date":"2015-11-09","arxiv_id":"1511.02583","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/batch-normalized-maxout-network-in-network#ran","syntology_url":"https://syntology.ai/paper/1511.02583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02583"}}}},{"paper":"/paper/binaryconnect-training-deep-neural-networks","slug":"binaryconnect-training-deep-neural-networks","title":"BinaryConnect: Training Deep Neural Networks with binary weights during propagations","date":"2015-11-02","arxiv_id":"1511.00363","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["MatthieuCourbariaux/BinaryConnect"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/binaryconnect-training-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.00363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.00363"}}}},{"paper":"/paper/generalizing-pooling-functions-in","slug":"generalizing-pooling-functions-in","title":"Generalizing Pooling Functions in Convolutional Neural Networks: Mixed, Gated, and Tree","date":"2015-09-30","arxiv_id":"1509.08985","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generalizing-pooling-functions-in#ran","syntology_url":"https://syntology.ai/paper/1509.08985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.08985"}}}},{"paper":"/paper/tensorizing-neural-networks","slug":"tensorizing-neural-networks","title":"Tensorizing Neural Networks","date":"2015-09-22","arxiv_id":"1509.06569","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["Bihaqo/TensorNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/tensorizing-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1509.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.06569"}}}},{"paper":"/paper/domain-adversarial-training-of-neural","slug":"domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","arxiv_id":"1505.07818","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":52,"samples_ran":35,"samples_constructed":11,"samples_ran_checked":18,"samples_ran_instrument_failed":17,"samples_unverified":17,"pointer_only_for_licence":22,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-adversarial-training-of-neural#ran","syntology_url":"https://syntology.ai/paper/1505.07818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.07818"}}}},{"paper":"/paper/learning-transferable-features-with-deep","slug":"learning-transferable-features-with-deep","title":"Learning Transferable Features with Deep Adaptation Networks","date":"2015-02-10","arxiv_id":"1502.02791","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-transferable-features-with-deep#ran","syntology_url":"https://syntology.ai/paper/1502.02791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.02791"}}}},{"paper":"/paper/explaining-and-harnessing-adversarial","slug":"explaining-and-harnessing-adversarial","title":"Explaining and Harnessing Adversarial Examples","date":"2014-12-20","arxiv_id":"1412.6572","rows_on_this_dataset":1,"code_links":59,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":16,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":7,"samples_unverified":5,"pointer_only_for_licence":8,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/explaining-and-harnessing-adversarial#ran","syntology_url":"https://syntology.ai/paper/1412.6572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6572"}}}},{"paper":"/paper/fractional-max-pooling","slug":"fractional-max-pooling","title":"Fractional Max-Pooling","date":"2014-12-18","arxiv_id":"1412.6071","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fractional-max-pooling#ran","syntology_url":"https://syntology.ai/paper/1412.6071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6071"}}}},{"paper":"/paper/unsupervised-domain-adaptation-by","slug":"unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","arxiv_id":"1409.7495","rows_on_this_dataset":1,"code_links":22,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":41,"samples_ran":34,"samples_constructed":11,"samples_ran_checked":22,"samples_ran_instrument_failed":12,"samples_unverified":7,"pointer_only_for_licence":14,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-domain-adaptation-by#ran","syntology_url":"https://syntology.ai/paper/1409.7495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.7495"}}}},{"paper":"/paper/deeply-supervised-nets","slug":"deeply-supervised-nets","title":"Deeply-Supervised Nets","date":"2014-09-18","arxiv_id":"1409.5185","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":20,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deeply-supervised-nets#ran","syntology_url":"https://syntology.ai/paper/1409.5185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.5185"}}}},{"paper":"/paper/pcanet-a-simple-deep-learning-baseline-for","slug":"pcanet-a-simple-deep-learning-baseline-for","title":"PCANet: A Simple Deep Learning Baseline for Image Classification?","date":"2014-04-14","arxiv_id":"1404.3606","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pcanet-a-simple-deep-learning-baseline-for#ran","syntology_url":"https://syntology.ai/paper/1404.3606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1404.3606"}}}},{"paper":"/paper/network-in-network","slug":"network-in-network","title":"Network In Network","date":"2013-12-16","arxiv_id":"1312.4400","rows_on_this_dataset":1,"code_links":17,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["worksheets.codalab.org/worksheets/0x7b8f6fbc6b5c49c18ac7ca94aafaa1a7"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/network-in-network#ran","syntology_url":"https://syntology.ai/paper/1312.4400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.4400"}}}}],"record_sha256":"131554eab02c0d76c093b5847ed721206b98b9174c38dfdb4b6692b4fba0f986","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}