{"as_of":"2026-08-08T07:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:880c7eb67b08dbcadfb2cdd1748b3a246f4e492051117df2efea82a2a0394bb5","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:30:13.589845Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"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/2506.05791/citation-record","integrity":"/paper/2506.05791/integrity","json":"/paper/2506.05791/citation-record.json","paper":"/paper/2506.05791"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:55.354615Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:29:55.354615Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:4292f2597e7c1739856aa3213d93dbe1d2049abc82bfe10d97002b49eaa4102b","observation_id":"85fc5821-74c2-4b25-904c-7186c84bfd13","resolution":{"observed_at":"2026-08-07T10:29:55.354615Z","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-07T10:30:15.033930Z","title":"Convex optimization: Algorithms and complexity","venue":null,"work_id":"bb8ec7f4-b6b3-4e46-8e18-8689d30af5bd","year":2015},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.537778Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:7d0e54864e8f024a21f9108725285b58f53c377fafbbd5dbd9e3ab824394679a","observation_id":"52011adf-9bb9-42c6-ad36-82ed5a6f18a2","resolution":{"observed_at":"2026-08-07T10:30:15.042542Z","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-07T10:30:15.000898Z","title":"Dcatalyst: A unified accelerated framework for decentralized optimization","venue":null,"work_id":"63296807-1ce3-4a88-8179-a165e2ed74ec","year":2025},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.552904Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:b03a857cafdd8a1fbfd1cfc6b5c03ec6866b6277796711d5117df856192ee61d","observation_id":"2ad08b82-1141-4f9a-9f56-452a1f8494fc","resolution":{"observed_at":"2026-08-07T10:30:15.010527Z","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-07T10:30:14.972190Z","title":"New proximal point algorithms for convex minimization","venue":null,"work_id":"71311c98-1e6c-4907-9941-a4c0c544e8d0","year":1992},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.562763Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:414645a0e42e11f8f3f5a681fb4f2786bc356c5c8805828fdcf8149b73658a8b","observation_id":"911cc6a9-f1fe-4f0b-b0a3-1549cfa4ca04","resolution":{"observed_at":"2026-08-07T10:30:14.977746Z","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-07T10:30:14.946799Z","title":"H., Qi, H., and Brown, M","venue":null,"work_id":"8d9ce379-65e6-4184-99fe-4399aad263fa","year":2019},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.573782Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:93a0089c4bf6efead175f8b363a8fca917011c39fd3ced3c59adc7dc729ca2ba","observation_id":"d23a2108-5c0b-497a-a3cd-81e9747fece3","resolution":{"observed_at":"2026-08-07T10:30:14.953909Z","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-07T10:30:14.920326Z","title":null,"venue":null,"work_id":"a7c20780-1d58-4f77-881e-89a582004a71","year":2024},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.580845Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:0d8c738d278bd390a9431758f2601193bd8ad409018cd418455217b7698652bf","observation_id":"8505dd4e-1ddb-43be-add3-85cf2c8ecf00","resolution":{"observed_at":"2026-08-07T10:30:14.930460Z","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-07T10:30:14.900770Z","title":null,"venue":null,"work_id":"a2c09079-4b34-4980-a855-54ba40e5e07a","year":2024},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.593227Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:e60db5a903fe18c40ccd34242a2b338313d62b170e341e23df098be84fabba32","observation_id":"544cdcdd-eaae-4a2b-a0c8-58d806d1e21d","resolution":{"observed_at":"2026-08-07T10:30:14.906905Z","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-07T10:30:14.865803Z","title":"P., Jaggi, M., Kale, S., Mohri, M., Reddi, S","venue":null,"work_id":"7d05cb0c-b1cf-43e0-9ae6-60580e88dc49","year":2021},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.610933Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:583dbc780abc3d8c161828770bf315fc1f8940414ddab28b1338d8ad8c3ecb67","observation_id":"165ae88e-5b6f-4d0f-863c-d98fa482debd","resolution":{"observed_at":"2026-08-07T10:30:14.875556Z","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-07T10:30:14.841708Z","title":"and Jin, C","venue":null,"work_id":"c7b52f68-deee-4f63-b74e-1b2fb6c82753","year":2022},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.621928Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:2da180721f34a14975ac59919d06b1b7e0ce206f7610f14a9f11431b2b953b3f","observation_id":"3a8e6c67-e10e-4227-ab7d-939916c59520","resolution":{"observed_at":"2026-08-07T10:30:14.847531Z","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-07T10:30:14.818796Z","title":"and Jin, C","venue":null,"work_id":"b914ac64-b19f-426c-a984-0567b31aec13","year":2023},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.631309Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:624168c61c052efbaa0b3195f4a3d404c2230311bbe47313884ffd1febb356c8","observation_id":"49feaf7b-adc5-47ea-88a0-435def5efaee","resolution":{"observed_at":"2026-08-07T10:30:14.828572Z","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-07T10:30:14.793847Z","title":"A unified theory of decentralized SGD with changing topology and local updates","venue":null,"work_id":"4111c0d4-4748-41f7-986c-1854f0ce6f51","year":2020},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.640709Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:7e8f979fc331315607a95ddf622326116c870fd985040aa9d02d59db1ccff7a8","observation_id":"6a580c89-aee3-4e6a-a9d3-0e819f473557","resolution":{"observed_at":"2026-08-07T10:30:14.801863Z","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-07T10:30:14.758592Z","title":null,"venue":null,"work_id":"1cedcadb-a147-4d7b-b220-f4531d31dcd1","year":2021},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.648828Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:744fcddd0f9a3c5471f60ff43abe50bbdaad7a36669f9b9a0156922d64346f8e","observation_id":"cdd4d8ac-91dd-4d3b-a8d2-ce43995d936d","resolution":{"observed_at":"2026-08-07T10:30:14.769856Z","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-07T10:30:14.733316Z","title":"A linearly convergent algorithm for decentralized optimization: Sending less bits for free! In International Conference on Artificial Intelligence and Statistics, 2021","venue":null,"work_id":"8cf11c15-d5d8-4e90-91d1-74c048d3504c","year":2021},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.666312Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:36dea1d63376b8dcc473b458eb983837c3bba6affa79d56de2054d0ba4042119","observation_id":"2afed844-3e08-401e-a8c9-8850932e7fda","resolution":{"observed_at":"2026-08-07T10:30:14.741917Z","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-07T10:30:14.700776Z","title":"D., Gasnikov, A., and Scutari, G","venue":null,"work_id":"84af47f0-840f-4f6e-b551-b32bcfa93960","year":2022},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.677287Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:a510562902e03563639b4cf867b09327b6d4084c34dc2e956483efa109865a44","observation_id":"6d0f18c4-f571-41df-accd-1c1f06a33a1c","resolution":{"observed_at":"2026-08-07T10:30:14.709087Z","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-07T10:30:14.672777Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":"93bd816c-dae3-4c6c-879e-7d8e76f1a28e","year":1998},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.685559Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:252155cc9363ae7214187712dc68d7b8963b0e9ae95ebb29bddf0bb23cbe4efd","observation_id":"e46faace-cc9b-4250-b27b-3498ecc12af4","resolution":{"observed_at":"2026-08-07T10:30:14.685685Z","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-07T10:30:14.636400Z","title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","venue":null,"work_id":"a73a9d38-9dfa-4b51-94a3-f552939bcd7f","year":2020},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.703340Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:fed49b9c5ee6d5ea4dc99b00cf2d603ab731eb486a6dc8b3436bbf605e5dfa45","observation_id":"472562f8-0dba-4ad5-968d-b962ced78ea7","resolution":{"observed_at":"2026-08-07T10:30:14.650690Z","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-07T10:30:14.602314Z","title":"A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates","venue":null,"work_id":"9b7ace84-9d11-43e0-a550-e1e98b444aba","year":2019},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.716120Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:64c39aa22a886e68ceae2cae79a6677e5e2d64664bac4edda901694f8066ea7c","observation_id":"a24e9e40-0a31-4de7-b260-780bea79fcbb","resolution":{"observed_at":"2026-08-07T10:30:14.609972Z","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-07T10:30:14.579355Z","title":"Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent","venue":null,"work_id":"01efe12d-436d-4c71-8924-ff9b2abd1d14","year":2017},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.726933Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:25e790660b7a814beb65a99b51cad48fa69aea5b94d3eaab3a8122626bf72e15","observation_id":"df2b78f8-4f66-43b3-b018-96110ac0c55e","resolution":{"observed_at":"2026-08-07T10:30:14.588252Z","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-07T10:30:14.550893Z","title":"Stochastic distributed optimization under average second-order similarity: Algorithms and analysis","venue":null,"work_id":"5e1ae397-b8b8-451a-8491-32d5d9bd44ed","year":2023},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.735525Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:1e375ebd7ed5da58410634b226f0b135fee73d35649052b9451654875312a8e7","observation_id":"e226245b-14c4-4ee2-86ad-fe63d32d23f6","resolution":{"observed_at":"2026-08-07T10:30:14.559950Z","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-07T10:30:14.528831Z","title":"and Morse, A","venue":null,"work_id":"f7fa3e5a-fbb7-47d1-9566-c55513baeddf","year":2011},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.745295Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:6f37f2dccfabc3b07adb6b653a3f1baf181f5b55acaeb72a7712d4db2755f38f","observation_id":"bc62f3a9-7497-4c68-b860-d321225faa38","resolution":{"observed_at":"2026-08-07T10:30:14.534296Z","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-07T10:30:14.500010Z","title":null,"venue":null,"work_id":"97cda27c-5361-4368-82dc-f246c3deda7e","year":2024},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.756607Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:59b5db61c2b0a16bef7ffa1f7e3d87b6d4d30ff3d069fec54173e1646d1a5883","observation_id":"f5b7e6e8-65d3-4889-bb2e-2577dbabca51","resolution":{"observed_at":"2026-08-07T10:30:14.507190Z","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-07T10:30:14.472514Z","title":null,"venue":null,"work_id":"a40d8272-3aab-4358-a09e-d908594ed930","year":2024},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.768099Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:005a8c670db91bfab3e2c72f3aa1afab1e6f5ba5a7d4ca41260159964f792d92","observation_id":"ee2bdad9-5b56-417e-9163-04d8e4b3e370","resolution":{"observed_at":"2026-08-07T10:30:14.480240Z","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-07T10:30:14.447587Z","title":null,"venue":null,"work_id":"e74fd657-ba42-4321-8d15-83a5d714fa8a","year":2016},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.782693Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:eb4aeebe51e73f336fc4f0a6367aad64ac15d45645ecd7c5d8939a3372d05dac","observation_id":"8eab1f1f-55f1-4baf-8a6c-b12e8cb81fdf","resolution":{"observed_at":"2026-08-07T10:30:14.452973Z","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-07T10:30:14.422859Z","title":null,"venue":null,"work_id":"7cc6e719-cb47-4109-959b-097ce0a45913","year":2013},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.799745Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:9faeff9f7489efd576784949912601f1746104c12c39165b7ca3d5789865d6c7","observation_id":"12294503-ca1b-4c57-b2b4-cdcd781dba47","resolution":{"observed_at":"2026-08-07T10:30:14.430832Z","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-07T10:30:14.397402Z","title":"and Suzuki, T","venue":null,"work_id":"38a542af-5269-470c-9ec9-73a92b668cbd","year":2021},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.808801Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:e42c3d57a7bfdb4cffe128290648d4aac399dc197369d144976a89b9b1111d1c","observation_id":"7132f2ca-77e5-4563-a7ba-7d3015fb1d58","resolution":{"observed_at":"2026-08-07T10:30:14.403610Z","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-07T10:30:14.368201Z","title":"and Ozdaglar, A","venue":null,"work_id":"34236750-9e68-4664-8594-460e7e32fc7a","year":2009},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.821716Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:c998d4c09b009e26393aba34bf181bcf849f2baad8c7e63da94cac5c45febe3c","observation_id":"b17a2660-00b5-43ef-9317-fc7d7ad80aa9","resolution":{"observed_at":"2026-08-07T10:30:14.375241Z","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-07T10:30:14.343998Z","title":"Lectures on convex optimization","venue":null,"work_id":"c63332e8-75ea-4067-b030-cc0eb4e89cdb","year":2018},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.829206Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:7a1f80f931090970120b1751e00b3a93cb9cffa9ccb97ca0b80977fd94b75eea","observation_id":"a8592368-6768-4069-99ab-efd2e122d468","resolution":{"observed_at":"2026-08-07T10:30:14.350475Z","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-07T10:30:14.314828Z","title":"V., Guminov, S., and Dvurechensky, P","venue":null,"work_id":"8a38c806-ed9f-49de-bda8-6d8e953a412c","year":2018},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.839018Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:6d8dafbbbccda36753869f0c9c0a8b8d64f368d4086d0b2b83a0f0ca252bbb54","observation_id":"156bf24c-7416-42ed-99f0-20ca72835758","resolution":{"observed_at":"2026-08-07T10:30:14.323361Z","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-07T10:30:14.276450Z","title":"K., Glasgow, M., Zindari, A., Wang, L., Stich, S","venue":null,"work_id":"63fa48f6-ece1-41c9-86bc-60e9993d03ab","year":2024},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.848548Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:f9d5c3794af35a2b71035f8f70050c6d10ee91dabd5f0e70e358222fc195b582","observation_id":"3e21f2cf-8290-40ac-987d-9b38891b92ed","resolution":{"observed_at":"2026-08-07T10:30:14.284435Z","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-07T10:30:14.236454Z","title":"and Nedic, A","venue":null,"work_id":"dd8ed66c-87bd-432d-a315-9ddab7a7dd84","year":2021},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.859032Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:f0252e58fb564c19cb45790feb0ffc628223485cad9378a4acf1da34c7678192","observation_id":"f55cd761-1366-48b9-bcae-21b70138135f","resolution":{"observed_at":"2026-08-07T10:30:14.250036Z","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-07T10:30:14.210422Z","title":null,"venue":null,"work_id":"a244d57c-eb89-40d9-81bb-58b03f9d5fd3","year":1976},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.871530Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:57ec18d2e9a692dcfa85759e3403586b8e690a6fe360e9c50e8b135eb4e95014","observation_id":"33a783ba-5b94-491f-ac0d-f79c3ce01100","resolution":{"observed_at":"2026-08-07T10:30:14.217457Z","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-07T10:30:14.182380Z","title":"T., and Massouli \\'e , L","venue":null,"work_id":"0b7035d5-60fa-4949-a104-6f4c68e83a2a","year":2017},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.885036Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:ab41eb885da93eb167eea87ae3ee788814b9f3fa6a708de170428a2421517d12","observation_id":"d644b538-a398-4a63-942b-51080d842687","resolution":{"observed_at":"2026-08-07T10:30:14.191034Z","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-07T10:30:14.141460Z","title":"and Sun, Y","venue":null,"work_id":"86f1d885-7313-4582-aa4d-c0c71398ce38","year":2019},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.893656Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:417ec459f6520f47624ae8c528ee6f2a38410016f6f2238fdfea74ca779d2aaa","observation_id":"054d75dd-98a7-42f6-8b62-ce20ffa7c129","resolution":{"observed_at":"2026-08-07T10:30:14.151940Z","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-07T10:30:14.115177Z","title":"and Srebro, N","venue":null,"work_id":"1f6c5123-768b-4b63-9218-c22e6516810b","year":2014},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.903172Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:b2bb1583de161be3447cf9a2ff5b2ad2d78488bf15ecb15ea724f523ebe6a7dc","observation_id":"be786ac4-9ecb-448c-9800-7def049013dd","resolution":{"observed_at":"2026-08-07T10:30:14.121727Z","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-07T10:30:14.090513Z","title":"Communication-efficient distributed optimization using an approximate newton-type method","venue":null,"work_id":"2d116e73-d1c8-4547-8953-856929948744","year":2014},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.915304Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:391cf07305cd24592b55210f437006019974e1283bacc79656b714d0fb6426fe","observation_id":"976419a7-24ce-491b-882b-ab3237ab9974","resolution":{"observed_at":"2026-08-07T10:30:14.099783Z","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-07T10:30:14.059855Z","title":"Extra: An exact first-order algorithm for decentralized consensus optimization","venue":null,"work_id":"efdf9901-7ba6-4799-a3d9-a427f843ce67","year":2015},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.922636Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:1dab4296fa9119ddbbc536c88c9931d3a8dd4503836143ee6c0608079033ab0a","observation_id":"08861a0e-f9c8-43fd-bebf-39ebbabb0ba6","resolution":{"observed_at":"2026-08-07T10:30:14.069172Z","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-07T10:30:14.026509Z","title":"and Svaiter, B","venue":null,"work_id":"75901ba3-77ff-43f1-8334-bfb081981879","year":1999},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.938948Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:9926001b49af12c2b793f68c0d3176a67ac688e7ff76e821e08ba36ef624ebc4","observation_id":"583ea4e2-801d-49b6-9a3e-eb5d0a616fd7","resolution":{"observed_at":"2026-08-07T10:30:14.038318Z","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-07T10:30:13.997147Z","title":null,"venue":null,"work_id":"5e1a409d-fab7-44f9-8ef4-41e514edb6b8","year":2001},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.947977Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:5cd1772964a7d0a9d9737995cf27dba15af149eacd0b1834503e8f10f1a4c69a","observation_id":"6c87df9b-0d30-43d9-aa83-419c840e9237","resolution":{"observed_at":"2026-08-07T10:30:14.005281Z","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-07T10:30:13.974573Z","title":"Distributed optimization based on gradient tracking revisited: Enhancing convergence rate via surrogation","venue":null,"work_id":"4f87e6ab-f884-413b-9bc3-b44f77243b1c","year":2022},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.958047Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:524a13d450dabe5606842acc242375480cf71da8599e8f51ea9c7a8528fca60c","observation_id":"38c08ce9-415f-4adb-aa6e-d4aba21bbd6c","resolution":{"observed_at":"2026-08-07T10:30:13.981110Z","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-07T10:30:13.950766Z","title":"Momentum tracking: Momentum acceleration for decentralized deep learning on heterogeneous data","venue":null,"work_id":"3bc5780d-52d7-4548-98e9-496427570b05","year":2023},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.964464Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:8b7af41c70b7381e3b0e3890b730fe75678cb4a718b95fbcfbe338afe89765f3","observation_id":"73970c28-c1b1-4f9f-b432-a3e8fc37c719","resolution":{"observed_at":"2026-08-07T10:30:13.958290Z","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-07T10:30:13.921975Z","title":"Acceleration in distributed optimization under similarity","venue":null,"work_id":"cae78735-cc19-488a-8745-966abfdb36ee","year":2022},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.972804Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:a0bddd6b45c62e34d5f639f3ebf16d7a8af6e529056c418717fd76b01a5899eb","observation_id":"0fe69c5e-6fa2-426c-9c82-3aabcfe6e98f","resolution":{"observed_at":"2026-08-07T10:30:13.929729Z","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-07T10:30:13.892201Z","title":"K., Yang, Z., Joshi, G., and Kar, S","venue":null,"work_id":"e9ebc51f-756e-4a31-a9b4-e97770b75518","year":2019},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.982011Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:71f8ad9493a8b8f614d4f7ab0be39daa6a61eb5cf90cae6c01727b4a4b69ff14","observation_id":"00e0ac1d-4a0e-430f-88d9-107d192dafb3","resolution":{"observed_at":"2026-08-07T10:30:13.900785Z","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-07T10:30:13.850743Z","title":"A scheme for robust distributed sensor fusion based on average consensus","venue":null,"work_id":"6986c595-5a9a-4c14-8dfb-d40cf638df2c","year":2005},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.993038Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:b6d72deb73fbd0923eba5bea5e9432cb3b9af70887ee0b5b419f642e8e1211eb","observation_id":"2a312dd7-5ed7-418d-8e3a-3bc2a5e8de46","resolution":{"observed_at":"2026-08-07T10:30:13.861151Z","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-07T10:30:13.822027Z","title":null,"venue":null,"work_id":"2355ec4d-cf54-4e2e-a95d-b36381b9e1e1","year":2019},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:13.017865Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:b1c2c9374a23f50286046544a3c52fb3b27bbd694f914aecfe5cf717ff8e7c12","observation_id":"f94c71c8-e473-4453-8eda-5e0ab16e717b","resolution":{"observed_at":"2026-08-07T10:30:13.831648Z","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-07T10:30:13.789479Z","title":"Revisiting optimal convergence rate for smooth and non-convex stochastic decentralized optimization","venue":null,"work_id":"280fd767-5801-4ab2-a71e-f3e46ba7fe85","year":2022},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:13.204953Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:b93a4e227de18da7850c05b91e8c4d4886803f9bd846afcc3bbc10a9f18ebd1a","observation_id":"04de1e13-b130-4159-8537-817168a0cec5","resolution":{"observed_at":"2026-08-07T10:30:13.800200Z","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-07T10:30:13.753246Z","title":null,"venue":null,"work_id":"286eedf7-5548-4511-9332-5b3675700b01","year":2023},"citing_paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:13.589845Z"},"links":{"citing_paper":"/paper/2506.05791"},"observation_digest":"sha256:86c07f2f86562214f2fb5b34e6768bc750aa86fa96f1c33c8614fdf13bdf5ead","observation_id":"fcbf7a00-5001-4194-a80b-c00596f57df0","resolution":{"observed_at":"2026-08-07T10:30:13.764392Z","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"}}],"paper":{"arxiv_id":"2506.05791","last_updated":"2025-06-06T06:37:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T10:11:08.899914Z","submitted_at":"2025-06-06T06:37:10Z","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":46},"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 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2506.05791."}