arxiv_id string | pwc_url string | status int64 | found bool | pwc_id string | title string | url_abs string | repositories list | project_pages list | hf_models list | hf_datasets list | hf_spaces list |
|---|---|---|---|---|---|---|---|---|---|---|---|
2507.07136 | https://paperswithcode.co/api/v1/papers/arxiv/2507.07136?include_resources=true | 200 | true | 51804 | LangSplatV2: High-dimensional 3D Language Gaussian Splatting with 450+ FPS | https://arxiv.org/abs/2507.07136 | [
{
"url": "https://github.com/ZhaoYujie2002/LangSplatV2",
"owner": "ZhaoYujie2002",
"name": "LangSplatV2",
"stars": 165,
"is_official": true,
"source": "ai_extraction"
}
] | [
{
"url": "https://langsplat-v2.github.io/",
"is_official": true
},
{
"url": "https://langsplat-v2.github.io",
"is_official": true
}
] | [] | [] | [] |
2505.19741 | https://paperswithcode.co/api/v1/papers/arxiv/2505.19741?include_resources=true | 200 | true | 87365 | Minimax Adaptive Online Nonparametric Regression over Besov spaces | https://arxiv.org/abs/2505.19741 | [] | [] | [] | [] | [] |
2505.12275 | https://paperswithcode.co/api/v1/papers/arxiv/2505.12275?include_resources=true | 200 | true | 87033 | Curriculum Abductive Learning | https://arxiv.org/abs/2505.12275 | [] | [] | [] | [] | [] |
2510.12251 | https://paperswithcode.co/api/v1/papers/arxiv/2510.12251?include_resources=true | 200 | true | 86179 | DSAS: A Universal Plug-and-Play Framework for Attention Optimization in Multi-Document Question Answering | https://arxiv.org/abs/2510.12251 | [] | [] | [] | [] | [] |
2505.19102 | https://paperswithcode.co/api/v1/papers/arxiv/2505.19102?include_resources=true | 200 | true | 87363 | Statistical inference for Linear Stochastic Approximation with Markovian Noise | https://arxiv.org/abs/2505.19102 | [] | [] | [] | [] | [] |
2410.21228 | https://paperswithcode.co/api/v1/papers/arxiv/2410.21228?include_resources=true | 200 | true | 39281 | LoRA vs Full Fine-tuning: An Illusion of Equivalence | https://arxiv.org/abs/2410.21228 | [] | [] | [] | [] | [] |
2506.20173 | https://paperswithcode.co/api/v1/papers/arxiv/2506.20173?include_resources=true | 200 | true | 87043 | Valid Selection among Conformal Sets | https://arxiv.org/abs/2506.20173 | [] | [] | [] | [] | [] |
2512.11087 | https://paperswithcode.co/api/v1/papers/arxiv/2512.11087?include_resources=true | 200 | true | 63807 | Clip-and-Verify: Linear Constraint-Driven Domain Clipping for Accelerating Neural Network Verification | https://arxiv.org/abs/2512.11087 | [
{
"url": "https://github.com/Verified-Intelligence/Clip_and_Verify",
"owner": "Verified-Intelligence",
"name": "Clip_and_Verify",
"stars": 4,
"is_official": true,
"source": "hf_api"
}
] | [
{
"url": "https://abcrown.org",
"is_official": true
}
] | [] | [] | [] |
2510.07316 | https://paperswithcode.co/api/v1/papers/arxiv/2510.07316?include_resources=true | 200 | true | 66775 | Pixel-Perfect Depth with Semantics-Prompted Diffusion Transformers | https://arxiv.org/abs/2510.07316 | [] | [] | [] | [] | [] |
2506.06039 | https://paperswithcode.co/api/v1/papers/arxiv/2506.06039?include_resources=true | 404 | false | null | null | null | null | null | null | null | null |
2510.17526 | https://paperswithcode.co/api/v1/papers/arxiv/2510.17526?include_resources=true | 404 | false | null | null | null | null | null | null | null | null |
2502.02545 | https://paperswithcode.co/api/v1/papers/arxiv/2502.02545?include_resources=true | 200 | true | 86273 | Optimal Spectral Transitions in High-Dimensional Multi-Index Models | https://arxiv.org/abs/2502.02545 | [] | [] | [] | [] | [] |
2512.20107 | https://paperswithcode.co/api/v1/papers/arxiv/2512.20107?include_resources=true | 404 | false | null | null | null | null | null | null | null | null |
2510.03886 | https://paperswithcode.co/api/v1/papers/arxiv/2510.03886?include_resources=true | 200 | true | 86722 | Rare Text Semantics Were Always There in Your Diffusion Transformer | https://arxiv.org/abs/2510.03886 | [] | [] | [] | [] | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.