{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4ECCDJCNPVKWLJCLR65ZFCIGSE","short_pith_number":"pith:4ECCDJCN","canonical_record":{"source":{"id":"1712.09789","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-28T08:50:22Z","cross_cats_sorted":[],"title_canon_sha256":"5a6c5f6c878e81a922a23013d95f54f1078f61167083160f941171cda3e9805a","abstract_canon_sha256":"7b80a838e985985cf5716cfcc20ac3e39a6af298ae29f60db3bc46e6897e02e4"},"schema_version":"1.0"},"canonical_sha256":"e10421a44d7d5565a44b8fbb9289069137b334dcf29ec8fcbadcc8411771008a","source":{"kind":"arxiv","id":"1712.09789","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09789","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09789v2","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09789","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"4ECCDJCNPVKW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ECCDJCNPVKWLJCL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ECCDJCN","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4ECCDJCNPVKWLJCLR65ZFCIGSE","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09789","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-28T08:50:22Z","cross_cats_sorted":[],"title_canon_sha256":"5a6c5f6c878e81a922a23013d95f54f1078f61167083160f941171cda3e9805a","abstract_canon_sha256":"7b80a838e985985cf5716cfcc20ac3e39a6af298ae29f60db3bc46e6897e02e4"},"schema_version":"1.0"},"canonical_sha256":"e10421a44d7d5565a44b8fbb9289069137b334dcf29ec8fcbadcc8411771008a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:03.711828Z","signature_b64":"ck6CwSgYXyZtYk+frlSoifu7OYKGoVg6xaQZJRuW/fTDWURywkUA/j2HWYHsElbn+po2Wg/W7QUlPLAV/YGRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10421a44d7d5565a44b8fbb9289069137b334dcf29ec8fcbadcc8411771008a","last_reissued_at":"2026-05-18T00:25:03.711293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:03.711293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09789","source_version":2,"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:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMzDoyZ6Ia84c4qtIM6sTyKwnxpfDiVTfO1AFcRnD9y8BrA8rjZyuDEGVjENTJEZKywvB+NnQTVqeeoMuoBUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:09:38.124496Z"},"content_sha256":"9808a49e3702caab64819fc20660657e3dfd42ace54044828187e88dd079f567","schema_version":"1.0","event_id":"sha256:9808a49e3702caab64819fc20660657e3dfd42ace54044828187e88dd079f567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4ECCDJCNPVKWLJCLR65ZFCIGSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Parallel Connected Components Labeling with a Coarse-to-fine Strategy","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hiroshi Sankoh, Houari Sabirin, Jun Chen, Keisuke Nonaka, Ryosuke Watanabe, Sei Naito","submitted_at":"2017-12-28T08:50:22Z","abstract_excerpt":"This paper proposes a new parallel approach to solve connected components on a 2D binary image implemented with CUDA. We employ the following strategies to accelerate neighborhood exploration after dividing an input image into independent blocks. In the local labeling stage, a coarse-labeling algorithm, including row-column connection and label-equivalence list unification, is applied first to sort out the mess of an initialized local label map; a refinement algorithm is then introduced to merge separated sub-regions from a single component. In the block merge stage, we scan the pixels located"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09789","kind":"arxiv","version":2},"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:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4eTpDkqmSOKS4aq/1CsmhT0XVyLktuLOiu9gHX0lLutb1IIn0vqetsW8JzcWVxkBAVvn2D02Y7zRXA5urksDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:09:38.124940Z"},"content_sha256":"c790da12fac77ef68daada22a08889f610208d2f79fc91553eaaa3ad6307d6c6","schema_version":"1.0","event_id":"sha256:c790da12fac77ef68daada22a08889f610208d2f79fc91553eaaa3ad6307d6c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/bundle.json","state_url":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/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-08-23T10:09:38Z","links":{"resolver":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE","bundle":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/bundle.json","state":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4ECCDJCNPVKWLJCLR65ZFCIGSE","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":"7b80a838e985985cf5716cfcc20ac3e39a6af298ae29f60db3bc46e6897e02e4","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-28T08:50:22Z","title_canon_sha256":"5a6c5f6c878e81a922a23013d95f54f1078f61167083160f941171cda3e9805a"},"schema_version":"1.0","source":{"id":"1712.09789","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09789","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09789v2","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09789","created_at":"2026-05-18T00:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"4ECCDJCNPVKW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ECCDJCNPVKWLJCL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ECCDJCN","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:c790da12fac77ef68daada22a08889f610208d2f79fc91553eaaa3ad6307d6c6","target":"graph","created_at":"2026-05-18T00:25:03Z","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":"This paper proposes a new parallel approach to solve connected components on a 2D binary image implemented with CUDA. We employ the following strategies to accelerate neighborhood exploration after dividing an input image into independent blocks. In the local labeling stage, a coarse-labeling algorithm, including row-column connection and label-equivalence list unification, is applied first to sort out the mess of an initialized local label map; a refinement algorithm is then introduced to merge separated sub-regions from a single component. In the block merge stage, we scan the pixels located","authors_text":"Hiroshi Sankoh, Houari Sabirin, Jun Chen, Keisuke Nonaka, Ryosuke Watanabe, Sei Naito","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-28T08:50:22Z","title":"Efficient Parallel Connected Components Labeling with a Coarse-to-fine Strategy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09789","kind":"arxiv","version":2},"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:9808a49e3702caab64819fc20660657e3dfd42ace54044828187e88dd079f567","target":"record","created_at":"2026-05-18T00:25:03Z","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":"7b80a838e985985cf5716cfcc20ac3e39a6af298ae29f60db3bc46e6897e02e4","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-28T08:50:22Z","title_canon_sha256":"5a6c5f6c878e81a922a23013d95f54f1078f61167083160f941171cda3e9805a"},"schema_version":"1.0","source":{"id":"1712.09789","kind":"arxiv","version":2}},"canonical_sha256":"e10421a44d7d5565a44b8fbb9289069137b334dcf29ec8fcbadcc8411771008a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10421a44d7d5565a44b8fbb9289069137b334dcf29ec8fcbadcc8411771008a","first_computed_at":"2026-05-18T00:25:03.711293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:03.711293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ck6CwSgYXyZtYk+frlSoifu7OYKGoVg6xaQZJRuW/fTDWURywkUA/j2HWYHsElbn+po2Wg/W7QUlPLAV/YGRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:03.711828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09789","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9808a49e3702caab64819fc20660657e3dfd42ace54044828187e88dd079f567","sha256:c790da12fac77ef68daada22a08889f610208d2f79fc91553eaaa3ad6307d6c6"],"state_sha256":"07d48aef7998300a15fb4f0be0348b4154becba19bdd800980978d54e29aa17c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV0XkCySKMVYXB/fJqkJ0roXEpK0RELsXnmQdg2ByU/5GwPC7TzCyLbbMP9OCXBxkUk5dmLurFDbb6gDIN/CDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T10:09:38.129666Z","bundle_sha256":"93cce537b4034af4e6a3c3f1f7c5f9a6546c71eba4a5f2bec9596f1cd93c49fe"}}