{"as_of":"2026-08-07T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5433615687dea8d9a820bdc3c5069bfc726cc998260ab249ad4ead077c6b5e10","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-01T17:29:37.089302Z","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-07T06:34:17.273281+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/2607.17641/citation-record","integrity":"/paper/2607.17641/integrity","json":"/paper/2607.17641/citation-record.json","paper":"/paper/2607.17641"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:29:35.931036Z","title":"InThe Fourteenth International Confer- ence on Learning Representations (ICLR)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:35.931036Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:e5342382fb9b407eb4662603f33ca245b56ba6b3614a49945a3bfd7e9afe209f","observation_id":"1565ab46-9a51-4e14-8735-7ac523a1b380","resolution":{"observed_at":"2026-08-01T17:29:35.931036Z","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-08-01T17:29:36.139871Z","title":"In Vanschoren,J.;andYeung,S.,eds.,ProceedingsoftheNeu- ral Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.139871Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:0d8c71c9aebd76a3e4bcf4d16549b86ae9848c48cce875aba211306cdc6e3460","observation_id":"3504a2fe-fef5-4151-b57e-8062d8a4e28f","resolution":{"observed_at":"2026-08-01T17:29:36.139871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.02304","last_updated":"2026-04-21T03:02:32Z","snapshot_observed_at":"2026-08-06T04:14:07.500244Z","submitted_at":"2025-12-02T00:51:14Z","title":"When Does Verification Pay Off? A Closer Look at LLMs as Solution Verifiers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.02304","snapshot_observed_at":"2026-08-01T17:29:36.471688Z","title":"arXiv:2512.02304","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.471688Z"},"links":{"cited_paper":"/paper/2512.02304","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:f66d5810820f2a468ca34d76b57fd6eeb3c290d1955cff29efe636aeb3a7785f","observation_id":"f0d5f9c6-9ae1-4d83-8ecf-055a5c498d1a","resolution":{"observed_at":"2026-08-01T17:29:36.471688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04549","last_updated":"2024-07-05T14:34:50Z","snapshot_observed_at":"2026-08-03T03:39:29.907591Z","submitted_at":"2024-07-05T14:34:50Z","title":"Spontaneous Reward Hacking in Iterative Self-Refinement","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.04549","snapshot_observed_at":"2026-08-01T17:29:36.542916Z","title":"In Oh, A.; Naumann, T.; Globerson, A.; Saenko, K.; Hardt, M.; and Levine, S., eds.,Advances in Neural Information Processing Systems, volume 36, 46534–46594","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.542916Z"},"links":{"cited_paper":"/paper/2407.04549","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:5e2b6f71ff381be2dac347d0fed7dca53af5a6122666b0bb8f0466b51e11db57","observation_id":"bf9af895-f837-4b0a-a5af-18cd714d5b1a","resolution":{"observed_at":"2026-08-01T17:29:36.542916Z","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-08-01T17:29:36.718443Z","title":"InProceedings of the 64th Annual Meeting of the Association for Computational Linguistics","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.718443Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:7c16cb57e27c79a5f4fc4852037fe1062c73aa29d6a9b4c0dc4412e84a127107","observation_id":"aa7cb22d-bbc6-44e3-a877-cb49f45fe47f","resolution":{"observed_at":"2026-08-01T17:29:36.718443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-01T17:29:36.793226Z","title":"arXiv:2412.15115","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.793226Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:985433d1180bb8179497148e044d6f9611b6dc65bc180a9d9aab95c44a965c1f","observation_id":"5c0e3dd2-3b2e-4f59-8bd5-b6a7aadf1ec7","resolution":{"observed_at":"2026-08-01T17:29:36.793226Z","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-08-01T17:29:36.869364Z","title":"InProceedings of the 2025 Conference on EmpiricalMethodsinNaturalLanguageProcessing,13573– 13587","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.869364Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:0ae10f97faa30a4d56734f8de4dff7e1782e7f33d9a1ae8fb9b7c0fd25e15b8f","observation_id":"731dadeb-5be4-479c-ae8b-bc179231c50d","resolution":{"observed_at":"2026-08-01T17:29:36.869364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00271","last_updated":"2025-02-01T02:08:49Z","snapshot_observed_at":"2026-08-02T04:16:47.283470Z","submitted_at":"2025-02-01T02:08:49Z","title":"Scaling Flaws of Verifier-Guided Search in Mathematical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00271","snapshot_observed_at":"2026-08-01T17:29:36.978463Z","title":"arXiv:2502.00271","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.978463Z"},"links":{"cited_paper":"/paper/2502.00271","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:d68506ce91337d7c2e0311af96cd0b4d922ee1183fb176f1d880166c23b66ba2","observation_id":"7de6432c-46c4-449b-aaab-3c62782a9a9c","resolution":{"observed_at":"2026-08-01T17:29:36.978463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11966","last_updated":"2025-05-17T11:41:44Z","snapshot_observed_at":"2026-07-06T21:25:32.619009Z","submitted_at":"2025-05-17T11:41:44Z","title":"Solve-Detect-Verify: Inference-Time Scaling with Flexible Generative Verifier","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11966","snapshot_observed_at":"2026-08-01T17:29:37.089302Z","title":"arXiv:2505.11966","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:37.089302Z"},"links":{"cited_paper":"/paper/2505.11966","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:341e251a064d0557de5485401c92a342aed5822e1d66efed5faa263aed4e3ab6","observation_id":"20dcab79-a8fd-40b6-9782-f86d51605ec3","resolution":{"observed_at":"2026-08-01T17:29:37.089302Z","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-08-01T17:29:36.607663Z","title":"InProceedingsofthe33rdInternationalConference onMachineLearning,volume48ofProceedingsofMachine Learning Research","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.607663Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:bd768ecafc5613414ec4b5727b7903245afb7613c38e06f690f88aa595862360","observation_id":"d902d939-d87a-4853-a133-6dc1e6e52b0b","resolution":{"observed_at":"2026-08-01T17:29:36.607663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-01T17:29:35.656599Z","title":"arXiv:2108.07732","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:35.656599Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:67e12366d0bed7affeb458e870d43067fb16865cc4b1cbb55b2ebb8d03306df8","observation_id":"e5b27311-3f8d-4d51-bc6e-d9297163e5b5","resolution":{"observed_at":"2026-08-01T17:29:35.656599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-01T17:29:36.255727Z","title":"Kamoi, R.; Das, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.255727Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:9164258dea4f7066720cd0ff0fa76998e2d63efceba3fbb8fd047a121fdb8462","observation_id":"4a5d015e-8006-4014-bedc-6dcdf6ab7921","resolution":{"observed_at":"2026-08-01T17:29:36.255727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-01T17:29:36.028422Z","title":"CoRR, abs/2407.21783","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.028422Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:00052d75919a440fc68a52fe6e743d9a928274ab5870affa52ac6c0d2c438715","observation_id":"2a238890-af07-4032-9c86-99c45d621cd0","resolution":{"observed_at":"2026-08-01T17:29:36.028422Z","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-08-01T17:29:36.410071Z","title":"InAdvancesinNeuralInformation Processing Systems 38 (NeurIPS 2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:36.410071Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:5fcc1badac976353a6f716927353a32052daca76006fea19fe32553d054b460b","observation_id":"3fc5b034-2a11-4b1f-9d47-f772bdedd386","resolution":{"observed_at":"2026-08-01T17:29:36.410071Z","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-08-01T17:29:35.762998Z","title":"InMatusevych,Y.;Eryiğit,G.;andAletras,N.,eds., Proceedingsofthe19thConferenceoftheEuropeanChapter oftheAssociationforComputationalLinguistics(Volume5: Industry Track), 927–936","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T17:29:35.762998Z"},"links":{"citing_paper":"/paper/2607.17641"},"observation_digest":"sha256:5fef7dfaf5bcd22f4dfaf32dc0711e33a8060647355c91f3f86c09deb31637c2","observation_id":"6a7c2b90-cb3d-451d-a5d5-39fdc1cbc7b5","resolution":{"observed_at":"2026-08-01T17:29:35.762998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17641","last_updated":"2026-07-20T07:52:36Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T06:27:12.373704Z","submitted_at":"2026-07-20T07:52:36Z","title":"Verify, Repair, Repeat, or Stop? Robust Stopping for Noisy Verify-Repair Loops in LLM Agents"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.17641."}