{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TLBDYQT3CO7C3UA7CZVWJKA2JO","short_pith_number":"pith:TLBDYQT3","schema_version":"1.0","canonical_sha256":"9ac23c427b13be2dd01f166b64a81a4b802d15476b3b158eec92efb8a4a0f8c4","source":{"kind":"arxiv","id":"2301.07425","version":2},"attestation_state":"computed","paper":{"title":"Segregator: Global Point Cloud Registration with Semantic and Geometric Cues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Haozhi Cao, Lihua Xie, Pengyu Yin, Shenghai Yuan, Shuyang Zhang, Xingyu Ji","submitted_at":"2023-01-18T10:47:45Z","abstract_excerpt":"This paper presents Segregator, a global point cloud registration framework that exploits both semantic information and geometric distribution to efficiently build up outlier-robust correspondences and search for inliers. Current state-of-the-art algorithms rely on point features to set up putative correspondences and refine them by employing pair-wise distance consistency checks. However, such a scheme suffers from degenerate cases, where the descriptive capability of local point features downgrades, and unconstrained cases, where length-preserving (l-TRIMs)-based checks cannot sufficiently c"},"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":"2301.07425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-18T10:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"5aa50d18b24e12ba0c1f9445b50eddda6b2fdb741ba05d194d98a8b5ef07cf97","abstract_canon_sha256":"8e9a4176c9d4ba957b2231d824eef46bd4493686ff6a6d64d8d8af60dc86c46e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:53.132411Z","signature_b64":"oKpgbme9F+c+Fz5p84fNhp5FtLUTzCqSIgtK76S+bhHVJMC3F2D7kgAFd9ZbflUeV2HT3y60rbN/Ku6qaxifCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ac23c427b13be2dd01f166b64a81a4b802d15476b3b158eec92efb8a4a0f8c4","last_reissued_at":"2026-07-05T05:46:53.131967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:53.131967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Segregator: Global Point Cloud Registration with Semantic and Geometric Cues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Haozhi Cao, Lihua Xie, Pengyu Yin, Shenghai Yuan, Shuyang Zhang, Xingyu Ji","submitted_at":"2023-01-18T10:47:45Z","abstract_excerpt":"This paper presents Segregator, a global point cloud registration framework that exploits both semantic information and geometric distribution to efficiently build up outlier-robust correspondences and search for inliers. Current state-of-the-art algorithms rely on point features to set up putative correspondences and refine them by employing pair-wise distance consistency checks. However, such a scheme suffers from degenerate cases, where the descriptive capability of local point features downgrades, and unconstrained cases, where length-preserving (l-TRIMs)-based checks cannot sufficiently c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07425","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.07425/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.07425","created_at":"2026-07-05T05:46:53.132023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.07425v2","created_at":"2026-07-05T05:46:53.132023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07425","created_at":"2026-07-05T05:46:53.132023+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLBDYQT3CO7C","created_at":"2026-07-05T05:46:53.132023+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLBDYQT3CO7C3UA7","created_at":"2026-07-05T05:46:53.132023+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLBDYQT3","created_at":"2026-07-05T05:46:53.132023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01439","citing_title":"TurboReg: TurboClique for Robust and Efficient Point Cloud Registration","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO","json":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO.json","graph_json":"https://pith.science/api/pith-number/TLBDYQT3CO7C3UA7CZVWJKA2JO/graph.json","events_json":"https://pith.science/api/pith-number/TLBDYQT3CO7C3UA7CZVWJKA2JO/events.json","paper":"https://pith.science/paper/TLBDYQT3"},"agent_actions":{"view_html":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO","download_json":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO.json","view_paper":"https://pith.science/paper/TLBDYQT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.07425&json=true","fetch_graph":"https://pith.science/api/pith-number/TLBDYQT3CO7C3UA7CZVWJKA2JO/graph.json","fetch_events":"https://pith.science/api/pith-number/TLBDYQT3CO7C3UA7CZVWJKA2JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO/action/storage_attestation","attest_author":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO/action/author_attestation","sign_citation":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO/action/citation_signature","submit_replication":"https://pith.science/pith/TLBDYQT3CO7C3UA7CZVWJKA2JO/action/replication_record"}},"created_at":"2026-07-05T05:46:53.132023+00:00","updated_at":"2026-07-05T05:46:53.132023+00:00"}