{"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/can-dataset","name":"can-dataset","full_name":"can-dataset","description_markdown":"The controller area network (CAN) bus has emerged as the de facto standard for in-vehicle networks (IVNs) around the globe. Safety-critical components (e.g., the brakes, the engine, the transmission) depend on the CAN bus for expedient, reliable communication. Unfortunately, while the CAN bus was designed to be resilient under harsh operating conditions, it was not designed to be resilient under adversarial conditions. Standard security practices such as authentication, authorization, and encryption are completely lacking when it comes to the CAN bus. Researchers have since developed authentication, authorization, and encryption specifications for the CAN bus, but retroactive implementation of said security controls would be exorbitantly expensive—in terms of hardware, labor, engineering effort, and monetary cost. Therefore, the automotive intrusion detection system (IDS) has emerged in the literature as a low-cost, low-effort solution to the automotive [in]security problem. However, developing and evaluating an automotive IDS can be quite challenging—especially if researchers lack access to a test vehicle. Without a test vehicle, researchers are limited to publicly available CAN data, and existing CAN intrusion detection datasets come with various limitations. This lack of CAN data has become a barrier to entry into automotive intrusion detection research—and even automotive security research in general.\r\n\r\nWe seek to lower this barrier to entry by introducing a new CAN intrusion detection dataset, which facilitates the development and evaluation of automotive IDSs. Our dataset, can-train-and-test, offers real-world CAN traffic data from four different vehicles—a sedan, a compact SUV, a full-size SUV, and a pickup truck—produced by two different manufacturers. For each vehicle, we provided comparable attack captures, which enable researchers to assess a given IDS's ability to generalize to different vehicle types and models. Our dataset contains .log files for playback as well as labeled and unlabeled .csv files for supervised and unsupervised machine learning. As such, our dataset is well suited to a variety of different automotive intrusion detection and automotive security enterprises. In addition, can-train-and-test supplies nine unique attacks, ranging from denial of service (DoS) fuzzing to triple spoofing attacks. As such, researchers can select from a wide variety of attacks when partitioning the data into training and testing datasets. Alternatively, researchers can leverage our curated can-train-and-test repository, which is subdivided into four train/test sub-datasets and four testing subsets. As a benchmark, we pitted 18 machine learning models against the can-train-and-test repository. During our evaluation and analysis, we found that the multi-layer perceptron, gradient boosting, isolation forest, BIRCH, and logistic regression models consistently scored above 0.95 when it came to accuracy, precision, recall, and F1-score—regardless of the sub-dataset and testing subset. Across all experiments on all sub-datasets, we saw an average F1-score of ≈0.5039, indicating that our can-train-and-test dataset is indeed capable of distinguishing capable, well-trained IDSs from their less-than-capable counterparts. We present can-train-and-test as a contribution to the existing collection of open-access CAN intrusion detection datasets in hopes of filling in the gaps left by the existing collection.","description_withheld":null,"homepage":"https://bitbucket.org/brooke-lampe/can-dataset/src/master/","introduced_date":"2023-08-09","introduced_date_note":null,"introduced_by":{"paper":null,"title":"can-train-and-test: A Curated CAN Dataset for Automotive Intrusion Detection","first_author":null,"url":null},"license":null,"modalities":[],"tasks":[],"languages":[],"variants":["can-dataset"],"data_loaders":[],"num_papers_in_archive":1,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[],"papers":{"order":"date (newest first), then slug","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,"shown":0,"of":0,"counts":{"papers_with_a_benchmark_row":0,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":0,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[],"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_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.","pages":[],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":0,"papers_with_a_run_with_no_instrument_failure":0,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"2bea537f45d75f28670478c00b24f458f758462e25c2043810845c6ab9545366","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}