{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YEO7WKQCJLUJO3KMEH65ALZYWT","short_pith_number":"pith:YEO7WKQC","canonical_record":{"source":{"id":"1604.04689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-16T04:43:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f5b4a82f9c552e5b3f94f90d925815d584c97141e92b7d1513c39a8f8370085e","abstract_canon_sha256":"fc73f5455b267a28d450c6eaad875b85ae287d3f9eabf23f60008bb17e69b254"},"schema_version":"1.0"},"canonical_sha256":"c11dfb2a024ae8976d4c21fdd02f38b4d2cd12f21541bd8f580b64176eeaf112","source":{"kind":"arxiv","id":"1604.04689","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04689","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04689v3","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04689","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"YEO7WKQCJLUJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YEO7WKQCJLUJO3KM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YEO7WKQC","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YEO7WKQCJLUJO3KMEH65ALZYWT","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04689","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-16T04:43:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f5b4a82f9c552e5b3f94f90d925815d584c97141e92b7d1513c39a8f8370085e","abstract_canon_sha256":"fc73f5455b267a28d450c6eaad875b85ae287d3f9eabf23f60008bb17e69b254"},"schema_version":"1.0"},"canonical_sha256":"c11dfb2a024ae8976d4c21fdd02f38b4d2cd12f21541bd8f580b64176eeaf112","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.912457Z","signature_b64":"lMyM2rr38WSaMmS/CLrdqWmjAVwZSiuNVcHFXR+TkrW8y/8rYOR1jYoa5g9s4XD+6luRy7FL4zrNIyGPRZ48DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c11dfb2a024ae8976d4c21fdd02f38b4d2cd12f21541bd8f580b64176eeaf112","last_reissued_at":"2026-05-18T01:15:33.911646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.911646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04689","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CF4dlJ3kdyKCHEjRHpio/L0TeaV4uz+eXT6Ee3E3iWI2qiYyXKi590aH7s0qCjHuLyKnYChI13Pj+i1w8EUKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:29:07.001261Z"},"content_sha256":"3756e67637c1b16213fa50b01c49d9b09d2b6a707d4de6f01316f51f6821e152","schema_version":"1.0","event_id":"sha256:3756e67637c1b16213fa50b01c49d9b09d2b6a707d4de6f01316f51f6821e152"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YEO7WKQCJLUJO3KMEH65ALZYWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parallel Solution to Finding Nodal Neighbors in Generic Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CG","authors_text":"Gang Mei, Hong Tian, Nengxiong Xu, Shengwei Li","submitted_at":"2016-04-16T04:43:25Z","abstract_excerpt":"In this paper we specifically present a parallel solution to finding the one-ring neighboring nodes and elements for each vertex in generic meshes. The finding of nodal neighbors is computationally straightforward but expensive for large meshes. To improve the efficiency, the parallelism is adopted by utilizing the modern Graphics Processing Unit (GPU). The presented parallel solution is heavily dependent on the parallel sorting, scan, and reduction, and can be applied to determine both the neighboring nodes and elements. To evaluate the performance, the parallel solution is compared to the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04689","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G56Q+TkEshQc4hJVyQyfHbbCyc5sO/HltBANKl0F1r27Z0z+ZtBvdJy6rt13RE8weSXomlGFwCOfikXG8Fj7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:29:07.001620Z"},"content_sha256":"0486dec3bbd4ecf41b51f7fa81306e4fd2034a8fa41cac37a186ac2704b89532","schema_version":"1.0","event_id":"sha256:0486dec3bbd4ecf41b51f7fa81306e4fd2034a8fa41cac37a186ac2704b89532"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEO7WKQCJLUJO3KMEH65ALZYWT/bundle.json","state_url":"https://pith.science/pith/YEO7WKQCJLUJO3KMEH65ALZYWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEO7WKQCJLUJO3KMEH65ALZYWT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T19:29:07Z","links":{"resolver":"https://pith.science/pith/YEO7WKQCJLUJO3KMEH65ALZYWT","bundle":"https://pith.science/pith/YEO7WKQCJLUJO3KMEH65ALZYWT/bundle.json","state":"https://pith.science/pith/YEO7WKQCJLUJO3KMEH65ALZYWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEO7WKQCJLUJO3KMEH65ALZYWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YEO7WKQCJLUJO3KMEH65ALZYWT","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":"fc73f5455b267a28d450c6eaad875b85ae287d3f9eabf23f60008bb17e69b254","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-16T04:43:25Z","title_canon_sha256":"f5b4a82f9c552e5b3f94f90d925815d584c97141e92b7d1513c39a8f8370085e"},"schema_version":"1.0","source":{"id":"1604.04689","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04689","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04689v3","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04689","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"YEO7WKQCJLUJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YEO7WKQCJLUJO3KM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YEO7WKQC","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:0486dec3bbd4ecf41b51f7fa81306e4fd2034a8fa41cac37a186ac2704b89532","target":"graph","created_at":"2026-05-18T01:15:33Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we specifically present a parallel solution to finding the one-ring neighboring nodes and elements for each vertex in generic meshes. The finding of nodal neighbors is computationally straightforward but expensive for large meshes. To improve the efficiency, the parallelism is adopted by utilizing the modern Graphics Processing Unit (GPU). The presented parallel solution is heavily dependent on the parallel sorting, scan, and reduction, and can be applied to determine both the neighboring nodes and elements. To evaluate the performance, the parallel solution is compared to the co","authors_text":"Gang Mei, Hong Tian, Nengxiong Xu, Shengwei Li","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-16T04:43:25Z","title":"A Parallel Solution to Finding Nodal Neighbors in Generic Meshes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04689","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3756e67637c1b16213fa50b01c49d9b09d2b6a707d4de6f01316f51f6821e152","target":"record","created_at":"2026-05-18T01:15:33Z","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":"fc73f5455b267a28d450c6eaad875b85ae287d3f9eabf23f60008bb17e69b254","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-16T04:43:25Z","title_canon_sha256":"f5b4a82f9c552e5b3f94f90d925815d584c97141e92b7d1513c39a8f8370085e"},"schema_version":"1.0","source":{"id":"1604.04689","kind":"arxiv","version":3}},"canonical_sha256":"c11dfb2a024ae8976d4c21fdd02f38b4d2cd12f21541bd8f580b64176eeaf112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c11dfb2a024ae8976d4c21fdd02f38b4d2cd12f21541bd8f580b64176eeaf112","first_computed_at":"2026-05-18T01:15:33.911646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:33.911646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lMyM2rr38WSaMmS/CLrdqWmjAVwZSiuNVcHFXR+TkrW8y/8rYOR1jYoa5g9s4XD+6luRy7FL4zrNIyGPRZ48DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:33.912457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04689","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3756e67637c1b16213fa50b01c49d9b09d2b6a707d4de6f01316f51f6821e152","sha256:0486dec3bbd4ecf41b51f7fa81306e4fd2034a8fa41cac37a186ac2704b89532"],"state_sha256":"724e2a7f970515f0945be63743a3e183409e7719504b71a216ded35f791c1428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lba7WEOCtKk8fLxmxNQsybALO/AZlwDau6sn5+lyn6cBobRaD0TsL2+CemIDJkJvI7/NX/Mj3Y7aSxcI4+wCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:29:07.003581Z","bundle_sha256":"443f68f0ebc85bd4f3d61d04360ceb4b78770655d72ed358e20fe4353fb567b3"}}