{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UKVGCR6QQN4WSCOBDZVYDG2JMW","short_pith_number":"pith:UKVGCR6Q","canonical_record":{"source":{"id":"2507.01439","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-07-02T07:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"dc7a4dda741f5e2aaf3337878f659268f38edfc78fdb159958d75857c206a018","abstract_canon_sha256":"d62cb07575b18b14fd4cf388dac42801a6fcf5fe648a233d31eee8ffb6c0828c"},"schema_version":"1.0"},"canonical_sha256":"a2aa6147d083796909c11e6b819b4965a5f46dc2f1471b61e0c434e82b9476fb","source":{"kind":"arxiv","id":"2507.01439","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.01439","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"2507.01439v3","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01439","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"UKVGCR6QQN4W","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"pith_short_16","alias_value":"UKVGCR6QQN4WSCOB","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"pith_short_8","alias_value":"UKVGCR6Q","created_at":"2026-07-05T11:45:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UKVGCR6QQN4WSCOBDZVYDG2JMW","target":"record","payload":{"canonical_record":{"source":{"id":"2507.01439","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-07-02T07:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"dc7a4dda741f5e2aaf3337878f659268f38edfc78fdb159958d75857c206a018","abstract_canon_sha256":"d62cb07575b18b14fd4cf388dac42801a6fcf5fe648a233d31eee8ffb6c0828c"},"schema_version":"1.0"},"canonical_sha256":"a2aa6147d083796909c11e6b819b4965a5f46dc2f1471b61e0c434e82b9476fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:15.239956Z","signature_b64":"gDi4DtLQ+mqWTKvLgWDcMWMrssTudiu5kGkgNr20/wvYCeLXEeHvOwuZz92I5y/yqccHAkkQVy9aJPuxhmgZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2aa6147d083796909c11e6b819b4965a5f46dc2f1471b61e0c434e82b9476fb","last_reissued_at":"2026-07-05T11:45:15.239456Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:15.239456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.01439","source_version":3,"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-07-05T11:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ob2OJE8UCLtA8kcP4VnBD6vLIfjU0YAaD1DsxgCZTrUL6Zdc/Zqefchn8ub8LG+muQUT3YTVF+zcn9C41P0PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:45:21.784704Z"},"content_sha256":"21a62f50d8e9a522c2565cb2335df11154128792a9a1de3b92f954e1e1b8a2cd","schema_version":"1.0","event_id":"sha256:21a62f50d8e9a522c2565cb2335df11154128792a9a1de3b92f954e1e1b8a2cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UKVGCR6QQN4WSCOBDZVYDG2JMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TurboReg: TurboClique for Robust and Efficient Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiayuan Li, Ji Wu, Kaixin Wang, Kuang Cao, Pengcheng Shi, Shaocheng Yan, Zhenjun Zhao","submitted_at":"2025-07-02T07:50:24Z","abstract_excerpt":"Robust estimation is essential in correspondence-based Point Cloud Registration (PCR). Existing methods using maximal clique search in compatibility graphs achieve high recall but suffer from exponential time complexity, limiting their use in time-sensitive applications. To address this challenge, we propose a fast and robust estimator, TurboReg, built upon a novel lightweight clique, TurboClique, and a highly parallelizable Pivot-Guided Search (PGS) algorithm. First, we define the TurboClique as a 3-clique within a highly-constrained compatibility graph. The lightweight nature of the 3-clique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01439","kind":"arxiv","version":3},"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/2507.01439/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"},"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-07-05T11:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mta4R8/+MZbrQWiZ/RKOqbDRR17JhqzSwpc5KFCCjWuCpup3zeQxZzD05VxmDqpfe+KHIt8TmlVWAWSvrCNgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:45:21.785721Z"},"content_sha256":"d6048a95726b853aebe213fcf048af21331ec160ba32ecfd19f6b16307cdcc4c","schema_version":"1.0","event_id":"sha256:d6048a95726b853aebe213fcf048af21331ec160ba32ecfd19f6b16307cdcc4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW/bundle.json","state_url":"https://pith.science/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW/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-11T08:45:21Z","links":{"resolver":"https://pith.science/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW","bundle":"https://pith.science/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW/bundle.json","state":"https://pith.science/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKVGCR6QQN4WSCOBDZVYDG2JMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UKVGCR6QQN4WSCOBDZVYDG2JMW","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":"d62cb07575b18b14fd4cf388dac42801a6fcf5fe648a233d31eee8ffb6c0828c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-07-02T07:50:24Z","title_canon_sha256":"dc7a4dda741f5e2aaf3337878f659268f38edfc78fdb159958d75857c206a018"},"schema_version":"1.0","source":{"id":"2507.01439","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.01439","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"2507.01439v3","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01439","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"UKVGCR6QQN4W","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"pith_short_16","alias_value":"UKVGCR6QQN4WSCOB","created_at":"2026-07-05T11:45:15Z"},{"alias_kind":"pith_short_8","alias_value":"UKVGCR6Q","created_at":"2026-07-05T11:45:15Z"}],"graph_snapshots":[{"event_id":"sha256:d6048a95726b853aebe213fcf048af21331ec160ba32ecfd19f6b16307cdcc4c","target":"graph","created_at":"2026-07-05T11:45:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.01439/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust estimation is essential in correspondence-based Point Cloud Registration (PCR). Existing methods using maximal clique search in compatibility graphs achieve high recall but suffer from exponential time complexity, limiting their use in time-sensitive applications. To address this challenge, we propose a fast and robust estimator, TurboReg, built upon a novel lightweight clique, TurboClique, and a highly parallelizable Pivot-Guided Search (PGS) algorithm. First, we define the TurboClique as a 3-clique within a highly-constrained compatibility graph. The lightweight nature of the 3-clique","authors_text":"Jiayuan Li, Ji Wu, Kaixin Wang, Kuang Cao, Pengcheng Shi, Shaocheng Yan, Zhenjun Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-07-02T07:50:24Z","title":"TurboReg: TurboClique for Robust and Efficient Point Cloud Registration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01439","kind":"arxiv","version":3},"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:21a62f50d8e9a522c2565cb2335df11154128792a9a1de3b92f954e1e1b8a2cd","target":"record","created_at":"2026-07-05T11:45:15Z","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":"d62cb07575b18b14fd4cf388dac42801a6fcf5fe648a233d31eee8ffb6c0828c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-07-02T07:50:24Z","title_canon_sha256":"dc7a4dda741f5e2aaf3337878f659268f38edfc78fdb159958d75857c206a018"},"schema_version":"1.0","source":{"id":"2507.01439","kind":"arxiv","version":3}},"canonical_sha256":"a2aa6147d083796909c11e6b819b4965a5f46dc2f1471b61e0c434e82b9476fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2aa6147d083796909c11e6b819b4965a5f46dc2f1471b61e0c434e82b9476fb","first_computed_at":"2026-07-05T11:45:15.239456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:15.239456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDi4DtLQ+mqWTKvLgWDcMWMrssTudiu5kGkgNr20/wvYCeLXEeHvOwuZz92I5y/yqccHAkkQVy9aJPuxhmgZAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:15.239956Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.01439","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21a62f50d8e9a522c2565cb2335df11154128792a9a1de3b92f954e1e1b8a2cd","sha256:d6048a95726b853aebe213fcf048af21331ec160ba32ecfd19f6b16307cdcc4c"],"state_sha256":"dab58474072610e284fbb8cd3ccd97d1de4ec78f668cff06b7ae3ed6bad6c84d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEK55U/r41BHgI7ystdzYuEUcMdIo9z69Bifm22qwjkTpfrSalrf2Kzrkp7Hr1yVdO3ZvrKocgShIgwtBavFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:45:21.791496Z","bundle_sha256":"f29f447b948a6e7e1d18bea4b9a76236549bc23c6a7d8f710cde1ad34cb02974"}}