{"as_of":"2026-08-08T09:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c14c6dce6404917995baa3958e322d84f768302bbcb9f21a003be594628885f","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:58:25.092206Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"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/2607.18174/citation-record","integrity":"/paper/2607.18174/integrity","json":"/paper/2607.18174/citation-record.json","paper":"/paper/2607.18174"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:58:23.288308Z","title":"K., Unutmaz, D., Weil, K., Yin, S., & Zhivotovskiy, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.288308Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:2f6ec46255974f71df9faf9b39bd6f9bbf8e60916fb5f901e2be39fd56308ca4","observation_id":"e4a77357-d0f2-4b67-ad7e-3c5c0094b545","resolution":{"observed_at":"2026-08-01T15:58:23.288308Z","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-01T15:58:23.357673Z","title":"D., Ying, Y., & Chen, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.357673Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:45dd85e5d7b5d3917051cafbced02c13ad60d92e9139dbc681bb4afb4b0895b2","observation_id":"f08565a2-b931-4809-982b-7b1097f14276","resolution":{"observed_at":"2026-08-01T15:58:23.357673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10945","last_updated":"2025-08-06T06:47:04Z","snapshot_observed_at":"2026-08-08T08:00:34.863842Z","submitted_at":"2025-01-19T04:56:55Z","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10945","snapshot_observed_at":"2026-08-01T15:58:23.446589Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.446589Z"},"links":{"cited_paper":"/paper/2501.10945","citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:edb0c3b3f23a5efe99d644c86766154d4bc2459d3f6e32436b6edae510537490","observation_id":"561d1f28-4321-49cc-ab5b-162f56597890","resolution":{"observed_at":"2026-08-01T15:58:23.446589Z","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-01T15:58:23.561719Z","title":"(2005).Multicriteria optimization(2nd ed.)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.561719Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:ae0a579b9d6a6cd1db72230fdbbbcbd9e49d9ae4095273707126e714d8b4cc87","observation_id":"54fe99b6-23ad-4d17-81f5-34cd7a54c04c","resolution":{"observed_at":"2026-08-01T15:58:23.561719Z","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-01T15:58:23.648065Z","title":"D., Chen, L., Lu, S., Chen, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.648065Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:5824b3548ed3532f42f47be8570a8147f71df11ccf82002f38edc6209b5c60a0","observation_id":"1d29d76a-07bf-4610-81f3-6f978e0063b3","resolution":{"observed_at":"2026-08-01T15:58:23.648065Z","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-01T15:58:23.699480Z","title":"D., Shen, H., Liu, M., Chaudhury, S., Murugesan, K., & Chen, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.699480Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:0c087d14e77c96d7f7af4954c2c81e535073bb16946ec91bb880162d2401c587","observation_id":"ca1aa93b-ab8a-4bee-b1ab-1e73ae4d6ab9","resolution":{"observed_at":"2026-08-01T15:58:23.699480Z","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-01T15:58:23.745510Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.745510Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:b9097b9f8c1042d82936b0dfa75edd85a354f031a57287e2e0d07974375c1719","observation_id":"f064b80b-c065-4667-82d6-019d81291faf","resolution":{"observed_at":"2026-08-01T15:58:23.745510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.15412","last_updated":"2026-07-16T19:34:00Z","snapshot_observed_at":"2026-08-06T02:19:44.098365Z","submitted_at":"2026-07-16T19:34:00Z","title":"Regularity-Aware Stochastic MGDA with Adaptive Conflict-Avoidant Update Direction Control","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.15412","snapshot_observed_at":"2026-08-01T15:58:23.815109Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.815109Z"},"links":{"cited_paper":"/paper/2607.15412","citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:efd4489fd2e0da6bdc527bb92b2a1d76b8ea89ee68cc073aea5b47e3bd81697e","observation_id":"d06520bc-e856-4573-b67b-4926484401ee","resolution":{"observed_at":"2026-08-01T15:58:23.815109Z","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-01T15:58:23.906770Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:23.906770Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:42c4750e5aa96f5dda381f21bf577e5b2a377a82be965be982dd1c1656c50a79","observation_id":"5e43c075-8b4c-4ea8-92d8-b895226032c9","resolution":{"observed_at":"2026-08-01T15:58:23.906770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.31182","last_updated":"2026-06-30T06:10:25Z","snapshot_observed_at":"2026-08-06T10:16:29.088396Z","submitted_at":"2026-06-30T06:10:25Z","title":"AI-Assisted Discovery of Convex Relaxations via Dual Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.31182","snapshot_observed_at":"2026-08-01T15:58:24.022869Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.022869Z"},"links":{"cited_paper":"/paper/2606.31182","citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:2b112d8027d806bfe4e8b174ccccbc54ca67c742a958ae280e03c0b9a1b1f6c9","observation_id":"af692fa5-bdd2-4bd1-bfc1-27b80b215a2a","resolution":{"observed_at":"2026-08-01T15:58:24.022869Z","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-01T15:58:24.076721Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.076721Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:9ebfca1a45eecbc0872edd2216e7e0630458a87f1fd4308bc3de2d918bfffd48","observation_id":"b21d7d11-1f8e-40b0-92a3-4e1259e55ca9","resolution":{"observed_at":"2026-08-01T15:58:24.076721Z","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-01T15:58:24.154282Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.154282Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:e259889bb58c88103004e39ac8040535ec670b30ff4b9dee0c04c7d1b57a5e3e","observation_id":"485d7474-7f19-4e2a-8bd4-558141a7cf68","resolution":{"observed_at":"2026-08-01T15:58:24.154282Z","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-01T15:58:24.210259Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.210259Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:fdab3d95592a2659046755ba7d40f0e8262781b29314ae05ea33ac3dea8974b3","observation_id":"275b3d7a-679e-49eb-94e2-4010f109dda0","resolution":{"observed_at":"2026-08-01T15:58:24.210259Z","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-01T15:58:24.324129Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.324129Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:7ffab688eb31dc767aab1a905d59e6c54f8f6499a68c50681c461f0526309e86","observation_id":"18a411fc-5b1b-4b86-9029-7f5b8f1ebd8e","resolution":{"observed_at":"2026-08-01T15:58:24.324129Z","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-01T15:58:24.426402Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.426402Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:d058ccebe81ffcf5e7c8e6197f9403f789266abd74df50fc1ee99fccb7746bcb","observation_id":"c885d2f7-1a72-44f7-a83c-0beee7662524","resolution":{"observed_at":"2026-08-01T15:58:24.426402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.11773","last_updated":"2026-06-10T07:57:32Z","snapshot_observed_at":"2026-08-06T09:44:31.038157Z","submitted_at":"2026-06-10T07:57:32Z","title":"Last-Iterate Convergence of Optimistic Multiplicative Weight Update","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.11773","snapshot_observed_at":"2026-08-01T15:58:24.497677Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.497677Z"},"links":{"cited_paper":"/paper/2606.11773","citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:ddbb7c003804b1e287c239b457d2ee67fbc411a3b9fb9a6489debf3472c744ae","observation_id":"a3007c05-3bb2-49bc-ae45-f51910074b8a","resolution":{"observed_at":"2026-08-01T15:58:24.497677Z","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-01T15:58:24.559382Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.559382Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:c4b7162ea08182be83bb5da916ec61ebab3ea92d9aabc3e4b4ed3f86fa42ca5e","observation_id":"a30b9126-0153-4ec3-827f-4ad9bf289387","resolution":{"observed_at":"2026-08-01T15:58:24.559382Z","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-01T15:58:24.614276Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.614276Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:89f6c22576eef061f41a28863b6a34737caa9acd6373809a65fa06373e6d7cf9","observation_id":"30443236-9515-4626-a754-99bf6866bc24","resolution":{"observed_at":"2026-08-01T15:58:24.614276Z","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-01T15:58:24.722492Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.722492Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:4eeb382d6769d816a8896d40437afeee23d78451286a933acd50a9123094f9d4","observation_id":"78db1f65-28b8-46d3-be44-c17b22addc04","resolution":{"observed_at":"2026-08-01T15:58:24.722492Z","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-01T15:58:24.807766Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.807766Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:5ebbe1455fbf03feb10befce945492996243076d873ad2a8a5b95765b36c38ba","observation_id":"cf52aeee-c148-4cf2-acdf-150ca14c5b5f","resolution":{"observed_at":"2026-08-01T15:58:24.807766Z","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-01T15:58:24.879811Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.879811Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:dd7016c7d0846ad6e4f5a8fbc6d670d132a6db3b3e98ea40f681c4b7a318f5c8","observation_id":"5dd6e52e-bad8-44fc-b2d4-42272bb0d161","resolution":{"observed_at":"2026-08-01T15:58:24.879811Z","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-01T15:58:24.945388Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:24.945388Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:0ebfc33ab18a77ce1a190bf638ab1d98bf58cd7b26e366291fcc3fb64cf7d2d3","observation_id":"da89fe91-255e-43f5-9345-d6ccd49e6c1b","resolution":{"observed_at":"2026-08-01T15:58:24.945388Z","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-01T15:58:25.012605Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:25.012605Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:a702a5bcc3d349b0c5e7ff3b80306c363c567c731f8bc0550d42cfb504b41e60","observation_id":"a4c2e16c-c8a6-47fc-87e6-9f1fe1673460","resolution":{"observed_at":"2026-08-01T15:58:25.012605Z","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-01T15:58:25.092206Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:25.092206Z"},"links":{"citing_paper":"/paper/2607.18174"},"observation_digest":"sha256:5489f1e8c014dadd60bdd1b719245757b16a2bb86995e0acd672b7a2a08a788c","observation_id":"a8c4cf94-2a0a-4cfa-aeb6-4802ecfee3eb","resolution":{"observed_at":"2026-08-01T15:58:25.092206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18174","last_updated":"2026-07-20T17:13:07Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T09:45:11.139375Z","submitted_at":"2026-07-20T17:13:07Z","title":"Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.18174."}