{"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/sim-combi","name":"sim-combi","full_name":null,"description_markdown":"# Data simulator for polypharmacies / drug combinations\r\n\r\n## TL;DR\r\n```python create_dataset.py [--config path/to/config.json --seed your_seed]```\r\n\r\nTemplate of `config.json` in `configs/`\r\n\r\n## Example end result\r\n| Rx1 | Rx2 | Rx3 | Rx4 | ... | RxN | RR   |\r\n|-----|-----|-----|-----|-----|-----|------|\r\n| 1   | 0   | 0   | 1   | ... | 0   | 3.00 |\r\n| 0   | 1   | 0   | 1   | ... | 1   | 2.67 |\r\n| 0   | 1   | 1   | 1   | ... | 1   | 3.14 |\r\n| ⋮   | ⋮   | ⋮   | ⋮   | ... | ⋮   | ⋮    |\r\n| 1   | 1   | 1   | 1   | ... | 0  | 1.85|\r\n\r\n\r\n## Abbreviations\r\n* RR = Relative risk\r\n\r\n## Configuration\r\n* `file_identifier`: File identifier for the output data\r\n* `output_dir`: Directory identifier for the output data\r\n* `seed`: Random seed\r\n* `n_combi`: Number of unique drug combinations to produce\r\n* `n_rx`: Number of individual drugs (equals the number of columns in the generated dataset)\r\n* `mean_rx`: Mean number of drugs per combination\r\n* `use_gpu`: Indicate whether to use GPU for data generation, if available\r\n\r\n* `patterns`: Sub-configuration for the dangerous patterns\r\n    * `n_patterns`: Number of dangerous patterns to generate\r\n    * `min_rr`: Minimal RR for patterns\r\n    * `max_rr`: Maximal RR for patterns\r\n    * `mean_rx`: Mean number of drugs per dangerous patterns\r\n\r\n* `disjoint_combinations`: Sub-configuration for drug combinations disjoint from the dangerous patterns \r\n    * `mean_rr`: Gaussian mean for the RR of these combinations\r\n    * `std_rr`: Gaussian standard deviation of these combinations\r\n\r\n\r\n* `inter_combinations`: Sub-configurtion for drug combinations which intersect with dangerous patterns\r\n    * `std_rr`: Gaussian standard deviation of these combinations\r\n\r\n\r\n## Used Distributions\r\n### Patterns\r\nHere, uniform distributions within the interval [`patterns:min_rr`, `patterns:max_rr`] are used to facilitate the creation of datasets of varying difficulty levels.\r\n\r\n### Combinations with Intersection with a Pattern\r\nA normal distribution with a standard deviation of `inter_combinations:std_rr` is used, with a mean calculated based on the similarity between combinations and dangerous patterns.\r\n\r\n### Disjoint Combinations of Patterns\r\nA normal distribution with a mean of `disjoint_combinations:mean_rr` and a standard deviation of `disjoint_combinations:std_rr` is used. Combinations related to a pattern will thus be closer to an RR predetermined by the configuration.\r\n\r\n## General Idea\r\n1. Generate dangerous patterns and associated risks randomly.\r\n2. Generate combinations.\r\n3. Generate risks based on the similarity between combinations and patterns.\r\n\r\nThis can be seen as a cut that overflows into other cuts, or as a tree. Each pattern is a root from which several combinations stem. A combination is associated with a pattern if the pattern is its nearest neighbor according to the Hamming distance. However, a combination can be placed in a separate set if no medication is shared between the combination and the nearest pattern.\r\n\r\nSee our [paper](https://arxiv.org/abs/2212.05190) for more details. \r\n\r\n## Troubleshooting\r\n1. If stuck on \"Regenerating bad combinations...\", it is possible that the average number of \"possible\" combinations is smaller than the number of combinations being generated. In other words, the average number of Rx per combination should be increased, otherwise, you'll be stuck in an infinite loop.\r\nTo ensure a finite loop, it suffices to have:\r\n\r\n$$ C_k(n) = {n \\choose k} = \\frac{n!}{k!(n-k)!} $$\r\n\r\nwhere $n$ is the number of Rx, $k$ is the average number of Rx per combination. This condition is sufficient but not necessary, as we are working in expectation.","description_withheld":null,"homepage":"https://github.com/IA-Polypharmacie-ULaval/sim-combi","introduced_date":"2022-12-10","introduced_date_note":null,"introduced_by":{"paper":"/paper/neural-bandits-for-data-mining-searching-for","title":"Neural Bandits for Data Mining: Searching for Dangerous Polypharmacy","first_author":"Alexandre Larouche","url":null},"license":null,"modalities":[],"tasks":[],"languages":[],"variants":["sim-combi"],"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":"9111658a8b366f9ea3197bcce1180f79ef2d8ce674559f1d40105afc26d3540b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}