{"as_of":"2026-08-11T16:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:803c09ec4a864f56d9ef6cc6d3a2a65fcf7ad491ac0dcf6fb81eef1f222d4fe7","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-11T06:34:44.6726+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-08T07:46:10.530796Z","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:1011bbdf9b645f0bf5c0c6801e960e46b2650ba77b37e2be928b37aace20e2e7","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-08T07:46:10.530796Z","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:741cc574b5f33a1955cb62006c428ff1f811b8bbb63d0dda0925b4374d8a8f0e","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-08T07:46:10.530796Z","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:4629d92a6a64d95fe0515a15bbd6aa292bdc9a98b1557151fa56cff46e41acb2","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-11T06:01:58.556940Z","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-08T07:46:10.530796Z","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:32bf8a339bd7cd94f41b7363f8cad930661e0cdb3f719572a10e9c2f421ef512","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-08T07:46:10.530796Z","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:8151bb336040dd7bcc498ef5391e845854cf02092dec7a3045cd5f54c23de128","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-08T07:46:10.530796Z","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:a37c356a90139d25b65f3ab177fc2dd4f4856654ad40e2e5159ec18e97f11713","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-08T07:46:10.530796Z","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:b2514b667dbc0399825096d46cec705702597131bc6d36f72e89e182007d26f3","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-11T12:42:43.574209Z","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-08T07:46:10.530796Z","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:01078805eb3484c77a4c61c9ed5815a0978498467fe9d02fdb401d144a79b26b","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-08-07T22:01:52.371751Z","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-08T07:46:10.530796Z","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:0216518cb4d3b0d905e1c81d2d9e4b31b14d6e12d041fa7123d4093f5b6aecc9","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-08T07:46:10.530796Z","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:45136273de1889daf66b74be5aada16d232b2b6e875b7dbcfd8c37d383e257df","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-08T07:46:10.530796Z","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:35343de89941fe47ae8fe3cda34816e419149ac48470035596e1f77e9eeecbea","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-08T07:46:10.530796Z","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:040803b8dc0aa59e6447d0ab7490d0c07dc6c3faa27edfdabf18a000dbd18beb","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-08-10T16:40:37.411115Z","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-08T07:46:10.530796Z","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:cd35d7e58f628dcb5461b1e42d63af3c7cf2d5e25f26e54abc22c472956a5b17","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-08T07:46:10.530796Z","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:7f80f76c78e481db86c0fc8d5e91e448f0de07e73353858b392db98f7911d93e","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-08T07:46:10.530796Z","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:e2888896c3d2c7a018ccd32fe7c5fb609baf586e6371e06453be97dc4ddfcf1d","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-08T07:46:10.530796Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.17641."}