Search arXiv paper metadata
Papers on arXiv that match a query, from the arXiv API: title, authors, the first 500 characters of the abstract, the paper's page, the PDF, submission time and primary category. `sort` is relevance or date; `category` narrows to one arXiv category such as cs.LG; `limit` up to 100. Usage limits: Up to 100 paper metadata records; abstracts are limited to 500 characters. Return source/PDF links; full-paper redistribution requires separate license checks. Draft retail price: USD 0.000150/successful call, equal to the TREG catalog rate; no markup.
- Selected price
- $0.00015 / callPublished pricing
- Providers / implementations
- 1 / 1
- Requests · 30d
- —Loading...
- Success rate · 30d
- —Loading...
| Provider | Price / call | Requests · 30d | Performance | Access |
|---|---|---|---|---|
tregCurrent Search arXiv paper metadata · POST | $0.00015 / call | — | —successP50— |
Statistics use persisted gateway logs from the last 30 days up to now, including today.
Success rate = successful requests / all requests;
P50 = median latency of successful requests.
Prices reflect the published API contract. Contract revision: 2. Price update time: not supplied.
Playground
Run sends a real API request. Charges follow the published API contract.
curl \
'https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers' \
-X POST \
-H "Authorization: Bearer $OPENANY_API_KEY" \
-H 'Content-Type: application/json' \
--data-raw '{
"limit": 1,
"query": "rust memory safety",
"sort": "relevance"
}'- Method
- POST
- Endpoint
https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers- Content type
- application/json
- Authentication
Authorization: Bearer $OPENANY_API_KEY
curl \
'https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers' \
-X POST \
-H "Authorization: Bearer $OPENANY_API_KEY" \
-H 'Content-Type: application/json' \
--data-raw '{
"limit": 1,
"query": "rust memory safety",
"sort": "relevance"
}'Input parameters
Fields in this listing; additional options and input encoding can vary by provider.
| Parameter | Location | Type | Required | Description |
|---|---|---|---|---|
category | JSON request bodybody | string | No | default |
limit | JSON request bodybody | integer | No | default 20 minimum: 1 · maximum: 100 |
query | JSON request bodybody | string | Yes | |
sort | JSON request bodybody | string | No | default relevance enum: "relevance", "date" |
Required markers inside a nested object or variant apply when that object or variant is used.
Sample response
Third-party response reference · Documented HTTP 200; not a live result. Historical third-party reference. It may differ from the current provider response; verify the original contract before use.
{
"meta": {
"blocked": [],
"elapsed_ms": 311,
"from_cache": false,
"llm_calls": 0,
"pages_fetched": 1,
"partial": false,
"warnings": [
"module: arxiv-search: 'rust memory safety' · 1 papers"
]
},
"recipe": "arxiv-search",
"rows": [
{
"abstract": "We present our ongoing work on developing an end-to-end verified Rust compiler based on CompCert. It provides two guarantees: one is semantics preservation from Rust to assembly, i.e., the behaviors of source code includes the behaviors of target code, with which the properties verified at the source can be preserved down to the target; the other is memory safety ensured by the verifying compilation -- the borrow checking pass, which can simplify the verification of Rust programs, e.g., by allow …",
"authors": "Jinhua Wu, Yuting Wang, Liukun Yu, Linglong Meng",
"category": "cs.PL",
"pdf": "https://arxiv.org/pdf/2602.07455v1",
"published": "2026-02-07T09:15:35Z",
"title": "RustCompCert: A Verified and Verifying Compiler for a Sequential Subset of Rust",
"url": "http://arxiv.org/abs/2602.07455v1"
}
],
"usage": {
"boxes": [
"gate",
"recipe"
],
"cache": "miss",
"engine": "recipe",
"lines": [
{
"about": "the call",
"boxes": [
"gate"
],
"cache": "miss",
"call": "recipes",
"engine": "gate",
"units": 1
},
{
"attempts": 1,
"cache": "api",
"call": "scrape",
"engine": "api",
"proxy": "isp",
"units": 1,
"url": "http://export.arxiv.org/…"
}
],
"units": 2
},
"version": 1
}Agent integration
Copy the resource contract without sharing an API key.
View API Markdown
# Search arXiv paper metadata
Papers on arXiv that match a query, from the arXiv API: title, authors, the first 500 characters of the abstract, the paper's page, the PDF, submission time and primary category. `sort` is relevance or date; `category` narrows to one arXiv category such as cs.LG; `limit` up to 100.
Usage limits: Up to 100 paper metadata records; abstracts are limited to 500 characters. Return source/PDF links; full-paper redistribution requires separate license checks.
Draft retail price: USD 0.000150/successful call, equal to the TREG catalog rate; no markup.
Documentation: https://openany.si/apis/50aff158-c308-48f1-9e00-c6f5da96051b
Method: POST
Endpoint: https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers
Price: $0.00015 / call
Provider: treg
Contract revision: 2
Price source: selected implementation in the OpenAny public API catalog. Price update time: not supplied.
Use OPENANY_API_KEY from the environment. API Key calls use your shared balance.
## Prepared request
```bash
curl \
'https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers' \
-X POST \
-H "Authorization: Bearer $OPENANY_API_KEY" \
-H 'Content-Type: application/json' \
--data-raw '{
"limit": 1,
"query": "rust memory safety",
"sort": "relevance"
}'
```
## API contract
```json
{
"resource_type": "api",
"name": "Search arXiv paper metadata",
"endpoint": "https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers",
"method": "POST",
"content_type": "application/json",
"execution_mode": "sync",
"authentication": {
"type": "bearer",
"environment_variable": "OPENANY_API_KEY"
},
"inputs": [
{
"description": "Papers on arXiv that match a query, from the arXiv API: title, authors, the first 500 characters of the abstract, the paper's page, the PDF, submission time and primary category. `sort` is relevance or date; `category` narrows to one arXiv category such as cs.LG; `limit` up to 100.\nUsage limits: Up to 100 paper metadata records; abstracts are limited to 500 characters. Return source/PDF links; full-paper redistribution requires separate license checks.\nDraft retail price: USD 0.000150/successful call, equal to the TREG catalog rate; no markup.",
"json_schema": {
"additionalProperties": false,
"properties": {
"category": {
"description": "default ",
"example": "cs.LG",
"type": "string"
},
"limit": {
"description": "default 20",
"maximum": 100,
"minimum": 1,
"type": "integer"
},
"query": {
"description": "",
"example": "rust memory safety",
"type": "string"
},
"sort": {
"description": "default relevance",
"enum": [
"relevance",
"date"
],
"type": "string"
}
},
"required": [
"query"
],
"type": "object"
},
"location": "body",
"name": "body",
"nullable": false,
"pointer": "",
"required": true,
"type": "object"
}
],
"billing": {
"currency": "USD",
"mode": "fixed",
"priceMicroUsd": "150",
"rounding": null,
"unit": "call",
"unitQuantity": null
},
"examples": [
{
"http_status": 200,
"name": "Third-party reference · Testnet 2026-11-04: success (abridged)",
"request": {
"body": {
"limit": 1,
"query": "rust memory safety",
"sort": "relevance"
},
"headers": {},
"path": {},
"query": {}
},
"response_body": {
"meta": {
"blocked": [],
"elapsed_ms": 311,
"from_cache": false,
"llm_calls": 0,
"pages_fetched": 1,
"partial": false,
"warnings": [
"module: arxiv-search: 'rust memory safety' · 1 papers"
]
},
"recipe": "arxiv-search",
"rows": [
{
"abstract": "We present our ongoing work on developing an end-to-end verified Rust compiler based on CompCert. It provides two guarantees: one is semantics preservation from Rust to assembly, i.e., the behaviors of source code includes the behaviors of target code, with which the properties verified at the source can be preserved down to the target; the other is memory safety ensured by the verifying compilation -- the borrow checking pass, which can simplify the verification of Rust programs, e.g., by allow …",
"authors": "Jinhua Wu, Yuting Wang, Liukun Yu, Linglong Meng",
"category": "cs.PL",
"pdf": "https://arxiv.org/pdf/2602.07455v1",
"published": "2026-02-07T09:15:35Z",
"title": "RustCompCert: A Verified and Verifying Compiler for a Sequential Subset of Rust",
"url": "http://arxiv.org/abs/2602.07455v1"
}
],
"usage": {
"boxes": [
"gate",
"recipe"
],
"cache": "miss",
"engine": "recipe",
"lines": [
{
"about": "the call",
"boxes": [
"gate"
],
"cache": "miss",
"call": "recipes",
"engine": "gate",
"units": 1
},
{
"attempts": 1,
"cache": "api",
"call": "scrape",
"engine": "api",
"proxy": "isp",
"units": 1,
"url": "http://export.arxiv.org/…"
}
],
"units": 2
},
"version": 1
}
}
]
}
```Error handling
| Status | Next step |
|---|---|
400 | Check the offering and request fields. |
401 / 403 | Verify your credentials and access permissions. |
402 | Inspect the selected access mode and returned payment requirements. |
429 | Respect the returned rate limit and retry guidance. |
5xx | Inspect the error and usage record before retrying a paid operation. |
Third-party reference · Testnet 2026-11-04: success (abridged)
Historical third-party reference. It may differ from the current provider response; verify the original contract before use.
Prepare your environment
Use a terminal with cURL installed.
Use an OpenAny API key with shared-balance access. Confirm availability and price before running; a call may charge your balance.
Set the key in your terminal using the hidden prompt below. Keep its value out of source files and logs.
Terminal · macOS / Linuxprintf 'OpenAny API key: ' read -r -s OPENANY_API_KEY export OPENANY_API_KEY printf '\n'Run the request
Paste the complete command below into your terminal.
Values to replace before running 1
Review these request fields before running. Keep the published provider and request method unchanged.
body- Papers on arXiv that match a query, from the arXiv API: title, authors, the first 500 characters of the abstract, the paper's page, the PDF, submission time and primary category. `sort` is relevance or date; `category` narrows to one arXiv category such as cs.LG; `limit` up to 100. Usage limits: Up to 100 paper metadata records; abstracts are limited to 500 characters. Return source/PDF links; full-paper redistribution requires separate license checks. Draft retail price: USD 0.000150/successful call, equal to the TREG catalog rate; no markup.
Terminal · cURLcurl \ 'https://api.openany.si/v1/agent-apis/treg/call/crawl4ai.research.search.papers' \ -X POST \ -H "Authorization: Bearer $OPENANY_API_KEY" \ -H 'Content-Type: application/json' \ --data-raw '{ "limit": 1, "query": "rust memory safety", "sort": "relevance" }'Check the response
Third-party response reference · Documented HTTP 200; not a live result.
Third-party reference · not a live result{ "meta": { "blocked": [], "elapsed_ms": 311, "from_cache": false, "llm_calls": 0, "pages_fetched": 1, "partial": false, "warnings": [ "module: arxiv-search: 'rust memory safety' · 1 papers" ] }, "recipe": "arxiv-search", "rows": [ { "abstract": "We present our ongoing work on developing an end-to-end verified Rust compiler based on CompCert. It provides two guarantees: one is semantics preservation from Rust to assembly, i.e., the behaviors of source code includes the behaviors of target code, with which the properties verified at the source can be preserved down to the target; the other is memory safety ensured by the verifying compilation -- the borrow checking pass, which can simplify the verification of Rust programs, e.g., by allow …", "authors": "Jinhua Wu, Yuting Wang, Liukun Yu, Linglong Meng", "category": "cs.PL", "pdf": "https://arxiv.org/pdf/2602.07455v1", "published": "2026-02-07T09:15:35Z", "title": "RustCompCert: A Verified and Verifying Compiler for a Sequential Subset of Rust", "url": "http://arxiv.org/abs/2602.07455v1" } ], "usage": { "boxes": [ "gate", "recipe" ], "cache": "miss", "engine": "recipe", "lines": [ { "about": "the call", "boxes": [ "gate" ], "cache": "miss", "call": "recipes", "engine": "gate", "units": 1 }, { "attempts": 1, "cache": "api", "call": "scrape", "engine": "api", "proxy": "isp", "units": 1, "url": "http://export.arxiv.org/…" } ], "units": 2 }, "version": 1 }
Loading related APIs…
Common questions
Do I need a separate key for every provider?
Use your OpenAny API key for standard API access. Read it from OPENANY_API_KEY in your environment and keep it out of prompts, source code and logs.
Are these providers interchangeable?
No. Each offering has its own inputs, pricing and response contract. Selecting a catalog offering does not establish automatic routing or fallback. Confirm the service contract before calling.
How is this API billed?
API-key calls use your shared balance at the selected implementation's published rate. Check the billing unit and request-specific pricing rules before making a paid call. Recorded usage determines the final charge under that contract.
Where do the price and contract come from?
The selected implementation publishes its provider, request contract, revision and billing rules through OpenAny's public API catalog. A revision number identifies a contract version, not a price update date. A price update timestamp is not supplied; do not treat a page date as one.
How do OpenAny Balance and x402 differ?
OpenAny Balance uses an API key and one shared balance. Card, USDC and x402 top-ups, card auto top-up and USDC subscriptions fund that balance; available routes appear on the Credits page. Direct x402 is a separate pay-per-request flow, available only on listings that show it and requiring an authorized payment client.
Does Playground send a paid request?
Yes. After you sign in, Run sends a real API request using an active OpenAny API key. Charges follow the published API contract and use your shared balance. Selecting an implementation, editing inputs and viewing sample responses do not send requests.