{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/patent-classification","name":"Patent classification","slug":"patent-classification","description_markdown":"Patent reviewers usually are responsible to classify the patent applications, i.e., they assign the design codes. This is time-consuming due to the numerous classification codes. For instance, the U.S. design patent system has 33 classes which are further divided into subclasses. Given that design patents include both titles and visual content, the goal of the experiment is patent classification by integrating titles, captions, and images. Although a single design patent can be associated with multiple design codes, we focus on the primary classification—solving the task as a multi-class classification problem.","categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":36,"papers_with_code":9,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/dapfam","name":"DAPFAM","full_name":"A Domain‑Aware Patent Retrieval Dataset Aggregated at the Family Level","num_papers_in_archive":1},{"url":"/dataset/impact-patent","name":"IMPACT Patent","full_name":"A Large-scale Integrated Multimodal Patent Analysis and Creation Dataset for Design Patents","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/multi-class-classification","name":"Multi-class Classification"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":36,"of":36,"of_with_code":9,"tagged_in_all":36,"counts":{"archive_papers_tagged":36,"with_a_code_link":9,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":36,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/hybrid-model-for-patent-classification-using","slug":"hybrid-model-for-patent-classification-using","title":"PatentSBERTa: A Deep NLP based Hybrid Model for Patent Distance and Classification using Augmented SBERT","date":"2021-03-22","arxiv_id":"2103.11933","repositories_listed":2,"syntology":null},{"url":"/paper/impact-a-large-scale-integrated-multimodal","slug":"impact-a-large-scale-integrated-multimodal","title":"IMPACT: A Large-scale Integrated Multimodal Patent Analysis and Creation Dataset for Design Patents","date":"2024-12-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-taxonomy-learning-and-historical","slug":"adaptive-taxonomy-learning-and-historical","title":"Adaptive Taxonomy Learning and Historical Patterns Modelling for Patent Classification","date":"2023-08-10","arxiv_id":"2308.05385","repositories_listed":1,"syntology":null},{"url":"/paper/event-based-dynamic-graph-representation","slug":"event-based-dynamic-graph-representation","title":"Event-based Dynamic Graph Representation Learning for Patent Application Trend Prediction","date":"2023-08-04","arxiv_id":"2308.09780","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-patent-similarity-measurement","slug":"a-novel-patent-similarity-measurement","title":"A Novel Patent Similarity Measurement Methodology: Semantic Distance and Technological Distance","date":"2023-03-23","arxiv_id":"2303.16767","repositories_listed":1,"syntology":null},{"url":"/paper/technological-taxonomies-for-hypernym-and","slug":"technological-taxonomies-for-hypernym-and","title":"Technological taxonomies for hypernym and hyponym retrieval in patent texts","date":"2022-11-14","arxiv_id":"2212.06039","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-sentence-embedding-models","slug":"a-survey-on-sentence-embedding-models","title":"A Survey on Sentence Embedding Models Performance for Patent Analysis","date":"2022-04-28","arxiv_id":"2206.02690","repositories_listed":1,"syntology":null},{"url":"/paper/clusterdatasplit-exploring-challenging","slug":"clusterdatasplit-exploring-challenging","title":"ClusterDataSplit: Exploring Challenging Clustering-Based Data Splits for Model Performance Evaluation","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/190602124","slug":"190602124","title":"PatentBERT: Patent Classification with Fine-Tuning a pre-trained BERT Model","date":"2019-05-14","arxiv_id":"1906.02124","repositories_listed":1,"syntology":null},{"url":"/paper/dapfam-a-domain-aware-patent-retrieval","slug":"dapfam-a-domain-aware-patent-retrieval","title":"DAPFAM: A Domain-Aware Patent Retrieval Dataset Aggregated at the Family Level","date":"2025-06-27","arxiv_id":"2506.22141","repositories_listed":0,"syntology":null},{"url":null,"slug":"research-on-feature-fusion-and-multimodal","title":"Research on feature fusion and multimodal patent text based on graph attention network","date":"2025-05-26","arxiv_id":"2505.20188","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-evolving-boundary-of-green-technology","title":"The evolving boundary of green technology","date":"2025-03-27","arxiv_id":"2503.21310","repositories_listed":0,"syntology":null},{"url":null,"slug":"innovative-activities-of-activision-blizzard","title":"Innovative activities of Activision Blizzard: A patent network analysis","date":"2025-02-04","arxiv_id":"2502.02259","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-effective-solutions-hidden-in","title":"Extracting effective solutions hidden in large language models via generated comprehensive specialists: case studies in developing electronic devices","date":"2024-12-31","arxiv_id":"2501.00224","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-automated-patent-workflows-ai","title":"Towards Automated Patent Workflows: AI-Orchestrated Multi-Agent Framework for Intellectual Property Management and Analysis","date":"2024-09-21","arxiv_id":"2409.19006","repositories_listed":0,"syntology":null},{"url":null,"slug":"retrouver-l-inventeur-auteur-la-lev-e-e-d","title":"Retrouver l'inventeur-auteur : la lev{é}e d'homonymies d'autorat entre les brevets et les publications scientifiques","date":"2024-02-26","arxiv_id":"2402.16440","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-similarity-matching-for-patent","title":"Semantic Similarity Matching for Patent Documents Using Ensemble BERT-related Model and Novel Text Processing Method","date":"2024-01-06","arxiv_id":"2401.06782","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-black-boxes-explainable-deep","title":"Unveiling Black-boxes: Explainable Deep Learning Models for Patent Classification","date":"2023-10-31","arxiv_id":"2310.20478","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-classification-of-artificial","title":"Multi label classification of Artificial Intelligence related patents using Modified D2SBERT and Sentence Attention mechanism","date":"2023-03-03","arxiv_id":"2303.03165","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-generate-questions-by-enhancing","title":"CinPatent: Datasets for Patent Classification","date":"2022-12-23","arxiv_id":"2212.12192","repositories_listed":0,"syntology":null},{"url":null,"slug":"guiding-data-driven-design-ideation-by","title":"Guiding Data-Driven Design Ideation by Knowledge Distance","date":"2022-10-18","arxiv_id":"2210.10104","repositories_listed":0,"syntology":null},{"url":null,"slug":"patents-phrase-to-phrase-semantic-matching","title":"Patents Phrase to Phrase Semantic Matching Dataset","date":"2022-08-01","arxiv_id":"2208.01171","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-single-label-patent-classification","title":"Automated Single-Label Patent Classification using Ensemble Classifiers","date":"2022-03-03","arxiv_id":"2203.03552","repositories_listed":0,"syntology":null},{"url":null,"slug":"solar-cell-patent-classification-method-based","title":"Solar cell patent classification method based on keyword extraction and deep neural network","date":"2021-09-18","arxiv_id":"2109.08796","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-for-technical-document","title":"Deep Learning for Technical Document Classification","date":"2021-06-27","arxiv_id":"2106.14269","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-patent-mining-and-relevance","title":"Improving Patent Mining and Relevance Classification using Transformers","date":"2021-05-09","arxiv_id":"2105.03979","repositories_listed":0,"syntology":null},{"url":null,"slug":"technical-progress-analysis-using-a-dynamic","title":"Technical Progress Analysis Using a Dynamic Topic Model for Technical Terms to Revise Patent Classification Codes","date":"2020-12-18","arxiv_id":"2012.10120","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-based-citation-recommendation","title":"Deep learning-based citation recommendation system for patents","date":"2020-10-21","arxiv_id":"2010.10932","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-cnn-based-patent-image-retrieval-method-for","title":"A Convolutional Neural Network-based Patent Image Retrieval Method for Design Ideation","date":"2020-03-10","arxiv_id":"2003.08741","repositories_listed":0,"syntology":null},{"url":null,"slug":"bert-cnn-a-hierarchical-patent-classifier","title":"BERT-CNN: a Hierarchical Patent Classifier Based on a Pre-Trained Language Model","date":"2019-11-03","arxiv_id":"1911.06241","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-label-informative-wide-textbackslash-deep","title":"A Label Informative Wide \\& Deep Classifier for Patents and Papers","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-language-model-fine-tuning-for","title":"Universal Language Model Fine-tuning for Patent Classification","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"classifying-patent-applications-with-ensemble","title":"Classifying Patent Applications with Ensemble Methods","date":"2018-11-12","arxiv_id":"1811.04695","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-run-dynamics-of-the-u-s-patent","title":"Long-run dynamics of the U.S. patent classification system","date":"2018-09-21","arxiv_id":"1703.02104","repositories_listed":0,"syntology":null},{"url":null,"slug":"filtering-patent-maps-for-visualization-of","title":"Filtering Patent Maps for Visualization of Diversification Paths of Inventors and Organizations","date":"2016-06-25","arxiv_id":"1507.01338","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-representations-for-patent","title":"Text Representations for Patent Classification","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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_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 task or check it against the task's benchmarks.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"d18c3eb2e4aeaff06a322576cbb9964a53aed64d3d300dd067b0b0cbffaf6930","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}