Pith Number
pith:7R5JEB2X
pith:2015:7R5JEB2XWHLMGTT5I7I77SOZPU
not attested
not anchored
not stored
refs pending
A robust sub-linear time R-FFAST algorithm for computing a sparse DFT
arxiv:1501.00320 v1 · 2015-01-01 · cs.IT · cs.LG · math.IT
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{7R5JEB2XWHLMGTT5I7I77SOZPU}
Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge
Record completeness
1
Bitcoin timestamp
2
Internet Archive
3
Author claim
· sign in to
claim
4
Citations
5
Replications
✓
Portable graph bundle live · download bundle · merged
state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same
current state with the deterministic merge algorithm.
Receipt and verification
| First computed | 2026-05-18T02:30:09.580753Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
fc7a920757b1d6c34e7d47d1ffc9d97d28e69e0a1ceaf067242b6ff78fd29a5f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU \
| jq -c '.canonical_record' \
| python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: fc7a920757b1d6c34e7d47d1ffc9d97d28e69e0a1ceaf067242b6ff78fd29a5f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "74028d571a3d9e6ed42695f47ad3c665210b2bb87ae27066b67985ebb2ba5fd6",
"cross_cats_sorted": [
"cs.LG",
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.IT",
"submitted_at": "2015-01-01T21:48:00Z",
"title_canon_sha256": "b51b990780be97417b6f4bac2d478db05da85c11ab4c936de15d8efadb87d5bf"
},
"schema_version": "1.0",
"source": {
"id": "1501.00320",
"kind": "arxiv",
"version": 1
}
}