{"as_of":"2026-08-14T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ed6af84536f263b778c2e9c352791b9050d4710ad267a21c834ddbd47465a47","coverage":[{"denominator":92,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":92,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:42:39.055335Z","state":"measured"},{"denominator":94,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":94,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:46:55.043461Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T04:37:31.889336Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"cited_work":{"arxiv_id":"2502.05028","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05028","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"14d40ab8-017f-4fa1-a0af-a013477aaa25","year":2025},"citing_paper":{"arxiv_id":"2502.00709","last_updated":"2026-04-16T23:58:55Z","snapshot_observed_at":"2026-08-03T02:52:29.636832Z","submitted_at":"2025-02-02T07:49:56Z","title":"RankFlow: A Multi-Role Collaborative Reranking Workflow Utilizing Large Language Models","version":5},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-23T04:36:32.897387Z"},"links":{"cited_paper":"/paper/2502.05028","citing_paper":"/paper/2502.00709"},"observation_digest":"sha256:1b2da4c54e0cfb2581ba3c1fd29af303a194eaf2dee62039c95e6b6615ffcc37","observation_id":"3c9f5127-ffff-4c9b-be23-4dc9e2d7505d","resolution":{"observed_at":"2026-05-23T04:37:31.892450Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05028","snapshot_observed_at":"2026-08-02T21:46:55.043461Z","title":"Near-optimal online learning for multi-agent submodular coordination: Tight approximation and communication efficiency,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.19366","last_updated":"2026-07-29T17:53:56Z","snapshot_observed_at":"2026-08-10T14:23:40.446580Z","submitted_at":"2026-02-22T22:36:37Z","title":"Self-Configurable Mesh-Networks for Scalable Distributed Submodular Bandit Optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T21:46:55.043461Z"},"links":{"cited_paper":"/paper/2502.05028","citing_paper":"/paper/2602.19366"},"observation_digest":"sha256:54b84f8dac993ea002181c7e249fae7024d96199cee64106887c27a90c58ff5c","observation_id":"841b139f-0f3e-4f7d-9973-78346f07a5b2","resolution":{"observed_at":"2026-08-02T21:46:55.043461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05028/citation-record","integrity":"/paper/2502.05028/integrity","json":"/paper/2502.05028/citation-record.json","paper":"/paper/2502.05028"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.767840Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.767840Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:4f6bcc253320b80a937e219ee9c7a174e8ab91068392277339f9b41b9d6de224","observation_id":"1ffd6084-83e9-4e2a-9084-a3369e19c9c9","resolution":{"observed_at":"2026-08-08T20:42:38.767840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.772412Z","title":"Finding approximate local minima faster than gradient descent","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.772412Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:4e8a4a8aede8c93dfba7420f889ee8113883a267cb86a913ca6219f57c808525","observation_id":"fd425a4a-04a1-4fd9-b8ae-ea2fae9231ca","resolution":{"observed_at":"2026-08-08T20:42:38.772412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.775691Z","title":"New local search approximation techniques for maximum generalized satisfiability problems","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.775691Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:99a0b03715222542d82ec0510c406b2309de420eb13d676f24395249d87e3a9f","observation_id":"8afee5fb-b6c2-446b-a0be-ccad8af1d488","resolution":{"observed_at":"2026-08-08T20:42:38.775691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.779186Z","title":"Decentralized active information acquisition: Theory and application to multi-robot slam","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.779186Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:a33fbca00b6c60b1116bbbd7da0910cab276afe152fee96d0aa78a30162b41a0","observation_id":"b347439d-b1d9-4816-bc14-de8c5c90df95","resolution":{"observed_at":"2026-08-08T20:42:38.779186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.782581Z","title":"Diverse client selection for federated learning via submodular maximization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.782581Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:6bcd99561bd24d2eb0ad2aed226b632aeaaa63e75d42fb79f30143d1bae3b3f9","observation_id":"b0e31e14-e587-47a7-ade5-56722d1c19bf","resolution":{"observed_at":"2026-08-08T20:42:38.782581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.786073Z","title":"Joint and separate convexity of the bregman distance","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.786073Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:b473312b1e5add9722cb0a22ff1aee400decd78a68ac0ed805d9a603b7b71430","observation_id":"85a91d2c-8e24-422f-af13-bdccc53ef75d","resolution":{"observed_at":"2026-08-08T20:42:38.786073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.789609Z","title":"Guarantees for greedy maximization of non-submodular functions with applications","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.789609Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:1facfe8c26a9e80b97f539bb46a2d98ce70eec069a7d2b17458a51af42055342","observation_id":"211ab686-ccf1-4d38-9c35-e57b3fd3f91e","resolution":{"observed_at":"2026-08-08T20:42:38.789609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.793092Z","title":"Guaranteed non-convex optimization: Submodular maximization over continuous domains","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.793092Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:26af91c80a57030052c8cf78e7b7160ac9b0143fbf8cc70605654340499c41e4","observation_id":"96b79496-8d8b-4867-a955-b5cb95356640","resolution":{"observed_at":"2026-08-08T20:42:38.793092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13474","last_updated":"2020-06-24T04:37:31Z","snapshot_observed_at":"2026-08-13T19:48:09.995083Z","submitted_at":"2020-06-24T04:37:31Z","title":"Continuous Submodular Function Maximization","version":1},"cited_work":{"arxiv_id":"2006.13474","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.13474","snapshot_observed_at":"2026-08-08T20:42:39.127635Z","title":"Continuous Submodular Function Maximization","venue":"cs.LG","work_id":"5a320d7b-adaf-44ab-b345-53c89fdbcdaa","year":2020},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.796257Z"},"links":{"cited_paper":"/paper/2006.13474","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:1fb72135b297bccb5ebbe78ea58618e051458292e374f496e3df8ff3d3d9faef","observation_id":"735617f8-0527-41f1-a05f-e4ffe588bf87","resolution":{"observed_at":"2026-08-08T20:42:39.131506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.800072Z","title":"An o (n) algorithm for quadratic knapsack problems","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.800072Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:e4374e1ee0266506d467e7fe61c72192afc3ded1a77a9a7b4591ade7af68d5c9","observation_id":"a5d42909-6a14-450f-9129-9da80dbbac1d","resolution":{"observed_at":"2026-08-08T20:42:38.800072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.803183Z","title":"Maximizing a monotone submodular function subject to a matroid constraint","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.803183Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:2c7ea8015df88c2b24a8e70cc0fb8461e5e9261c1739a3a6fc91e6f3bda822bd","observation_id":"08bdf84b-4e0e-4a41-a396-f8192ae1ffe8","resolution":{"observed_at":"2026-08-08T20:42:38.803183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.806560Z","title":"Submodular function maximization via the multilinear relaxation and contention resolution schemes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.806560Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:67c05a0c1ad5e964c695c388f6a0e8b715dd45a9b9c30f79249754350867024c","observation_id":"e7616ff2-9492-4119-bbdf-347547b834d8","resolution":{"observed_at":"2026-08-08T20:42:38.806560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.809851Z","title":"Convergence analysis of a proximal-like minimization algorithm using bregman functions","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.809851Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:b939357f3a7381412483f965b97a337b769bc9f54f670b2f229a7b91e19f254b","observation_id":"1e9f560a-aa89-4edb-8f0e-e5dfe34b589a","resolution":{"observed_at":"2026-08-08T20:42:38.809851Z","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-08T20:42:39.818228Z","title":"Online continuous submodular maximization","venue":null,"work_id":"05445a0f-37f4-44c4-97d7-c57d08795c76","year":1905},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.812818Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:9ac4d917a7c3ada51ad03cb3a0ec56cc0f24555b3ed004cc13c23e1a0ae89ad2","observation_id":"56610edd-6f0c-4a33-bc28-5603509efba6","resolution":{"observed_at":"2026-08-08T20:42:39.821388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.808332Z","title":"Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem","venue":null,"work_id":"00f99dcc-1f58-4642-ae0a-f50b53dcae58","year":1984},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.816041Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:2b9674e4c25dd8bb63243695b2d62009bc7e03fe681c945c3cf8fd78b9b7fee2","observation_id":"91f28cb1-a94e-41e7-811f-f617e784076e","resolution":{"observed_at":"2026-08-08T20:42:39.811958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.798047Z","title":"Scalable distributed planning for multi-robot, multi-target tracking","venue":null,"work_id":"be7205d7-82ab-4894-86cf-80ee67b7451a","year":2021},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.819215Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:03c3386fc364d62ab429f13ab8cf2980d856ce68e44c604c68875d1e8e290233","observation_id":"b54dc5ee-2cbd-4aaf-b4f4-4453d021a780","resolution":{"observed_at":"2026-08-08T20:42:39.801841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.788797Z","title":"Approximate submodularity and its applications: Subset selection, sparse approximation and dictionary selection","venue":null,"work_id":"f9c82b9c-ac84-45ba-9dd3-c70c018a2039","year":2018},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.822214Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:857886572dace0aa71c133e4919d4c2c127e5faf6a3f78b1960d9cac7e7ac4ff","observation_id":"405bef8a-8cb0-4609-8ec1-f99f9494fce8","resolution":{"observed_at":"2026-08-08T20:42:39.792253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.779723Z","title":"Jacobi-style iteration for distributed submodular maximization","venue":null,"work_id":"7e0f29ae-6168-4e8a-b479-19c300cca415","year":2022},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.825110Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:3d7b1748339f83d53e043375c1dc2565cca595ac7cc7ee52ebd20ec3d7a3bf0d","observation_id":"9d7a75bf-aacc-4082-97a4-10ce12be01d8","resolution":{"observed_at":"2026-08-08T20:42:39.782903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.769858Z","title":"Turning down the noise in the blogosphere","venue":null,"work_id":"2e8a57e8-5770-4369-8535-0ab224c3fb37","year":2009},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.828193Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:dd088af01becff0ee16dc231138d642eab0bf2d37a5f0990e5e208df2edaa022","observation_id":"fad66a8d-3036-4844-acd3-85fc0d6a9319","resolution":{"observed_at":"2026-08-08T20:42:39.773133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.760407Z","title":"Combatting dimensional collapse in llm pre-training data via diversified file selection","venue":null,"work_id":"fe7a5e08-11bd-410f-bd0e-f7da3976a010","year":2025},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.831561Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:cbd5e072b6f74c82d49584469a5bd17d31d5be191c9867f9ba836e1cf9bb22c8","observation_id":"5e582203-b46d-40d3-887c-1c9575593b0f","resolution":{"observed_at":"2026-08-08T20:42:39.763796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.834528Z","title":"Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.834528Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:4dd86aa0c120c3698646c4969c8c7c2ed449e181356dd7a1d1f213ca355cdc4e","observation_id":"3ac6586e-240b-4d57-be7b-afc2ffa7e280","resolution":{"observed_at":"2026-08-08T20:42:38.834528Z","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-08T20:42:39.744879Z","title":"The power of local search: Maximum coverage over a matroid","venue":null,"work_id":"f3ce4198-efed-44c6-9917-779b8a1c5e9b","year":2012},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.837627Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:eaacf5910db98a1a970cecc76f067ee41bbec2a2f8cbe9eefe8851c2299e10a0","observation_id":"a614f48d-abb6-444a-9bef-3d3172f5d676","resolution":{"observed_at":"2026-08-08T20:42:39.747913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.735715Z","title":"Monotone submodular maximization over a matroid via non-oblivious local search","venue":null,"work_id":"6ebe9ed6-d3a8-486b-bb8a-c1aa76b53a99","year":2014},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.840630Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:05eccc44c21b43bbc9d029055b6f03a01fdc23a3396b0c9e00577edc3c692430","observation_id":"b739f55c-1de4-4fe2-ba30-57a22f3d249c","resolution":{"observed_at":"2026-08-08T20:42:39.739033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.722942Z","title":"An analysis of approximations for maximizing submodular set functions—ii","venue":null,"work_id":"8a44591f-6b74-4832-8984-d9c76d0f5696","year":1978},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.843715Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:ca1465973e973dae361f39a2c2119d00729621a6845268a0368766e7c650f331","observation_id":"d577e217-d436-4412-84d3-45e6f6e7fb18","resolution":{"observed_at":"2026-08-08T20:42:39.726876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.713177Z","title":"On the convergence of distributed stochastic bilevel optimization algorithms over a network","venue":null,"work_id":"f59895ac-80a2-4297-9c8d-d105e48be69d","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.846800Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:d2418f7dfcfe65d50a5816a3a1a73a4f9f947c6ead1e1feba90bac3e1a07d67d","observation_id":"5099a28a-370a-4538-8726-46d02f2f27e8","resolution":{"observed_at":"2026-08-08T20:42:39.716494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.703681Z","title":"Distributed submodular maximization with limited information","venue":null,"work_id":"2e4bbff7-db8f-44f3-9427-d5050b79c5ed","year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.849989Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:592750225425672c8aca2ac19d03bd5a9fb59785e4c9c8ca29cdb193d75911df","observation_id":"55ff0fca-0707-4a24-b20a-aaf5d80041c8","resolution":{"observed_at":"2026-08-08T20:42:39.706977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.693918Z","title":"Cvx: Matlab software for disciplined convex programming, version 2.1, 2014","venue":null,"work_id":"49370dfd-a9bc-4b06-9d37-b36229a7a7af","year":2014},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.852943Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:432e2ecc91c1d9246daddc92bdcbc011a0e6bdcf61382cd538a3018ae05e5bc2","observation_id":"b2a74da4-7946-4ef8-ae9a-74df38d0de01","resolution":{"observed_at":"2026-08-08T20:42:39.697216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.684889Z","title":"The impact of information in distributed submodular maximization","venue":null,"work_id":"334ffb0a-f769-46b0-bb92-8296e13ece58","year":2018},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.857113Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:c61c3c5a74e9e7c2725c4b142854073af2780736c75cd66016d1add5ae2625b1","observation_id":"65e95097-b2a3-4efc-9c20-b3d81c62d959","resolution":{"observed_at":"2026-08-08T20:42:39.688144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.675490Z","title":"Gradient methods for submodular maximization","venue":null,"work_id":"2b6399c5-1a6d-4764-aa8e-ea305ddc96c1","year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.860098Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:9aadf803cfabd048a2321a837d2c1df03a0815fe1c841cdd0df902f62ec6b6bf","observation_id":"e178d3cc-693a-4ae9-9a49-e1f677848996","resolution":{"observed_at":"2026-08-08T20:42:39.678783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.862951Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.862951Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:2828ca14a0bdf826f96d7116a0ac330e0663eea9dc7a184234c35833ef06f10a","observation_id":"80e102ef-1adf-4214-b993-dfaad01ef345","resolution":{"observed_at":"2026-08-08T20:42:38.862951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.866000Z","title":"Matrix analysis","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.866000Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:d8f1978591ff35131808e4817243f1d49ceef1f3ccad48d1245af1ce07bed6de","observation_id":"a1ef63ba-e763-44f9-9724-4f76bacb80d8","resolution":{"observed_at":"2026-08-08T20:42:38.866000Z","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-08T20:42:39.654367Z","title":"Online optimization: Competing with dynamic comparators","venue":null,"work_id":"4df42bab-d450-4188-b06b-94c6c2aa2116","year":2015},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.868886Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:9062bad6a3be8c3acf7e3e499d337beedf46796832ec09c9285fa24e21f262de","observation_id":"0f3de1c3-26bf-4bc6-b2d7-8cac6049c977","resolution":{"observed_at":"2026-08-08T20:42:39.657892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.645157Z","title":"Metaxas, and Marco Pavone","venue":null,"work_id":"cdcaef55-db25-41e4-b84a-ccf1c599d5cb","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.871663Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:c98bc863d4ed75fac868a3869bd4ae01f980fbdb7ee5b8db51615ae57e65a462","observation_id":"61a76936-4fd3-465b-bbee-b604093b4c65","resolution":{"observed_at":"2026-08-08T20:42:39.648337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.635806Z","title":"Visual prompting upgrades neural network sparsification: A data-model perspective","venue":null,"work_id":"adf759d4-f30f-4e64-8d65-6b08c0fb1a47","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.874534Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:447aa3ab0d8f94eff97b79194fe494bd4c11613844551f15370b863574bf18b6","observation_id":"72cfd201-d0a8-4e82-843b-a0bd0dcbd67a","resolution":{"observed_at":"2026-08-08T20:42:39.638941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14449","last_updated":"2025-05-20T02:36:54Z","snapshot_observed_at":"2026-08-13T21:56:48.611481Z","submitted_at":"2024-06-20T16:11:45Z","title":"APEER: Automatic Prompt Engineering Enhances Large Language Model Reranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14449","snapshot_observed_at":"2026-08-08T20:42:38.877409Z","title":"Apeer: Automatic prompt engineering enhances large language model reranking","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.877409Z"},"links":{"cited_paper":"/paper/2406.14449","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:658a73009fa751979531aecd1957f993cefa780c689e8d68be5db8e09bc3b30f","observation_id":"fd4e926d-5de4-415c-afbc-953b5cd03ac8","resolution":{"observed_at":"2026-08-08T20:42:38.877409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.881036Z","title":"How to escape saddle points efficiently","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.881036Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:df7e648249b28b44b0e88704e05298f7d34b2949646fee6f150c4943e064e2bb","observation_id":"b1d732c1-175b-4700-be27-9baa2c0e9a13","resolution":{"observed_at":"2026-08-08T20:42:38.881036Z","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-08T20:42:39.620855Z","title":"Playing games with approximation algorithms","venue":null,"work_id":"3298e12f-97f3-4072-a080-e4e35e6ccf43","year":2007},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.884050Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:e97e1c921dd6cfe9a5c6541f6684cd18f6025442a59161f7ba62f26b661b5eee","observation_id":"4e4093bb-bac0-4b9a-a8ac-0e3f0e058444","resolution":{"observed_at":"2026-08-08T20:42:39.624003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.611758Z","title":"Maximizing the spread of influence through a social network","venue":null,"work_id":"487baa34-714f-4552-af44-aa0adfa0590e","year":2003},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.887016Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:4d642e15f23b04c2e9d894ec4d2194850e8f0fc3e6d9a966b84135462892d0ba","observation_id":"d3416e02-59b7-449a-826b-fa8c5ef6af12","resolution":{"observed_at":"2026-08-08T20:42:39.614990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.602341Z","title":"On syntactic versus computational views of approximability","venue":null,"work_id":"8b99c95f-7920-4954-9b39-893be810dbf0","year":1998},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.890126Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:ff3e35f6c752884832d25032ef342907e9e97d548bba92204b640c23af2f025c","observation_id":"3c7fb20d-a036-43e9-b4a2-e5c4ad4d21ee","resolution":{"observed_at":"2026-08-08T20:42:39.605625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.593200Z","title":"Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies","venue":null,"work_id":"6e9aee00-241c-4f41-a140-af5da4528255","year":2008},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.892986Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:97d9fb3d7764122b6f779cefb7f01e1501394eb5d944cb84b39ee2843ee5cb00","observation_id":"25755990-8aa5-443c-8f02-eb2b54615a31","resolution":{"observed_at":"2026-08-08T20:42:39.596584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.584125Z","title":"An end-to-end submodular framework for data-efficient in-context learning","venue":null,"work_id":"8a9e9881-f872-43be-b4a0-a77183a3f33f","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.896095Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:595ebeb00bf98d3e2bfa46811b4d250fa1d0f1990b4351aa818c7980fc2e3e96","observation_id":"de3ecbf3-94d9-4672-bb94-101055ab04ab","resolution":{"observed_at":"2026-08-08T20:42:39.587636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.00345","last_updated":"2016-07-01T18:37:33Z","snapshot_observed_at":"2026-07-06T05:02:06.677337Z","submitted_at":"2016-07-01T18:37:33Z","title":"Convergence Rate of Frank-Wolfe for Non-Convex Objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.00345","snapshot_observed_at":"2026-08-08T20:42:38.899009Z","title":"Convergence rate of frank-wolfe for non-convex objectives","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.899009Z"},"links":{"cited_paper":"/paper/1607.00345","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:5e7cf7daa06f54fb1037bac4c5c0c5eae50d98db003c5c993f9794df7d6970e6","observation_id":"efec36ff-7a33-4551-bf1d-c5088b04b380","resolution":{"observed_at":"2026-08-08T20:42:38.899009Z","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-08T20:42:39.575329Z","title":"Functional analysis","venue":null,"work_id":"009bf47c-a7d4-46f9-9e10-a170cfd7aaa7","year":2014},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.902555Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:b627ccf97bfd37e2a4c7b9714689a3434cb7f7589b50b217f20c2ef6f1bd57c1","observation_id":"c75a0072-e53f-4d07-b8c4-961235d0a931","resolution":{"observed_at":"2026-08-08T20:42:39.578488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.566185Z","title":"Submodularity of optimal sensor placement for traffic networks","venue":null,"work_id":"e2405b1d-1e74-46a7-a492-d900c4f0cf32","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.905863Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:bc0a1157f38d4dffa079a9574a5cc86bb9dfb673c791975d63544b49fa93e2be","observation_id":"2970570c-bba9-41c5-a2dd-38d6cc47f3e7","resolution":{"observed_at":"2026-08-08T20:42:39.569450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18442","last_updated":"2023-05-29T02:54:31Z","snapshot_observed_at":"2026-08-13T11:30:37.266281Z","submitted_at":"2023-05-29T02:54:31Z","title":"Improved Projection-free Online Continuous Submodular Maximization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18442","snapshot_observed_at":"2026-08-08T20:42:38.909277Z","title":"Improved projection-free online continuous submodular maximization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.909277Z"},"links":{"cited_paper":"/paper/2305.18442","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:03c31dd5614ffce010d55fd50a2d0c9bf8ce3720091acef4bd5c4a6a0d554500","observation_id":"9b9be261-c349-4d23-ae51-167feb4682ff","resolution":{"observed_at":"2026-08-08T20:42:38.909277Z","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-08T20:42:39.556688Z","title":"Multi-document summarization via budgeted maximization of submodular functions","venue":null,"work_id":"38d0fd5b-fbff-46b2-be96-b7eaa78c839e","year":2010},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.912727Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:1859d19f3277192284fd975d3ac1fc7b3fdf31f5615ffa54da5c78f69553aa2b","observation_id":"0d41207c-081f-425f-8896-a3e663e321c4","resolution":{"observed_at":"2026-08-08T20:42:39.559929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.547400Z","title":"A class of submodular functions for document summarization","venue":null,"work_id":"27e5f258-1cae-430c-9fc5-6d025c85aab2","year":2011},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.915916Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:d2c22cd8c13a362fbe1db1de8d8d622a0f6717a1131c93c7fb6b6e1befd9509f","observation_id":"93ba6f4e-e2d8-41d4-a822-73b4400c9a83","resolution":{"observed_at":"2026-08-08T20:42:39.550593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.537921Z","title":"Distributed resilient submodular action selection in adversarial environments","venue":null,"work_id":"32e1debd-a2e6-48af-9d27-4be26296ca42","year":2021},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.918908Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:ffd8d9de8e21117e18a5996595685b36991db0a922a21866e723edfd17a79c2d","observation_id":"952b41f3-5ab8-4877-b798-e97763032a19","resolution":{"observed_at":"2026-08-08T20:42:39.541253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.528020Z","title":"The role of information in distributed resource allocation","venue":null,"work_id":"cc850e21-f29d-4249-839b-dbb944a988de","year":2016},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.921995Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:1096ca43d10fadd282aa98b710e9c75e6649cd24d0fd74dfdcaa77c0298a1854","observation_id":"6cd4e9ab-2e39-4f25-a598-f2fcc2dfd15d","resolution":{"observed_at":"2026-08-08T20:42:39.531412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.518198Z","title":"Fast constrained submodular maximization: Personalized data summarization","venue":null,"work_id":"eac179ec-38e0-419c-b557-e1ea11d7d8ba","year":2016},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.925032Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:53efb11922835ddab5e19c4a1b7c713686164aebda91a6448be43fb826d5ad46","observation_id":"3b81af62-9da5-434c-8fa4-c32aa2ac8b55","resolution":{"observed_at":"2026-08-08T20:42:39.521755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.508007Z","title":"Distributed submodular maximization","venue":null,"work_id":"339f7e4c-075e-4297-89d0-d57f10a0402b","year":2016},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.928187Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:f5f5335e1b9ecbdea93b6e1e1c63e2e376456db3c0a30bd094effa14a5b166eb","observation_id":"c244cf97-5c5b-4a08-9e10-3d509888f9e9","resolution":{"observed_at":"2026-08-08T20:42:39.511527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.498341Z","title":"Decentralized submodular maximization: Bridging discrete and continuous settings","venue":null,"work_id":"0262b700-85f9-4f6f-a881-84282d838314","year":2018},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.931552Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:c4ea97aa208353fd05a27a6c9bbeba5b55645ab24ac55a51a1bf5b5426388db8","observation_id":"343b0202-8e02-4a9c-b6b4-d5a016f6d8c0","resolution":{"observed_at":"2026-08-08T20:42:39.501741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.489088Z","title":"Distributed optimization over time-varying directed graphs","venue":null,"work_id":"93eac3ac-345e-4225-9c54-cd16f6186e8a","year":2014},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.934749Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:d1c3494e18f5021c6973f38a7bbbaca3d96c2eec9e8129d5277ed48957b77f43","observation_id":"47eea9fb-c388-49e0-b219-e91059290cf8","resolution":{"observed_at":"2026-08-08T20:42:39.492345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.479428Z","title":"Distributed subgradient methods for multi-agent optimization","venue":null,"work_id":"fe90aff4-9c0b-4f3c-8ef7-a64a5babd471","year":2009},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.937889Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:350acf71c5fa4b1f604360452989aeea88c7a747d63210d7375c7e96e251f078","observation_id":"d7999030-76ac-4330-b15e-281130eff157","resolution":{"observed_at":"2026-08-08T20:42:39.482660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.469713Z","title":"Achieving geometric convergence for distributed optimization over time-varying graphs","venue":null,"work_id":"ca8efd99-de4b-45c0-90aa-99a81a6d981f","year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.940957Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:529c2e30a742339877b2eb70b0a83a36d49aa572b4cf1a87df28f2668a8128a6","observation_id":"08e6250b-cb19-45e3-bbdb-67633e58965d","resolution":{"observed_at":"2026-08-08T20:42:39.473087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:38.943939Z","title":"An analysis of approximations for maximizing submodular set functions—i","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.943939Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:15bba74fb9577ecfe36ee38d12157869a19bc57ba9ce77680ed4ed9daa6040b8","observation_id":"0ed2c420-13c1-489a-98bc-4e02c6e74ded","resolution":{"observed_at":"2026-08-08T20:42:38.943939Z","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-08T20:42:39.454354Z","title":"Nemirovsky and D.B","venue":null,"work_id":"f68fea9c-a12a-4b02-b88f-07e50ed247c5","year":1983},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.946937Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:80aa633bbc11c818a5f409526554fecab9bc3c9ed65cf9213fff4573239dab45","observation_id":"769073b7-c2bd-4f74-a363-16d796cb66ca","resolution":{"observed_at":"2026-08-08T20:42:39.457633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.445257Z","title":"Introductory Lectures on Convex Optimization: A Basic Course, volume 87","venue":null,"work_id":"5b947d3a-6251-4f5f-a7e4-13e17d93ec7e","year":2013},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.950013Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:cf04a659775bf0826cc0f9f121ddb7727ccf0666779eeac2a1f3082c0a4195d7","observation_id":"01b9bc97-406c-43c3-8629-1f640822e928","resolution":{"observed_at":"2026-08-08T20:42:39.448556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.435433Z","title":"An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds","venue":null,"work_id":"56da3f53-1a61-45ee-a761-7b9074f1d25a","year":1990},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.953179Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:fb07518dd131ad048c71c295af85813619468ff28dd4f76cbbf61114fa5c0b95","observation_id":"5464934d-13b4-49e5-925c-4ae3d0db540d","resolution":{"observed_at":"2026-08-08T20:42:39.439316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.426313Z","title":"A unified approach for maximizing continuous dr-submodular functions","venue":null,"work_id":"1c41c105-3280-43f2-a729-90cbbb7c2add","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.956437Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:3695c29e5b739af15357b47f750657728a90eff46fbe12417362dce8e5e30986","observation_id":"5e0745ab-0a36-40d9-889d-38670f9dc41e","resolution":{"observed_at":"2026-08-08T20:42:39.429666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.417040Z","title":"Nadew, Christopher John Quinn, and Vaneet Aggarwal","venue":null,"work_id":"87613425-bba8-4ea1-8bf6-151d1863d9ea","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.959516Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:c5b89ed15377afcb0d81244d95d1c18339599b70fa6d76e5a6e6d8b4abdf3f5f","observation_id":"ef4d7b7b-b4e3-4574-81c7-79e37babf088","resolution":{"observed_at":"2026-08-08T20:42:39.420401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.406012Z","title":"Near-optimal multi-agent learning for safe coverage control","venue":null,"work_id":"8a1690e6-46b1-46e8-8ebe-acb7510b2b69","year":2022},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.962561Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:55000fe7b251670a31bf354249f75db8f4a5fe92e7f5877350db955491ace8dd","observation_id":"3de148ae-2b4a-480f-a274-d1c9b4d3b639","resolution":{"observed_at":"2026-08-08T20:42:39.409205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.396947Z","title":"Distributed stochastic gradient tracking methods","venue":null,"work_id":"badfaf48-c8aa-4188-b08b-e1b2647387c7","year":2021},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.965613Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:cd3fd6647a87874a618e74b1e94147855dc63f8c4881288909b603d3f763990e","observation_id":"a534abec-dede-4844-83af-69c53fa12daa","resolution":{"observed_at":"2026-08-08T20:42:39.400284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.387869Z","title":"Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions","venue":null,"work_id":"6fec830a-1ae1-440c-bea3-c3a665373545","year":2019},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.968748Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:70f82e06cdfc72321b07b9bdbc6668858ad5c94dd4cfe0446c914eeb4aa9fba5","observation_id":"a02ab6c3-7de3-4071-9fcb-61c0f912bc87","resolution":{"observed_at":"2026-08-08T20:42:39.391111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.378678Z","title":"Decomposable submodular maximization in federated setting","venue":null,"work_id":"29987614-07f8-4192-aba9-2a9164f5949f","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.971791Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:75b1b3c1247613a102b5955a32f2c17c020ca6ae225ed71ce0fb0e61ddac310f","observation_id":"744237cc-eb0c-446e-af8d-0231fce5c808","resolution":{"observed_at":"2026-08-08T20:42:39.381884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.369396Z","title":"Distributed strategy selection: A submodular set function maximization approach","venue":null,"work_id":"095de51f-4173-4d60-9cd3-b5bb1924298c","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.974810Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:6bd603eed7f3b78673f16c5b897e211771b0f7fbbaa9b778cfc8ed7c7ef1b8a9","observation_id":"96d1b86f-e970-4f08-8734-16ac7be9466c","resolution":{"observed_at":"2026-08-08T20:42:39.372780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.359067Z","title":"Optimal algorithms for submodular maximization with distributed constraints","venue":null,"work_id":"7b84ad0c-dbd6-433e-be7a-4db7170cf98d","year":2021},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.977876Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:00d503c3fd332fe1a678cb37b14ff5701ba81118c23ce6a0d6e394e06b50947e","observation_id":"037ef1dd-3247-4adc-9273-b4a1bb7450f4","resolution":{"observed_at":"2026-08-08T20:42:39.363198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.350001Z","title":"Resilient active information acquisition with teams of robots","venue":null,"work_id":"1d5ff003-fe91-4708-8732-cf2c4d3beb22","year":2021},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.981142Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:99565e55d27a2d6088398dae9dd620f09c44406efe6c62222fa59a8262ad7abc","observation_id":"12eeba83-c695-430d-ba04-21c61a704207","resolution":{"observed_at":"2026-08-08T20:42:39.353200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.340972Z","title":"Distributed online optimization in dynamic environments using mirror descent","venue":null,"work_id":"fd6b2f1e-d08a-48c5-a116-40badad379dc","year":2017},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.984032Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:12de8b2c17783b3de91f5df39a1dc81e8d24d3f6aa1cb8e9ed28e9e0f88dcaf5","observation_id":"9c4b6291-764c-4c0b-bf88-1327da1685c0","resolution":{"observed_at":"2026-08-08T20:42:39.344256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.331591Z","title":"Efficient informative sensing using multiple robots","venue":null,"work_id":"5af1593c-eec4-4bdc-9e1a-3901c86988ad","year":2009},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.987104Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:92e18bf307933c4771fc006a8adea79561e0db65ef60c568ea2c473bdc5ebcc1","observation_id":"d5cb0708-3c15-453a-b90b-4e5e75b58e1e","resolution":{"observed_at":"2026-08-08T20:42:39.334819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.322848Z","title":"An online algorithm for maximizing submodular functions","venue":null,"work_id":"1326d05c-9048-4bd4-ad2c-de390eb4ef2c","year":2008},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.990129Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:f31400b4ab5f83b47d10c4bf364b7428983e955f144f17d8134423c7c5a32b79","observation_id":"5f03b3d5-56fc-4b84-b731-17b1d26ca220","resolution":{"observed_at":"2026-08-08T20:42:39.325996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.310597Z","title":"Submodularity and curvature: The optimal algorithm (combinatorial optimization and discrete algorithms)","venue":null,"work_id":"423d7672-a01a-486d-93c3-3f550da284c4","year":2010},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.992943Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:2eb4d174fd7f3d9d774ee659f0dde6f5163bb77c27c4b9f2d63d00393dd98eb0","observation_id":"a081e94d-f102-41dc-8f1b-8d194b61d124","resolution":{"observed_at":"2026-08-08T20:42:39.317063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.301505Z","title":"Symmetry and approximability of submodular maximization problems","venue":null,"work_id":"a38aa4a2-e725-4814-af46-014522ab1fa0","year":2013},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.996095Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:93a740f407777e11abda7b63e3170607eda9ed33c301f7bdc4a4a89783fa0da3","observation_id":"5634f4bb-1c57-42ec-9068-fef4651d1f9c","resolution":{"observed_at":"2026-08-08T20:42:39.304685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.292240Z","title":"Bandit multi-linear dr-submodular maximization and its applications on adversarial submodular bandits","venue":null,"work_id":"6b4183ad-3f94-4869-9b63-49dc00f60377","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.999374Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:fee4ea591cf47d6f674fee75515f1de7a6474f8cfab1a99d1148abecf1afa8cc","observation_id":"ccd2855a-fbf5-43a1-9b50-44aa8ddab693","resolution":{"observed_at":"2026-08-08T20:42:39.295573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.283071Z","title":"An empirical study of user engagement in influencer marketing on weibo and wechat","venue":null,"work_id":"13bbbb1f-0420-4dba-8d0e-c0070ce26434","year":2022},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.002420Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:24b0a07c7290af611b3a78677881d6f6900c62b1bed04b83f8f0a36fce929188","observation_id":"9a3ce273-cfc4-4d2b-9489-5b5910891bdd","resolution":{"observed_at":"2026-08-08T20:42:39.286537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.273687Z","title":"Using document summarization techniques for speech data subset selection","venue":null,"work_id":"8ce257fc-1c1c-4a8f-8adc-efed48a2f1c9","year":2013},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.005807Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:533e2d721155594d53ae488b88dac6f88d206a05267f36a6e19238cde556dcc1","observation_id":"72138928-c1ba-423c-8a50-7ae9403c82ce","resolution":{"observed_at":"2026-08-08T20:42:39.277421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.264262Z","title":"Submodularity in data subset selection and active learning","venue":null,"work_id":"5baa6b3c-27d3-4407-94de-b0a959e32f5a","year":1954},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.008921Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:d4d86af6971bafd183d4ae1d9b3fb9c2e60087568081b354b4aabc1492c1c030","observation_id":"1b078945-549a-43ed-93f0-818653e920aa","resolution":{"observed_at":"2026-08-08T20:42:39.267719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.254776Z","title":"Decentralized gradient tracking for continuous dr-submodular maximization","venue":null,"work_id":"da471183-e1db-4fba-9a3d-078d86cd85c7","year":2019},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.011930Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:5021d77def1972a6a589680bf1ac404b8a50cdf25dc1eee6d9f1f5d60e819440","observation_id":"d101e4b3-6a11-4fd6-8d57-7b80bfc2120d","resolution":{"observed_at":"2026-08-08T20:42:39.258072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.245633Z","title":"Online submodular coordination with bounded tracking regret: Theory, algorithm, and applications to multi-robot coordination","venue":null,"work_id":"f189bd9c-28b2-4bd7-a3ca-ddd59071a61f","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.014913Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:2119d7714de78c0d950a543bc9f940b1a10520262b5bcca8a410304547151072","observation_id":"30c025bf-45e4-4255-9b41-8d5ec57c0788","resolution":{"observed_at":"2026-08-08T20:42:39.248936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.236361Z","title":"On the convergence of decentralized gradient descent","venue":null,"work_id":"fa5b130b-2aff-41f6-bc55-b190c68623a1","year":2016},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.017786Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:017237b1181dadfa75c4e042651330d430c66d30756a89a865d6ab5c082cb4dd","observation_id":"0b093079-da53-4bd8-a4d4-7f4afc25a554","resolution":{"observed_at":"2026-08-08T20:42:39.239716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.226889Z","title":"Stochastic continuous submodular maximization: Boosting via non-oblivious function","venue":null,"work_id":"c477a31e-3c2b-4917-a531-f3cdd7079bfc","year":2022},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.020826Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:0b7c4082f5bed17ce90f168750f0dd1a959a042e302b90151cb12bb434f29ed9","observation_id":"69b3962d-015d-4a97-9eda-69fe94c06c08","resolution":{"observed_at":"2026-08-08T20:42:39.230108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.217378Z","title":"Communication-efficient decentralized online continuous dr-submodular maximization","venue":null,"work_id":"c1c88243-f1bb-47a4-bf76-eb3081f11066","year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.023950Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:92b620fc97bf18d137bb7200a71a646b37bdc029bbf0995c587b0fb4144fbd7d","observation_id":"b936baff-8a86-42c1-9efb-266385226909","resolution":{"observed_at":"2026-08-08T20:42:39.220782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08330","last_updated":"2024-07-24T08:13:26Z","snapshot_observed_at":"2026-08-13T04:42:04.608261Z","submitted_at":"2024-01-16T12:49:10Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","version":2},"cited_work":{"arxiv_id":"2401.08330","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.08330","snapshot_observed_at":"2026-08-08T20:42:39.084831Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","venue":"cs.LG","work_id":"a8390a36-ce75-4c03-a900-572fcf44fd1d","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.027006Z"},"links":{"cited_paper":"/paper/2401.08330","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:a8005bccba757f931f7030bcb44eeb50ca5141d7a731080f443efb0d58551b7a","observation_id":"d145699e-4209-4e17-b01a-5e04ddec62cb","resolution":{"observed_at":"2026-08-08T20:42:39.090502Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.206764Z","title":"Minimax optimal q learning with nearest neighbors","venue":null,"work_id":"7f9e26af-6ae9-4e65-bf7c-dab3da3a0bac","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.030439Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:0413b36ef206f5d896dc41dc56f27d7a0d9daef0f2ee03b649b8caaf4033efcb","observation_id":"92c29081-f9a6-42ec-a93d-909dd6e1137d","resolution":{"observed_at":"2026-08-08T20:42:39.210706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.196605Z","title":"A huber loss minimization approach to mean estimation under user-level differential privacy","venue":null,"work_id":"3a7b1b89-2cd9-4ec5-b45d-6ddcef7a9930","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.033489Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:d43cb58c11f7231c2281d2b15711792d239fd822a82935f5f6b0ab2a95296dc9","observation_id":"2275dcd2-74af-4d7f-a531-0882a8996bb0","resolution":{"observed_at":"2026-08-08T20:42:39.200008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.186569Z","title":"A huber loss minimization approach to byzantine robust federated learning","venue":null,"work_id":"affffa79-e1b6-43e0-a020-37cfe35daabd","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.036526Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:23a31e78ca55ca2391233a2da00a2fbdf5cde82e21c875e6952c83a2a8bd9fe6","observation_id":"a77bdfe1-0252-4252-8029-4630fc454c92","resolution":{"observed_at":"2026-08-08T20:42:39.190000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.176307Z","title":"Risk-aware submodular optimization for multirobot coordination","venue":null,"work_id":"cb8708e9-6b7f-42fd-af22-b0be7392e401","year":2022},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.039538Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:9efb0e36e0b79e6fbee4b3b7e8f7fdf56f03419215d0a4f5143498cb6672c796","observation_id":"b6ffbbb7-e452-4769-ac7b-6029cdff8eee","resolution":{"observed_at":"2026-08-08T20:42:39.179681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.166560Z","title":"Resilient active target tracking with multiple robots","venue":null,"work_id":"f73c9446-c1d0-407b-8602-4e7da1d51b16","year":2018},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.042636Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:5cc618663583fadaacefefeb94976aeebbee7510e9593a8e90d2d4e248fafde7","observation_id":"96adf695-67a3-475a-b829-b78233b009d1","resolution":{"observed_at":"2026-08-08T20:42:39.170012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T20:42:39.156208Z","title":"Projection-free decentralized online learning for submodular maximization over time-varying networks","venue":null,"work_id":"a123c860-8011-40b6-a8b0-aeb4844836e0","year":2021},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.045683Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:b7c71dcac4728d4f4a08835130338f65b4760e6100e3d706752d49be2482bbf6","observation_id":"a057bfe9-2922-4601-8280-b26c071515d7","resolution":{"observed_at":"2026-08-08T20:42:39.160071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:39.048767Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.048767Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:6bdd0d7c33d9911f5800b8bcc130d8c034ce42a65857508f3bf77b18451018e0","observation_id":"ea9b0420-23f4-4496-a3ef-9db5593e49ca","resolution":{"observed_at":"2026-08-08T20:42:39.048767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:39.052045Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.052045Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:c79248490cde1cad8a0d9f88dfa6962e71ec35f5bd5d03a7712ac901879c4a62","observation_id":"5cd28cc2-acfe-4c47-a71e-bdb330904553","resolution":{"observed_at":"2026-08-08T20:42:39.052045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:42:39.055335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.055335Z"},"links":{"citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:274d6eb0198c9ad717c8eddfb23099b13d840af60111d77af27e04b6336e917c","observation_id":"46e34410-7dd1-48af-8a8f-222e1848cd6f","resolution":{"observed_at":"2026-08-08T20:42:39.055335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency"},"reference_resolution":{"displayed":92,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":2,"verified_fuzzy":67},"total_outbound_references":92},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 92 of 92 outbound references and 2 inbound Pith citation observations for arXiv:2502.05028."}