{"as_of":"2026-08-10T12:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71db2c70335b1e89f819952341c9e29df0a2356a50eea20a899eb426fa2eec31","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T18:31:29.408950Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2604.06430/citation-record","integrity":"/paper/2604.06430/integrity","json":"/paper/2604.06430/citation-record.json","paper":"/paper/2604.06430"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bandit submodular maximization for multi-robot coordination in unpredictable and partially observable environments","venue":null,"work_id":"bd21316e-2f8e-4afc-b797-cc07542a70e4","year":2023},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:3885376d0e08f1b35493e718402a42d964e959e9868e31df8f855fb74438663e","observation_id":"f6c40a55-e728-482a-a911-e5080ee63289","resolution":{"observed_at":"2026-05-16T19:03:19.741329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decentralized active information acquisition: Theory and application to multi-robot SLAM","venue":null,"work_id":"2896c1b5-5828-4593-af28-d119947b93ae","year":2015},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:f640c293564ffc6b3d1fbea9beff13f2a12ca380a5c541d64267fa76c7d31616","observation_id":"eeedb588-5646-4ff0-9d45-f09632993dc5","resolution":{"observed_at":"2026-05-16T19:03:19.732714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed submodular maximization on partition matroids for planning on large sensor networks","venue":null,"work_id":"38973850-dc1c-4d30-9e78-4c72cd4f3c3a","year":2018},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:56437d793e105713617ae9f59831f1c2bd18e3d2c608afa1fea6eaf4cd07d12f","observation_id":"f247c10e-1655-4c12-af63-b442d37ef2a1","resolution":{"observed_at":"2026-05-16T19:03:19.748033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-optimal sensor place- ments in gaussian processes: Theory, efficient algorithms and empirical studies","venue":null,"work_id":"19f53cc2-4b91-4b4a-9a16-fd12a9203885","year":2008},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:c35d8956e016a3c63acd15a3cab9197a997f43a8996e031afe5166ee0c258232","observation_id":"1a6960e6-a22c-41f2-9bb8-9ccdd7025469","resolution":{"observed_at":"2026-05-16T19:03:19.729989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient informa- tive sensing using multiple robots","venue":null,"work_id":"962011a0-a3e1-4d49-9d7b-3efc05de577e","year":2009},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:b3b7ab903419da029d29b2df1a3af099a838576bd3512f3bd09bfd76dd97ccb3","observation_id":"7aca4073-0d40-4017-8f69-b9eb24e61d5f","resolution":{"observed_at":"2026-05-16T19:03:19.738270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi-target visual tracking with aerial robots","venue":null,"work_id":"6c5ed38f-78e8-4ef6-9e56-8e662b829a65","year":2014},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:b66ab5bcee2ca6b999c7f58f018a8f2ae7744c8202817c26812c986a0d652618","observation_id":"5b019005-d1ce-45c8-af03-7c83f5ba3697","resolution":{"observed_at":"2026-05-16T19:03:19.744544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed submodular maximization with limited information","venue":null,"work_id":"6f940c60-9ae6-4b2c-95d7-ca9b0121f661","year":2017},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:ddf5f8343b4efc853d49e6b366f71e22d78c80feb207dcdd784a8a7967f61c4f","observation_id":"55cae8c9-4f0e-4a25-a2c0-5922fa574667","resolution":{"observed_at":"2026-05-16T19:03:19.735508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The role of information in distributed resource allo- cation","venue":null,"work_id":"d56fa29d-2094-412d-aab4-35d35ab6d617","year":2017},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:0bd6945539b35b5e5be5708447f3ec9cc4d33a80e75d710e6e0164967d41cee6","observation_id":"d4d2bad9-709c-49c2-a552-de67845cc667","resolution":{"observed_at":"2026-05-16T19:03:19.770627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The impact of information in distributed submodular maximization","venue":null,"work_id":"51fafae6-e318-424f-aad5-a7cd2a1cd17e","year":2019},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:5f820d80ff6526fd1f8980d18fe225b02c6e38b3e9acb4af84636c8f8b8b2dd0","observation_id":"5eb411c9-020b-46be-b08b-c166edced51b","resolution":{"observed_at":"2026-05-16T19:03:19.789592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Resilient active information acquisition with teams of robots","venue":null,"work_id":"5917c9ef-d3b3-48b1-9d93-601ab2531c3d","year":2021},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:b1f37b23e04ab84dcec635bc0fe21a5d482cae90db0aca8dd2597e47c35fb95b","observation_id":"f522cced-3d3d-416d-9033-e197ffd5f39f","resolution":{"observed_at":"2026-05-16T19:03:19.794661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jacobi-style iteration for dis- tributed submodular maximization","venue":null,"work_id":"859b4e6d-45ef-4ecd-bbf5-3ef61a49fbdd","year":2022},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:c3339738856bff743545ec379ac99cd160a84d068382b2c03502680db86d3ecf","observation_id":"d072683b-9859-4397-999a-6f84f53dc9be","resolution":{"observed_at":"2026-05-16T19:03:19.805391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed strategy selection: A submodular set function maximization approach","venue":null,"work_id":"0af16e12-4962-4509-a4b0-0f717a7e5933","year":2023},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:e5fdabaac60d6267deeff628b09688b78b48f66c6983239ac52a42c59ecfd592","observation_id":"03cb2c2c-1fdc-45bb-ac19-b1b5a0d046b8","resolution":{"observed_at":"2026-05-16T19:03:19.773532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal algorithms for submodular maximization with distributed constraints","venue":null,"work_id":"7e6e4a62-b61d-4f53-b933-c43c8a597ee5","year":2021},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:68621feb707e67de0adff4bf0a9728ff0cdc80a1470bc078c93f21ac15d3b4ca","observation_id":"cd1d8c14-86fd-46dc-8bd6-0e50f4502e39","resolution":{"observed_at":"2026-05-16T19:03:19.754586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Communication- and computation-efficient distributed submodular optimization in robot mesh networks","venue":null,"work_id":"1a992054-3966-46b6-b1d3-bb0133c73f22","year":2025},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:175fef321b748506e799ea537e8a8d90e2c46fd82d2f0e0e5d0bb502f539f7bd","observation_id":"70cd7d93-e688-435c-8888-4dffc96c2bb5","resolution":{"observed_at":"2026-05-16T19:03:19.803008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An analysis of approximations for maximizing submodular set functions–II","venue":null,"work_id":"0a235140-bc11-4b44-928e-60e8e97d387b","year":1978},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:7201478dc52cee11b505278d9006ba631cf5688b63f453f35aa23a2226865587","observation_id":"948d9662-13b0-4205-aae4-13b6efe06980","resolution":{"observed_at":"2026-05-16T19:03:19.757843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A threshold ofln(n)for approximating set cover","venue":null,"work_id":"654f4217-dbba-406c-a1c3-aed5b11c4847","year":1998},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:1bf501575052aa05d90256dcd752129be73ce014c857b05eb511a883f8a9d109","observation_id":"f34152de-73b7-43b5-8fda-0b74ef026e69","resolution":{"observed_at":"2026-05-16T19:03:19.781816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed re- silient submodular action selection in adversarial environments","venue":null,"work_id":"b7fe9d51-f597-4465-b1df-46bc699c0f8b","year":2021},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:25bc1cf860285484ce61566d16efe7031e710f3ae5c02c2f5e2fdd837a7dd1ad","observation_id":"cf0be6c4-b86c-44e3-aebd-518a8a5a779e","resolution":{"observed_at":"2026-05-16T19:03:19.776446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Execution order matters in greedy algorithms with limited information","venue":null,"work_id":"772f4de7-a3fa-405e-963c-0991ff011579","year":2022},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:efa802f35d42aa3de5ffeafc091fe06a6ba9934011f62f2baccef3156f491fa0","observation_id":"91c1e719-169a-44d4-baf4-e63f75327306","resolution":{"observed_at":"2026-05-16T19:03:19.808049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Submodular function maximization","venue":null,"work_id":"2d5b7a13-71d7-4eae-84d7-bdf577523db7","year":2012},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:5c966840d8f2551850d5bcb8b4587d8046dad8cd60f80953978eb60f32f81305","observation_id":"3d72dfb0-68f5-4fb4-9ed8-62d387384ee7","resolution":{"observed_at":"2026-05-16T19:03:19.797434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lattimore and C","venue":null,"work_id":"5b58769b-d735-4439-bd48-f44fc43ac9c1","year":2020},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:07c76af008544e4db685d5d20990e7f4f2afa9d19e8342749e86c8b214409b77","observation_id":"d3226453-61df-4b6c-abf7-dd0fe0435225","resolution":{"observed_at":"2026-05-16T19:03:19.760705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A gaussian process based method for multiple model tracking","venue":null,"work_id":"11d4de9c-f03a-4827-8808-cd6638ca1353","year":2020},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:8dba34c3fa12a8f63e71cef92f39d16059ff5faf46504ef00db942c5bb79c289","observation_id":"b2b0493a-5f23-4e7d-822a-77ff87ac2add","resolution":{"observed_at":"2026-05-16T19:03:19.800094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online submodular coordination with bounded tracking regret: Theory, algorithm, and applications to multi-robot coordination","venue":null,"work_id":"f6e34a00-df68-4420-ac7f-0ebfa271a365","year":2023},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:93df7a1119956de2926151d03dff2072932ae0034bdf6df2b21f7bf0a085236d","observation_id":"8d040998-d915-48c6-9417-aa64123147ed","resolution":{"observed_at":"2026-05-16T19:03:19.751458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Explore no more: Improved high-probability regret bounds for non-stochastic bandits","venue":null,"work_id":"1540a560-ce5a-4fcc-ae7e-31e334e145aa","year":2015},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:653ebcda034c1e7477f38910eccb4849cacaf29d8e3cbf1a4dec42e2d9e41d46","observation_id":"a63084fc-0ec5-455c-acb5-14478f29b141","resolution":{"observed_at":"2026-05-16T19:03:19.810311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.19366","last_updated":"2026-07-29T17:53:56Z","snapshot_observed_at":"2026-08-03T05:44:03.294747Z","submitted_at":"2026-02-22T22:36:37Z","title":"Self-Configurable Mesh-Networks for Scalable Distributed Submodular Bandit Optimization","version":2},"cited_work":{"arxiv_id":"2602.19366","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.19366","snapshot_observed_at":"2026-07-30T02:07:02.712350Z","title":"Self-configurable mesh-networks for scalable distributed submodular bandit optimization","venue":null,"work_id":"abc2aa25-d0aa-4697-bff2-15d286f33bdd","year":2026},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"cited_paper":"/paper/2602.19366","citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:fa06de75d101dae9577a2892325347e05d6d594b97d6a9c8d10d9d8467b66591","observation_id":"b1c61b08-2877-45a9-9a9a-52fa7bf1212f","resolution":{"observed_at":"2026-07-30T02:07:02.712350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.27803","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed online submodular maximization under commu- nication delays: A simultaneous decision-making approach","venue":null,"work_id":"62d1cdb0-83b5-40f7-9727-ad8c9ce3d14b","year":2026},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:958ff36fc131cc5ac554a6dfa29352877a614927a4cf52ed4359dd3490dbdd7c","observation_id":"bf8e7ca3-f1f8-4000-8ace-354ccb535ba5","resolution":{"observed_at":"2026-05-11T00:25:52.179118Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nonstochastic multi- armed bandits with unrestricted delays","venue":null,"work_id":"ddeced01-52e0-46dc-b889-bc7d6be3e9cb","year":2019},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:c98bd5907e592415e7a6a43e7a1f7119ad98ba2a8423c92a35446f9b9597f683","observation_id":"6adeaf8f-d153-4790-bfac-6686acc6507e","resolution":{"observed_at":"2026-05-16T19:03:19.784325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A characterization of a cone of pseudo-boolean functions via supermodularity-type inequal- ities","venue":null,"work_id":"c7386897-918d-4295-b41f-c43055683288","year":1989},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:d6e32cf8d00d82c185da7eae3e84cd75045db8b0b86c9b005d8832ba0bc3f3c4","observation_id":"f2a33e84-e371-417d-93a3-2f02532a4f6c","resolution":{"observed_at":"2026-05-16T19:03:19.787143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Submodularity, supermodularity, and higher-order monotonicities of pseudo-boolean functions","venue":null,"work_id":"d2a92486-6efb-4c05-a442-05b65c446b88","year":2005},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:89450f66d0116550260903a78e02b25f63ecb5b4279c558c0531f9c294ebfadd","observation_id":"fe44354e-6f8f-467d-9caa-f3a3d8b7a72a","resolution":{"observed_at":"2026-05-16T19:01:12.832821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some general- izations of the rado-edmonds theorem","venue":null,"work_id":"e708f0da-a7a4-4620-b43c-b7e2b0031141","year":1984},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:ee6ecc09b5448ca1b7985fbe1e45309210bd367e4d7c4fba4a1c2ce53fb4d64c","observation_id":"9cfaface-0d08-46e4-a042-3c278aeefc50","resolution":{"observed_at":"2026-05-16T19:03:19.779353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal approximation for submodular and supermodular optimization with bounded curvature","venue":null,"work_id":"ce6a113c-8456-4d3c-a975-184e1703b2fe","year":2017},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:26c09c4026f163ee7756714446d2b569736b45ca62fb2d3b0d41ed91ecb0ffb0","observation_id":"4e7e21e0-e20a-4e5b-936a-c17dc998a342","resolution":{"observed_at":"2026-05-16T19:03:19.763970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Time, clocks, and the ordering of events in a distributed system","venue":null,"work_id":"651fbc65-66f2-40a1-b7c5-b44fdd0d911a","year":1978},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:f91d140b4cacc450858671c568eab55cc7abc6602db03c28f80174bbf744bf62","observation_id":"9610438e-1346-411f-86ce-dede3f37a70b","resolution":{"observed_at":"2026-05-16T19:01:12.829939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fundamental limits on synchronizing clocks over networks","venue":null,"work_id":"958494b1-0f10-4ad9-a061-57a5e8e39a18","year":2010},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:161ef03438d195f794640d3258c19b89d0466ad96c6f05a6bacba5d67eab4229","observation_id":"08615249-174b-422a-816b-f434bb63f453","resolution":{"observed_at":"2026-05-16T19:03:19.767820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed asyn- chronous deterministic and stochastic gradient optimization algo- rithms","venue":null,"work_id":"f31b3473-f8c3-46d6-8f94-f84e64784564","year":1986},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:ac3faf987e2f8929a62a8bfed2a7516ef82522415384aa6ee4a056dec2a5ddf8","observation_id":"e1f8b5f9-4b33-46c3-ab92-7c9ead362f32","resolution":{"observed_at":"2026-05-16T19:01:12.827273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient clock synchronization","venue":null,"work_id":"56857312-1f23-4af9-9b44-94a8b0e914a4","year":2004},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:07d134a2beee0aca4b9d6aa2f4bc3f77bc5612cc2ac138fcc4691e4347c526ca","observation_id":"c946ed2b-19ce-40c7-9086-b898cbbe2f3f","resolution":{"observed_at":"2026-05-16T19:03:19.792246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decentralized safe control for distributed cyber-physical systems using real-time reachability analysis","venue":null,"work_id":"8e3380b9-67d3-4b59-839d-d05e31b81c90","year":2023},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:7e08e0211970ff3057293fbb6a8fb33b392f3585069dc14c5e687671259a4dd4","observation_id":"776af868-7763-4873-b057-7dd975593187","resolution":{"observed_at":"2026-05-16T19:01:12.937632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online learning with predictable sequences","venue":null,"work_id":"7826603c-5a18-4c4b-bc33-6599558cc433","year":2013},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:e1174d79bdaf67c28c28550ca441361c653cad1280b7964cef7f9d41e4de407e","observation_id":"18d6d18a-6d42-4b12-9412-4d8275fd4d34","resolution":{"observed_at":"2026-05-16T19:01:12.930231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Softmax is1/2-lipschitz: A tight bound across allℓ p norms","venue":null,"work_id":"2fa9a818-fc48-483d-a4be-8fff67d17162","year":2026},"citing_paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:29.408950Z"},"links":{"citing_paper":"/paper/2604.06430"},"observation_digest":"sha256:f987632defb3ce7c7d6f23d80d7668196e4ddf00ad842492a0e0b17b32ca016b","observation_id":"b31d1b0d-88bb-4770-b3c2-26bcdcefe251","resolution":{"observed_at":"2026-05-16T19:01:12.933980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.06430","last_updated":"2026-04-07T20:13:04Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T20:13:04Z","title":"Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2604.06430."}