{"as_of":"2026-08-21T13:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26747b39180895ca101b2c3a86cec0eacf3c5cbb6996064f2536d98ffe9716f9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T02:06:01.131410Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T02:08:29.405723Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.08772","last_updated":"2020-10-08T01:05:16Z","snapshot_observed_at":"2026-07-06T09:13:23.894818Z","submitted_at":"2020-04-19T05:40:59Z","title":"Maximizing robustness of point-set registration by leveraging non-convexity","version":3},"cited_work":{"arxiv_id":"2004.08772","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.08772","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximizing robustness of point-set registration by leveraging non-convexity","venue":null,"work_id":"0c69ac8c-6db5-4039-9139-2621dedca311","year":2004},"citing_paper":{"arxiv_id":"2605.14444","last_updated":"2026-05-14T06:39:36Z","snapshot_observed_at":"2026-08-13T16:17:32.851578Z","submitted_at":"2026-05-14T06:39:36Z","title":"Inlier Recovery for Robust Registration via Gram-Matrix Overlap","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T02:06:01.131410Z"},"links":{"cited_paper":"/paper/2004.08772","citing_paper":"/paper/2605.14444"},"observation_digest":"sha256:8c7a477ff02b1f974a8ddc308253cd282a0bdbe9e6d59fba524c56352a344f48","observation_id":"7728db29-225a-44cb-a1d1-c7826bd3b5b8","resolution":{"observed_at":"2026-05-15T02:08:29.407493Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.08772/citation-record","integrity":"/paper/2004.08772/integrity","json":"/paper/2004.08772/citation-record.json","paper":"/paper/2004.08772"},"outbound":[],"paper":{"arxiv_id":"2004.08772","last_updated":"2020-10-08T01:05:16Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T09:13:23.894818Z","submitted_at":"2020-04-19T05:40:59Z","title":"Maximizing robustness of point-set registration by leveraging non-convexity"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2004.08772."}