{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4BGWQ626PEQQCG24EIZD2MZSSD","short_pith_number":"pith:4BGWQ626","canonical_record":{"source":{"id":"1811.10136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-26T01:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"670b45b697bc9ca9cc74f962d6509cfcc0ad54460cb2547d064ff41495dcac98","abstract_canon_sha256":"5a0397da557bbf0f1cadd7e8c0a1172f6c75025c75ea4dfea2a439195996f9a4"},"schema_version":"1.0"},"canonical_sha256":"e04d687b5e7921011b5c22323d333290e257bf139e4abcf0c461917a3202697a","source":{"kind":"arxiv","id":"1811.10136","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10136","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10136v3","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10136","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"4BGWQ626PEQQ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BGWQ626PEQQCG24","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BGWQ626","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4BGWQ626PEQQCG24EIZD2MZSSD","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-26T01:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"670b45b697bc9ca9cc74f962d6509cfcc0ad54460cb2547d064ff41495dcac98","abstract_canon_sha256":"5a0397da557bbf0f1cadd7e8c0a1172f6c75025c75ea4dfea2a439195996f9a4"},"schema_version":"1.0"},"canonical_sha256":"e04d687b5e7921011b5c22323d333290e257bf139e4abcf0c461917a3202697a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:34.040409Z","signature_b64":"VzLozokvlYwsq6cn/I5NGmjPAXtIFh2YilyKOR36c7BWEdYtrdzL0gD8IHJy76lTuzC1Q/EB22BV1KxfjUzLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e04d687b5e7921011b5c22323d333290e257bf139e4abcf0c461917a3202697a","last_reissued_at":"2026-05-17T23:40:34.039866Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:34.039866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10136","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-05-17T23:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YAxAxuhT1CCvMceeNwxXaJmcatsMqHN11o7rTD/OlytbNc4ZMeLxKihyb32Jp71461WXiU4MN6ggyI2c2zEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:03:22.038620Z"},"content_sha256":"13fa492ba75926d7d15fc4976b0d9ffa4843cb34caf330a2db1d7c7993addccc","schema_version":"1.0","event_id":"sha256:13fa492ba75926d7d15fc4976b0d9ffa4843cb34caf330a2db1d7c7993addccc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4BGWQ626PEQQCG24EIZD2MZSSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FilterReg: Robust and Efficient Probabilistic Point-Set Registration using Gaussian Filter and Twist Parameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Russ Tedrake, Wei Gao","submitted_at":"2018-11-26T01:23:47Z","abstract_excerpt":"Probabilistic point-set registration methods have been gaining more attention for their robustness to noise, outliers and occlusions. However, these methods tend to be much slower than the popular iterative closest point (ICP) algorithms, which severely limits their usability. In this paper, we contribute a novel probabilistic registration method that achieves state-of-the-art robustness as well as substantially faster computational performance than modern ICP implementations. This is achieved using a rigorous yet computationally-efficient probabilistic formulation. Point-set registration is c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10136","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":""},"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-17T23:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQEARCtkZKszvYOiHRDQjKi/Le4kmZSGgIEvdkK4HiA6VD4tZzQH2g/9hMblOlZYSGmDPUmxxxhq9hv3Wbx7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:03:22.039290Z"},"content_sha256":"52d2e2a34297bb4fb3dbbc0f82ab58b96a6a56335ea30d2f5a1a4e0577b6d1a4","schema_version":"1.0","event_id":"sha256:52d2e2a34297bb4fb3dbbc0f82ab58b96a6a56335ea30d2f5a1a4e0577b6d1a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BGWQ626PEQQCG24EIZD2MZSSD/bundle.json","state_url":"https://pith.science/pith/4BGWQ626PEQQCG24EIZD2MZSSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BGWQ626PEQQCG24EIZD2MZSSD/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-05-26T22:03:22Z","links":{"resolver":"https://pith.science/pith/4BGWQ626PEQQCG24EIZD2MZSSD","bundle":"https://pith.science/pith/4BGWQ626PEQQCG24EIZD2MZSSD/bundle.json","state":"https://pith.science/pith/4BGWQ626PEQQCG24EIZD2MZSSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BGWQ626PEQQCG24EIZD2MZSSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4BGWQ626PEQQCG24EIZD2MZSSD","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":"5a0397da557bbf0f1cadd7e8c0a1172f6c75025c75ea4dfea2a439195996f9a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-26T01:23:47Z","title_canon_sha256":"670b45b697bc9ca9cc74f962d6509cfcc0ad54460cb2547d064ff41495dcac98"},"schema_version":"1.0","source":{"id":"1811.10136","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10136","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10136v3","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10136","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"4BGWQ626PEQQ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BGWQ626PEQQCG24","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BGWQ626","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:52d2e2a34297bb4fb3dbbc0f82ab58b96a6a56335ea30d2f5a1a4e0577b6d1a4","target":"graph","created_at":"2026-05-17T23:40:34Z","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":"Probabilistic point-set registration methods have been gaining more attention for their robustness to noise, outliers and occlusions. However, these methods tend to be much slower than the popular iterative closest point (ICP) algorithms, which severely limits their usability. In this paper, we contribute a novel probabilistic registration method that achieves state-of-the-art robustness as well as substantially faster computational performance than modern ICP implementations. This is achieved using a rigorous yet computationally-efficient probabilistic formulation. Point-set registration is c","authors_text":"Russ Tedrake, Wei Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-26T01:23:47Z","title":"FilterReg: Robust and Efficient Probabilistic Point-Set Registration using Gaussian Filter and Twist Parameterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10136","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:13fa492ba75926d7d15fc4976b0d9ffa4843cb34caf330a2db1d7c7993addccc","target":"record","created_at":"2026-05-17T23:40:34Z","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":"5a0397da557bbf0f1cadd7e8c0a1172f6c75025c75ea4dfea2a439195996f9a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-26T01:23:47Z","title_canon_sha256":"670b45b697bc9ca9cc74f962d6509cfcc0ad54460cb2547d064ff41495dcac98"},"schema_version":"1.0","source":{"id":"1811.10136","kind":"arxiv","version":3}},"canonical_sha256":"e04d687b5e7921011b5c22323d333290e257bf139e4abcf0c461917a3202697a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e04d687b5e7921011b5c22323d333290e257bf139e4abcf0c461917a3202697a","first_computed_at":"2026-05-17T23:40:34.039866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:34.039866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VzLozokvlYwsq6cn/I5NGmjPAXtIFh2YilyKOR36c7BWEdYtrdzL0gD8IHJy76lTuzC1Q/EB22BV1KxfjUzLCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:34.040409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10136","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13fa492ba75926d7d15fc4976b0d9ffa4843cb34caf330a2db1d7c7993addccc","sha256:52d2e2a34297bb4fb3dbbc0f82ab58b96a6a56335ea30d2f5a1a4e0577b6d1a4"],"state_sha256":"a07fb5f9665cc5af78d81ce1cbcd6fe9c05e07e6957ab14f715fac5970dcbe65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MWGf5eu0lsoqRKdDcKv9mRsJV4in1mmpW//VOj+9uG5A9cpXqpbN2JA8jIrQYk8YMK5eKmPeztvPuG7oUmpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:03:22.042089Z","bundle_sha256":"29a3dc8fa429d4e1fc5b5304641e7c2009b25335fef3d9e2758ce0cd4fdf2a57"}}