{"as_of":"2026-08-10T11:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d85118e742625a7a00829b25a4bc0c5ae2841a31fe20661eb4a7a386412af14d","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:59:19.872813Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:55:55.448797Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T08:39:41.944225Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2504.11320","last_updated":"2026-05-14T23:11:43Z","snapshot_observed_at":"2026-08-02T11:51:09.028246Z","submitted_at":"2025-04-15T16:00:21Z","title":"Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T19:44:35.756018Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2504.11320"},"observation_digest":"sha256:5389a65c7a527f2c4af4939736feaa94d3ee75f986a60f2fa5650b48c44f68f9","observation_id":"8fbed5c4-d278-4e34-9a12-ac32dbf7e135","resolution":{"observed_at":"2026-06-30T02:16:09.189250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-08-05T22:55:55.448797Z","title":"These sophisticated neural networks, trained on extensive corpora of textual data, now serve as foundational components for numerous real- world applications","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.06127","last_updated":"2025-08-08T08:47:26Z","snapshot_observed_at":"2026-08-08T03:33:28.525202Z","submitted_at":"2025-08-08T08:47:26Z","title":"SAM Encoder Breach by Adversarial Simplicial Complex Triggers Downstream Model Failures","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T22:55:55.448797Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2508.06127"},"observation_digest":"sha256:90ee049de4856637b36695e6a739676c07825097f4079a9488cd71d1bab2ce9b","observation_id":"3f4fb693-23e0-43ed-b0ab-89bd60590180","resolution":{"observed_at":"2026-08-05T22:55:55.448797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2604.11001","last_updated":"2026-04-13T05:03:16Z","snapshot_observed_at":"2026-08-08T18:06:41.472244Z","submitted_at":"2026-04-13T05:03:16Z","title":"Flow-Controlled Scheduling for LLM Inference with Provable Stability Guarantees","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T15:51:11.343200Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2604.11001"},"observation_digest":"sha256:c931628255180631aa6ad250ba2585c35a45a1c477a537a78fec6386bdffa6e9","observation_id":"de56bfa0-519f-4f09-86af-2d8fa95a00e3","resolution":{"observed_at":"2026-06-30T02:16:09.189250Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2605.01280","last_updated":"2026-05-02T06:31:11Z","snapshot_observed_at":"2026-08-03T03:47:16.035466Z","submitted_at":"2026-05-02T06:31:11Z","title":"Position: LLM Serving Needs Mathematical Optimization and Algorithmic Foundations, Not Just Heuristics","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-09T18:53:29.089882Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2605.01280"},"observation_digest":"sha256:8612877730ca80abcb12cb9c7f1bfd23bc5580f5f65604f97d69260438ae2fb0","observation_id":"48e8820b-e5c1-4798-b0ed-61f1b997a5ab","resolution":{"observed_at":"2026-06-30T02:16:09.189250Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2605.04595","last_updated":"2026-05-06T07:42:26Z","snapshot_observed_at":"2026-08-08T18:04:13.922410Z","submitted_at":"2026-05-06T07:42:26Z","title":"A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-08T17:28:05.492863Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2605.04595"},"observation_digest":"sha256:3535e8553d110b8f69577c26550ecb446738d966276c85dc0e90189458b53c1f","observation_id":"580b7487-c84c-4279-956f-9af48ae0fddb","resolution":{"observed_at":"2026-06-30T02:16:09.189250Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-08T05:22:14.122156Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:7b16d6993bc64b3bb01a30bc73da6df88d781981d8f4367091c47d6443b8eab0","observation_id":"44518a3f-da22-4fcf-a503-ffab3c8ead8a","resolution":{"observed_at":"2026-06-30T02:16:09.189250Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-11T00:59:57.639525Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:92a5e08d1f0f193702df428f99ddf8004ba253f1c93e31264786e6fb0b9bc3f0","observation_id":"1bfc7601-42bb-439c-91e2-0b68510eb68f","resolution":{"observed_at":"2026-06-30T02:16:09.189250Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":"2508.06133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-04T08:39:41.944225Z","title":"Wang, M., Ye, Y., and Zhou, Z","venue":"math.OC","work_id":"9d7ea5f7-50e6-4ad0-8050-d86971f560d6","year":2025},"citing_paper":{"arxiv_id":"2606.22327","last_updated":"2026-06-24T14:02:53Z","snapshot_observed_at":"2026-08-07T17:40:04.855669Z","submitted_at":"2026-06-21T04:05:38Z","title":"Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T11:17:35.860286Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2606.22327"},"observation_digest":"sha256:a859a2a5e7e6a87cb9587355c416eee36d36002a90dbebee521100b5ea0f93af","observation_id":"44cf0a7c-fd4b-4bed-bedf-18c5ecf0e7f8","resolution":{"observed_at":"2026-07-04T08:39:41.945441Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":"LLM serving optimization with variable prefill and decode lengths","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-08T07:42:04.363588Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:9f0ba8e2afb21eb30c3a7898cf838fcf3f51bee7390fbf4abe1c44953d8c51c0","observation_id":"8e3a61ed-affe-44a7-bf55-0e7f4295ef5c","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-08-04T10:54:03.079660Z","title":"Zhixiang Wei, James Yen, Jingyi Chen, Ziyang Zhang, Zhibai Huang, Chen Chen, Xingzi Yu, Yicheng Gu, Chenggang Wu, Yun Wang, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02244","last_updated":"2026-08-03T13:55:20Z","snapshot_observed_at":"2026-08-08T06:39:19.636143Z","submitted_at":"2026-08-03T13:55:20Z","title":"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T10:54:03.079660Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2608.02244"},"observation_digest":"sha256:094f0cc4697d4433ef0fdbb8905d5fabe8c4dca181643dd6e08e0c3f3ffda90f","observation_id":"a0baf015-af7d-44f8-a8b5-2be04de56ed9","resolution":{"observed_at":"2026-08-04T10:54:03.079660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06133/citation-record","integrity":"/paper/2508.06133/integrity","json":"/paper/2508.06133/citation-record.json","paper":"/paper/2508.06133"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.18927","last_updated":"2024-10-24T17:14:40Z","snapshot_observed_at":"2026-07-06T19:39:15.025945Z","submitted_at":"2024-10-24T17:14:40Z","title":"SafeBench: A Safety Evaluation Framework for Multimodal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.18927","snapshot_observed_at":"2026-08-05T22:59:19.872813Z","title":"Ying, Z.; Liu, A.; Liang, S.; Huang, L.; Guo, J.; Zhou, W.; Liu, X.; and Tao, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:19.872813Z"},"links":{"cited_paper":"/paper/2410.18927","citing_paper":"/paper/2508.06133"},"observation_digest":"sha256:b0142a72af3db2b96f4fc234f41b6cb77081576c329da68777e84189dfe35bf2","observation_id":"638c69ce-eb7c-43c9-be03-16cdedd8f489","resolution":{"observed_at":"2026-08-05T22:59:19.872813Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02785","last_updated":"2024-12-05T12:58:44Z","snapshot_observed_at":"2026-08-07T05:58:53.717462Z","submitted_at":"2024-11-05T03:51:13Z","title":"Stochastic Monkeys at Play: Random Augmentations Cheaply Break LLM Safety Alignment","version":2},"cited_work":{"arxiv_id":"2411.02785","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.02785","snapshot_observed_at":"2026-08-05T22:59:20.030191Z","title":"Stochastic Monkeys at Play: Random Augmentations Cheaply Break LLM Safety Alignment","venue":"cs.LG","work_id":"81d7c48b-6c00-4656-9e09-2af319c84987","year":2024},"citing_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:19.726224Z"},"links":{"cited_paper":"/paper/2411.02785","citing_paper":"/paper/2508.06133"},"observation_digest":"sha256:0bbf2a84709960f24f3b86ee8e3e713992233db67af626c57f041fd86a23e758","observation_id":"5321b12d-c7cb-4b99-b21f-f664bdd575c0","resolution":{"observed_at":"2026-08-05T22:59:20.132431Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":2},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 10 inbound Pith citation observations for arXiv:2508.06133."}