{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NJPZGK5G5L4SIBKHSR6HNUJPSY","short_pith_number":"pith:NJPZGK5G","schema_version":"1.0","canonical_sha256":"6a5f932ba6eaf9240547947c76d12f961e6e268aeeea12fa9a7f4554740711c2","source":{"kind":"arxiv","id":"1901.02532","version":1},"attestation_state":"computed","paper":{"title":"Fast 3D Line Segment Detection From Unorganized Point Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kai Li, Xiaohu Lu, Yahui Liu","submitted_at":"2019-01-08T21:51:51Z","abstract_excerpt":"This paper presents a very simple but efficient algorithm for 3D line segment detection from large scale unorganized point cloud. Unlike traditional methods which usually extract 3D edge points first and then link them to fit for 3D line segments, we propose a very simple 3D line segment detection algorithm based on point cloud segmentation and 2D line detection. Given the input unorganized point cloud, three steps are performed to detect 3D line segments. Firstly, the point cloud is segmented into 3D planes via region growing and region merging. Secondly, for each 3D plane, all the points bel"},"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":"1901.02532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-08T21:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"af1ba069518cea133c1f58aa462b79d9e62bf338214e0d848609471f8f677dbc","abstract_canon_sha256":"25f6813a67264b003c8d1455534ecce13caf9b09a58ef4926c188bdde0270193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.276817Z","signature_b64":"hJiPGdO5G3/L5rbk3qejUy6rb2kDUyPpe5wkNU8MiN6xQvd0ABPcP8ptVg5XBuFbkBglmf/WCFFNd4MlCHPFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a5f932ba6eaf9240547947c76d12f961e6e268aeeea12fa9a7f4554740711c2","last_reissued_at":"2026-05-17T23:56:40.276159Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.276159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast 3D Line Segment Detection From Unorganized Point Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kai Li, Xiaohu Lu, Yahui Liu","submitted_at":"2019-01-08T21:51:51Z","abstract_excerpt":"This paper presents a very simple but efficient algorithm for 3D line segment detection from large scale unorganized point cloud. Unlike traditional methods which usually extract 3D edge points first and then link them to fit for 3D line segments, we propose a very simple 3D line segment detection algorithm based on point cloud segmentation and 2D line detection. Given the input unorganized point cloud, three steps are performed to detect 3D line segments. Firstly, the point cloud is segmented into 3D planes via region growing and region merging. Secondly, for each 3D plane, all the points bel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02532","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.02532","created_at":"2026-05-17T23:56:40.276277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02532v1","created_at":"2026-05-17T23:56:40.276277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02532","created_at":"2026-05-17T23:56:40.276277+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJPZGK5G5L4S","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJPZGK5G5L4SIBKH","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJPZGK5G","created_at":"2026-05-18T12:33:24.271573+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/NJPZGK5G5L4SIBKHSR6HNUJPSY","json":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY.json","graph_json":"https://pith.science/api/pith-number/NJPZGK5G5L4SIBKHSR6HNUJPSY/graph.json","events_json":"https://pith.science/api/pith-number/NJPZGK5G5L4SIBKHSR6HNUJPSY/events.json","paper":"https://pith.science/paper/NJPZGK5G"},"agent_actions":{"view_html":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY","download_json":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY.json","view_paper":"https://pith.science/paper/NJPZGK5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02532&json=true","fetch_graph":"https://pith.science/api/pith-number/NJPZGK5G5L4SIBKHSR6HNUJPSY/graph.json","fetch_events":"https://pith.science/api/pith-number/NJPZGK5G5L4SIBKHSR6HNUJPSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY/action/storage_attestation","attest_author":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY/action/author_attestation","sign_citation":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY/action/citation_signature","submit_replication":"https://pith.science/pith/NJPZGK5G5L4SIBKHSR6HNUJPSY/action/replication_record"}},"created_at":"2026-05-17T23:56:40.276277+00:00","updated_at":"2026-05-17T23:56:40.276277+00:00"}