{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EEEJ2UAYEEUIR423XJOSDRDXNS","short_pith_number":"pith:EEEJ2UAY","schema_version":"1.0","canonical_sha256":"21089d5018212888f35bba5d21c4776c986bbe1e510f05c4291d2b705e8cf68a","source":{"kind":"arxiv","id":"2101.03588","version":1},"attestation_state":"computed","paper":{"title":"Provably Approximated ICP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CV","authors_text":"Alaa Maalouf, Dan Feldman, Ibrahim Jubran, Ron Kimmel","submitted_at":"2021-01-10T18:09:29Z","abstract_excerpt":"The goal of the \\emph{alignment problem} is to align a (given) point cloud $P = \\{p_1,\\cdots,p_n\\}$ to another (observed) point cloud $Q = \\{q_1,\\cdots,q_n\\}$. That is, to compute a rotation matrix $R \\in \\mathbb{R}^{3 \\times 3}$ and a translation vector $t \\in \\mathbb{R}^{3}$ that minimize the sum of paired distances $\\sum_{i=1}^n D(Rp_i-t,q_i)$ for some distance function $D$. A harder version is the \\emph{registration problem}, where the correspondence is unknown, and the minimum is also over all possible correspondence functions from $P$ to $Q$. Heuristics such as the Iterative Closest Poin"},"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":"2101.03588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-01-10T18:09:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"7ea51278a6fb9c3fbcff707acf8c4267d91ded4559ebbb406ed122e6292a3577","abstract_canon_sha256":"150750124f51e86a1e4a5b9624071f10407d506e50c5a4dc25e1d359eb1afb2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:51.750889Z","signature_b64":"Pip6NxLl86OvdhRISN3BjyTb+60MIUa8x/z9QF/ETucI7zx15x3AePup4iCdDJkuBb4BhQHlmSkdKmVeUCKvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21089d5018212888f35bba5d21c4776c986bbe1e510f05c4291d2b705e8cf68a","last_reissued_at":"2026-07-05T02:05:51.750485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:51.750485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Approximated ICP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CV","authors_text":"Alaa Maalouf, Dan Feldman, Ibrahim Jubran, Ron Kimmel","submitted_at":"2021-01-10T18:09:29Z","abstract_excerpt":"The goal of the \\emph{alignment problem} is to align a (given) point cloud $P = \\{p_1,\\cdots,p_n\\}$ to another (observed) point cloud $Q = \\{q_1,\\cdots,q_n\\}$. That is, to compute a rotation matrix $R \\in \\mathbb{R}^{3 \\times 3}$ and a translation vector $t \\in \\mathbb{R}^{3}$ that minimize the sum of paired distances $\\sum_{i=1}^n D(Rp_i-t,q_i)$ for some distance function $D$. A harder version is the \\emph{registration problem}, where the correspondence is unknown, and the minimum is also over all possible correspondence functions from $P$ to $Q$. Heuristics such as the Iterative Closest Poin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03588","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.03588/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":"2101.03588","created_at":"2026-07-05T02:05:51.750546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.03588v1","created_at":"2026-07-05T02:05:51.750546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03588","created_at":"2026-07-05T02:05:51.750546+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEEJ2UAYEEUI","created_at":"2026-07-05T02:05:51.750546+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEEJ2UAYEEUIR423","created_at":"2026-07-05T02:05:51.750546+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEEJ2UAY","created_at":"2026-07-05T02:05:51.750546+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/EEEJ2UAYEEUIR423XJOSDRDXNS","json":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS.json","graph_json":"https://pith.science/api/pith-number/EEEJ2UAYEEUIR423XJOSDRDXNS/graph.json","events_json":"https://pith.science/api/pith-number/EEEJ2UAYEEUIR423XJOSDRDXNS/events.json","paper":"https://pith.science/paper/EEEJ2UAY"},"agent_actions":{"view_html":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS","download_json":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS.json","view_paper":"https://pith.science/paper/EEEJ2UAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.03588&json=true","fetch_graph":"https://pith.science/api/pith-number/EEEJ2UAYEEUIR423XJOSDRDXNS/graph.json","fetch_events":"https://pith.science/api/pith-number/EEEJ2UAYEEUIR423XJOSDRDXNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS/action/storage_attestation","attest_author":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS/action/author_attestation","sign_citation":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS/action/citation_signature","submit_replication":"https://pith.science/pith/EEEJ2UAYEEUIR423XJOSDRDXNS/action/replication_record"}},"created_at":"2026-07-05T02:05:51.750546+00:00","updated_at":"2026-07-05T02:05:51.750546+00:00"}