Pith Number

pith:H6UJ5HK5

pith:2026:H6UJ5HK5ERW3MAMCJHQVOCRYTQ

not attested not anchored not stored refs pending

L-PCN: A Point Cloud Accelerator Exploiting Spatial Locality through Octree-based Islandization

Bowen Jiang, Herman Lam, Jieming Yin, Jiliang Zhang, Xiangru Chen, Yiming Gao, Yuxiang Wang, Zhilei Chai

L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs.

arxiv:2604.10716 v3 · 2026-04-12 · cs.AR

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{H6UJ5HK5ERW3MAMCJHQVOCRYTQ}

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 open · sign in to claim

4 Citations open

5 Replications open

✓ 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.

Claims

C1strongest claim

L-PCN achieves a theoretical reduction in feature fetching ranging from 55.2% to 93.8% and in feature computation ranging from 45.4% to 80.6% during the PCN process. For experimentation, prototype L-PCN accelerators are implemented on the Intel Arria 10 GX FPGA. Experimental results prove that with the Islandization Unit as a plug-in, state-of-the-art PCN accelerators can achieve an additional speedup ranging from 1.2x to 3.2x.

C2weakest assumption

The assumption that the spatial locality arising from overlapping point subsets in the data-structuring step is both substantial and stable enough across typical point-cloud workloads that the added partitioning and scheduling overhead does not offset the reported savings.

C3one line summary

L-PCN exploits spatial locality in point cloud networks via octree partitioning into islands and intra-island hub scheduling, delivering 55-94% less feature fetching, 45-81% less computation, and 1.2-3.2x additional speedup on FPGA prototypes.

Cited by

1 paper in Pith

FlashFPS: Efficient Farthest Point Sampling for Large-Scale Point Clouds via Pruning and Caching

Receipt and verification

First computed	2026-06-02T02:04:52.976684Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

3fa89e9d5d246db6018249e1570a389c0822dd8709ab662ef6f0691775533896

Aliases

arxiv: 2604.10716 · arxiv_version: 2604.10716v3 · doi: 10.48550/arxiv.2604.10716 · pith_short_12: H6UJ5HK5ERW3 · pith_short_16: H6UJ5HK5ERW3MAMC · pith_short_8: H6UJ5HK5

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ \
  | 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: 3fa89e9d5d246db6018249e1570a389c0822dd8709ab662ef6f0691775533896

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "b4a266102cc57e07d6926156903cccf6e6078a799602f3da545a943109c2f6d4",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "primary_cat": "cs.AR",
    "submitted_at": "2026-04-12T16:24:14Z",
    "title_canon_sha256": "d3475b92f9ed9bc5597090f230a440218de3001820917a774e26d6681a037cd6"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.10716",
    "kind": "arxiv",
    "version": 3
  }
}