arXiv (All)
open access
Benchmarking Embedding Geometries and Clustering Algorithms for Unsupervised Patent Claim Classification
Prior-art retrieval systems are structurally organized around classification codes, making cross-code discovery difficult. This paper asks if an unsupervised representation trained on patent text can recover relevant connections that code-restricted search cannot, and if hyperbolic space helps. We t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Leveraging Code Embeddings to Identify and Address Blind Spots in Benchmark Creation#438627
- HybridCodeAuthorship: A Benchmark Dataset for Line-Level Code Authorship Detection#271917
- CoHyDE: Iterative Co-Training of LLM Rewriter & Dense Encoder for Tool Retrieval#999799
- LLMSniffer: Detecting LLM-Generated Code via GraphCodeBERT and Supervised Contrastive Learning#31335
- Constraint-Preserving Genetic Algorithms for Embedding Linear Codes into Self-Orthogonal Codes#822534
Record · ID 1297349
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive