{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5W4UZVSTPI2ENKDLMKRPHD5Z7N","short_pith_number":"pith:5W4UZVST","schema_version":"1.0","canonical_sha256":"edb94cd6537a3446a86b62a2f38fb9fb4f8850289d293dc85b67f28fb21143c3","source":{"kind":"arxiv","id":"1811.07455","version":1},"attestation_state":"computed","paper":{"title":"On Geometric Alignment in Low Doubling Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hu Ding, Mingquan Ye","submitted_at":"2018-11-19T02:03:35Z","abstract_excerpt":"In real-world, many problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns, especially in the field of computer vision. Recently, the alignment of geometric patterns in high dimension finds several novel applications, and has attracted more and more attentions. However, the research is still rather limited in terms of algorithms. To the best of our knowledge, most existing approaches for high dimensional alignment are just simple extensions of their counterparts for 2D and 3D cases, and ofte"},"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":"1811.07455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T02:03:35Z","cross_cats_sorted":["cs.CG","stat.ML"],"title_canon_sha256":"a9da1581e4269d857c49efdcafa9b891d00a28fc979696d9d1826424bfe51249","abstract_canon_sha256":"1277cb6550f64aebcd8cbab35e7e5016bce0aea76b76ee7d073f6594652e1c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:24.470945Z","signature_b64":"5gOfBfHqZ3yaYMAchwQ0NuErNrWsanOFTsJiUvoMV8GDgulAijZyxMtMu9fdpa0l0GAl7ve6IjtfON3rWMp2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb94cd6537a3446a86b62a2f38fb9fb4f8850289d293dc85b67f28fb21143c3","last_reissued_at":"2026-05-18T00:00:24.470210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:24.470210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Geometric Alignment in Low Doubling Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hu Ding, Mingquan Ye","submitted_at":"2018-11-19T02:03:35Z","abstract_excerpt":"In real-world, many problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns, especially in the field of computer vision. Recently, the alignment of geometric patterns in high dimension finds several novel applications, and has attracted more and more attentions. However, the research is still rather limited in terms of algorithms. To the best of our knowledge, most existing approaches for high dimensional alignment are just simple extensions of their counterparts for 2D and 3D cases, and ofte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07455","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":"1811.07455","created_at":"2026-05-18T00:00:24.470311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07455v1","created_at":"2026-05-18T00:00:24.470311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07455","created_at":"2026-05-18T00:00:24.470311+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W4UZVSTPI2E","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W4UZVSTPI2ENKDL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W4UZVST","created_at":"2026-05-18T12:32:08.215937+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/5W4UZVSTPI2ENKDLMKRPHD5Z7N","json":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N.json","graph_json":"https://pith.science/api/pith-number/5W4UZVSTPI2ENKDLMKRPHD5Z7N/graph.json","events_json":"https://pith.science/api/pith-number/5W4UZVSTPI2ENKDLMKRPHD5Z7N/events.json","paper":"https://pith.science/paper/5W4UZVST"},"agent_actions":{"view_html":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N","download_json":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N.json","view_paper":"https://pith.science/paper/5W4UZVST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07455&json=true","fetch_graph":"https://pith.science/api/pith-number/5W4UZVSTPI2ENKDLMKRPHD5Z7N/graph.json","fetch_events":"https://pith.science/api/pith-number/5W4UZVSTPI2ENKDLMKRPHD5Z7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N/action/storage_attestation","attest_author":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N/action/author_attestation","sign_citation":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N/action/citation_signature","submit_replication":"https://pith.science/pith/5W4UZVSTPI2ENKDLMKRPHD5Z7N/action/replication_record"}},"created_at":"2026-05-18T00:00:24.470311+00:00","updated_at":"2026-05-18T00:00:24.470311+00:00"}