{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H6UJ5HK5ERW3MAMCJHQVOCRYTQ","short_pith_number":"pith:H6UJ5HK5","schema_version":"1.0","canonical_sha256":"3fa89e9d5d246db6018249e1570a389c0822dd8709ab662ef6f0691775533896","source":{"kind":"arxiv","id":"2604.10716","version":3},"attestation_state":"computed","paper":{"title":"L-PCN: A Point Cloud Accelerator Exploiting Spatial Locality through Octree-based Islandization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs.","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bowen Jiang, Herman Lam, Jieming Yin, Jiliang Zhang, Xiangru Chen, Yiming Gao, Yuxiang Wang, Zhilei Chai","submitted_at":"2026-04-12T16:24:14Z","abstract_excerpt":"Existing Point Cloud Networks (PCNs) have proven to achieve great success in many point cloud tasks such as object part segmentation, shape classification, and so on. The most popular point-based PCNs are usually composed of two sequential steps: Data Structuring (DS) and Feature Computation (FC). In this paper, we first describe an important characteristic of the PCN-specific DS step that has not been addressed in existing PCN accelerators: the spatial locality resulting from overlapping points of the gathered point subsets. Using algorithm-hardware co-design, L-PCN (Locality-aware PCN) propo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2604.10716","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2026-04-12T16:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"d3475b92f9ed9bc5597090f230a440218de3001820917a774e26d6681a037cd6","abstract_canon_sha256":"b4a266102cc57e07d6926156903cccf6e6078a799602f3da545a943109c2f6d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:52.977082Z","signature_b64":"R/KFUBnMxnH29+w81jwNA80w2RXoD8MmrIE29NxI9BCuB9sHouGVtuOppb5sLS9KqMW44MzkgUZR7ycRtp2HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fa89e9d5d246db6018249e1570a389c0822dd8709ab662ef6f0691775533896","last_reissued_at":"2026-06-02T02:04:52.976684Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:52.976684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L-PCN: A Point Cloud Accelerator Exploiting Spatial Locality through Octree-based Islandization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs.","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bowen Jiang, Herman Lam, Jieming Yin, Jiliang Zhang, Xiangru Chen, Yiming Gao, Yuxiang Wang, Zhilei Chai","submitted_at":"2026-04-12T16:24:14Z","abstract_excerpt":"Existing Point Cloud Networks (PCNs) have proven to achieve great success in many point cloud tasks such as object part segmentation, shape classification, and so on. The most popular point-based PCNs are usually composed of two sequential steps: Data Structuring (DS) and Feature Computation (FC). In this paper, we first describe an important characteristic of the PCN-specific DS step that has not been addressed in existing PCN accelerators: the spatial locality resulting from overlapping points of the gathered point subsets. Using algorithm-hardware co-design, L-PCN (Locality-aware PCN) propo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ee3587b2a51ebb7571a200453d4ca5366a7fd2f9d53dd71453be6fbf59c81700"},"source":{"id":"2604.10716","kind":"arxiv","version":3},"verdict":{"id":"d80b0315-e05c-443a-8c6a-196a4f10a1d7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T15:24:32.734362Z","strongest_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.","one_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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.10716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2604.10716","created_at":"2026-06-02T02:04:52.976739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.10716v3","created_at":"2026-06-02T02:04:52.976739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.10716","created_at":"2026-06-02T02:04:52.976739+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6UJ5HK5ERW3","created_at":"2026-06-02T02:04:52.976739+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6UJ5HK5ERW3MAMC","created_at":"2026-06-02T02:04:52.976739+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6UJ5HK5","created_at":"2026-06-02T02:04:52.976739+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.17720","citing_title":"FlashFPS: Efficient Farthest Point Sampling for Large-Scale Point Clouds via Pruning and Caching","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ","json":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ.json","graph_json":"https://pith.science/api/pith-number/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/graph.json","events_json":"https://pith.science/api/pith-number/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/events.json","paper":"https://pith.science/paper/H6UJ5HK5"},"agent_actions":{"view_html":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ","download_json":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ.json","view_paper":"https://pith.science/paper/H6UJ5HK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.10716&json=true","fetch_graph":"https://pith.science/api/pith-number/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/action/storage_attestation","attest_author":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/action/author_attestation","sign_citation":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/action/citation_signature","submit_replication":"https://pith.science/pith/H6UJ5HK5ERW3MAMCJHQVOCRYTQ/action/replication_record"}},"created_at":"2026-06-02T02:04:52.976739+00:00","updated_at":"2026-06-02T02:04:52.976739+00:00"}