{"as_of":"2026-08-09T18:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac89f76d2793fc4ee352cc7fb2bd91fcc431b5c310bf28e5653cf13d23f442bd","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T23:24:11.495687Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2605.07607/citation-record","integrity":"/paper/2605.07607/integrity","json":"/paper/2605.07607/citation-record.json","paper":"/paper/2605.07607"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.03877","last_updated":"2025-02-06T08:48:34Z","snapshot_observed_at":"2026-08-09T00:22:16.779632Z","submitted_at":"2025-02-06T08:48:34Z","title":"Advanced Object Detection and Pose Estimation with Hybrid Task Cascade and High-Resolution Networks","version":1},"cited_work":{"arxiv_id":"2502.03877","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03877","snapshot_observed_at":"2026-06-30T23:25:07.124783Z","title":"Predator: Registration of 3d point clouds with low overlap","venue":null,"work_id":"86bcf992-bc05-4cb8-9643-91b2d8cae25f","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"cited_paper":"/paper/2502.03877","citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:b9b534a3fdd80bf5f7aab4300222336766e2224c84d68b5903194f4ea184f5db","observation_id":"9e2a5850-55dd-4c04-98d7-9ba881e01216","resolution":{"observed_at":"2026-06-30T23:25:07.126656Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.689275Z","title":"R., Talib, M","venue":null,"work_id":"2bafd568-89b5-4cc6-9ea0-536575a2e046","year":2015},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:940879424832c1caef00674d0f822e6f781df6a2121776748a8ba0630d64a9d4","observation_id":"dede2983-86d9-45c2-896c-d66545d523da","resolution":{"observed_at":"2026-07-07T11:13:41.690571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.15392","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T23:25:07.128082Z","title":"Ef-3dgs: Event-aided free-trajectory 3d gaussian splatting.arXiv preprint arXiv:2410.15392","venue":null,"work_id":"67d1b7b9-4f43-4337-8f36-cdf7db139001","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:d17e9fb264189f7af29da901ca83a50855d2734b6c11c04b8b2190fa36de5ac2","observation_id":"9b1f226f-3548-4a86-8966-0611123f2a94","resolution":{"observed_at":"2026-06-30T23:25:07.129969Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.10160","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T23:25:07.134371Z","title":"Safire: Saccade-fixation reiteration with mamba for referring image segmentation.arXiv preprint arXiv:2510.10160","venue":null,"work_id":"9c1e30d9-ffec-4680-8fa9-209045fdff37","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:1fb8ac6db72fe8e0b1af9784cc702a9235eacb350b659e5240f4f7499e5caf07","observation_id":"ddf41c80-be00-4888-ac65-524f581b7642","resolution":{"observed_at":"2026-06-30T23:25:07.136476Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.691179Z","title":"Real time localization and 3d reconstruction","venue":null,"work_id":"a2cf1fa8-1bdd-47a9-bd82-294f62766d34","year":2006},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:0b1d2d55f9179a8a2ae59b2b79f534e8f6cb97ae245a318e6af3bfab76d77dc5","observation_id":"d0bf623a-f6ef-4f9a-a55d-64ab829b4802","resolution":{"observed_at":"2026-07-07T11:13:41.692344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.684555Z","title":"Purify then guide: A bi-directional bridge network for open-vocabulary semantic segmentation.IEEE Trans- actions on Circuits and Systems for Video Technology, 2024a","venue":null,"work_id":"2a6759a2-6b0e-48b2-9a29-4c4e8e47d188","year":2031},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:c174d1aba63348f0b0586492efe980be17df501be9633107ad84d08a99c8864d","observation_id":"6a6291c1-901d-410a-89ee-f3a8d07f9c52","resolution":{"observed_at":"2026-07-07T11:13:41.686002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.686551Z","title":"Impact of similarity measures on web-page clustering","venue":null,"work_id":"2eb17a99-7502-4c09-9cd8-2d46f3f4abfc","year":2000},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:1d07d18b4567a4ae99b143f99d386375aa439259da8ad05acda80f116a5434f1","observation_id":"399e2473-3d51-4d75-9460-a4e2cebee791","resolution":{"observed_at":"2026-07-07T11:13:41.688643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.26260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T23:25:07.131436Z","title":"Geoguide: Hierarchi- cal geometric guidance for open-vocabulary 3d semantic segmentation.arXiv preprint arXiv:2603.26260","venue":null,"work_id":"5c693058-7784-4e58-9386-8836cd184336","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:9113ab20b5dc772bbd7ed85fe8ccf83de43fe4c6cb102b608d9f71ec59125de1","observation_id":"fab3fe3a-494f-4c2b-9e5a-7bc750f9b5f9","resolution":{"observed_at":"2026-06-30T23:25:07.133251Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.21541","last_updated":"2025-07-30T06:48:41Z","snapshot_observed_at":"2026-08-06T22:21:13.261667Z","submitted_at":"2025-06-26T17:58:05Z","title":"StruMamba3D: Exploring Structural Mamba for Self-supervised Point Cloud Representation Learning","version":3},"cited_work":{"arxiv_id":"2506.21541","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.21541","snapshot_observed_at":"2026-06-30T23:25:07.137424Z","title":"Long-short range adaptive transformer with dynamic sampling for 3d object detection.IEEE Transactions on Circuits and Systems for Video Technology, 33(12): 7616–7629, 2023a","venue":null,"work_id":"38083482-2886-4dcd-aaad-a332a2c656ef","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"cited_paper":"/paper/2506.21541","citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:adabf03909831793d127004ccddf21104f8aa2a8fb6847b0cd596e5f8763f88d","observation_id":"2adc82a9-78e6-4fc2-8811-7c685bb9ba2d","resolution":{"observed_at":"2026-06-30T23:25:07.139197Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v36i8.20839","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Wang, Z., Pan, T., Zhou, Q., and Wang, J","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"5fdff000-5f1e-4166-bf28-d8e948d87040","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:ba4f3c5f17b15aa7088b484b23e4a4b205470b6e8391177a1aa51243d59f6e14","observation_id":"87f77998-73d0-4f1b-acc0-184fc3a07bc1","resolution":{"observed_at":"2026-06-30T23:25:06.575349Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15284","last_updated":"2025-03-19T15:03:41Z","snapshot_observed_at":"2026-08-07T16:51:46.290861Z","submitted_at":"2025-03-19T15:03:41Z","title":"EdgeRegNet: Edge Feature-based Multimodal Registration Network between Images and LiDAR Point Clouds","version":1},"cited_work":{"arxiv_id":"2503.15284","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15284","snapshot_observed_at":"2026-06-30T23:25:07.134507Z","title":"Edgeregnet: Edge feature-based multimodal reg- istration network between images and lidar point clouds","venue":null,"work_id":"b0caeaef-2798-4353-9a52-e5a7cf5c3410","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"cited_paper":"/paper/2503.15284","citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:f891716621981ec9275ea4c83b9726491dc0b2ca2fd0c8439142cd4ccbea4d73","observation_id":"e80d6e65-8e2a-4552-b4aa-b4b4ef3c43eb","resolution":{"observed_at":"2026-06-30T23:25:07.136185Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.21957","last_updated":"2025-06-27T06:58:59Z","snapshot_observed_at":"2026-08-06T22:12:20.865909Z","submitted_at":"2025-06-27T06:58:59Z","title":"Exploring Semantic Masked Autoencoder for Self-supervised Point Cloud Understanding","version":1},"cited_work":{"arxiv_id":"2506.21957","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.21957","snapshot_observed_at":"2026-06-30T23:25:07.140371Z","title":"Exploring semantic masked autoencoder for self-supervised point cloud understanding.arXiv preprint arXiv:2506.21957, 2025a","venue":null,"work_id":"e68a2c7a-70f1-49d8-8e16-2175779abf0a","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"cited_paper":"/paper/2506.21957","citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:9c6cf53b987da081987d8a9616a3ce96a3ac2a5e9972757ba2269e5dd78280a7","observation_id":"5726b0d4-86ee-473b-986e-0c3f17a040b9","resolution":{"observed_at":"2026-06-30T23:25:07.141993Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.680991Z","title":"It is particularly effective for visualizing high- dimensional datasets by embedding them into two or three dimensions","venue":null,"work_id":"16a50a3b-2b11-4816-ba3c-1470d82a541b","year":2016},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:da03f354e13308ec976a298c7792d51bc0d10f211362f49a509014d437a0c243","observation_id":"7d59a78e-8607-48f6-a1d5-e9d90efa24f1","resolution":{"observed_at":"2026-07-07T11:13:41.682247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.682865Z","title":", sin(2L−1x),cos(2 L−1x) , (20) where L is the length of the embedding","venue":null,"work_id":"4c40a24a-7aae-4918-94de-dbf505a710e3","year":2021},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:87ec6e158b4daf23cc4e2906a51e2843e186801b90a85ec37c64ed5dd16827c0","observation_id":"04ec2c03-05d2-4d8e-8645-b452858d09f3","resolution":{"observed_at":"2026-07-07T11:13:41.683972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.694579Z","title":"The margins are set to∆ p = 0.1and∆ n = 1.4","venue":null,"work_id":"8d5ef4dd-d8ad-4292-a4e0-f0e2a1e5b850","year":2023},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:6a421e2f58d49418fba38cefb331df8200a97ec59022b768799aecdaa0dd09f7","observation_id":"00f9ae95-1e8a-4472-b444-5e5ca2bf0ef8","resolution":{"observed_at":"2026-07-07T11:13:41.695656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-07T11:13:41.692978Z","title":null,"venue":null,"work_id":"1ee61a95-6530-4c5a-a0d9-92888ace6778","year":2023},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:3a9cf56565af44b40d05ff9e5e824cde094cc487d616e26039db3b66e2e14bab","observation_id":"e6cac533-d2eb-4b19-aaba-7915f587a6c2","resolution":{"observed_at":"2026-07-07T11:13:41.694009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5024.3331","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T23:25:07.143110Z","title":null,"venue":null,"work_id":"d3812cc6-9182-41c2-bf22-9bd029517460","year":null},"citing_paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T23:24:11.495687Z"},"links":{"citing_paper":"/paper/2605.07607"},"observation_digest":"sha256:8f9312008345b76144d1628c6188635ab5e69308fe2ae31e28375da9454e0953","observation_id":"737a8daa-74e7-417c-817f-eb12c6c1b8fb","resolution":{"observed_at":"2026-06-30T23:25:07.144604Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.07607","last_updated":"2026-05-25T08:27:02Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-02T22:34:00.184502Z","submitted_at":"2026-05-08T11:33:18Z","title":"FS-I2P:A Hierarchical Focus-Sweep Registration Network with Dynamically Allocated Depth"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":8,"verified_fuzzy":7},"total_outbound_references":17},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2605.07607."}