{"as_of":"2026-08-16T10:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ea92403ee18b1ba739953cc867de4dd8a5bdb1c5af3ded2befa95a21529050e","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:55:28.289002Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.04384/citation-record","integrity":"/paper/1908.04384/integrity","json":"/paper/1908.04384/citation-record.json","paper":"/paper/1908.04384"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.488841Z","title":"A solution for the best rotation to relate two sets o f vec- tors,","venue":null,"work_id":"17c23934-ad8c-45fa-a539-e0a147896fa2","year":1976},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.241520Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:9dd43f8a2a1147c92a9261c1bdc69d9096c3449326bf69a834ea9a7d39d853f9","observation_id":"07d2ebec-7b0d-4b1c-bc2c-b9fce74dc87c","resolution":{"observed_at":"2026-08-14T14:55:28.493765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.469547Z","title":"Least-squares fitting of t wo 3- D point sets,","venue":null,"work_id":"b00fd555-b8cd-4118-bcb8-40b8b8d28016","year":1987},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.247479Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:bba8a0887145d54d6021be0489157c8591173ee95771986433e861956f3dcc26","observation_id":"e5123efe-d9ec-4809-9981-2995ebbb20ae","resolution":{"observed_at":"2026-08-14T14:55:28.476438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.453263Z","title":"Least-squares estimation of transformation pa rameters between two point sets,","venue":null,"work_id":"2577c372-fc1f-4343-87be-fe0ccf3c19b9","year":1991},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.252528Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:1bbe1c3c5848ce0f959ca3096c1a2acb692c5e31527769aea1f76459e8c4cf4c","observation_id":"c208cff7-782c-4493-bc86-3b2f3b513a70","resolution":{"observed_at":"2026-08-14T14:55:28.458247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.437751Z","title":"Fast algorithm for poin t pat- tern matching: Invariant to translations, rotations and scale cha nges,","venue":null,"work_id":"576399ea-4585-456b-ad48-171907da1cf7","year":1997},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.257581Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:c5b0212f45e3917a99659474ab7da2b44d2ed64bea1efe5b222547479a947ce4","observation_id":"42d1d48c-28b7-48da-965b-30ca4b8f2f81","resolution":{"observed_at":"2026-08-14T14:55:28.442851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.419738Z","title":"The softassign pro crustes matching algorithm,","venue":null,"work_id":"58b61f9a-280d-437f-bdcd-bce838a1f538","year":1997},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.262587Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:7ee0026c65c1196e166f1c76239981621494fcad7132ac9e3408afd99ed56fb0","observation_id":"dc850099-c7b2-4717-92c5-18012aa73c52","resolution":{"observed_at":"2026-08-14T14:55:28.425144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.400800Z","title":"A robust point matching algorith m for autoradiograph alignment,","venue":null,"work_id":"2ea09930-bbfd-4530-993a-12f874003d20","year":1997},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.267659Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:9aefc42279b46c86c6427ce598f7a65931f23f59a4218492cf8e282773f335d8","observation_id":"e0a1027d-f995-4422-92fd-974307eaf230","resolution":{"observed_at":"2026-08-14T14:55:28.406371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.383425Z","title":"Ne w algorithms for 2d and 3d point matching: pose estimation and corre- spondence,","venue":null,"work_id":"7a683861-237b-4120-87f3-67afec7bac7b","year":1998},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.273348Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:7bd76b30818c04e97058802b364f662cb6366ac169358faf0921db8f8b3d16a4","observation_id":"97035649-e7dd-4a4c-9eda-248c97abf916","resolution":{"observed_at":"2026-08-14T14:55:28.389056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.364313Z","title":"A correlation-based approach to robus t point set registration,","venue":null,"work_id":"cda232af-b5a8-41fb-b528-9ac19d1f26dc","year":2004},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.278897Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:1368a73f55ded2adee25825f2120667499a14be7f491a18040a897209efc9085","observation_id":"6549ac01-06fa-43d0-91f3-cca43d97b853","resolution":{"observed_at":"2026-08-14T14:55:28.371065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.342367Z","title":"Robust point set registration using gauss ian mixture models,","venue":null,"work_id":"d2a7b726-9962-484a-a7ff-07dd8964f1f3","year":2010},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.283839Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:cf9db834dcf8685f9a91057175121ebbdfc49cd6f0c1bc26083bda1c2eac142f","observation_id":"914f5b09-7d61-49e6-9118-05e2c06827af","resolution":{"observed_at":"2026-08-14T14:55:28.348773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:28.322544Z","title":"An unsuperv ised 2d point-set registration algorithm for unlabeled feature points: App lica- tion to fingerprint matching,","venue":null,"work_id":"38f3b4f5-6151-4d97-90fb-f0f0a5d41c77","year":2017},"citing_paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:28.289002Z"},"links":{"citing_paper":"/paper/1908.04384"},"observation_digest":"sha256:c5d9167c8276afa1a1fa7cbdeedd5f92f5da85b0c121ca4cb3ec57cc670c14e5","observation_id":"2cf47d96-5965-464b-9227-a6b36eada286","resolution":{"observed_at":"2026-08-14T14:55:28.330522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04384","last_updated":"2019-08-06T17:03:53Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-14T14:46:58.386184Z","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":10},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:1908.04384."}