{"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/data-for-linking-datasets-on-organizations","name":"Data for: \"Linking Datasets on Organizations Using Half a Billion Open-Collaborated Records\"","full_name":"Data for: \"Linking Datasets on Organizations Using Half a Billion Open-Collaborated Records\"","description_markdown":"**Source: Linking Datasets on Organizations Using Half-a-Billion Open-Collaborated Records (Description (Markdown and LATEX enabled))**\r\n\r\n### High-Level Explanation of the Dataset \r\n- **Scale and Composition**: This repository provides millions of positive and negative name match examples (e.g., “PosMatches_mat.csv,” “NegMatches_mat.csv,” etc.) derived from LinkedIn data, alongside bipartite and Markov network representations of organizational relationships.  \r\n- **LinkedIn-Based Training Corpus**: By leveraging the open-collaborated records from LinkedIn, the dataset offers a vast repository of string pairs—covering trillions of potential organization name matches—designed to refine and improve the accuracy of fuzzy matching techniques.\r\n\r\n### Motivations and Summary of Content \r\n- **Overcoming String Matching Challenges**: Standard fuzzy matching struggles with highly variable and context-dependent organization names. This dataset was created to provide large-scale, diverse examples for training advanced machine learning models to address these limitations.  \r\n- **Network Representation**: In addition to direct name-pair examples, the dataset includes bipartite and Markov network files that capture relationships between organizations, recognizing that organizational matching often depends on structural ties (e.g., shared employees or affiliated branches).  \r\n- **Examples Folder**: The `Example*` directories illustrate how the data can be integrated into typical merging tasks: each folder includes `x` and `y` variables (e.g., `by_x` and `by_y`) and a merged `z` dataset, demonstrating how linkage can be evaluated and improved in applied research settings.\r\n\r\n### Potential Use Cases\r\n1. **Entity Resolution / Record Linkage**: Researchers and data scientists can use the millions of positive and negative organizational name matches to train more robust entity resolution algorithms across various domains (e.g., nonprofit, corporate, government datasets).  \r\n2. **Network Analysis**: The bipartite and Markov network representations allow for investigations into the structural connectivity of organizations, uncovering patterns in how organizational names (and, by extension, entities) relate to one another.  \r\n3. **Benchmarking and Methodological Development**: Method developers can employ this corpus to benchmark and stress-test new string matching approaches, harnessing the dataset’s size and diversity to refine algorithmic performance.  \r\n4. **Domain-Specific Applications**: Researchers studying lobbying firms, nonprofits, or other organizational types can integrate this dataset to improve the reliability of merges between multiple datasets that lack standardized IDs.\r\n\r\nFor further details or questions, please contact the authors at the email provided in the repository.","description_withheld":null,"homepage":"https://doi.org/10.7910/DVN/EHRQQL","introduced_date":"2023-02-06","introduced_date_note":null,"introduced_by":{"paper":"/paper/linking-datasets-on-organizations-using-half","title":"Linking Datasets on Organizations Using Half A Billion Open-Collaborated Records","first_author":null,"url":null},"license":{"name":"GLP-3","url":"https://www.gnu.org/licenses/gpl-3.0.en.html#license-text"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"},{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[],"languages":[],"variants":["Data for: \"Linking Datasets on Organizations Using Half a Billion Open-Collaborated Records\""],"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":"b402c982875a0c39ab78aa61ed70a3e9e3eef81baea661b99594512da754fc06","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}