{"as_of":"2026-08-22T02:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:981e4f9e6b03f2e986ec891be5304dd2c8f0bea3631610fc1e048f690cd3c762","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T23:34:08.173177Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2605.26163/citation-record","integrity":"/paper/2605.26163/integrity","json":"/paper/2605.26163/citation-record.json","paper":"/paper/2605.26163"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T23:34:08.173177Z","title":"On the road to 6G: Visions, requirements, key technologies, and testbeds,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:ff02529666958beaabd17a5708099d4394d96b6a68e57d422189b30dab50f3f2","observation_id":"e6fd323e-0a2d-4f54-a96a-c0601727899c","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Dynamic task offloading and resource allocation for ultra-reliable low-latency edge computing,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:49d8723b62c47ab3d16b257cbd7774396ffe51235cc8b230b6effed983bfeddd","observation_id":"3853a9da-8acd-490c-8d32-82f7fe5cd4e7","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Adversarial machine learning threat analysis and remediation in open radio access network (O-RAN),","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:2761c120b80d4077ea35414e238d46a32a9285cf24ef026f22c1c8c8605921ec","observation_id":"e9f534d8-c5ec-4c26-8762-736a43f0de7d","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.06093","last_updated":"2023-03-04T17:20:37Z","snapshot_observed_at":"2026-08-20T20:10:03.767264Z","submitted_at":"2022-01-16T17:01:38Z","title":"Adversarial Machine Learning Threat Analysis and Remediation in Open Radio Access Network (O-RAN)","version":2},"cited_work":{"arxiv_id":"2201.06093","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.06093","snapshot_observed_at":"2026-06-29T23:44:03.273338Z","title":"Available: https://arxiv.org/abs/2201.06093","venue":null,"work_id":"e71fbdc1-adc4-435b-b730-df488199e427","year":null},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"cited_paper":"/paper/2201.06093","citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:73c733304320b4bd542c1277ac5199244f4bc22da7ccfbb697763647369e92f8","observation_id":"a21ab92c-0922-4bd6-a02c-1c9b4a7905dd","resolution":{"observed_at":"2026-06-29T23:44:03.274790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-29T23:34:08.173177Z","title":"ColO- RAN: Developing machine learning-based xApps for open RAN closed- loop control on programmable experimental platforms,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:f125d95cf4dfde75c145c41b79cb18de2923bc76dd5ddc3a3cddcf03b293deab","observation_id":"f8a8c657-d2c2-4ed4-88df-6cba4c4437fa","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"OrchestRAN: Network automation through orchestrated intelligence in the open RAN,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:d2633e126851550c92b9fe74acbeff40f70445f9195de3a6b5e0def75ff98575","observation_id":"b2591fce-ea15-440b-87fd-3821d88dda0b","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12964","last_updated":"2025-02-11T02:06:03Z","snapshot_observed_at":"2026-08-19T08:48:30.380042Z","submitted_at":"2024-08-31T13:10:48Z","title":"OpenRANet: Neuralized Spectrum Access by Joint Subcarrier and Power Allocation with Optimization-based Deep Learning","version":3},"cited_work":{"arxiv_id":"2409.12964","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.12964","snapshot_observed_at":"2026-06-29T23:44:03.278443Z","title":"OpenRANet: Neuralized spectrum access by joint subcarrier and power allocation with optimization-based deep learning,","venue":null,"work_id":"7e3020cf-2603-4428-87ee-0a911d20826d","year":2025},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"cited_paper":"/paper/2409.12964","citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:09465311670473b8fdfb55191f52145b6adc4414491831e776e5699e45ccf12e","observation_id":"f55016c8-7fb7-4206-a1ea-ab7b33c1d18f","resolution":{"observed_at":"2026-06-29T23:44:03.279948Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-29T23:34:08.173177Z","title":"Space exploration holdings, LLC request for deployment and operating authority for the spaceX Gen2 NGSO satellite system,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:82f86f0415ff0094629838c99ce571986aab79ab823bf73b4dcf356dbe325832","observation_id":"621b1dc3-0507-40c0-8bf7-989ea490026f","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14136","last_updated":"2024-10-18T03:14:24Z","snapshot_observed_at":"2026-08-19T15:06:48.260739Z","submitted_at":"2024-10-18T03:14:24Z","title":"Coded Water-Filling for Multi-User Interference Cancellation","version":1},"cited_work":{"arxiv_id":"2410.14136","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14136","snapshot_observed_at":"2026-06-29T23:44:03.281052Z","title":"Coded water-filling for multi-user interference cancellation,","venue":null,"work_id":"c08af5b4-02f2-477a-8edf-67e263464e52","year":2024},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"cited_paper":"/paper/2410.14136","citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:fa9dd818f1e739be5afce496ca17d5de52180b066b3ed5b7568545c0c36c6cae","observation_id":"e3dfcc05-d6ee-47dd-b25c-af6c277fdc4a","resolution":{"observed_at":"2026-06-29T23:44:03.282565Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-29T23:34:08.173177Z","title":"A survey on nongeostationary satellite systems: The communication perspective,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:2a6bd01d20504cf80950c87608351059ae7a34dbd2942c536c8b98eec1d32113","observation_id":"440dbed6-241e-485a-86e6-35b2b62c3ab6","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Satellite-5G integration: A network perspective,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:f07c2cb952228b965410398db7da5d0143ca1c9ac5393e175f06c51ecdf1f0ed","observation_id":"785932dd-2f1c-482a-b268-414f22ba40dc","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Exploring the","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:3df5ba16175e83939d2a46fd248322aa7fff74678e0b6a2c23e433c1ea271a04","observation_id":"f9629557-a12f-49a0-85db-5a45431280c7","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"An O-RAN approach to spectrum sharing between commercial 5G and government satellite systems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:6847374a7f11e237a004f96b289f17bc0a36e80e1e1d7303d34b8b3fc97ca7d8","observation_id":"ef916985-7228-4b00-a305-01111299d9a7","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":null,"venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:0aa24c9ef5f6d84b7c2465bd41f16e8d4fa80ad991aee822f39260d6c77fc982","observation_id":"d0e01abe-1fb0-4796-8c10-db1d4c04ca62","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Optimum power allocation for parallel Gaussian channels with arbitrary input distributions,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:38e4f77a06560cdc895437e0224e56b3b567c22492aa246cd67e20064f00d56e","observation_id":"6a4e2430-4e3a-4bd2-b747-408b4bf91334","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Practical algorithms for a family of waterfilling solutions,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:8e3440e010bbe591f3656300350b9e52bf0464b70e417643698b035095e64710","observation_id":"58d602a6-faf6-407a-a841-532b2ff29d05","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"New viewpoint and algorithms for water-filling solutions in wireless communications,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:4d9a72fb94ce8fb02b12218fc3982e1ee93fecf4c66445fc82355077183da010","observation_id":"306667aa-87e3-4fa8-8231-1f3aa211aad8","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Wireless max–min utility fairness with general monotonic constraints by Perron–Frobenius theory,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:1f4602596af223d039181f032ebac6b7a9f38b876fbce4ec95b3d2a89a5cc6a4","observation_id":"f5995887-d121-42f8-a2e0-82a5da20a52d","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"A first-order primal-dual algorithm for convex problems with applications to imaging,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:d9cb1f53418135be8453de737d0a989c7af558539bc7516e1966e2b9e1fc6eb1","observation_id":"fa5536b5-82a6-47d0-bd3a-0557acb6086b","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.0546","last_updated":"2015-03-24T18:39:52Z","snapshot_observed_at":"2026-08-15T00:19:07.878769Z","submitted_at":"2013-05-02T19:26:47Z","title":"Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems","version":2},"cited_work":{"arxiv_id":"1305.0546","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.0546","snapshot_observed_at":"2026-06-29T23:44:03.268268Z","title":"Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems","venue":"math.NA","work_id":"c76767cc-76aa-4b89-9531-b3cfe28c6a26","year":2013},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"cited_paper":"/paper/1305.0546","citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:b51568e10281fc78c654e058442b35e7632cb5e95ee0eebb01f233ab22957489","observation_id":"0afee0ef-61a9-4920-a669-c83c96b10669","resolution":{"observed_at":"2026-06-29T23:44:03.269570Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-0-85729-033-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Yang and M","venue":"Lecture notes in control and information sciences","work_id":"5fa64a87-95cd-42f5-94df-98e4eea6559f","year":2010},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:43aed3f85d08622f89699cf66c2b48adbc5ec94588331990bd8f12cb45d5f743","observation_id":"cf327671-5224-4132-86bf-dbcc3b14db4f","resolution":{"observed_at":"2026-06-29T23:44:02.675730Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-29T23:34:08.173177Z","title":"Learning to optimize: Training deep neural networks for interference management,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:d7bb031e2b38e366ff9967ec234959dff2ab118984e47a33711975d6490ec7f7","observation_id":"77ee1a9d-f5ec-42d2-88c5-b53480175a07","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17053","last_updated":"2024-06-15T07:01:54Z","snapshot_observed_at":"2026-08-18T03:37:20.820261Z","submitted_at":"2024-05-27T11:18:25Z","title":"WirelessLLM: Empowering Large Language Models Towards Wireless Intelligence","version":2},"cited_work":{"arxiv_id":"2405.17053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.17053","snapshot_observed_at":"2026-07-04T18:40:03.531958Z","title":"WirelessLLM: Empowering large language models towards wireless intelligence","venue":null,"work_id":"e126b87d-d936-461b-9dc9-501537032cbf","year":2024},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"cited_paper":"/paper/2405.17053","citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:7643923f17b0c3c88ed9c7d107f1933a2b5304d2b742a2a0c985447a18de7f56","observation_id":"f823225a-1f9b-4f82-bea6-9c5b4fb3b793","resolution":{"observed_at":"2026-06-29T23:44:03.272236Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-29T23:34:08.173177Z","title":"Adversarial water-filling: Minimax resource allocation optimization with proximal decomposition in open ran,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:ead6b05d4b47ffe6f9671858d125accd8746361483ee92f92733ff64291b3aaa","observation_id":"c02783c4-8a36-4439-bd16-38501cebaeef","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:4e3b486098ca3854b5028017e0d3646a9bf57f2eea122b3167d4eda0511b069f","observation_id":"c950eb3d-e1d1-495e-8835-20718f0cf3ad","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Tse and P","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:933b932fe14ee429432986ec0c456332c16e181f822c335ea2d09555bcc64b7c","observation_id":"915c1aef-300e-43a4-ac5b-c0c72f622f2a","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Iterative water-filling for Gaus- sian vector multiple-access channels,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:b56ff6b4a995d81866f75cce0d88e8e5c11e2822f2198784a9c23212239c9e70","observation_id":"fda0238d-55ef-4f9c-a7e1-e1cd904666c9","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Dual methods for nonconvex spectrum optimization of multicarrier systems,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:d97f800af64950c99f3250a2a4b8a969168514ba7798d1eded5a2574305286b7","observation_id":"a7ec7663-735d-4a5f-9756-521f949f08f1","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Minimax and convex-concave games,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:e1e75dc697bdbfd9d2aa7656e2029a9a4865038d063e261415c07e16925195e0","observation_id":"ef74ae80-5356-4a47-b3c1-3e6f37e7dc19","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Max-min resource alloca- tion with application to anti-jamming,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:840d8523608ac0491698264007858f9f0430ed41b52ac816abc2c5290ec85264","observation_id":"2038a9db-37dd-4ccd-b59c-92d159615f4a","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"An anti-jamming multiple access channel game using latency as metric,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:e68f2dd0f0bac27521528368cdd3b147b4d46f87b8a74f951e2468248ffb9754","observation_id":"a165c3f9-800d-4e80-a49e-98a1900245b5","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Learning to continuously optimize wireless resource in a dynamic environment: A bilevel optimization perspective,","venue":null,"work_id":null,"year":1900},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:2b4676d60c96d83a4da059304f1f8c2568437e2efc629541164978519498e90d","observation_id":"db04c83c-4ddb-4d0e-b9bb-f013554926fa","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Multi-agent deep reinforcement learning for dynamic power allocation in wireless networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:65d51591693831ce46dafbe97350fb88c9f0bf77521b439e71ed38d3c374d958","observation_id":"2b4d4003-dd54-426e-bdd1-e8f9cc15ce68","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Graph neural networks for scalable radio resource management: Architecture design and theoretical analysis,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:02f79c6f6b8c9cc6d1b698ecf65d97f809296d087ca974119fc4f6c196d84742","observation_id":"ebdac446-6e13-4c4d-a05c-a08ca0a92b81","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Knowledge-driven resource allocation for wireless networks: A WMMSE unrolled graph neural network ap- proach,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:4b72e1b917b26791334a86b764601754a7be2872913eaeed8ba24a439f53ac73","observation_id":"8dd44fdf-f7da-4310-b76e-733d67edb09c","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.06114","last_updated":"2018-04-14T18:54:19Z","snapshot_observed_at":"2026-08-15T19:29:25.073045Z","submitted_at":"2017-03-10T21:02:53Z","title":"Deep Sets","version":3},"cited_work":{"arxiv_id":"1703.06114","doi":"10.48550/arxiv.1703.06114","metadata_source":"pith","pith_arxiv_id":"1703.06114","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deep Sets","venue":"cs.LG","work_id":"98fe9370-503b-494e-bcc9-b0775a5878e9","year":2017},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"cited_paper":"/paper/1703.06114","citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:143c43578b2dea1877ecf866d27abd0e33517c3d03892ac12aff09f2cfd357cd","observation_id":"634b74e9-8578-4a95-9daf-518f5b49c637","resolution":{"observed_at":"2026-06-29T23:44:03.277215Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-03T16:38:09.646583+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T16:38:09.646583+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-29T23:34:08.173177Z","title":"Set transformer: A framework for attention-based permutation-invariant neu- ral networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:807a0e38c58d0c1bb4aa89e3c7eb8d712f004882a793d3c15b63ad4dbc905267","observation_id":"735f985d-aa16-4d8c-91dd-459455b51e7d","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Perceiver: General perception with iterative attention,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:ed520dbfb64238a34df96ce56cef34e3b3fff7fe10b00e5ed959bdc5fd89a309","observation_id":"d9e937bf-8d90-4bc2-83fd-46c2e0f71299","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"OpenRAN gym: AI/ML development, data collection, and testing for O-RAN on PAWR platforms,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:6d43dbcc4a747e1376b5ef9eebf89c802a26e73e923fbac5b81115e516228cdc","observation_id":"d9ebec8f-b736-421a-a447-22555ee9e4d1","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:e6e6f133f5062aae6a262b874bb44bf3267ed53eb33d81d78c233abe7374730f","observation_id":"d1167a21-a228-4ce2-938b-fb6b71d7018d","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Spectrum management in multiuser cognitive wireless networks: Optimality and algorithm,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:df360ea51a9f161d615d3d82386b2382f552f9a443ba65c12169e6683c71eebb","observation_id":"77c69a5e-b606-49a6-a3ca-c89ca9f6add2","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Mutual information and minimum mean-square error in Gaussian channels,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:d811fee481e3880ba21a024ee96d6f9423671dce4521771e451690fc0467b840","observation_id":"a25a0c09-6405-4349-a7b8-a9bb4ccf18e8","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Proximal algorithms,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:11eade5c989ebfbefc097fdb0b0b019704c1716792efcbe31fe07fdbbdf1e5f7","observation_id":"d442fbcf-4ed4-4dc5-a32e-6c8cbf7259ac","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","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-06-29T23:34:08.173177Z","title":"Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T23:34:08.173177Z"},"links":{"citing_paper":"/paper/2605.26163"},"observation_digest":"sha256:96a2d878ff8c5c4f17f5233e33d8195b54532f45f89ae276d7fbf18e998bdf3f","observation_id":"d96b023d-331c-4d51-9039-631c3bd8eda2","resolution":{"observed_at":"2026-06-29T23:34:08.173177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26163","last_updated":"2026-05-24T17:37:30Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-09T19:31:48.552799Z","submitted_at":"2026-05-24T17:37:30Z","title":"Adversarial Water-Filling: Theory, Algorithms and Foundation Model"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":44},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2605.26163."}