{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4ECCDJCNPVKWLJCLR65ZFCIGSE","short_pith_number":"pith:4ECCDJCN","schema_version":"1.0","canonical_sha256":"e10421a44d7d5565a44b8fbb9289069137b334dcf29ec8fcbadcc8411771008a","source":{"kind":"arxiv","id":"1712.09789","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.09789","created_at":"2026-05-18T00:25:03.711379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09789v2","created_at":"2026-05-18T00:25:03.711379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09789","created_at":"2026-05-18T00:25:03.711379+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ECCDJCNPVKW","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ECCDJCNPVKWLJCL","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ECCDJCN","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE","json":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE.json","graph_json":"https://pith.science/api/pith-number/4ECCDJCNPVKWLJCLR65ZFCIGSE/graph.json","events_json":"https://pith.science/api/pith-number/4ECCDJCNPVKWLJCLR65ZFCIGSE/events.json","paper":"https://pith.science/paper/4ECCDJCN"},"agent_actions":{"view_html":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE","download_json":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE.json","view_paper":"https://pith.science/paper/4ECCDJCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09789&json=true","fetch_graph":"https://pith.science/api/pith-number/4ECCDJCNPVKWLJCLR65ZFCIGSE/graph.json","fetch_events":"https://pith.science/api/pith-number/4ECCDJCNPVKWLJCLR65ZFCIGSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/action/storage_attestation","attest_author":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/action/author_attestation","sign_citation":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/action/citation_signature","submit_replication":"https://pith.science/pith/4ECCDJCNPVKWLJCLR65ZFCIGSE/action/replication_record"}},"created_at":"2026-05-18T00:25:03.711379+00:00","updated_at":"2026-05-18T00:25:03.711379+00:00"}