Pith Number
pith:E6K3DVO5
pith:2023:E6K3DVO5QENP5KFPHC3WPITFJM
not attested
not anchored
not stored
refs pending
As large as it gets: Learning infinitely large Filters via Neural Implicit Functions in the Fourier Domain
arxiv:2307.10001 v2 · 2023-07-19 · cs.CV
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{E6K3DVO5QENP5KFPHC3WPITFJM}
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.
Cited by
Receipt and verification
| First computed | 2026-07-05T08:19:19.904925Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
2795b1d5dd811afea8af38b767a2654b276b74c3be8b907bc07672ecf6a891e8
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/E6K3DVO5QENP5KFPHC3WPITFJM \
| 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: 2795b1d5dd811afea8af38b767a2654b276b74c3be8b907bc07672ecf6a891e8
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "2313d3fe09b4700890f7e8afc7c3d8ba31a8394876040a7430c8840faccb80db",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CV",
"submitted_at": "2023-07-19T14:21:11Z",
"title_canon_sha256": "e298a8b77d13276a5133abfa274a496b5a9805772d4f1b3fbb3dc62b6f76aa83"
},
"schema_version": "1.0",
"source": {
"id": "2307.10001",
"kind": "arxiv",
"version": 2
}
}