{"as_of":"2026-08-10T22:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f83d3aa4e9e618eabebfa6f75b900f346ff649747cc1fac0c43e947599095478","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T22:06:07.775625Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:49:47.310491Z","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-07-03T04:57:38.241457Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"cited_work":{"arxiv_id":"2502.04640","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04640","snapshot_observed_at":"2026-07-03T04:57:38.241457Z","title":"Building rome with convex optimization","venue":null,"work_id":"fceafce4-0855-405b-873b-51985fe775bc","year":2025},"citing_paper":{"arxiv_id":"2503.20142","last_updated":"2026-05-16T13:28:55Z","snapshot_observed_at":"2026-08-06T23:54:41.467488Z","submitted_at":"2025-03-26T01:16:42Z","title":"Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T23:35:06.548892Z"},"links":{"cited_paper":"/paper/2502.04640","citing_paper":"/paper/2503.20142"},"observation_digest":"sha256:6d2ad1a8abbf112d923ae5d6aa805abf6391a9d54689df6c169b4c6294210856","observation_id":"cf27cd86-e09d-4f0a-b327-afdca9215030","resolution":{"observed_at":"2026-05-22T23:35:13.324760Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"cited_work":{"arxiv_id":"2502.04640","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04640","snapshot_observed_at":"2026-07-03T04:57:38.241457Z","title":"Building rome with convex optimization","venue":null,"work_id":"fceafce4-0855-405b-873b-51985fe775bc","year":2025},"citing_paper":{"arxiv_id":"2505.20858","last_updated":"2026-04-07T12:32:13Z","snapshot_observed_at":"2026-08-03T14:45:07.618102Z","submitted_at":"2025-05-27T08:07:00Z","title":"ProBA: Probabilistic Bundle Adjustment with the Bhattacharyya Coefficient","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T12:58:56.975162Z"},"links":{"cited_paper":"/paper/2502.04640","citing_paper":"/paper/2505.20858"},"observation_digest":"sha256:b228c9569d2067175381164240cff6d0e53ba65d2650a3d156eaf4dd3c3f9171","observation_id":"a29c7c91-e397-4f02-9169-9cd55fec4bf8","resolution":{"observed_at":"2026-05-19T13:02:18.431435Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04640","snapshot_observed_at":"2026-08-04T09:49:47.310491Z","title":"Building rome with convex optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.13310","last_updated":"2026-07-21T19:26:24Z","snapshot_observed_at":"2026-08-09T04:59:17.288715Z","submitted_at":"2025-10-15T08:58:05Z","title":"InstantSfM: Towards GPU-Native SfM for the Deep Learning Era","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T09:49:47.310491Z"},"links":{"cited_paper":"/paper/2502.04640","citing_paper":"/paper/2510.13310"},"observation_digest":"sha256:e1548c40b60aa403402faaef982ac542d356ceb059bdded39f9ae739a0ea4273","observation_id":"bb773c12-c955-46e4-bb82-1eb4511c8053","resolution":{"observed_at":"2026-08-04T09:49:47.310491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"cited_work":{"arxiv_id":"2502.04640","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04640","snapshot_observed_at":"2026-07-03T04:57:38.241457Z","title":"Building rome with convex optimization","venue":null,"work_id":"fceafce4-0855-405b-873b-51985fe775bc","year":2025},"citing_paper":{"arxiv_id":"2606.10579","last_updated":"2026-06-09T08:45:08Z","snapshot_observed_at":"2026-08-08T06:26:51.054401Z","submitted_at":"2026-06-09T08:45:08Z","title":"LieIPM: Lie Group Interior Point Method for Direct Trajectory Optimization of Rigid Bodies","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-27T13:33:03.356383Z"},"links":{"cited_paper":"/paper/2502.04640","citing_paper":"/paper/2606.10579"},"observation_digest":"sha256:6c2c5f606f341acb33aee5675116c1695a102ca0107a8a8bdff6b7f1af988e04","observation_id":"b9bb3ee9-70e9-4abd-aa84-27394b77e565","resolution":{"observed_at":"2026-07-03T04:57:38.242855Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04640/citation-record","integrity":"/paper/2502.04640/integrity","json":"/paper/2502.04640/citation-record.json","paper":"/paper/2502.04640"},"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-08T22:06:08.584222Z","title":"Optimization algorithms on matrix manifolds","venue":null,"work_id":"2b21753b-d162-40cd-89c9-ff5fe7a765eb","year":2008},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.535404Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:57e8b6189756a4d197cf5ae51c6a2bc4ecd87d43e0a7f34524d49fb013159c27","observation_id":"71105392-4417-43a6-a786-ad4d9e4a0efe","resolution":{"observed_at":"2026-08-08T22:06:08.588919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.569172Z","title":"Bundle adjustment in the large","venue":null,"work_id":"0c24bab5-d528-4d0d-a065-818d76d906c3","year":2010},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.540280Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:172ee2b774581b050ecb3fe1aea54d4ab8a15ebb6ea147718374b4dbe44052ec","observation_id":"524b3088-dbb3-4fc0-a5da-dfa1ed4462ed","resolution":{"observed_at":"2026-08-08T22:06:08.574351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.554534Z","title":"Ceres solver: Tutorial & reference","venue":null,"work_id":"76431b16-54a7-4364-a339-95c8334b5efa","year":2012},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.544550Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:46c4df775257d01b807c93e0211d62bdec2ea82486510cc8e9ccc9c9858af4cc","observation_id":"3dbd1a4d-20ef-4b49-88c7-68802d4728b4","resolution":{"observed_at":"2026-08-08T22:06:08.559007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.540359Z","title":"Outlier-robust estimation: Hardness, minimally tuned algorithms, and applications","venue":null,"work_id":"6e2e5cb9-4195-4d06-8959-9531bfe3b267","year":2021},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.549030Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:034ab979ba7fe52de774482503a1976a60e2fd5bc5d65be0d7f82e2247ffda4a","observation_id":"e034aeb7-dadb-41dc-8eb2-743a6f0eea96","resolution":{"observed_at":"2026-08-08T22:06:08.544935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.525999Z","title":"Mosek optimization toolbox for matlab","venue":null,"work_id":"41393017-daf2-461d-930e-f79554298f75","year":2019},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.553202Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:19b716982ca20ce4efa071d3797b39db97a9af63220c0111f0cd81afb18a7633","observation_id":"28e251ab-45ec-40a8-8ec8-5aa53605a5a1","resolution":{"observed_at":"2026-08-08T22:06:08.530478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.511717Z","title":"Certifiably optimal rotation and pose estimation based on the cayley map","venue":null,"work_id":"9e8eb0b3-70a8-4665-8655-7dd8a2f0f8bd","year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.558123Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:be3faa31025c849852deb15e25156cc8f20c9bfc156da96bee8e73d2c863d29a","observation_id":"38638594-1527-493b-b23a-db748bb05975","resolution":{"observed_at":"2026-08-08T22:06:08.516292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.496835Z","title":"Barron, Ben Mildenhall, Dor Verbin, Pratul P","venue":null,"work_id":"74f47f58-9a84-42e2-b6b8-66cfe54d5bbf","year":2022},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.563969Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:bb0658eb37ad38f6d2c5ba68050a23c061414244aec6115b4a5dc4fee08f4c03","observation_id":"da428aaf-066d-488d-bfb9-c87008434cd8","resolution":{"observed_at":"2026-08-08T22:06:08.501528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.482962Z","title":"Barron, Ben Mildenhall, Dor Verbin, Pratul P","venue":null,"work_id":"0bde48c2-8f0f-4094-a71e-0335a18b0eec","year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.569042Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:af6a28124cdc997ad66bcf97eec033697e9edb38f49a2d82fbcc0b34807002d6","observation_id":"38d6ab7f-54f5-4904-a4fe-4434a339c876","resolution":{"observed_at":"2026-08-08T22:06:08.486961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.469150Z","title":"Colonoscopy 3d video dataset with paired depth from 2d-3d registration","venue":null,"work_id":"5e172fb7-a745-41c8-8964-b7fafe73609a","year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.573977Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:e0ae5e0101ab2c6ba28b897f587d67b43dcc13026f0dc0c9a8df7319b5515be5","observation_id":"613b0998-13d8-4770-8d97-f72ce62b0b96","resolution":{"observed_at":"2026-08-08T22:06:08.473421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02073","last_updated":"2025-04-21T12:09:08Z","snapshot_observed_at":"2026-08-02T06:32:26.688405Z","submitted_at":"2024-10-02T22:42:20Z","title":"Depth Pro: Sharp Monocular Metric Depth in Less Than a Second","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02073","snapshot_observed_at":"2026-08-08T22:06:07.579008Z","title":"Depth pro: Sharp monocular met- ric depth in less than a second","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.579008Z"},"links":{"cited_paper":"/paper/2410.02073","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:4b8b5b32d795c10955a895fbaea6eb6fb215071069b4287afe15b61d56004f19","observation_id":"0c4e49e8-f078-442c-a070-4b60dc8dd849","resolution":{"observed_at":"2026-08-08T22:06:07.579008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:08.453981Z","title":"An introduction to optimization on smooth manifolds","venue":null,"work_id":"6d679103-9a36-4db2-acee-c06806943954","year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.583960Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:3ac33175de331c91b7f87521daf15550c0ecfd45fac63e4545d2f5a6d0b132f1","observation_id":"c083ee49-17f1-4146-b0f1-19650f2a79b0","resolution":{"observed_at":"2026-08-08T22:06:08.459124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.438559Z","title":"Manopt, a matlab toolbox for optimization on manifolds","venue":null,"work_id":"1c73ff08-334e-4655-82ab-0c85f05d116e","year":2014},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.589479Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:d8be32a5455992fd4a15f76888c4c598c2c5d78047b39e17ab0d013704165a5a","observation_id":"1c6a5b19-14e6-4228-afa8-6ce799db5f12","resolution":{"observed_at":"2026-08-08T22:06:08.443271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.423610Z","title":"A nonlinear pro- gramming algorithm for solving semidefinite programs via low-rank factorization","venue":null,"work_id":"7343bba2-337b-457b-b14b-44a49a0045dc","year":2003},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.594052Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:c1c2f51e8b506f61a6260f37088a19b7e3890da7977fca936f55eab5706eeda4","observation_id":"06fa009e-32cd-494b-9b99-8a093c36d4a7","resolution":{"observed_at":"2026-08-08T22:06:08.428523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.408958Z","title":"Lagrangian duality in 3d slam: Verification techniques and optimal solutions","venue":null,"work_id":"ca2c4851-a16e-4f87-a515-ad5d2963a030","year":2015},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.598650Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:853effcaaf79d042e24b7aa0cab2eb59714292cb32ed84272ead6b73f144a250","observation_id":"ac6ab7d4-f4ae-49c3-a29a-69c1699bf1e1","resolution":{"observed_at":"2026-08-08T22:06:08.413563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.393875Z","title":"Global registration of multiple point clouds using semidefinite programming","venue":null,"work_id":"cc71d3a7-e69b-459e-9c49-ff52981c0c69","year":2015},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.603233Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:81dc9b518bf1d4069bdb3a141ebf159a85c9f37a84166d793becacd11566d9f6","observation_id":"b588b7a0-ac91-41e8-9b28-9830d13f904f","resolution":{"observed_at":"2026-08-08T22:06:08.398865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.379012Z","title":"Image matching challenge 2023","venue":null,"work_id":"432ba27e-06d4-43a7-9cb3-deeb978487cc","year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.607933Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:2f6e88896b44ddbc2cd62ccf08cec137c85eec8398326ff1f8942b503d480d6e","observation_id":"9444c700-1110-4244-a7b9-5c88d2079d94","resolution":{"observed_at":"2026-08-08T22:06:08.383570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:07.612499Z","title":"borglab/gtsam,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.612499Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:f4eac8f52cf20786970927f1f789c16806140d6c424cb8df3041cf7552fec05f","observation_id":"63230f40-8b2b-4f28-890d-87a61e421f08","resolution":{"observed_at":"2026-08-08T22:06:07.612499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:08.338833Z","title":"Shonan rotation averaging: Global optimality by surfing so (p)ˆ n so (p) n","venue":null,"work_id":"acec1c03-09ce-4351-8bfd-8b180c07d7e3","year":2020},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.621654Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:793aa1465f60f0ecdd9b2437a53fec6409bf9b421c6c7ffc647ab64f30935678","observation_id":"ab76bcae-8732-48d5-899a-73de926d08ea","resolution":{"observed_at":"2026-08-08T22:06:08.343611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07026","last_updated":"2023-08-08T18:50:07Z","snapshot_observed_at":"2026-08-10T01:05:52.405412Z","submitted_at":"2023-05-11T17:58:47Z","title":"Decentralization and Acceleration Enables Large-Scale Bundle Adjustment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.07026","snapshot_observed_at":"2026-08-08T22:06:07.626329Z","title":"De- centralization and acceleration enables large-scale bundle adjustment","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.626329Z"},"links":{"cited_paper":"/paper/2305.07026","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:8e185ab2ae75766b60735f8b622f2fa559502ef9de55e914f0ff8cc28760fddc","observation_id":"ed113a51-c607-4b6f-9046-dd813e83c5ee","resolution":{"observed_at":"2026-08-08T22:06:07.626329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:08.323942Z","title":"Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography","venue":null,"work_id":"a22bb852-0896-4750-a773-327dad4b0eb1","year":1981},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.631012Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:cf87b144e27b8dc608d22ee5594f319c5fc4e2b096644c0e8f5b8c453ccc1002","observation_id":"7a1b0be5-0e40-4594-a6e3-3bcf5ff5d21f","resolution":{"observed_at":"2026-08-08T22:06:08.329011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.309986Z","title":"Certifiable planar relative pose estimation with gravity prior","venue":null,"work_id":"11cf5c3a-dd94-4d0b-bd7f-615cdf9f36de","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.635546Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:2bb0f0d95b4f7866550af0ee7335da6d460263675b0a0f1b55fe31a721da1556","observation_id":"384b122c-78ff-4e6b-9ec5-ea392dbf6f9b","resolution":{"observed_at":"2026-08-08T22:06:08.314677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.295315Z","title":"Certifiable relative pose estimation","venue":null,"work_id":"3e219b85-2099-436c-a37b-824d041778b5","year":2021},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.640524Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:be6cdae957d42ad8c511bb18e2116642b845cbdec55e37fe88e1f192cdb1efde","observation_id":"c9636ff1-7e49-4895-b5e4-b402235dd650","resolution":{"observed_at":"2026-08-08T22:06:08.299900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.280587Z","title":"An efficient global optimality certificate for landmark-based slam","venue":null,"work_id":"2805ad41-38bb-41d1-a54b-00db2c737d71","year":null},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.644802Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:781f98d49e9fffadd1febd9d55040b2a6171c5781d584023c0215e81a44dbd09","observation_id":"454f8079-8835-4647-b4a6-f66b1ec0da32","resolution":{"observed_at":"2026-08-08T22:06:08.285603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19309","last_updated":"2025-01-08T18:29:33Z","snapshot_observed_at":"2026-07-06T18:22:10.094519Z","submitted_at":"2024-05-29T17:33:34Z","title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19309","snapshot_observed_at":"2026-08-08T22:06:07.649496Z","title":"Sdprlayers: Certifiable backpropagation through polynomial optimization problems in robotics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.649496Z"},"links":{"cited_paper":"/paper/2405.19309","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:9846ba061385b020f6fd6762caf0ae97efda982c085c1e8daed4437f2d029800","observation_id":"d2d08b44-3be8-4bbc-83e9-d7b894350230","resolution":{"observed_at":"2026-08-08T22:06:07.649496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:08.265145Z","title":"Closed-form solution of absolute orientation using unit quaternions","venue":null,"work_id":"359f2717-6a96-4073-909c-5edf0924f80e","year":null},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.654147Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:941b9e850166de247fc598c03d038fa8535aadf375cbdf9d795c3ac29896ce08","observation_id":"c1d41f0b-3785-474a-8af9-0c838a11d514","resolution":{"observed_at":"2026-08-08T22:06:08.270344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.251337Z","title":"Global optimality for point set registration using semidef- inite programming","venue":null,"work_id":"bfadd669-df57-479e-9781-bdfadb23bd1b","year":2020},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.658596Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:e2c410d0c0649786eb30aaefc0f3ffe3b71066b29dc87b04118758cc86d0a233","observation_id":"365cecaf-07bb-4ce8-9b99-ce40ce9dc5c6","resolution":{"observed_at":"2026-08-08T22:06:08.255559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.238104Z","title":"Low-rank optimization on the cone of positive semidefinite matrices","venue":null,"work_id":"d00cc8df-04e9-4527-ae7b-9424faa9322b","year":null},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.663148Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:facb3b64750c9fc2bf49f0432ef930f99c4238baa49e76591ce7adbcdfcb543c","observation_id":"e05ed66c-e813-4827-a02c-eb7d09201630","resolution":{"observed_at":"2026-08-08T22:06:08.242291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-08-08T22:06:07.667683Z","title":"Fast and certifiable trajectory optimiza- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.667683Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:202e2629f85be929a965b64a036fb711c5c6ad71d197d2d80b843f90ec09513b","observation_id":"6e6e74b1-f081-4549-9c56-385ab9b13e3c","resolution":{"observed_at":"2026-08-08T22:06:07.667683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:08.224721Z","title":"3d gaussian splatting for real-time radiance field rendering","venue":null,"work_id":"3b2455b2-6029-46de-be1a-5a115119adcb","year":2023},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.672292Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:0b75eabfe9e1ba53696afb151140ada37ed2423b724c272a69351d9649d1c10d","observation_id":"ed41e287-ff20-4576-b93f-97ceee594a6e","resolution":{"observed_at":"2026-08-08T22:06:08.229343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.210889Z","title":"Object recognition from local scale- invariant features","venue":null,"work_id":"22fbac94-433e-4e27-8577-225887611dd3","year":1999},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.676579Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:d3954c7dc640ddb3c1ffb5ec5d7b7ce97befd351e48cc64bb5cf67d02dad974c","observation_id":"bf42273f-5869-4a03-b753-8569aa275b8e","resolution":{"observed_at":"2026-08-08T22:06:08.215475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.197158Z","title":"Outlier removal using duality","venue":null,"work_id":"9c36f8c0-b8ef-4bb4-a094-28c4d51f05f0","year":2010},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.680788Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:25e7cd07929b734a2f2866238b19104aafccdce2a9eb95df20893ac671f352ef","observation_id":"30ff8e9d-641a-4f96-be56-5997064e8bb7","resolution":{"observed_at":"2026-08-08T22:06:08.201607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.182849Z","title":"Global structure-from-motion revisited","venue":null,"work_id":"28b38751-0162-4a0a-9cf0-0310d1c8ebb3","year":2025},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.685206Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:96659e21189f74c6dbf2ba4a668c6b2730a254c3028f1f56a4c98991bc543181","observation_id":"9a21099c-9598-4432-8698-07f1ea38cd32","resolution":{"observed_at":"2026-08-08T22:06:08.187319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.168226Z","title":"Certifiably correct range-aided slam","venue":null,"work_id":"134cc593-8532-4479-9f92-a74281f9689c","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.689303Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:848f999ad1d1c3a87e8632340620236df6c0290315602197d0f3305b3cf63948","observation_id":"59583b25-585d-43bd-96c3-2feef0308956","resolution":{"observed_at":"2026-08-08T22:06:08.172769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17915","last_updated":"2024-08-20T18:17:30Z","snapshot_observed_at":"2026-07-06T17:51:28.420385Z","submitted_at":"2024-03-26T17:52:23Z","title":"Leveraging Near-Field Lighting for Monocular Depth Estimation from Endoscopy Videos","version":4},"cited_work":{"arxiv_id":"2403.17915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.17915","snapshot_observed_at":"2026-08-08T22:06:07.846565Z","title":"Leveraging Near-Field Lighting for Monocular Depth Estimation from Endoscopy Videos","venue":"cs.CV","work_id":"03d9dbfd-f371-4101-bbcf-3117ce8bb771","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.693658Z"},"links":{"cited_paper":"/paper/2403.17915","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:ddfe3697d749c9bb8aeffc8c96a02dedf2df22129f32539803d492936287c8c6","observation_id":"4a92b5d7-6532-41b5-9ee6-1181c4fd97db","resolution":{"observed_at":"2026-08-08T22:06:07.853852Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.153791Z","title":"Unidepth: Universal monocular metric depth estimation","venue":null,"work_id":"7056f1d9-05b1-4232-88a5-922ce4e11038","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.698531Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:aa77ad3004646e2e840775a5c5fc71bb5f2f42301e60a1da555e65886428168d","observation_id":"7da79674-647a-4ac5-b8b4-dec48c92d181","resolution":{"observed_at":"2026-08-08T22:06:08.158490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.138819Z","title":"Megba: A gpu-based distributed library for large-scale bundle adjustment","venue":null,"work_id":"f91d2b10-d90b-4455-9153-ca20ea0471d8","year":2022},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.702269Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:751d461eaee7786f04f776f63c473a63994e3d6feb6c6e4de48245fb31b1d474","observation_id":"b36a8455-e4e5-4afe-959e-0a44bd060858","resolution":{"observed_at":"2026-08-08T22:06:08.143741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.124671Z","title":"Scalable low-rank semidefinite pro- gramming for certifiably correct machine perception","venue":null,"work_id":"b631186c-8121-42ee-960a-674e06109543","year":2021},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.706250Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:8e1bca94247884d4c342bf3cc2cccee7d8c654268496e07bb231146d6768fd2f","observation_id":"58ddea4a-ed21-4790-96ef-869ec0cd8af6","resolution":{"observed_at":"2026-08-08T22:06:08.129218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.109356Z","title":"Se-sync: A certifiably correct algorithm for synchronization over the special euclidean group","venue":null,"work_id":"cc7ddaf8-1adc-4787-9f83-747f76a125f9","year":2019},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.710157Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:35cbf02cf3536bbc82bac575bc959d22eb4893c325029d06fbec70c8814e2b47","observation_id":"9be2f441-8dc0-4e40-87d4-2e25027a9180","resolution":{"observed_at":"2026-08-08T22:06:08.114615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.095028Z","title":"Structure-from-motion revisited","venue":null,"work_id":"d95e01ea-bac6-4bc5-b5f1-f596bcdad41b","year":2016},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.714023Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:2884d96cd54c6ae5a5dc44de0a32dc889891e2f4c3829c1df586401e828ceee1","observation_id":"d2504c3e-7b84-42e9-a272-6a1b30485455","resolution":{"observed_at":"2026-08-08T22:06:08.099684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.080832Z","title":"Removing outliers using the ℓ∞ norm","venue":null,"work_id":"f6890b3b-fd75-46f3-b9a9-e8653fd1a3c6","year":2006},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.717770Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:67435eaa778c06f9a5190977093153bd87b1112b5ab78041e20a99f16bd4beef","observation_id":"b102adbc-94f1-4ea7-99af-bacd84058fb3","resolution":{"observed_at":"2026-08-08T22:06:08.085208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05797","last_updated":"2019-06-13T16:29:58Z","snapshot_observed_at":"2026-08-01T13:51:16.469557Z","submitted_at":"2019-06-13T16:29:58Z","title":"The Replica Dataset: A Digital Replica of Indoor Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05797","snapshot_observed_at":"2026-08-08T22:06:07.721543Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.721543Z"},"links":{"cited_paper":"/paper/1906.05797","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:c7204a2d78bae92a4f335561521bb827f9e7c46bbfa868103321e4698acf919c","observation_id":"c2ed3a88-6974-4b00-82a3-c47e894bf1b3","resolution":{"observed_at":"2026-08-08T22:06:07.721543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:08.066311Z","title":"Sturm, N","venue":null,"work_id":"a79b85c6-2a6d-4a5d-ba2c-df4d22994924","year":2012},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.726079Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:4de0f39b580a05d4253f8aa946a63c9008487db8d41853c93765a788e6a0019a","observation_id":"841b5db3-5c39-432a-8dbd-c80e2fc92287","resolution":{"observed_at":"2026-08-08T22:06:08.070763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.051141Z","title":"imap: Implicit mapping and positioning in real-time","venue":null,"work_id":"a98033c3-3e11-4bb4-92bb-048b37d146e9","year":2021},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.730812Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:7d5d84eeed5b39a18f08f2d8c19f6630f8ec617b2ac6003586e5a8f13247db98","observation_id":"8e636679-4f92-4757-8801-c19f293aa7fe","resolution":{"observed_at":"2026-08-08T22:06:08.056021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.036334Z","title":"Distributed certifiably correct pose- graph optimization","venue":null,"work_id":"d8099a51-3585-4ace-8733-d0bde5e4a426","year":2021},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.735228Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:5c86aebf9abfbcd008b93e751a930bd303a43aaec6ccc4a0077a3ba47ca0eb80","observation_id":"1613aeb1-1c8a-4b0d-a0be-21da924d17e8","resolution":{"observed_at":"2026-08-08T22:06:08.040438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.022846Z","title":"Handbook of semidefinite programming: theory, algorithms, and applications , volume 27","venue":null,"work_id":"7702a0aa-6942-4ade-a6f8-8a0ee817cfb1","year":2012},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.739353Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:98d8cdfe2ec0ffea53c2de73bbee448aee9a56988bf9266ea5910667f3cddd4e","observation_id":"1c79822a-5b71-4c29-987c-5d8500c2ded1","resolution":{"observed_at":"2026-08-08T22:06:08.027016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.009086Z","title":"Semidefinite optimization and relaxation","venue":null,"work_id":"d451a7e4-afcd-4180-9680-93b49d2c628e","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.743820Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:35fa3fcd7ee842f82e844cd725070373c7be60675d6065ed1858ebe3dbc6ed9b","observation_id":"9855000e-8df4-42fc-966d-a65437cf1e81","resolution":{"observed_at":"2026-08-08T22:06:08.013102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:07.993483Z","title":"Certifiably optimal outlier- robust geometric perception: Semidefinite relaxations and scalable global optimization","venue":null,"work_id":"1d41d2ba-6f60-411f-9e8f-260419c7976d","year":2022},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.747989Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:7040b7bc7a07b1d62a3e118f91c1a0613c6ae67e32027a406420bd8022cc41aa","observation_id":"2b219e3c-7c07-499a-b088-b91438153cb5","resolution":{"observed_at":"2026-08-08T22:06:07.998573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:07.978070Z","title":"Teaser: Fast and certifiable point cloud registration","venue":null,"work_id":"369b3f76-8ffc-4e25-9d94-c7060ec77579","year":2020},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.752404Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:c342803c3e24584191f8ed1ea36cb213019f70bcecce0898b3a4d288d48aebb4","observation_id":"539de017-bdee-4abd-9428-2dafc79b2d98","resolution":{"observed_at":"2026-08-08T22:06:07.982991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:07.756893Z","title":"Depth anything: Unleashing the power of large-scale unlabeled data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.756893Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:6fb52240a992122a497ec87499f3a300aaaf5a6d2afe6aa31f5a46b307eea784","observation_id":"7f6860a7-7deb-448e-96ba-1beaf54720b9","resolution":{"observed_at":"2026-08-08T22:06:07.756893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09414","last_updated":"2024-10-20T11:24:09Z","snapshot_observed_at":"2026-07-06T18:30:32.982860Z","submitted_at":"2024-06-13T17:59:56Z","title":"Depth Anything V2","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09414","snapshot_observed_at":"2026-08-08T22:06:07.761725Z","title":"Depth anything v2","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.761725Z"},"links":{"cited_paper":"/paper/2406.09414","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:b701a4821202e1682487df0fef0065b3cdfa66f3ab87aeabfd6f6568b7bd76b9","observation_id":"1eb6338d-e7d9-4892-a463-2c302a944b1a","resolution":{"observed_at":"2026-08-08T22:06:07.761725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:06:07.954024Z","title":"Metric3D: A toolbox for zero-shot metric depth estimation","venue":null,"work_id":"d799bffd-9d3e-4053-8cf5-065691134def","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.766613Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:4bfe1c71386c8496233ab4afda68d0b614cbd6c6e8f20680f31862417575b27f","observation_id":"ff2053ad-fcb2-48fd-9315-4a8aa1ef83f8","resolution":{"observed_at":"2026-08-08T22:06:07.958725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:07.938939Z","title":"Sim-sync: From certifiably optimal synchronization over the 3d similarity group to scene reconstruction with learned depth","venue":null,"work_id":"8b38a1b0-d150-43cc-b660-8aa0e4ff1bb7","year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.770957Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:8c922052455c00ccb04a7eb47f503dda51a068a5c9ada9dda009a27f67cd5f67","observation_id":"0cb8be30-f2a5-4114-8546-8b5f4ae7f809","resolution":{"observed_at":"2026-08-08T22:06:07.944043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:07.923310Z","title":"Nice-slam: Neural implicit scalable encoding for slam","venue":null,"work_id":"525b15e8-6432-4bba-92ce-9ebd3390171c","year":2022},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.775625Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:e10fe869810a1e94537c8a0c941cac7aac5712a06a40d44f6aab2a499492108d","observation_id":"1f909e26-ffd3-4328-b345-76f4d1aec773","resolution":{"observed_at":"2026-08-08T22:06:07.928165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T22:06:08.353420Z","title":null,"venue":null,"work_id":"987c6081-98ee-4204-b401-f3c16dca5e5e","year":null},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.617039Z"},"links":{"citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:94235f9ed58aa923eaa0cd1cebb7388726808e73a4c0ebe7c17e0d26b3322dd7","observation_id":"729fe420-1179-42e1-8c29-b686f3776b11","resolution":{"observed_at":"2026-08-08T22:06:08.358222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","latest_version":4,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":54},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 4 inbound Pith citation observations for arXiv:2502.04640."}