{"as_of":"2026-08-21T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:01fc1691dff16a6e8d57240f05276c8e0055803f5775ae0b3223fe1c231159cd","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:33:31.043589Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2502.06477/citation-record","integrity":"/paper/2502.06477/integrity","json":"/paper/2502.06477/citation-record.json","paper":"/paper/2502.06477"},"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-08T15:33:31.753599Z","title":"Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs","venue":null,"work_id":"b6258e6c-2d12-4efb-a110-eaac4d822bb8","year":2022},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.880271Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:98eb10d3fdb2f3f60683a3acfcdbf728f40e796e95e45ec497f68419027a4c22","observation_id":"adb0b7b0-729f-428f-b45e-8f75071a53ac","resolution":{"observed_at":"2026-08-08T15:33:31.861205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16089","last_updated":"2025-03-28T12:06:57Z","snapshot_observed_at":"2026-08-16T12:48:17.770254Z","submitted_at":"2025-03-20T12:30:34Z","title":"Query-Efficient Fixpoints of $\\ell_p$-Contractions","version":2},"cited_work":{"arxiv_id":"2503.16089","doi":"10.48550/arxiv.2503.16089","metadata_source":"pith","pith_arxiv_id":"2503.16089","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Query-Efficient Fixpoints of $\\ell_p$-Contractions","venue":"cs.CC","work_id":"b2e9241e-4278-45ae-9e15-a28a9474e646","year":2025},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.920361Z"},"links":{"cited_paper":"/paper/2503.16089","citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:ff89faf99571b7a80b433434eb6dec1fac0c5d68b88db839352911c07644e6b9","observation_id":"20182e41-8887-4a61-98d7-1add4973f7cb","resolution":{"observed_at":"2026-08-08T15:33:31.235180Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-19135-0_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"26 Thomas Webster","venue":"Lecture notes in computer science","work_id":"0b784959-dfac-4ed3-8788-ab9c8dbb49ea","year":null},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:31.009833Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:22f9223f1f23ee768aadc94360b5219e4a48ec54bf916aa57d4db0d761270c35","observation_id":"94031867-2049-4e1b-8bd6-3748f765d614","resolution":{"observed_at":"2026-08-08T15:33:31.104010Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01004","last_updated":"2023-10-02T09:01:14Z","snapshot_observed_at":"2026-08-16T14:55:57.592648Z","submitted_at":"2023-10-02T09:01:14Z","title":"The Recursive Arrival Problem","version":1},"cited_work":{"arxiv_id":"2310.01004","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.01004","snapshot_observed_at":"2026-08-08T15:33:31.658100Z","title":"The Recursive Arrival Problem","venue":"cs.CC","work_id":"801dc188-7676-4de5-9659-2a348ee19fd4","year":2023},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:31.043589Z"},"links":{"cited_paper":"/paper/2310.01004","citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:25ce8823d50f77b386c5bd61c8538fcf87c565d1cc03e3e6d1c4ad7a2b0b2940","observation_id":"a257186a-725f-4f9a-b98e-700ebb55f8e1","resolution":{"observed_at":"2026-08-08T15:33:31.663820Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11784-009-0128-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Computational complexity of fixed points.Journal of Fixed Point Theory and Applications, 6(2):249–283, December 2009.doi:10.1007/s11784-009-0128-3","venue":"Journal of Fixed Point Theory and Applications","work_id":"9f6d86df-d3b1-497c-8542-26728b35b564","year":2009},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":1013,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.982920Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:249bd9940fee7f55a2a13b58cea61c6679de547656e2c29ed7690dc56f63d62d","observation_id":"3151e4b8-5cb8-4004-9c0b-8281549bd85e","resolution":{"observed_at":"2026-08-08T15:33:31.118185Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.10107","last_updated":"2025-03-27T11:06:35Z","snapshot_observed_at":"2026-08-12T19:55:57.631184Z","submitted_at":"2024-11-15T11:07:05Z","title":"Monotone Contractions","version":2},"cited_work":{"arxiv_id":"2411.10107","doi":"10.48550/arxiv.2411.10107","metadata_source":"pith","pith_arxiv_id":"2411.10107","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Monotone Contractions","venue":"cs.CC","work_id":"bf8dda9a-a6d5-4004-9a28-cb12e0be85cc","year":2024},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":1922,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.893190Z"},"links":{"cited_paper":"/paper/2411.10107","citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:ed5fa0c192eb21a3a0978190f911383eed35c739154fe23ad8cff4cff48624cb","observation_id":"1536dc57-9e67-4e6f-8ebb-aed9737d1f76","resolution":{"observed_at":"2026-08-08T15:33:31.495476Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:33:30.947021Z","title":"18 ARRIVAL: Recursive Framework & ℓ1-Contraction 23 K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.947021Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:86abdd63901b7dcfb57ce219dece3bc9882561d20955ab64832d8d51c3d3b6ca","observation_id":"f5015a9a-12ea-4bcb-b352-5caed5b5e0e0","resolution":{"observed_at":"2026-08-08T15:33:30.947021Z","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":"10.1007/978-3-319-44479-6_14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"12 Kousha Etessami, Christos Papadimitriou, Aviad Rubinstein, and Mihalis Yannakakis","venue":null,"work_id":"eed1b05d-db61-4c5c-883c-5e35502a258d","year":null},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.903374Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:0205e7b99dc39d0241a27e2da5bcc5ca907321bbd1695a069546cb760a476872","observation_id":"22432742-8b5a-4c94-b82c-46f7890730e0","resolution":{"observed_at":"2026-08-08T15:33:31.480554Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2018.60","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"16 Bernd Gärtner, Sebastian Haslebacher, and Hung P","venue":"arXiv (Cornell University)","work_id":"1c99f7a4-ae9f-4036-a914-c968e00f5f8a","year":2018},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.910144Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:3cf904b82f19243a79dcacf118aa46ddeb895b2126f17814182edf8c92ddf6fb","observation_id":"6fbb9d90-87ae-4f8c-9a24-2e22d932e57a","resolution":{"observed_at":"2026-08-08T15:33:31.362300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2020.18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"13 John Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani","venue":"arXiv (Cornell University)","work_id":"35ec974b-c291-4db4-9cd8-2ec4e7f097bc","year":2020},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.906809Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:6d0afac93448d0f07e5e5fa2a3a4439862e7024636450fcd6ed52f015fe0161d","observation_id":"0c8469af-200d-4e2c-9070-02d8b083b30b","resolution":{"observed_at":"2026-08-08T15:33:31.373942Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2021.69","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi:10.4230/LIPIcs.ICALP.2021.69","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"3dbd8db8-a95a-4f6b-8bb1-59e8f4c0036d","year":2021},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.913681Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:ad95240bea863f0d3316661a0b87b1438a5824a190dbce815ab70299e8f949ce","observation_id":"5c4fee72-00c9-4187-b127-c4cdb29f028e","resolution":{"observed_at":"2026-08-08T15:33:31.310622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2022.12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"2 David Auger, Pierre Coucheney, Loric Duhazé, and Kossi Roland Etse","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"1e17cb69-d0dc-4b68-8e2c-dc8c3027d989","year":2022},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.884936Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:42f657622d8559b807c7f9ade25a85e829c905f1e6c9d34f8d51dc423fa65c66","observation_id":"08946c75-eacb-4c7d-9b17-1790c1d23d7e","resolution":{"observed_at":"2026-08-08T15:33:31.647254Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-45286-4_14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"3 David Auger, Pierre Coucheney, and Yann Strozecki","venue":"Lecture notes in computer science","work_id":"4f2e8a35-0706-4494-932d-beefff09b666","year":null},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.888959Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:2220b2f1fcbae7dd42d61c4aa45ff82a51385df0532ee15d05b821e3db92d803","observation_id":"e11e170e-3370-4692-ada8-dbc589ce263a","resolution":{"observed_at":"2026-08-08T15:33:31.543689Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T15:33:30.897825Z","title":"doi:10.1145/3618260.3649623","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.897825Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:3f71e5d0dc5495896a807539f032df96ac006b4e40f5275e2b70077f3e9da2ee","observation_id":"8a338a72-8d64-4cc9-80cd-67af59be2e33","resolution":{"observed_at":"2026-08-08T15:33:30.897825Z","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":"10.4230/lipics.stacs.2025.39","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"18 Sebastian Haslebacher, Jonas Lill, Patrick Schnider, and Simon Weber","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"71653b03-56df-4ff2-909d-6b0c882b1a6d","year":2025},"citing_paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T15:33:30.916839Z"},"links":{"citing_paper":"/paper/2502.06477"},"observation_digest":"sha256:88f32e5490a05bcee0a1b30d722ad44d7b3ed1a9fcc4dfe73ef4d74dcf572aea","observation_id":"760cf0d7-d332-41d7-ae1a-65c0654bd51d","resolution":{"observed_at":"2026-08-08T15:33:31.249036Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.06477","last_updated":"2025-07-03T11:46:26Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T22:28:44.195466Z","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":10,"verified_fuzzy":1},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2502.06477."}