{"as_of":"2026-08-21T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a0ec0c2aab5b1628602ee7bca4755707e220a2a0d572f334040a08501222086","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:38:25.373697Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"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/2504.17955/citation-record","integrity":"/paper/2504.17955/integrity","json":"/paper/2504.17955/citation-record.json","paper":"/paper/2504.17955"},"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-16T10:38:27.443003Z","title":"The freeze-tag problem: how to wake up a swarm of robots","venue":null,"work_id":"b5a920cb-7cd2-41d2-b2fa-777c535b3f34","year":2006},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.638465Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:1e4393bec64b7ce7052fc8592adb7946089e802036f304a1bda9a9083907327f","observation_id":"603fee24-c251-44e5-b380-1fcdcb6776ac","resolution":{"observed_at":"2026-08-16T10:38:27.446742Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:24.643319Z","title":"Arkin, Michael A","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.643319Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:cd000762328e514a3d4c73b95368fb612aaa1995d5671013e46f498e5db1cdb0","observation_id":"84e4ea6a-fff2-43b5-bcb7-256d97203aa5","resolution":{"observed_at":"2026-08-16T10:38:24.643319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03258","last_updated":"2024-02-05T18:15:50Z","snapshot_observed_at":"2026-08-18T06:18:26.471511Z","submitted_at":"2024-02-05T18:15:50Z","title":"Freeze-Tag in $L_1$ has Wake-up Time Five","version":1},"cited_work":{"arxiv_id":"2402.03258","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.03258","snapshot_observed_at":"2026-08-16T10:38:26.070170Z","title":"Freeze-Tag in $L_1$ has Wake-up Time Five","venue":"cs.DS","work_id":"2386e0b8-e89d-44a2-8473-c55ccd15f84d","year":2024},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.647527Z"},"links":{"cited_paper":"/paper/2402.03258","citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:20763c63e2272d5ec331d24a6a1c51e8c4b165fa2575b439c7c3a5325b4024ce","observation_id":"df7d5e09-a367-4a12-b3f8-eef45a286b89","resolution":{"observed_at":"2026-08-16T10:38:26.074311Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:27.365296Z","title":"Euclidean freeze-tag problem on plane","venue":null,"work_id":"1d18ef09-214f-4201-ae11-826d1495c4e2","year":2024},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.652067Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:dce6ff03c8d8ea88023e11d3dbd14d497c5456eea69e6d851a0d1fb3b8e11301","observation_id":"08b45334-5dcf-4fb2-935a-a926efd3dce9","resolution":{"observed_at":"2026-08-16T10:38:27.434558Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:27.282704Z","title":"The approximation ratio of the greedy algorithm for the metric traveling salesman problem","venue":null,"work_id":"7444d744-f4d1-4219-b0a3-a0892c862c46","year":2015},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.656134Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:f24f754f77ced555669e70cf709e97f1f3c6e38df3812c36214a3dc3a5aec244","observation_id":"e5e83d8c-9be3-47f3-9f16-239ca414eae9","resolution":{"observed_at":"2026-08-16T10:38:27.287802Z","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":null,"cited_work":{"arxiv_id":"stable/2235930","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.999144Z","title":"The detection of defective members of large populations","venue":null,"work_id":"b6eae76c-a7a7-4530-a0b8-815bd8f1cf6f","year":1943},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.660564Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:04be185cdf9daec3b4f5827ed667aa0f399bcdfce997163ccddcf3365afd947f","observation_id":"8c9cd570-8379-462b-92f9-10f1c6f9937a","resolution":{"observed_at":"2026-08-16T10:38:26.057046Z","resolver_source":"raw_fallback","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.1142/4252","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.608759Z","title":"World Scientific, 2nd edition, 2000.doi:10.1142/4252","venue":null,"work_id":"a89f82e9-56f9-477c-92a7-6b1791d6a150","year":2000},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.699685Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:71c9fb8e10fed2ec07183315a41d889d43894797d8b8370b531bdba9b7846f5b","observation_id":"06a12745-a504-44cb-85cd-c9d59add6144","resolution":{"observed_at":"2026-08-16T10:38:25.630634Z","resolver_source":"doi_truncated","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:27.139934Z","title":"Multi-stage group testing improves efficiency of large-scale COVID-19 screening","venue":null,"work_id":"5af59b92-ec02-4cbf-8b28-b8174bdf5ee1","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.785558Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:c6df8b96408816043e520acbc7d7574b2b8db145e8344eaf2f185079c68ec24e","observation_id":"6f2b2d2d-01fe-4474-beb5-0a625beeee1c","resolution":{"observed_at":"2026-08-16T10:38:27.258491Z","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050631847","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.596226Z","title":"Improved combinatorial group testing algorithms for real-world problem sizes","venue":null,"work_id":"120be5c6-1568-48f2-ad3d-c17e3e54cf91","year":2007},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.969219Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:3169c513da5e0c274c6bc833b69e454940d18cef4ecfbb66f782141379054418","observation_id":"40173d79-2646-4639-a360-ebd9b5591a40","resolution":{"observed_at":"2026-08-16T10:38:25.600570Z","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/s10878-007-9087-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-19T11:03:45.297681Z","title":"Im- proved adaptive group testing algorithms with appli- cations to multiple access channels and dead sensor diagnosis","venue":"Journal of Combinatorial Optimization","work_id":"96bcd68e-4872-45f7-aaf7-7305c0fc84c0","year":2008},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.973118Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:d3495eea49ee56142048c80138cbccdd70c34ac3c81455e0015311f363e6691b","observation_id":"3b0d1394-19d1-463b-ab6c-37132f4f4571","resolution":{"observed_at":"2026-08-16T10:38:25.587812Z","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/11682462_53","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"The online freeze-tag problem","venue":"Lecture notes in computer science","work_id":"e7861c39-b3a1-4d2d-972e-aca6e21b572e","year":2006},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.978104Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:403c826c33ca1e7fc601ec0e16be07e772e610a627f3ccac3b112250daae3c9d","observation_id":"c03b5e17-08c0-4dd1-bf30-b93ab190df1a","resolution":{"observed_at":"2026-08-16T10:38:25.480222Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:27.101431Z","title":"Localization algorithms of wireless sensor networks: a survey.Telecommuni- cation Systems, 52:2419–2436, 2013","venue":null,"work_id":"f215b1cd-25a5-43c4-9fd9-570060f4ab1e","year":2013},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.982496Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:ea012f0b55cdeef4c29a7dcbb669cb13af036dc1fea321c63c807a90fd2f6915","observation_id":"4cf7fbec-28ad-4cd2-af0d-a286b99c952d","resolution":{"observed_at":"2026-08-16T10:38:27.107617Z","resolver_source":"raw_fallback","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:27.036064Z","title":"On the nearest neighbor rule for the metric traveling salesman prob- lem","venue":null,"work_id":"aa925388-0027-4ba8-93a0-17c2998f8ee0","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.986351Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:8593e6063f0b6fd665624c1c1380c66f21103f0e730ca233a6b67fda534ee28a","observation_id":"cc43f99a-9bc5-49f9-9752-4cd9280b7f38","resolution":{"observed_at":"2026-08-16T10:38:27.094248Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.944854Z","title":"CenWits: a sensor-based loosely coupled search and rescue system using witnesses","venue":null,"work_id":"7af3cf44-8da7-4560-9650-fdf87c4827d5","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.146505Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:7d10e687f4969823f6e59a09f2ba19f63f89e83777be7481671f55de062becb3","observation_id":"8069647c-a83e-4951-afa0-c8e4d5753fa4","resolution":{"observed_at":"2026-08-16T10:38:26.949036Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.156920Z","title":"The number of circles covering a set","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.156920Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:1a7fe22536d39fde9078dec967086fa21e5f2fa3b3e14d52635c2a997949d697","observation_id":"f1e5025f-545e-4ba5-91a4-568daf0c2930","resolution":{"observed_at":"2026-08-16T10:38:25.156920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12418","last_updated":"2020-03-27T13:57:17Z","snapshot_observed_at":"2026-08-09T00:57:47.180359Z","submitted_at":"2020-03-27T13:57:17Z","title":"Efficient description of many-body systems with Matrix Product Density Operators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12418","snapshot_observed_at":"2026-08-16T10:38:25.162516Z","title":"Martinson and F","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.162516Z"},"links":{"cited_paper":"/paper/2003.12418","citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:10d93845dda476553c03f2c0112c19b2b42c92af4f73d9d6f9d1269dc565638a","observation_id":"e1539281-78b5-4596-a45b-4808b650400c","resolution":{"observed_at":"2026-08-16T10:38:25.162516Z","resolver_source":null,"status":"malformed_identifier"},"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-08-16T10:38:25.166981Z","title":"Freeze-tag is NP-hard in 3d with L1 distance","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.166981Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:ece1fdb91e4915505232af73de8fbd525211a73d1a983f58226a00ef606a2c0a","observation_id":"9a66222d-1500-4996-8c02-dc985f34f14b","resolution":{"observed_at":"2026-08-16T10:38:25.166981Z","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-16T10:38:26.833873Z","title":"Rosenkrantz, Richard E","venue":null,"work_id":"9f994269-6455-41c7-b3de-e9becd8f2268","year":1977},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.177984Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:fa19f781416648c42c8f7e0cdb221b3e5d6a7c1358fe8f9001b887795aa4502a","observation_id":"a395982a-e634-4f7e-8b45-8adfcbad631b","resolution":{"observed_at":"2026-08-16T10:38:26.936875Z","resolver_source":"raw_fallback","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.181825Z","title":"Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.181825Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:890eb07fb3669d0170c6efaa3add3e18eb2a4c0151490ccac4f0de1edd9b8573","observation_id":"4eea7775-ab78-40f1-bcb0-eb7e0f16a672","resolution":{"observed_at":"2026-08-16T10:38:25.181825Z","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-16T10:38:26.805259Z","title":"Marco Polo (game),","venue":null,"work_id":"366b69e7-1743-4a08-a870-928e9aeedf3a","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.185479Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:37009323277bb8afb15c0a771545b5bf37876b347b77f6622df57cde2152486b","observation_id":"bcbb3e3f-adb1-447f-b765-6c33504699e1","resolution":{"observed_at":"2026-08-16T10:38:26.809105Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.660802Z","title":"Tag (game) – freeze tag,","venue":null,"work_id":"f800f654-2d38-4f3d-ae70-09fa1841424d","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.193065Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:e0161a616118ea27800ceabd073a8ec0fded78847d7b072fbce06e49ab0d705f","observation_id":"5a0be7df-672c-498e-b7e0-60cc8cd03be0","resolution":{"observed_at":"2026-08-16T10:38:26.744827Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.646761Z","title":"defective","venue":null,"work_id":"30797ff8-ea12-4e7d-a1b9-9430ae1ba82b","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.196956Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:b63a290983aa07918d8e79c1633bb05b699b230e165a433af8ecdfd6fe21bf28","observation_id":"5caecc09-4f36-4dfe-9823-13e6736b2290","resolution":{"observed_at":"2026-08-16T10:38:26.652422Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.496348Z","title":null,"venue":null,"work_id":"cbe37fc2-45d0-4ddd-a912-9cc5811a1ba8","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.201420Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:e0b7ab0b0176599b307f073faa688d90d85f1e704f9918e042fbf9121227ef69","observation_id":"0153db66-d2d0-4932-95f6-0857d54e6b0c","resolution":{"observed_at":"2026-08-16T10:38:26.583656Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.484333Z","title":null,"venue":null,"work_id":"1c10af92-e5a8-4812-8c1c-6bae01909952","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.330175Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:4193d209719ce1b5a0d57828da9c9468421fd411f6b574c6c145b1f8e624a7bd","observation_id":"f27b4fac-d971-4444-a754-cd255e1a8b86","resolution":{"observed_at":"2026-08-16T10:38:26.488259Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.392096Z","title":null,"venue":null,"work_id":"7a273cdc-f653-40a0-83ea-6dd1cdf1336f","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.366429Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:bd6faf05eb3e4adb4c2af8c2a85933a8bc76f10b545d14193deafbd1754cc15b","observation_id":"dad19c54-659f-4f41-8771-73b88a2588e5","resolution":{"observed_at":"2026-08-16T10:38:26.476063Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.292898Z","title":null,"venue":null,"work_id":"f4ff307d-1ed7-4949-8962-d8b81f4fc4f2","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.370457Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:d2568edbe954ca41cf0b6b5239e6472595e632256ae3f6537eb147f9c0566bbf","observation_id":"42458a8e-35be-4ea0-b32e-90a6099efa84","resolution":{"observed_at":"2026-08-16T10:38:26.300308Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:26.134546Z","title":"Other than step 1, the performance of the search strategy depends by the relative positions of the POIs","venue":null,"work_id":"a40c7197-fc50-4414-b1bc-9d3ac84724ff","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.373697Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:f0448ee263eca272975aa6e18a994e1fc3f9a8e6671c8e444c5d0786215a340e","observation_id":"3ead875e-f71a-41ee-8b43-c3bc4316771e","resolution":{"observed_at":"2026-08-16T10:38:26.222001Z","resolver_source":"raw_fallback","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":"8918.10989","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.809563Z","title":null,"venue":null,"work_id":"41a09e80-1c2e-4d66-9af2-865a7af02fab","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.152941Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:bc998b420ed7d29f9ed7e13ede89cb23435bfca50ec9e0695c1c0fb73b4f3f9d","observation_id":"b1593e1a-88fd-44c8-ad18-6ad8b0451564","resolution":{"observed_at":"2026-08-16T10:38:25.815003Z","resolver_source":"raw_fallback","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":"10.1016/j.dam.2014.03.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:38:25.433458Z","title":null,"venue":null,"work_id":"a390d214-4db2-4c4d-a0a2-c2b9ba326cf6","year":2013},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.088054Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:c3c7b993459bee5dad15dbd5c7fda5a143247834527dd7f578f4b17d2e004f29","observation_id":"14838ffb-0f35-4539-be01-7224b1c9f4c3","resolution":{"observed_at":"2026-08-16T10:38:25.438369Z","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-16T10:38:24.914141Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:24.914141Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:0cd9e7fa556afac7731eff3ce7e859f2fa2ddfcedb74246e83c911561cb2628c","observation_id":"1c2f40e6-3633-47cb-87d8-d3e5b4cf954c","resolution":{"observed_at":"2026-08-16T10:38:24.914141Z","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-16T10:38:26.793938Z","title":null,"venue":null,"work_id":"b326efb8-a277-49e5-9b75-73507fb93d97","year":null},"citing_paper":{"arxiv_id":"2504.17955","last_updated":"2025-05-08T06:24:39Z","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T10:38:25.189454Z"},"links":{"citing_paper":"/paper/2504.17955"},"observation_digest":"sha256:e37e6d7fee757e4073d7a60267364650f9b2788ed43861b707854448562d6108","observation_id":"738249d1-b945-4ba9-864d-c8a03d2fe6bb","resolution":{"observed_at":"2026-08-16T10:38:26.797672Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2504.17955","last_updated":"2025-05-08T06:24:39Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-17T13:07:47.716175Z","submitted_at":"2025-04-24T21:58:38Z","title":"The Marco Polo Problem: A Combinatorial Approach to Geometric Localization"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":5,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":6,"verified_fuzzy":9},"total_outbound_references":31},"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 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2504.17955."}