{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BQWL4EZ5USJEUF554XGA73FSSB","short_pith_number":"pith:BQWL4EZ5","canonical_record":{"source":{"id":"1710.06189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-17T10:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"4ec382eabe641dbf11a91e07fe8253d589a85673d363a14d091d883b5f9a1fe9","abstract_canon_sha256":"fa19021f77fd1aaca2eab9e1d8106a45f08333f12d8a0be2bb6363fb8ba8041f"},"schema_version":"1.0"},"canonical_sha256":"0c2cbe133da4924a17bde5cc0fecb29051fc7398ded130dd7c2b14c1a11fbf04","source":{"kind":"arxiv","id":"1710.06189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06189","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06189v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06189","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"BQWL4EZ5USJE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQWL4EZ5USJEUF55","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQWL4EZ5","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BQWL4EZ5USJEUF554XGA73FSSB","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-17T10:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"4ec382eabe641dbf11a91e07fe8253d589a85673d363a14d091d883b5f9a1fe9","abstract_canon_sha256":"fa19021f77fd1aaca2eab9e1d8106a45f08333f12d8a0be2bb6363fb8ba8041f"},"schema_version":"1.0"},"canonical_sha256":"0c2cbe133da4924a17bde5cc0fecb29051fc7398ded130dd7c2b14c1a11fbf04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:37.469271Z","signature_b64":"uhZkhhfT+N4KeD7Q879ChzqBnZpX6NWPLkmmb6I0Y5gwjATXm4+WwiTVEq01kO/l5ylP7JpVA/Ufnp7qkMYmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c2cbe133da4924a17bde5cc0fecb29051fc7398ded130dd7c2b14c1a11fbf04","last_reissued_at":"2026-05-18T00:32:37.468513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:37.468513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06189","source_version":1,"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-18T00:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1a+O2TFHCbdNom2iSsxPZcNXkeetQPaVfoQED8yue5/cZI9B5hOEOFWhYiFWwzf5CsijSiBEzWx5S+6u650PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:59:54.749416Z"},"content_sha256":"7d5b600550ac684efa052b3026439bbf3fbbed6592d18316c5e545d1a42ae979","schema_version":"1.0","event_id":"sha256:7d5b600550ac684efa052b3026439bbf3fbbed6592d18316c5e545d1a42ae979"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BQWL4EZ5USJEUF554XGA73FSSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation of gray-level co-occurrence matrix based on CUDA and its optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Huichao Hong, Lixin Zheng, Shuwan Pan","submitted_at":"2017-10-17T10:00:08Z","abstract_excerpt":"As in various fields like scientific research and industrial application, the computation time optimization is becoming a task that is of increasing importance because of its highly parallel architecture. The graphics processing unit is regarded as a powerful engine for application programs that demand fairly high computation capabilities. Based on this, an algorithm was introduced in this paper to optimize the method used to compute the gray-level co-occurrence matrix (GLCM) of an image, and strategies (e.g., \"copying\", \"image partitioning\", etc.) were proposed to optimize the parallel algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06189","kind":"arxiv","version":1},"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-18T00:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFsRe/IIi0Wd5aEf94jzzBWWRuWLQJgcapAINXjHWRwv0fXNSvr6Z3vZ4FnpnpBUrV2n8g6Y7ZMW0WqsNSAzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:59:54.750088Z"},"content_sha256":"514dce81ba3095f5f1c41c91e53ae14ff132075d3f90e620e8cda29007cf5158","schema_version":"1.0","event_id":"sha256:514dce81ba3095f5f1c41c91e53ae14ff132075d3f90e620e8cda29007cf5158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQWL4EZ5USJEUF554XGA73FSSB/bundle.json","state_url":"https://pith.science/pith/BQWL4EZ5USJEUF554XGA73FSSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQWL4EZ5USJEUF554XGA73FSSB/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-05-27T06:59:54Z","links":{"resolver":"https://pith.science/pith/BQWL4EZ5USJEUF554XGA73FSSB","bundle":"https://pith.science/pith/BQWL4EZ5USJEUF554XGA73FSSB/bundle.json","state":"https://pith.science/pith/BQWL4EZ5USJEUF554XGA73FSSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQWL4EZ5USJEUF554XGA73FSSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BQWL4EZ5USJEUF554XGA73FSSB","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":"fa19021f77fd1aaca2eab9e1d8106a45f08333f12d8a0be2bb6363fb8ba8041f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-17T10:00:08Z","title_canon_sha256":"4ec382eabe641dbf11a91e07fe8253d589a85673d363a14d091d883b5f9a1fe9"},"schema_version":"1.0","source":{"id":"1710.06189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06189","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06189v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06189","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"BQWL4EZ5USJE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQWL4EZ5USJEUF55","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQWL4EZ5","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:514dce81ba3095f5f1c41c91e53ae14ff132075d3f90e620e8cda29007cf5158","target":"graph","created_at":"2026-05-18T00:32:37Z","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":"As in various fields like scientific research and industrial application, the computation time optimization is becoming a task that is of increasing importance because of its highly parallel architecture. The graphics processing unit is regarded as a powerful engine for application programs that demand fairly high computation capabilities. Based on this, an algorithm was introduced in this paper to optimize the method used to compute the gray-level co-occurrence matrix (GLCM) of an image, and strategies (e.g., \"copying\", \"image partitioning\", etc.) were proposed to optimize the parallel algori","authors_text":"Huichao Hong, Lixin Zheng, Shuwan Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-17T10:00:08Z","title":"Computation of gray-level co-occurrence matrix based on CUDA and its optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06189","kind":"arxiv","version":1},"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:7d5b600550ac684efa052b3026439bbf3fbbed6592d18316c5e545d1a42ae979","target":"record","created_at":"2026-05-18T00:32:37Z","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":"fa19021f77fd1aaca2eab9e1d8106a45f08333f12d8a0be2bb6363fb8ba8041f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-17T10:00:08Z","title_canon_sha256":"4ec382eabe641dbf11a91e07fe8253d589a85673d363a14d091d883b5f9a1fe9"},"schema_version":"1.0","source":{"id":"1710.06189","kind":"arxiv","version":1}},"canonical_sha256":"0c2cbe133da4924a17bde5cc0fecb29051fc7398ded130dd7c2b14c1a11fbf04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c2cbe133da4924a17bde5cc0fecb29051fc7398ded130dd7c2b14c1a11fbf04","first_computed_at":"2026-05-18T00:32:37.468513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:37.468513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uhZkhhfT+N4KeD7Q879ChzqBnZpX6NWPLkmmb6I0Y5gwjATXm4+WwiTVEq01kO/l5ylP7JpVA/Ufnp7qkMYmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:37.469271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d5b600550ac684efa052b3026439bbf3fbbed6592d18316c5e545d1a42ae979","sha256:514dce81ba3095f5f1c41c91e53ae14ff132075d3f90e620e8cda29007cf5158"],"state_sha256":"c47997056a2686d6b4805b06aa2c1e090d19ad9e762229bab9f7e055615faca5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SuxSVwZPJjZkqqz/rrMrA0E0erPtrdYCjXDNoRoU25ObBWUlhtR52qZWA/h44ktHh0njPaWwqB/TRjV36wmNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:59:54.755573Z","bundle_sha256":"fe202941e324af6065902305b575085f1f9503dd5274294fe5fd7ec72a1d7382"}}