{"as_of":"2026-08-10T03:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a24fd38c2a75dddd1b04874e71d8b88429408252c4545941ac00238fd7162a1","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T06:40:25.476082Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"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.30583/citation-record","integrity":"/paper/2605.30583/integrity","json":"/paper/2605.30583/citation-record.json","paper":"/paper/2605.30583"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Bundle Adjustment in the Large","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:906f13abc85aade607a634f1f9e59d3e3a0533bf59a7b2e6ea48579bfdbd9b93","observation_id":"3d0eb115-3446-4b67-b2f9-52f171a84bdc","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Building Rome in a day","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:52e12319dd6474b1255b6a735fa76c80df603cf33b78b7dc5b3aa1857e802e08","observation_id":"03316d4a-0fb2-4832-8deb-540d6a32ef57","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Cambridge University Press, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:4da0dcaa1c81d3aba5eccaf3178609a7c23e3c754218e1e25a64f64851fbf49b","observation_id":"36a80943-1804-4d20-bd14-a68588bb91ac","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Past, Present, and Future of Simulta- neous Localization and Mapping: Toward the Robust- Perception Age","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:c3ae454214a7ea8391044334569af627fddb49004a27455ed1ed1770e9271e4f","observation_id":"4d25dd1d-d528-485a-b761-4d27faff7008","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:e6ced299462810e4453d7bc0f752cd49aae2a1c9828f71f416e79b90ca296c85","observation_id":"ea368ee9-d196-4461-ba39-0d49dd7394a0","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:31efea2cb9a366399928277ea0e45b1bd3c2aa493086974f53f081a51c9b45b1","observation_id":"a52a57ee-6f1e-4f62-864a-517f5ef8c320","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"DeepLM: Large-scale Nonlinear Least Squares on Deep Learning Frameworks using Stochastic Domain Decomposition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:e6f32129f236c1824e8298a3c72ec0c2651a819fc93c1ff453139d0e5865d294","observation_id":"903acc60-ae97-4ab4-a633-cb18e53cce30","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"g2o: A Gen- eral Framework for Graph Optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:5224193932b140e89c1c92b129cba01852492aa28beb19c59290730032e793a2","observation_id":"f33bface-aeca-4518-ac80-b4cd2bad543a","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:65a16c1cf9a28dafe2fb7e11562b431dd6209b0eb313298046d3d03c15987287","observation_id":"9df8334d-0ca7-4fb5-86c2-852c9fb92b21","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Cambridge University Press, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:0240f1cea5ba7670c0d2c89757014fe766ce5a7071501ca5bad7ea0472505a84","observation_id":"91ceaa2a-65c2-4a02-8338-7e9e00cde588","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Madsen, H.B","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:96dc702cb3eeadee1a8e61691a7641a470a32ba09c95f8bf0de873a3b3223106","observation_id":"55a00bf9-e650-47bd-b941-e1cd04753b4b","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:f85058be6eb9340b63197d21a7d4be4d37ac5f1deadd3db616a358afb2f697e9","observation_id":"c70fb3da-a781-4de4-a5e2-958e062977f1","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Combining Register Allocation and Instruction Scheduling (Technical Summary)","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:44d7580eb4eaa1d070a190e990e47c9f9094b09350bde94db8a30b4c8dde0694","observation_id":"15b8498f-22a1-4b17-9608-6e95a69f0b56","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:9f354a0c0fb9b09b00f8c434cc42830d4bd92ae19cf668212199c4c82cc322ab","observation_id":"c2b8a708-20ba-4dce-934b-8f27aeedfc3b","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:ac2534c0ee3650d2ba1a362d9b1776dda9d4a29c0b172713c0880d570d27719b","observation_id":"fc03e00b-2650-4d49-9bf2-5cc10fa678b6","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:a357e83b2ca93cac0e7f2de9770055fb365c4764d99e3f88f4b2d4cfd2800b5e","observation_id":"502f9335-a5b3-4d56-afd5-d6a201be6fa9","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Associative Instruction Reordering to Alleviate Register Pressure","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:178bacee786c1b0373bfd34632aa9d7fade55eb4e20d0f0827d450fccad85bd9","observation_id":"76600d38-67dd-4cf5-84df-a7d8e3842bfa","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.01349","last_updated":"2022-08-02T09:20:34Z","snapshot_observed_at":"2026-07-06T12:14:43.041337Z","submitted_at":"2021-12-02T15:50:18Z","title":"MegBA: A GPU-Based Distributed Library for Large-Scale Bundle Adjustment","version":3},"cited_work":{"arxiv_id":"2112.01349","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.01349","snapshot_observed_at":"2026-06-29T06:43:10.484829Z","title":null,"venue":null,"work_id":"cce2a065-3639-41de-aef8-298ae46d9732","year":2022},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"cited_paper":"/paper/2112.01349","citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:d8e1a7928cdad8f0bf1d38ae23e7b1b52bdd87c21cedbcbb2b1c4ba9af76ad4d","observation_id":"ce279f67-4267-45ed-8b56-f7e4138d3c7b","resolution":{"observed_at":"2026-06-29T06:43:10.486281Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:3a40a88ec175b9c3a32d33b00a5d6049c397121239fc4a1f041da48b78bbc6c2","observation_id":"5b1e6c7d-9681-446a-b615-97c6ca083818","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:1327c7c36d3cfa7aff0576dba8ba54f192c11741495a4a7fb2d830b573abfd0f","observation_id":"8f335724-44e4-4678-9f52-9db572790348","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:47436cee22ec8decc41b3d1421067ed8101bd52d21b0a642fbbc65f6ededd918","observation_id":"be6c058f-51a9-4f12-9953-a46991a048e2","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Bundle Adjustment—A Modern Synthesis","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:1d0fbd31361bc430a5082c4828f3b0f0a83d2ddf91d538232686dbb76fe320d9","observation_id":"f5c6f8d6-0f2f-4d87-97f1-104daa29983c","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T06:40:25.476082Z","title":"Multicore Bundle Adjustment","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T06:40:25.476082Z"},"links":{"citing_paper":"/paper/2605.30583"},"observation_digest":"sha256:49a2119a7cc57a7e26606291242d7d9dd77defa14ad65cb49e69ec3cc83a7c2b","observation_id":"227523e7-fad8-49f2-a117-0d0a6c7c3ad3","resolution":{"observed_at":"2026-06-29T06:40:25.476082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.30583","last_updated":"2026-05-28T21:18:59Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T21:18:59Z","title":"Caspar: CUDA Accelerator for Symbolic Programming with Adaptive Reordering"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":23},"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 10 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2605.30583."}