{"as_of":"2026-08-06T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f380935d386e156c1023b3b97262e77e638f33a0d2e91701fdee9fac2951daa3","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T19:05:37.675251Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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.16960/citation-record","integrity":"/paper/2605.16960/integrity","json":"/paper/2605.16960/citation-record.json","paper":"/paper/2605.16960"},"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":"Towards load- balanced clustered cell-free networking: A tight relaxation approach","venue":null,"work_id":"7b04ee40-11c2-4bc6-b873-1c93a920c6df","year":2025},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:e5ed932c888655a94cac49907b1aa82e4b94d32cba57852b7126275f53b84ccf","observation_id":"0624fff4-6240-42cd-b02f-3b886c29dbe1","resolution":{"observed_at":"2026-05-19T19:07:43.565548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 vision of 6G wireless systems: Applications, trends, technologies, and open research problems","venue":null,"work_id":"a6622cc0-2df8-4473-bae5-b376b2377552","year":2020},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:b2e4f278808a7e3f10632f3d7dbcd72ff312e68a6566c600a54c8db401f618d7","observation_id":"0922197f-dc61-44cf-9055-b24b6fe3f4e6","resolution":{"observed_at":"2026-05-19T19:07:43.608998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Cell edge performance of cellular mobile systems","venue":null,"work_id":"445b9921-a041-4c51-84b5-07a6600a7cc1","year":2011},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:2a4224295a731a5ea5d8146729ed06c350d1cfbc5fae41a51e9c0f0b7bbab778","observation_id":"dd78cdb1-9e43-4949-8899-597479c204d4","resolution":{"observed_at":"2026-05-19T19:07:43.517021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Tse and P","venue":null,"work_id":"27d74928-42d4-4ba1-beeb-0bd7de080034","year":2005},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:a2fc5916015ad4a2696d0d0bbbd2e521ca240e3bbb5dbcad0a959249b0a05c20","observation_id":"942ed502-23f0-43da-b85d-da881493aad7","resolution":{"observed_at":"2026-05-19T19:07:43.561816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Shannon-theoretic approach to a Gaussian cellular multiple- access channel","venue":null,"work_id":"98dfd160-cf0c-44db-896a-9a2968baa90d","year":1994},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:2797c911b7bf096eb9368e6f923d757b4052f34997596743c6d7263cf858bcf1","observation_id":"4105ae11-1a63-4cdd-8e6b-e07b48150ae4","resolution":{"observed_at":"2026-05-19T19:07:43.509614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Coordinated multipoint: Concepts, performance, and field trial results","venue":null,"work_id":"38a301ab-d9a8-4f06-abad-29eea0051da7","year":2011},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:a6aa0feb01dd4d118e2a155413632bc8eb1faf34395ea72e5b6649d3676e7bb3","observation_id":"056e8643-ca0e-49aa-b56f-86cc70eade38","resolution":{"observed_at":"2026-05-19T19:07:43.560065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Cell-free massive MIMO versus small cells","venue":null,"work_id":"c52f30d9-c0cc-4411-b04c-08af143672bd","year":2017},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:429915f75ca65b52f69b9be6f55b78340a450c103c066de217536fdfe14e8541","observation_id":"1f671c58-df61-45e9-9e45-c4e82d3a8c17","resolution":{"observed_at":"2026-05-19T19:07:43.574729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-09T08:26:04.983241Z","title":"Making cell-free massive MIMO competitive with MMSE processing and centralized implementation","venue":null,"work_id":"e69e4a92-0e61-4e71-82a1-2bc137ba59e7","year":2020},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:9175e076bce4e0d71bec650e7f46b4cba7d2118922ccc7000068f9006571f0a6","observation_id":"64351290-2ceb-4caf-b062-4ae1799b46a7","resolution":{"observed_at":"2026-05-19T19:07:43.505938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Ubiquitous cell-free massive MIMO communications","venue":null,"work_id":"c4f94f92-d028-4f26-b676-89521d01a099","year":2019},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:28132b8f50e78f074ce4a59d21e1aad1b7793c2adbd2d28521d5cb88f01684e2","observation_id":"85628336-8cd7-4624-8621-f5096e140244","resolution":{"observed_at":"2026-05-19T19:07:43.511360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Scalable cell-free massive MIMO systems","venue":null,"work_id":"3eb03140-244c-4dec-9d85-df1038d83241","year":2020},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:2e9c470db8ee90085ecd2265d3a4269b468e9db26a8caad96aaa4a3a2458a812","observation_id":"27568dbd-2356-46fe-a048-1839d6122f46","resolution":{"observed_at":"2026-05-19T19:07:43.572998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Cluster-wise processing in fronthaul-aware cell-free massive MIMO systems","venue":null,"work_id":"7db6a2f4-764c-4f13-9e23-b6552d14e1fe","year":2025},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:e28074f4d375c45c49dbfef77479ba41977f7d898a10e4b23fa06dfc68b3dc92","observation_id":"326d5a4f-068a-4ee5-808d-75219b8981a3","resolution":{"observed_at":"2026-05-19T19:07:43.524338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 decomposition for large-scale infrastructure- based wireless networks","venue":null,"work_id":"27f1a3f7-7c6d-4ad9-8ae7-9e5f5395413c","year":2017},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:15c8eccdf67a06a896a85f34f28d5b2da9fd971dc92949c5f5ffaa315a749895","observation_id":"d0422095-fcf0-4867-8547-033c421622c9","resolution":{"observed_at":"2026-05-19T19:07:43.576721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Clustered cell-free networking: A graph partitioning approach","venue":null,"work_id":"117febb5-c55b-4c1c-9cdc-1d075fb55c7e","year":2023},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:a9f6afac98f10d340ead09a47299b10b092d66466e3960b35943d7706c810fcd","observation_id":"1e1b145a-12df-41a3-8528-cd1ff6f7d990","resolution":{"observed_at":"2026-05-19T19:07:43.554652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Rate-constrained network decomposition for clustered cell-free networking","venue":null,"work_id":"8a7ccb2d-8686-4edc-8540-cf951757f808","year":2022},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:b96ed6f5cf45cd7a76ed34a2bd1fc320c587335c4fbed053a43d60dbf0c1185a","observation_id":"40762237-8626-4839-96d7-46c56e9bc938","resolution":{"observed_at":"2026-05-19T19:07:43.518889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 sequential minK-cut approach for sum rate maximization of clustered cell-free networking","venue":null,"work_id":"413ae7fc-4129-407d-94b6-74e2915d2b2d","year":2024},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:8f35ed754f5925130f239b7a22421100e71620d131a6e8ed25afcd13ca0d3776","observation_id":"06f8a12f-3851-4641-9b4f-ca319fb7caad","resolution":{"observed_at":"2026-05-19T19:07:43.515104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Tunable weighted kernelk-means for clustered cell-free networking acceleration and beam on-off control","venue":null,"work_id":"5e0ce5e3-2eea-49eb-bc4a-ece3b2d2b8da","year":2024},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:297dbfb28644c6b64aa60533e20dc55d4546914ca353c9ab37ff61f69b389faa","observation_id":"6a4cee3b-8ddd-4cfd-a71f-53f154226ad2","resolution":{"observed_at":"2026-05-19T19:07:43.520754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Tight differ- entiable relaxation of sum ergodic capacity maximization for clustered cell-free networking","venue":null,"work_id":"2f59e885-8e89-4ebd-964e-2546e56059a4","year":2024},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:270996231664627bc62eed4dca751a1d98cbf66142b17b8f8266caa035bcbf98","observation_id":"de2d2311-0b3e-424b-bffc-32e4ebac0311","resolution":{"observed_at":"2026-05-19T19:07:43.513237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Optimizing clustered cell-free networking for sum ergodic capacity maximization with joint processing constraint","venue":null,"work_id":"0be18da4-7364-44ab-8785-8b0fe1008251","year":2025},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:8841f8a8a6b4288a1ab67c710f005b644598342da4e2852a25dfda2c3bcc8e0e","observation_id":"b6fb1e5d-9ae7-4b36-9d7c-e9371fee17df","resolution":{"observed_at":"2026-05-19T19:07:43.507848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"C 2: A capacity-centric architecture toward future wireless networking","venue":null,"work_id":"ff3bcf79-ae47-4c3e-9121-ed3eff444aac","year":2022},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:bc3d65a080c5fe9b36c867d9a22f87ddba6db03bc59569cbf567ef4cbeb06ecc","observation_id":"c6c0d74d-c89b-4f07-ba59-fe835a38d4f0","resolution":{"observed_at":"2026-05-19T19:07:43.526118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"CGN: A capacity-guaranteed network architecture for future ultra-dense wireless systems","venue":null,"work_id":"7d9b4129-4829-4b72-bc3a-6330d9786a08","year":2022},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:76e5ad1a7da639ba206a1658e07abd4bc639dc6535bfbb90bbb307b3359fe30c","observation_id":"da96828b-7a96-4531-91bb-6237350fe4ab","resolution":{"observed_at":"2026-05-19T19:07:43.567443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Fair end-to-end window-based congestion control","venue":null,"work_id":"2512bf8a-91d9-44ce-a18a-1faf535ea7fd","year":2000},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:971b96a5c0879e945e2a6565de78ab7141a0d1a80ae0a2ad8014bc035958bc1b","observation_id":"0e986e0d-6213-4cdc-a7fe-19dd542cf74e","resolution":{"observed_at":"2026-05-19T19:07:43.613628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 quantitative measure of fairness and discrimination","venue":null,"work_id":"fe37f77b-2cd3-4a22-82de-b01ce1e054e8","year":2022},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:8f2206bf1524b54fc3875a565fb8a59cf9881f790b72f6be90111b3255f9bcb6","observation_id":"1232781e-8479-42a7-bbaf-770be6dad22d","resolution":{"observed_at":"2026-05-19T19:07:43.611547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Deterministic equivalents for certain functionals of large random matrices","venue":null,"work_id":"b56f42dd-d966-4350-a3fa-3668d5bc9168","year":2007},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:beb861418faa09a90328d7cc0a80677c328596a0f6b69ab38f7fdb35798fae81","observation_id":"28d9fbc7-13af-488c-80d5-19adb74d05d0","resolution":{"observed_at":"2026-05-19T19:07:43.599435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 power allocation scheme for non- orthogonal multiple access withα-fairness","venue":null,"work_id":"a30b0e88-301b-4af5-83f5-3cf7d8d7884c","year":2017},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:381d953962f0441ea7e68c3fc9a616197eb6a1b5ef441e485ae1509535157859","observation_id":"681f191e-b2d2-48cb-8673-5225b82d0090","resolution":{"observed_at":"2026-05-19T19:07:43.605221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Enhancing user fairness in wireless powered communication networks with STAR-RIS","venue":null,"work_id":"77174dd5-09c8-49f7-807d-d092d6f62500","year":2025},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:805da9bde28c706f50cc40597822841b16db1fb88b631aecb4f004ce9937e875","observation_id":"2f42925d-ed71-49a3-8a75-65a7447e8ef8","resolution":{"observed_at":"2026-05-19T19:07:43.595630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Fairness scheduling in user-centric cell-free massive MIMO wireless networks","venue":null,"work_id":"ec21f5bc-8dc7-4647-9931-5fc466a51b35","year":2024},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:c45db8339348b3a03338491f22250eef0998fa0182d08699bd3e2653f2b60cc5","observation_id":"028b4f11-20a7-4b3e-bf4a-bf3c662f0cc5","resolution":{"observed_at":"2026-05-19T19:07:43.588071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Fairness in wire- less networks:issues, measures and challenges","venue":null,"work_id":"9341bf74-b2ca-4130-940d-a0b8cea00661","year":2014},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:7659785b60ad2b56807e830d463fbf20e1fb1d3d58d6f1a19eee52ed1fc95106","observation_id":"d9768bf2-10f3-4621-99df-632006bd7fb4","resolution":{"observed_at":"2026-05-19T19:07:43.590048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Fairness for non-orthogonal multiple access in 5G systems","venue":null,"work_id":"0b4ae334-75d3-4519-a97c-cfa3cf47c059","year":2015},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:7ecca295b3f2a86fa35f0240b68620227a62f02312666c53c823b36e84d086b7","observation_id":"e98683b9-2f74-43ee-af9f-00fbb1f8d492","resolution":{"observed_at":"2026-05-19T19:07:43.584211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"On the outage performance of non-orthogonal multiple access with 1-bit feedback","venue":null,"work_id":"6c9f8665-9317-4573-bb19-48eeed61d7e6","year":2016},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:06ee8ff0617084a038118e624fa2a2610a7673bb6031d79b845372f14cf1583e","observation_id":"bcd07c63-0005-4837-b28f-bd0b9358f863","resolution":{"observed_at":"2026-05-19T19:07:43.578560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Fairness of user clustering in MIMO non-orthogonal multiple access systems","venue":null,"work_id":"1cbb849d-042c-462e-beae-7aaeeb781474","year":2016},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:fe5c164cd153daa816af1cbb8bf0a0356384c4a490f9431726eabe0df7a885a2","observation_id":"4ce648b8-2a0f-40fa-b3bd-5b58a277e908","resolution":{"observed_at":"2026-05-19T19:07:43.580371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Proportional fairness-aware task scheduling in space-air-ground integrated networks","venue":null,"work_id":"847fcd7f-facd-41b2-83f7-49d9ec892668","year":2024},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:950f267aa35d6f33d628235ea00ee687bedd9246c51ad6002599d4190ecf73ab","observation_id":"1aa6c4f9-6869-4a4c-9d35-2112c7845848","resolution":{"observed_at":"2026-05-19T19:07:43.582437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 axiomatic theory of fairness in network resource allocation","venue":null,"work_id":"034ddcb4-d419-413a-9734-49b067ca8c5e","year":2010},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:f74826a450ca00d63a21032ec9c37868d811f570d5fa54fad8f666a693d0ffc1","observation_id":"837de288-77b1-416e-bd24-c4aed59437f9","resolution":{"observed_at":"2026-05-19T19:07:43.586123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Rate control for com- munication networks: shadow prices, proportional fairness and stability","venue":null,"work_id":"da1e9119-a753-488c-8ff2-1d6fd5b2dc24","year":1998},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:388c4d8d9fe93e46671fbe5b585df37292d36f599c2790d2a68a880c5c5e4e7f","observation_id":"4927f5a1-0a18-4319-a68b-698360e6e55d","resolution":{"observed_at":"2026-05-19T19:07:43.591957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Foundations of user- centric cell-free massive MIMO","venue":null,"work_id":"1225f3f0-6d8d-4ef1-9a64-7c5999b95b03","year":2021},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:f8532e47ee8309e92de995ddfe18b2ca17eaf54e323b400cc6225998c106ceb2","observation_id":"7bb6939b-395d-416a-b8e0-cb0247cb1b85","resolution":{"observed_at":"2026-05-19T19:07:43.593766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Graph matching by simplified convex-concave relaxation procedure","venue":null,"work_id":"b9d0ab46-0d99-49e2-af49-a1b5a3bc439f","year":2014},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:f62347fd1270966afc17fa289825fe3f0b7d982cba09b358c128cf297a8b8b0f","observation_id":"99e17d50-f998-4b36-9830-6dacd25f2e5b","resolution":{"observed_at":"2026-05-19T19:07:43.601166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"GNCCP—graduated nonconvexityand concavity procedure","venue":null,"work_id":"1d08a7de-3fd4-46d9-af59-b30964b6a04e","year":2013},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:0017cb75b173b6dff533bbc54f406f63ca9f92ab90c05e0fe0ae178e084a2792","observation_id":"de38e261-96a0-4f4f-98ac-13b06fda617f","resolution":{"observed_at":"2026-05-19T19:07:43.571110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 algorithm for quadratic programming","venue":null,"work_id":"6d48a63d-449e-4c18-8d0f-6214a99e69bf","year":1956},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:35d4c095f7e1be18430c15aa1b1e588653257980cb0da8f9670698db3db35934","observation_id":"bb344fd1-1a9e-4792-8468-d4af78adcc27","resolution":{"observed_at":"2026-05-19T19:07:43.556377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 optimal production transport: Model and algorithm","venue":null,"work_id":"63931946-0efe-4499-8563-120e7cba00fd","year":2025},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:58ee71516f7a9b5a128485e85baeca4bd7d2c158c0f81abb89f33b05dbbedaab","observation_id":"db0f197b-d76e-435d-9495-c400daa3f904","resolution":{"observed_at":"2026-05-19T19:07:43.607105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem","venue":null,"work_id":"73f006f9-7466-4776-8cfa-8ac51299edb7","year":2021},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:bd33efc283fbd8f6bd82b420f79d074df638dc84ceee15f62b7243dcfa1058b9","observation_id":"584074f3-6d8a-4412-b349-818d2e5e8c85","resolution":{"observed_at":"2026-05-19T19:07:43.597628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-10T04:36:46.303182Z","title":null,"venue":null,"work_id":"50d94276-e808-41be-8402-a52c13d04913","year":2004},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:1eb66229d1d116210afb2157a790110e622a6c8ac81290ed1da3be757bc79ee1","observation_id":"49cbcdf5-fbcb-4f55-8b6a-2fc305e2d2a0","resolution":{"observed_at":"2026-05-19T19:07:43.547147Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Linear assignment problems","venue":null,"work_id":"4102ea68-f5d7-4aae-b531-b0d8c3d37b7d","year":1987},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:456c367a98f83e0933ebc0a6c54d2b6af1795393fb16f8fabffe624c9721f59b","observation_id":"7ab6d0ff-30d6-439b-8275-32dbd467fb43","resolution":{"observed_at":"2026-05-19T19:07:43.552674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 frank-wolfe algorithm: a short introduction","venue":null,"work_id":"f0469d49-4815-451b-b292-e8b664ed0faa","year":2024},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:c72eeba502dd3d414226728390a6b7336f35acb809bf3b9660f95fe200883322","observation_id":"acd94be5-0ac5-43f0-a058-ab112b0f1c6c","resolution":{"observed_at":"2026-05-19T19:07:43.615432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Nonlinear programming","venue":null,"work_id":"bcf7d1df-4882-49aa-9c43-41b2f9af52c0","year":2013},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:0641637fe83e7bd39fc5e4b37b5265096fa95c045a1ce71374adcc6704fa22d4","observation_id":"64291799-1ee3-4bc9-9612-6bb3a1377879","resolution":{"observed_at":"2026-05-19T19:07:43.550904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Sinkhorn distances: Lightspeed computation of optimal transport","venue":null,"work_id":"aac7a0cb-837d-42ef-83c7-7ab0303f54fe","year":2013},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:2438903706d319a01dce72ff0d8c65d74ec179a5e682b95d56f606648e70cadd","observation_id":"5fd709dc-3f22-4556-a72b-28ad9dfb2433","resolution":{"observed_at":"2026-05-19T19:07:43.603353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Balanced k-means for clustering","venue":null,"work_id":"45ec8def-4206-416b-b598-8a3c9d2354c8","year":2014},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:9f9d93a4b784e49bc6dd73be61fe2f150d038ea9e06cdaabc110e18fd4b1d333","observation_id":"f70d42a3-8342-4dae-b798-053d6510db20","resolution":{"observed_at":"2026-05-19T19:07:43.617213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Solving a class of non-convex min-max games using iterative first order methods","venue":null,"work_id":"9eebd083-cb6a-407b-a277-6134a53f8bc0","year":2019},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:90f045fdc534aedce5c50188c252f00a2f3a0a38093be1ff24193ebde3f73278","observation_id":"db4c4027-6478-44bb-8313-530e1a9bf087","resolution":{"observed_at":"2026-05-19T19:07:43.549101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 theory of max-min, with applications","venue":null,"work_id":"31fcdad1-9bf8-4234-abc4-3870c9df135d","year":1966},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:c53097ebd255fb138cc1e150e702c285f89c79b38b31fbd0e54de32354d725b5","observation_id":"1265dc9d-f1f1-47e8-b01b-c026d5554a4d","resolution":{"observed_at":"2026-05-19T19:07:43.558167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Nonconvex min-max optimization: Applications, challenges, and recent theoretical advances","venue":null,"work_id":"2ecee738-2fc5-4925-824b-acf6593ca4ba","year":2020},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:c3da4f275657fba5fe2c96a02267f1064db7865ec407f46a42b96512d0cef21c","observation_id":"b41661dd-608f-4821-b15a-751c0455c3b3","resolution":{"observed_at":"2026-05-19T19:07:43.544811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 method for finding projections onto the intersection of convex sets in Hilbert spaces","venue":null,"work_id":"f153a1b4-c9af-4832-a33a-78ac16885efb","year":1986},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:302264da7b204c5cc33d896b3824a4016c2ffddfab4743cec3fde72d713706f0","observation_id":"516bb0cb-8904-4d4f-8e37-8cd4e4df8d91","resolution":{"observed_at":"2026-05-19T19:07:43.563690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Dykstra’s algorithm with Bregman projections: A convergence proof","venue":null,"work_id":"59979ac2-4650-4e8b-9c80-85225dd3ba00","year":2000},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:c39357201b8641be96012895664c9836930d345d2758e3107a233e728ade311b","observation_id":"45715010-3082-4c37-9da6-df280aff3cf1","resolution":{"observed_at":"2026-05-19T19:07:43.569293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Two Bregman projection methods for solving variational inequalities","venue":null,"work_id":"1949961d-d1c7-4415-9c34-91389439abcb","year":2022},"citing_paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-19T19:05:37.675251Z"},"links":{"citing_paper":"/paper/2605.16960"},"observation_digest":"sha256:4ffa9f32da8c82e52df6c3dccddf8f8f4911e83aa09253f03661f85c12a1989e","observation_id":"45a6fab1-dc7a-4da6-8555-f20123b387f0","resolution":{"observed_at":"2026-05-19T19:07:43.522542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.16960","last_updated":"2026-05-16T12:23:04Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T23:28:02.429673Z","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":50},"total_outbound_references":51},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2605.16960."}