{"as_of":"2026-08-15T23:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0517a4806f17e6565214d96a544e47678a2cc9b9945c41eb314c46f9b009bebb","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:23:10.896687Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2411.11732/citation-record","integrity":"/paper/2411.11732/integrity","json":"/paper/2411.11732/citation-record.json","paper":"/paper/2411.11732"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:23:11.606297Z","title":"Sensor-based reactive navigation in unknown convex sphere worlds,","venue":null,"work_id":"ad1858fa-0374-40ed-853c-6faab733f46f","year":2019},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.673959Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:d58974e5cbbd4546063011aec122d874bc49be6f4c779a59f2e9f041aef163bc","observation_id":"f8c7f3d3-2744-4a75-9235-3435224eadb6","resolution":{"observed_at":"2026-08-12T18:23:11.612747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.584637Z","title":"D-map: Distributed maximum a posteriori probability estimation of dynamic systems,","venue":null,"work_id":"bc00c4d0-7725-4f8e-8125-03802b0e87b6","year":2012},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.680718Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:90999dd19a72c7432ba12bcc0cceb1253345b60806684c5df73aa0889c4b1a96","observation_id":"cbd65ccb-38a2-4416-ae69-523f2d29d7ea","resolution":{"observed_at":"2026-08-12T18:23:11.590867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.567782Z","title":"An online parallel algorithm for recursive estimation of sparse signals,","venue":null,"work_id":"d0703904-d725-4751-8f39-e66793f25c8c","year":2016},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.686620Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:5072170750157f2ad29c830555128bab1f38d93633c7172a9cddc4ec5e65eeb3","observation_id":"a3df84cb-e8f5-4e7c-b307-008959c3612c","resolution":{"observed_at":"2026-08-12T18:23:11.573308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.550761Z","title":"Time-varying convex optimization: Time- structured algorithms and applications,","venue":null,"work_id":"82187280-be14-44dc-8970-5f2ae80dd849","year":2020},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.693353Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:cf176c58f1d9650707616cf6e3462009dab400d881d5619188c50c843a4ee53e","observation_id":"efdd36fd-b80e-40ce-bafc-1528368d175e","resolution":{"observed_at":"2026-08-12T18:23:11.555887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.533479Z","title":"Real-time optimal power flow,","venue":null,"work_id":"74f30c4d-982f-48a8-8099-bc0af105c129","year":2017},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.698930Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:18968bb26309835f16477a1e2e304b73dc5a504634524192966a193738ed2fca","observation_id":"68f88fb4-61ef-437e-b2b1-98976da2304e","resolution":{"observed_at":"2026-08-12T18:23:11.538326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.516943Z","title":"Exact robot navigation using power diagrams,","venue":null,"work_id":"4b09f7a0-b16a-4242-9350-1c70e4fbce18","year":2016},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.704607Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:2325e33065eb76fd6f7ba4a0aa75afe3e4cef538edcc0778247ddda01bfffe46","observation_id":"139649f7-7ae4-4e2e-b137-cada3bc7b970","resolution":{"observed_at":"2026-08-12T18:23:11.521984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.500831Z","title":"Optimal power flow pursuit,","venue":null,"work_id":"b39a8a77-24b9-433b-88fb-44551c91495f","year":2016},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.710350Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:e02b731edf3e996947c2dd2db494f869565c55c2cb3eb1f525d8eed770b2c33e","observation_id":"db0cd168-7cff-425e-a04d-ca97b005c8f7","resolution":{"observed_at":"2026-08-12T18:23:11.505523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.482560Z","title":"Coordinated control of multi-robot systems: A survey,","venue":null,"work_id":"4682a3b9-56d7-45a7-89a8-c6ae6a443e01","year":2017},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.715709Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:f1ac5ea97769acc10c83fbfd9782915583c9451fbcdf1569fdcf04ce74d88c42","observation_id":"72688198-e30d-4593-834c-f56d2c07e7f7","resolution":{"observed_at":"2026-08-12T18:23:11.488505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.465425Z","title":"A class of prediction-correction methods for time-varying convex optimization,","venue":null,"work_id":"c4c37a13-6798-4773-9e18-dd195400fa78","year":2016},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.720985Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:880cfc6766305a7d1c36a3022214a7bc8a1c8a3b13a845e0819589640e4b3356","observation_id":"f2bd20ed-3da3-4056-bcff-3b7b8ca778a9","resolution":{"observed_at":"2026-08-12T18:23:11.470483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.448708Z","title":null,"venue":null,"work_id":"4012ac29-5e09-4071-9aec-7dc30b4e9200","year":1989},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.726466Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:2cdc90a0f2872ebf6fee4e22fed076842c05d50eb1d90444658b2588f623b409","observation_id":"c0ecab2f-65c3-475e-acb2-00a3084c3f2b","resolution":{"observed_at":"2026-08-12T18:23:11.454404Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.431553Z","title":"Asynchronous parallel nonconvex optimization under the polyak-łojasiewicz condition,","venue":null,"work_id":"1cde1cef-7297-4b62-a990-811b649a4a5a","year":2021},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.731756Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:ad26068243975a107a57fa5f6964fc7e9a017d1354dece6abd6a8443265fa447","observation_id":"1b79c71e-4e46-4647-a6fa-feaab57f59b4","resolution":{"observed_at":"2026-08-12T18:23:11.437347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.413112Z","title":"Asynchronous optimization over graphs: Linear convergence under error bound conditions,","venue":null,"work_id":"35587f50-6ff7-4d59-9b80-4896d436da7a","year":2020},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.737856Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:7f24a556ab98537b451941302e76ce500f1514caef2909e934e7d25beb4e204d","observation_id":"d71d4afa-fa01-4e21-8012-b99f047c7f93","resolution":{"observed_at":"2026-08-12T18:23:11.418238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.396413Z","title":"On the rate of convergence of a partially asynchronous gradient projection algorithm,","venue":null,"work_id":"7a38718d-717c-41fe-a830-ceeda449dd44","year":1991},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.744337Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:95e24e9015865f6ca388237214c46ab02e7d1321a2d3230550d2a17e33a7c308","observation_id":"0769faab-0173-4266-b79f-cfe24d786c92","resolution":{"observed_at":"2026-08-12T18:23:11.401678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.380578Z","title":"Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem,","venue":null,"work_id":"7c81c4e0-734b-4511-bd06-457d5219a17d","year":1992},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.753355Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:1e9a7f5a6d7059f6cdb6763f2bae3d6409c08dd9dacd52dbaf134500e3f717c4","observation_id":"a3663176-131d-4d98-97f4-6270c18ded48","resolution":{"observed_at":"2026-08-12T18:23:11.385965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.363270Z","title":"Totally asynchronous large-scale quadratic programming: Regularization, convergence rates, and parameter selection,","venue":null,"work_id":"232f4bb0-a298-48f6-a54c-f450a425f42b","year":2021},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.758116Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:748a58d40e61a64d1303939021eafcae3d0194aedde3826b6b869730e04c2919","observation_id":"b8b20d37-1cbe-4fb3-8d53-4850487f62df","resolution":{"observed_at":"2026-08-12T18:23:11.368985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.344274Z","title":"Totally asynchronous primal-dual convex optimization in blocks,","venue":null,"work_id":"d35ace39-42cd-4981-8b28-8956bbe2c5d0","year":2023},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.762897Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:5007516dab394d8eddb44252486f06c07de9c241e802d220f4e77a7f10218a1e","observation_id":"a5a9b863-6c8e-445f-8026-41d0771703b2","resolution":{"observed_at":"2026-08-12T18:23:11.350694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.325459Z","title":"Decentralized weapon–target assignment under asynchronous communications,","venue":null,"work_id":"5d38d016-624a-4937-84db-c26cee78af0a","year":2023},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.768669Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:99ddf3d6b9978f84668ddc3427018b0764883a7d06d803acc89908a7c20410e2","observation_id":"c28b9675-2af5-41ae-a461-9a256212a547","resolution":{"observed_at":"2026-08-12T18:23:11.332070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.307383Z","title":"A totally asynchronous algorithm for time-varying convex optimization problems,","venue":null,"work_id":"a8bbff01-eba7-4f11-9c05-707e36b90331","year":2023},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.775142Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:0c8e59290438a2b81d48fb3100d755cd2e2cdeb48ef97609c105110fbb1e60bd","observation_id":"d33b4f8e-4dbb-4009-9529-d8cbf6d7798e","resolution":{"observed_at":"2026-08-12T18:23:11.313695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00646","last_updated":"2023-12-01T15:18:27Z","snapshot_observed_at":"2026-08-13T05:12:22.405328Z","submitted_at":"2023-12-01T15:18:27Z","title":"Distributed Asynchronous Discrete-Time Feedback Optimization","version":1},"cited_work":{"arxiv_id":"2312.00646","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.00646","snapshot_observed_at":"2026-08-12T18:23:10.944643Z","title":"Distributed Asynchronous Discrete-Time Feedback Optimization","venue":"math.OC","work_id":"806ef15e-b8a9-44c2-90cf-b702ad572c39","year":2023},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.787261Z"},"links":{"cited_paper":"/paper/2312.00646","citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:871c8bbaff9886d1706373ffd0394b9fc5337af3a25011606c143db02d7378b9","observation_id":"0965cb09-ad4b-4bff-9e1b-b5a437c6e287","resolution":{"observed_at":"2026-08-12T18:23:10.952987Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.287478Z","title":"Solving time-varying quadratic programs based on finite-time zhang neural networks and their application to robot tracking,","venue":null,"work_id":"40fc12de-73c9-4c63-ad1f-f5e98bcf7a64","year":2015},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.792596Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:d9bc0bd1aef854c4fb6ab0478c76c01244c11729c779777bd608022f80fcdea5","observation_id":"3815c1b0-9d07-4629-8aa1-7be17cb7e681","resolution":{"observed_at":"2026-08-12T18:23:11.294182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.269629Z","title":"Dynamic neural networks for kinematic redundancy resolution of parallel stewart platforms,","venue":null,"work_id":"f768ea9d-739e-4289-8e38-114bebb062b7","year":2015},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.797531Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:ed37e1311c13710fdb6d8d7e5470bd000782bef8c108a629425c6298a1ae87ed","observation_id":"24fa993a-c1f8-484c-926f-cb24b3f9fbbc","resolution":{"observed_at":"2026-08-12T18:23:11.275548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.252193Z","title":"Quadrupedal locomotion via event-based predictive control and qp-based virtual constraints,","venue":null,"work_id":"717a3ef1-6373-448a-9bba-f54783dcb02c","year":2020},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.803210Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:1080c808992f93e797dcbf609f2b22ae5270bc8b36748ed6c00044af47146314","observation_id":"2a51857b-eee7-4872-81f5-fc4b166e7657","resolution":{"observed_at":"2026-08-12T18:23:11.257439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.237098Z","title":"Constrained nonlinear control allocation with singularity avoidance using sequential quadratic programming,","venue":null,"work_id":"66d783c3-4c6f-4952-9372-21eaf4b9d3eb","year":2004},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.807899Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:d878d09b2c39ad93460310e49b2d7ebff184399e53686ba4960787df35997b8a","observation_id":"ed2565a1-b20f-4aa2-8819-de30c70eb47f","resolution":{"observed_at":"2026-08-12T18:23:11.242008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.221357Z","title":"Real-time convex optimization in signal processing,","venue":null,"work_id":"3d733b60-c6cb-42a1-ad25-c19c481d07de","year":2010},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.812416Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:1a012887bbef9282ec01963dd61d7951c6022599d3031169e4bf9965841ccb7e","observation_id":"1955955c-9f41-4eb2-b5ca-a9bc3ca8269c","resolution":{"observed_at":"2026-08-12T18:23:11.226161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.205616Z","title":"A barrier varying-parameter dynamic learning network for solving time-varying quadratic programming problems with multiple constraints,","venue":null,"work_id":"89446e4a-4429-477b-947a-52f23b044ca2","year":2021},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.817052Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:8eef1a74215aca38962a0d5c2642f67f12ba98ad91b77623ca2add843f6c91fe","observation_id":"6cfa41e4-025e-4370-b66c-29e70a8e82ac","resolution":{"observed_at":"2026-08-12T18:23:11.210673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.189670Z","title":"Distributed continuous-time convex optimization with time-varying cost functions,","venue":null,"work_id":"82790b6e-3a38-4a2a-ab7b-dfd680318712","year":2016},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.821919Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:2a8ac410a481e2b2ff33ecb8cc2221431c91c4f4a8b365127bdacc2720cd3843","observation_id":"60736a2b-44eb-4137-876e-ad39d3b1bbe5","resolution":{"observed_at":"2026-08-12T18:23:11.194807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.172449Z","title":"Distributed continuous-time algorithm for time-varying optimization with affine formation constraints,","venue":null,"work_id":"cfe8a28c-956a-48ed-babc-9ebc3db10276","year":2022},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.826920Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:acd16c38133a0a653898326f87e99324c3db9939ef0e547a9881f5442d36a717","observation_id":"2bff0b0b-dc88-4490-b4fe-ed2c79b143a5","resolution":{"observed_at":"2026-08-12T18:23:11.178174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.154747Z","title":"Asynchronous and distributed tracking of time-varying fixed points,","venue":null,"work_id":"32a58ae3-2c5a-4872-985d-aa589aa9cf74","year":2018},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.833457Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:20c4ef5697b31877767aa63755c1a8e13f3ff12a2da0f13053edcc6e96af55ff","observation_id":"82983d0a-ee0a-4e43-bc26-99a6ddb46ff9","resolution":{"observed_at":"2026-08-12T18:23:11.160321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.139547Z","title":"Decentralized prediction-correction methods for networked time-varying convex optimization,","venue":null,"work_id":"7e54ef64-406f-445d-bfed-19c46b0087cd","year":2017},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.841622Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:5d52454fd97726cb23a75a45c80052691efb80e548c2b78561fbe9caddff944c","observation_id":"2608f296-c2a2-4be6-b3a1-b3f2b1478461","resolution":{"observed_at":"2026-08-12T18:23:11.144614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.123532Z","title":"Decentralized dynamic optimization through the alternating direction method of multipliers,","venue":null,"work_id":"27b551df-c3cf-4ee3-b2be-8f24715a6e64","year":2013},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.847978Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:8db93be0001051edd63157710dc694aff5f9686488e9f2268e7e396e928296ac","observation_id":"59414b45-6206-4e84-abd1-08d4cde784b5","resolution":{"observed_at":"2026-08-12T18:23:11.128950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.108297Z","title":"Distributed online convex optimization with time-varying coupled inequality constraints,","venue":null,"work_id":"238b764f-4605-4d41-8802-224993fb8178","year":2020},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.853764Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:d74bb9a6b4475c1d9734bb6f6003a81128f42ccff51f6745d477579e71e0e8d0","observation_id":"e82ff74a-f061-4968-8c08-9e31f3c49f40","resolution":{"observed_at":"2026-08-12T18:23:11.113210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.093436Z","title":"A parametric nonconvex decomposition algorithm for real-time and distributed nmpc,","venue":null,"work_id":"061a2665-7433-4768-9f34-b0ddbb3c7f0c","year":2015},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.858798Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:4d1c56b26f907afa73f23f8f03a79fbfd45acdd2b2f294d521e89aa7945330e8","observation_id":"78d2785c-a06e-458c-a119-2d933e12f2de","resolution":{"observed_at":"2026-08-12T18:23:11.098077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.075365Z","title":"Discrete and continuous-time soft-thresholding for dynamic signal recovery,","venue":null,"work_id":"ddd43323-b523-4ac0-afd2-7f896152d5d4","year":2015},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.864917Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:a9e1a8007402181ce5dbe7b2c2c5d1209303298883545fc5ab697146d8d7feaf","observation_id":"0dfe37f1-e97c-479f-8b13-6ba1e33c96ad","resolution":{"observed_at":"2026-08-12T18:23:11.082255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.057938Z","title":"Timescale separation in autonomous optimization,","venue":null,"work_id":"e13ac756-103f-4d94-bc70-a7494078f457","year":2020},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.870031Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:bbffb780fed6a03dbaeb39d3f42aa209378414355229986d22baf6f0f12dcbb1","observation_id":"973aa4ec-be10-45bd-8b81-ef21c50324cf","resolution":{"observed_at":"2026-08-12T18:23:11.063254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.038885Z","title":"Online optimization as a feedback controller: Stability and tracking,","venue":null,"work_id":"a365e145-0196-42f6-ba17-22cab75278a8","year":2019},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.875084Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:9674770b6736fa040882ee5aab9ca70e1acefe586c9f1792d33eedf74f2f6aec","observation_id":"52eb8ed6-c716-41ac-b0ca-40b77fcc26b8","resolution":{"observed_at":"2026-08-12T18:23:11.044593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.021628Z","title":"Differentially private distributed convex optimization via functional perturbation,","venue":null,"work_id":"de08705e-cfd5-4dd5-bd4a-71cbbd31babf","year":2016},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.881212Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:7b4a28cd61ea5bdfd183a1ca020f5281aa34e4ef072bdf5cb335686d0f64a71f","observation_id":"d15d85c7-874e-4103-8b08-52fdc1d546f5","resolution":{"observed_at":"2026-08-12T18:23:11.027460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:11.002374Z","title":"Convergence rate for consensus with delays,","venue":null,"work_id":"f3bccfb2-9c4b-4c6f-b010-6fb10229a2f5","year":2010},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.886973Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:6107b0e5be01cbf49247ef1ff53f816b78c0d4359906b1f21dba37f75fae9587","observation_id":"7b9884b7-38f5-4158-966d-f375923702e5","resolution":{"observed_at":"2026-08-12T18:23:11.008212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:10.984529Z","title":"Asynchronous iterations in optimization: New sequence results and sharper algorithmic guarantees,","venue":null,"work_id":"fc108d6c-4ffd-4f15-817b-e3ebff4ab58c","year":2023},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.891886Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:bff27e1e0a904110384953db8a06727d00b9e15bef82051335cd80795f1b371f","observation_id":"f505d146-9a79-4903-bc57-b1fad5b9a4c5","resolution":{"observed_at":"2026-08-12T18:23:10.989808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T18:23:10.966122Z","title":"Faster asynchronous nonconvex block coordinate descent with locally chosen stepsizes,","venue":null,"work_id":"509034fa-1c40-4e11-8bc5-c581643121bc","year":2022},"citing_paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T18:23:10.896687Z"},"links":{"citing_paper":"/paper/2411.11732"},"observation_digest":"sha256:e239c480fb70ed54aef2e402e7e1d4307cbb97987093fba8ecf2513b9a8fbbd8","observation_id":"8c7424dd-ecec-465e-b41e-3375cc293a64","resolution":{"observed_at":"2026-08-12T18:23:10.971686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.11732","last_updated":"2025-08-20T13:57:05Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T07:26:03.508006Z","submitted_at":"2024-11-18T17:00:18Z","title":"Distributed Asynchronous Time-Varying Quadratic Programming with Asynchronous Objective Sampling"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":37},"total_outbound_references":39},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2411.11732."}