{"as_of":"2026-08-08T18:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54c05ff4689f87b8ccd2c9295b322f15c3d448e5a5c055da2543d120a4afacf5","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:31:28.238316Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2509.00629/citation-record","integrity":"/paper/2509.00629/integrity","json":"/paper/2509.00629/citation-record.json","paper":"/paper/2509.00629"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-05T13:31:26.984283Z","title":"In Pro- ceedings of the AAAI Conference on Artificial Intelli- gence, volume 38, pages 19368–19376","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:26.984283Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:82a7ae6c20b874699a2130b230648b4223bd58a927ea8d876a5abd64d5b55661","observation_id":"f1a386d4-be61-4760-9849-531825d1f067","resolution":{"observed_at":"2026-08-05T13:31:26.984283Z","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-05T13:31:29.971714Z","title":"[BEGIN PROBLEM] {INSERT PROBLEM HERE} [END PROBLEM] # SELF-REFLECTION You were previously solving a coding problem","venue":null,"work_id":"3cb17459-4e03-4039-8078-9a93636b29a2","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.305302Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:8dc3649bef4f6323bf7e6dc962f571d810c25d99379829b5fd9947e37533a646","observation_id":"3265346e-8262-4e3a-8bbc-a9444ba52261","resolution":{"observed_at":"2026-08-05T13:31:30.077653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:30.530564Z","title":null,"venue":null,"work_id":"044bde5d-b5ec-4224-b60f-5c9c451a7a5a","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.416562Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:21b415c7ad9f4aceb023f363a012e3e20ae741f4a320627e97d0fb98e310711b","observation_id":"f7f01edf-f7e3-4973-9562-ceb6368f79a0","resolution":{"observed_at":"2026-08-05T13:31:30.533609Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:30.448818Z","title":null,"venue":null,"work_id":"991a255f-191a-475b-af8a-f020ee3ed26c","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.531257Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:e392be41dff08dd7a73e99db7e4df3cabb52cf8e16fd6e4ceeb3aaac5428dabd","observation_id":"57ca0a00-2c93-465e-854a-da850edbffbb","resolution":{"observed_at":"2026-08-05T13:31:30.523897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:30.190571Z","title":null,"venue":null,"work_id":"eca8f810-43d4-4750-8449-088ebe31fd18","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.606281Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:7507cb2cbcf2750f5f34063e9415933f69e8d8b4decc755eb3f66a1f9bafb8ec","observation_id":"2b026ce4-1d39-4751-ace4-8b10903772ec","resolution":{"observed_at":"2026-08-05T13:31:30.303130Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:29.793456Z","title":"[BEGIN SIMILAR PROBLEMS] {query[’retrieval_text’]} (Similar problem problem + solution goes here) [END SIMILAR PROBLEMS] Now it’s your turn","venue":null,"work_id":"285b6092-8d36-441e-99ed-efeedee9d875","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.701407Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:85851579b3fa8405b0c47488d167eeab098c2d446cbfb2d830d507d1157298b3","observation_id":"cd03360d-4347-4540-aca8-763d5d63a0a5","resolution":{"observed_at":"2026-08-05T13:31:29.880132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:29.532149Z","title":null,"venue":null,"work_id":"0fa29ec4-e2da-488b-a100-0841f8af42b2","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.778246Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:43110e26af9722fbc213c154af8d0753cd31513498eb648ec4877c4c883f01b9","observation_id":"b32dd9a2-0ec8-40c6-a591-5cee5abdc6b4","resolution":{"observed_at":"2026-08-05T13:31:29.670660Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:29.251936Z","title":null,"venue":null,"work_id":"aef99915-587c-4a44-ba86-d4913cdd5db5","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.864907Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:b0e146b6fd4b5328fdc8457bbbee2bba0fcb5407dd1280b1b6e9e4bce66a1c94","observation_id":"2107acae-9ce8-480a-a870-51eda93d6adf","resolution":{"observed_at":"2026-08-05T13:31:29.340480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:28.972128Z","title":"You MAY provide the models with:","venue":null,"work_id":"4e5f39fd-8721-4436-9b5c-d904f002e93f","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:27.935959Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:065702a7f11ebe29b99304167b702fdccc94db8a0e315981b0d998b66adc975f","observation_id":"f9ea0bd2-6d7a-496c-b2f7-29ba219abe74","resolution":{"observed_at":"2026-08-05T13:31:29.110341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:28.682255Z","title":null,"venue":null,"work_id":"cfe36a4f-4f62-4dd0-9b95-a2ee9d059caf","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:28.037212Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:10466a9b76341b5d840f946884023f94098b052264d9ba17749a1ecce63a32b1","observation_id":"556a307f-ec1d-442a-bfaf-9f11b734522c","resolution":{"observed_at":"2026-08-05T13:31:28.791281Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:28.493961Z","title":null,"venue":null,"work_id":"600f70f4-2928-4014-8518-0390d70c6d49","year":null},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:28.163413Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:dc4b282f0f3796fe3cfc34724d06a7cd8fae2e298d66b17d134a4da3efd90472","observation_id":"9c8d9be6-25d3-4570-9e4a-b2b51c96c2ce","resolution":{"observed_at":"2026-08-05T13:31:28.559387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T13:31:28.407486Z","title":"Here are examples of correct pathway: B Qualitative Analysis: HAI # FEEDBACK PHASE 1 P3: Please reply with a C++ solution to the below problem","venue":null,"work_id":"92a397a8-ff99-4c37-8096-9d194c404175","year":2011},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:28.238316Z"},"links":{"citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:ce03bf032d668b377c887a7314abe76b7b0e00f5a86e9b2a882730271f9d9e3c","observation_id":"821ff9c2-54f1-42c9-b84d-d7ea19df241f","resolution":{"observed_at":"2026-08-05T13:31:28.415254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09938","last_updated":"2021-11-08T21:16:44Z","snapshot_observed_at":"2026-08-04T23:13:25.514661Z","submitted_at":"2021-05-20T17:58:42Z","title":"Measuring Coding Challenge Competence With APPS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09938","snapshot_observed_at":"2026-08-05T13:31:26.857430Z","title":"arXiv preprint arXiv:2105.09938","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:26.857430Z"},"links":{"cited_paper":"/paper/2105.09938","citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:7e3a9f73a37d051bbe82803e6506b911b96dd82239fde109b18b358218f55e96","observation_id":"13849952-b2fb-4fc0-9184-3b3bd4ee5d6a","resolution":{"observed_at":"2026-08-05T13:31:26.857430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12883","last_updated":"2025-03-26T07:37:26Z","snapshot_observed_at":"2026-07-06T18:48:04.031944Z","submitted_at":"2024-07-16T17:58:27Z","title":"BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12883","snapshot_observed_at":"2026-08-05T13:31:26.897102Z","title":"arXiv preprint arXiv:2407.12883","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T13:31:26.897102Z"},"links":{"cited_paper":"/paper/2407.12883","citing_paper":"/paper/2509.00629"},"observation_digest":"sha256:7b520e0c1b05a837033fb65ed7d35b2219926ab9e6c99242f256e709a5cacea8","observation_id":"de9f739e-5aea-46f6-a558-cb9b8454cb9b","resolution":{"observed_at":"2026-08-05T13:31:26.897102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.00629","last_updated":"2025-08-30T23:02:12Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T04:13:01.801468Z","submitted_at":"2025-08-30T23:02:12Z","title":"Can Multi-turn Self-refined Single Agent LMs with Retrieval Solve Hard Coding Problems?"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":14},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2509.00629."}