{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:H6UJ5HK5ERW3MAMCJHQVOCRYTQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.10716","created_at":"2026-06-02T02:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2604.10716v3","created_at":"2026-06-02T02:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.10716","created_at":"2026-06-02T02:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"H6UJ5HK5ERW3","created_at":"2026-06-02T02:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"H6UJ5HK5ERW3MAMC","created_at":"2026-06-02T02:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"H6UJ5HK5","created_at":"2026-06-02T02:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:f3d5b408c5871e61d64cf0d7df82be8ca06b2b42fc01ffbed4724e26a564e6c3","target":"graph","created_at":"2026-06-02T02:04:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs."}],"snapshot_sha256":"ee3587b2a51ebb7571a200453d4ca5366a7fd2f9d53dd71453be6fbf59c81700"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.10716/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bowen Jiang, Herman Lam, Jieming Yin, Jiliang Zhang, Xiangru Chen, Yiming Gao, Yuxiang Wang, Zhilei Chai","cross_cats":[],"headline":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AR","submitted_at":"2026-04-12T16:24:14Z","title":"L-PCN: A Point Cloud Accelerator Exploiting Spatial Locality through Octree-based Islandization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.10716","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-10T15:24:32.734362Z","id":"d80b0315-e05c-443a-8c6a-196a4f10a1d7","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"L-PCN partitions point clouds into octree islands to reuse overlapping subset data and cut repetitive feature operations in PCNs.","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.","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."}},"verdict_id":"d80b0315-e05c-443a-8c6a-196a4f10a1d7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6e626c404af30fbcf39e16cb202c18d1d7fb536d893d7a2308577ab4e3b9ff9","target":"record","created_at":"2026-06-02T02:04:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"3fa89e9d5d246db6018249e1570a389c0822dd8709ab662ef6f0691775533896","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fa89e9d5d246db6018249e1570a389c0822dd8709ab662ef6f0691775533896","first_computed_at":"2026-06-02T02:04:52.976684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:52.976684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R/KFUBnMxnH29+w81jwNA80w2RXoD8MmrIE29NxI9BCuB9sHouGVtuOppb5sLS9KqMW44MzkgUZR7ycRtp2HDg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:52.977082Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.10716","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6e626c404af30fbcf39e16cb202c18d1d7fb536d893d7a2308577ab4e3b9ff9","sha256:f3d5b408c5871e61d64cf0d7df82be8ca06b2b42fc01ffbed4724e26a564e6c3"],"state_sha256":"3ff2a6915d564e5ae1ea204aa7dbb8e50f276e14d27006b594af63b88075795f"}