{"as_of":"2026-08-21T13:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:495d4a332c3cc26efc8832a1bc0d0431c336206211f1f561418b1c5022b5db9b","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:58:04.786403Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"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/2502.08734/citation-record","integrity":"/paper/2502.08734/integrity","json":"/paper/2502.08734/citation-record.json","paper":"/paper/2502.08734"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.602174Z","title":"A novel channel coding scheme for digital multiple access computing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.602174Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:5578477becb58938fd17f2db1b24dff5dc973c4397f9f10fe48f41c51870758c","observation_id":"00046d95-cb56-4392-9e04-abe158613297","resolution":{"observed_at":"2026-08-07T23:58:04.602174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.483544Z","title":"On the road to 6G: Visions, requirements, key technologies and testbeds,","venue":null,"work_id":"132d2603-dc04-437f-8206-cf7ed0cfcb74","year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.606294Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:ba04406950867f0f734a742285a661d0003781d41d464eff5681aa89e0a68be1","observation_id":"df232159-08a2-4c94-96d4-fb4162b5e2c3","resolution":{"observed_at":"2026-08-07T23:58:05.487383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.472221Z","title":"Guest editorial: Ultra-low- latency and reliable communications for 6G networks,","venue":null,"work_id":"32e9aaf1-b679-483b-9633-22c15a42910f","year":2021},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.610195Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:4bdad4ccc65e107fc104479d22acadcc64445897fe4cd98aa05a40132b33f03a","observation_id":"d032051a-d5c4-47b7-ae8c-a80e659de12f","resolution":{"observed_at":"2026-08-07T23:58:05.476247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2210.10524","last_updated":"2024-05-23T02:13:34Z","snapshot_observed_at":"2026-08-19T19:40:19.605686Z","submitted_at":"2022-10-19T12:58:48Z","title":"Over-the-Air Computation for 6G: Foundations, Technologies, and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10524","snapshot_observed_at":"2026-08-07T23:58:04.613988Z","title":"Over- the-air computation: Foundations, technologies, and applications,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.613988Z"},"links":{"cited_paper":"/paper/2210.10524","citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:d33a3f692960ea22a0f043ee8a570f69a9fc667831741ad0c96f77765e871367","observation_id":"7714d6e3-3b29-47ed-9798-b0a63086e741","resolution":{"observed_at":"2026-08-07T23:58:04.613988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.618020Z","title":"Federated learning in mobile edge networks: A comprehensive survey,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.618020Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:2db00df6750472bc50d1a0991a26a281159fb70e5d671d83c41ef5b43f968fd4","observation_id":"2a972af4-9c0a-4e80-af33-557f1334c1b3","resolution":{"observed_at":"2026-08-07T23:58:04.618020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.454164Z","title":"Networked sensing with AI- empowered interference management: Exploiting macro-diversity and array gain in perceptive mobile networks,","venue":null,"work_id":"79d2e202-8e88-40d5-bf0b-38b954776ad8","year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.621871Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:c0d9e6ac2030bb643519e589a49c5ad77223803b895f62624c287abd0903c8f1","observation_id":"b79262f6-9f93-4324-8bc7-4a689928941c","resolution":{"observed_at":"2026-08-07T23:58:05.458202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.444049Z","title":"OFDMA: A broadband wireless access technology,","venue":null,"work_id":"7362d766-2e93-48b7-bd4c-ded1a02c9d12","year":2006},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.625812Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:770c304b6756ea5c49a098f42595fcfd4b902403d44bef37655889886fd391db","observation_id":"114aacc5-6b2d-46a1-9044-83cc4c426098","resolution":{"observed_at":"2026-08-07T23:58:05.447635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.434077Z","title":"A survey on over-the-air computation,","venue":null,"work_id":"4a4e4e67-d6ee-4b69-b888-f58e0005cfb3","year":1908},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.629001Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:cb86b463004ff692d1f130b31d41d5299007ad864c15d928cffd3ca615f1d394","observation_id":"a8bfbf24-08e0-4df8-ab4d-7a7f9129bf7d","resolution":{"observed_at":"2026-08-07T23:58:05.437586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.632411Z","title":"Waveforms for computing over the air,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.632411Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:fc5aec5e6dab449d160ec19fc129fd8328d29373d4db17314210445f9d3f4a3c","observation_id":"f1f76652-8238-4799-b4c3-c7d94f94a196","resolution":{"observed_at":"2026-08-07T23:58:04.632411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.423293Z","title":"Over-the-air computation for distributed systems: Something old and something new,","venue":null,"work_id":"f0861ead-2c9a-438b-8bad-718acc8374dc","year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.635867Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:728c71ed20c05cb38c798046c832bd266cd836f9eaa917a89aff500b5ad583dd","observation_id":"29ccc27b-056a-48bc-833c-9fae38895475","resolution":{"observed_at":"2026-08-07T23:58:05.427053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.639316Z","title":"Harnessing interference for analog function computation in wireless sensor networks,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.639316Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:1182e4a1002979c6df6a76c0706e6c1f3a01367d91f796a999ec2c64e9a39da5","observation_id":"99115b89-1d18-483d-a6a9-0837f3e53065","resolution":{"observed_at":"2026-08-07T23:58:04.639316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.406030Z","title":"Broadband digital over- the-air computation for asynchronous federated edge learning,","venue":null,"work_id":"6c7c14d3-7c6a-450b-a1cd-6cb0df67efb6","year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.642884Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:6919103e54c43071e51905e608db8b823ecc0fab640e4dd454f6ea45107a9fad","observation_id":"b852e9de-ce88-4a86-a3f9-966cb96696f2","resolution":{"observed_at":"2026-08-07T23:58:05.409677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.646041Z","title":"Federated learning over wireless fading channels,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.646041Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:96aebfcb510df1b8264f563ecf2480115258cf5f9eb1ec6fa1deb423dad4cf70","observation_id":"f125abc5-b895-410e-a33f-06884d5cf685","resolution":{"observed_at":"2026-08-07T23:58:04.646041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.649292Z","title":"Wireless for machine learning: A survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.649292Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:e9927b8579a426a8d2719deef306d1149fd3af2660062b045114e66cbc9f1b66","observation_id":"92d6a8b5-c7b9-404a-8967-f29b590f1629","resolution":{"observed_at":"2026-08-07T23:58:04.649292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.382467Z","title":"ChannelComp: A general method for computation by communications,","venue":null,"work_id":"26ae5e65-de8a-4cdb-bb97-342f8f95ed49","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.652416Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:2507f518f0d51f7ca403d4552720108d2d9bc96f80a092f1f119b69ddaa290e9","observation_id":"0de7126b-6aed-4b66-9a10-f9cd2f3f6045","resolution":{"observed_at":"2026-08-07T23:58:05.386120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.655687Z","title":"Computation over multiple-access channels,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.655687Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:63e3a640fe74317d0629066f1fcf99e5346789c8840c4b4f5f8c88802fe2b3cb","observation_id":"1412e1d6-b214-434b-9967-d9ae1890a089","resolution":{"observed_at":"2026-08-07T23:58:04.655687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.366985Z","title":"Compute-and-forward: Harnessing interference through struc- tured codes,","venue":null,"work_id":"c8ea7e5f-4d8b-43f4-8928-3ae959108f75","year":2011},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.659095Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:e1e3c669f4f8b5f04ce806914939488ce3209e28ad4a318b23536b07237f4998","observation_id":"c0927bf0-a945-4221-ac62-1e66502c8d88","resolution":{"observed_at":"2026-08-07T23:58:05.370437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.357281Z","title":"Nomographic functions: Efficient computation in clustered gaussian sensor networks,","venue":null,"work_id":"1b12fb82-dcd9-44b5-b222-9fdf98587227","year":2014},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.662445Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:29af9d0b7824d2d4f1ebd977c22d641328e9b365924b0ce8d54e5e4a1dbb93e7","observation_id":"220ea3ce-d2d8-4134-8bdc-d48eb033d883","resolution":{"observed_at":"2026-08-07T23:58:05.360680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.347613Z","title":"On achievable rates for analog computing real-valued functions over the wireless channel,","venue":null,"work_id":"f956e0b9-84b0-4d1c-a69b-572843b0f8cf","year":2015},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.665814Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:06188fb43b14f16ea2ad638f78f36f953eb49f57a6d832d71b5c268d55572415","observation_id":"986b59cb-2404-4adf-88aa-e6766f82453d","resolution":{"observed_at":"2026-08-07T23:58:05.351373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.337902Z","title":"MIMO over-the-air computation for high- mobility multimodal sensing,","venue":null,"work_id":"35b04915-a59b-4b93-8b46-4ea91c9df409","year":2018},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.669183Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:e05af46dbaef5168b9464a1f2578f216326f3618cc3610289c1c38deed3c3be1","observation_id":"bb4769ad-342d-41af-8209-b9d98b480651","resolution":{"observed_at":"2026-08-07T23:58:05.341513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.328077Z","title":"Blind asynchronous over-the-air federated edge learning,","venue":null,"work_id":"60131f16-1557-451c-96ab-aa13cc8c2348","year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.672379Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:0abecfb399e3ccad4e31b37d7bdbd20c3c27836a41f7310b728c290397e08737","observation_id":"59427fe5-52fa-4dfe-b4ea-e279343c5918","resolution":{"observed_at":"2026-08-07T23:58:05.331609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2406.17393","last_updated":"2025-05-02T11:47:09Z","snapshot_observed_at":"2026-08-16T13:39:50.753489Z","submitted_at":"2024-06-25T09:12:24Z","title":"Timely and Painless Breakups: Off-the-grid Blind Message Recovery and Users' Demixing","version":2},"cited_work":{"arxiv_id":"2406.17393","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.17393","snapshot_observed_at":"2026-08-07T23:58:04.848158Z","title":"Timely and Painless Breakups: Off-the-grid Blind Message Recovery and Users' Demixing","venue":"cs.IT","work_id":"460fc53b-f9f9-475d-8921-abc14fa4d46e","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.675716Z"},"links":{"cited_paper":"/paper/2406.17393","citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:53b84110a2eb5d86bec9898ca551a4174671e8d2772d926b5da0b4184bfb8c09","observation_id":"c0e39077-3dec-434c-bb4c-b4a3c557e1bf","resolution":{"observed_at":"2026-08-07T23:58:04.851991Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.317364Z","title":"Power minimization for massive MIMO over-the-air computation with two-timescale hybrid beamform- ing,","venue":null,"work_id":"b760d7e5-db60-435f-b8a2-42314a6d1c04","year":2020},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.679346Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:1919b0c59f4bef730c1dba4e024dc781bebab24298e4e2d311f5974a6fc6afab","observation_id":"f7faa4da-e393-48a1-9845-b6d2d0cb8d1d","resolution":{"observed_at":"2026-08-07T23:58:05.321529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.307599Z","title":"Secure over-the-air computation using zero-forced artificial noise,","venue":null,"work_id":"6357ee2b-250c-4605-9938-088225590de7","year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.682393Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:9b73f0bb0d924dc9d27b180348e62c834f64fc2db971977591bfec1f05e8db18","observation_id":"ac71387e-0a85-424c-bed5-95f3f269bedd","resolution":{"observed_at":"2026-08-07T23:58:05.311077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.298097Z","title":"Fundamental limits of over-the-air optimization: Are analog schemes optimal?","venue":null,"work_id":"8ecaac70-a671-4e8a-aa08-1cecf9536c5e","year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.685695Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:b2fc33aefc89268b687feab13884a6d47d28dec07ef33e544fef349bd00a06f6","observation_id":"cff724d7-3769-4ad9-a181-ef2aac5a1499","resolution":{"observed_at":"2026-08-07T23:58:05.301438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.288321Z","title":"Over-the-air computation over balanced numer- als,","venue":null,"work_id":"9a5688bf-ff2b-4473-8d50-af6ef605f4af","year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.688806Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:8d02ddfc4f1bba802ee0cd07daf25380a1ad25087fcac15a6e80eec76a65ce69","observation_id":"2894afae-1b05-41ca-a443-34405de26479","resolution":{"observed_at":"2026-08-07T23:58:05.291850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2402.09657","last_updated":"2024-02-15T01:50:46Z","snapshot_observed_at":"2026-08-19T09:03:36.437720Z","submitted_at":"2024-02-15T01:50:46Z","title":"Digital versus Analog Transmissions for Federated Learning over Wireless Networks","version":1},"cited_work":{"arxiv_id":"2402.09657","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.09657","snapshot_observed_at":"2026-08-07T23:58:04.832043Z","title":"Digital versus Analog Transmissions for Federated Learning over Wireless Networks","venue":"cs.IT","work_id":"8f1a33ef-b484-4d7b-8125-1461a04bc3e9","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.691959Z"},"links":{"cited_paper":"/paper/2402.09657","citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:7906d8e4d2994d632b2a7c71dd4d1199fa18331d428705fce4de3046154a140c","observation_id":"1b4718fc-de87-4fac-b2fd-62dd11e424ec","resolution":{"observed_at":"2026-08-07T23:58:04.838110Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.278385Z","title":"Blind feder- ated learning via over-the-air q-QAM,","venue":null,"work_id":"0d6fad53-fb35-487f-9967-a9e1fb6c6239","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.695561Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:0126a1b8ad67df01be1667650dc12519113fa30db209266be916d56f1a2b7684","observation_id":"b035af11-6d1d-4bfc-9b89-a99f375819a9","resolution":{"observed_at":"2026-08-07T23:58:05.281865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.698679Z","title":"One-bit over-the-air aggre- gation for communication-efficient federated edge learning: Design and convergence analysis,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.698679Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:d4e390ed3f06c5270a9bcc63421e210c80f6cec8e856f7df5d80315d85c502ee","observation_id":"2314cc62-95ba-471d-911f-b3e12964c7ad","resolution":{"observed_at":"2026-08-07T23:58:04.698679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.262158Z","title":"Broadband digital over-the-air computation for wireless federated edge learning,","venue":null,"work_id":"79b09102-8f09-43b8-9a41-98013978497d","year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.701735Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:e793e8165168d4e37e715e376246cb758bae97d39deb273cdfb3bb5dabe601d2","observation_id":"65832db0-6dd1-4076-bc0d-209b6dbd79da","resolution":{"observed_at":"2026-08-07T23:58:05.266073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.252159Z","title":"Over-the-air majority vote computation with modulation on conjugate-reciprocal zeros,","venue":null,"work_id":"e8a00c7f-184e-43d9-9d0d-bad2690f22aa","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.704781Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:6c8c049e9d6875347007c02600559fc59a59103b00f4fa600e2ce96867ab890b","observation_id":"a53113d4-7329-4e22-8c61-ee766e706f45","resolution":{"observed_at":"2026-08-07T23:58:05.255581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.242481Z","title":"Massive digital over-the-air computation for communication-efficient federated edge learning,","venue":null,"work_id":"9cda78c4-ad11-403e-9d54-e5c9d3f03d52","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.707931Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:95865a6280e072bc4a42fb2540ed3a7c07f384913e94cab35fced92e419c4212","observation_id":"8396f73b-e32f-4c31-9656-29b30597e249","resolution":{"observed_at":"2026-08-07T23:58:05.246058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.232791Z","title":"signSGD: Compressed optimisation for non-convex problems,","venue":null,"work_id":"8be37ccd-a139-4ff5-97eb-f92a072ec524","year":2018},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.711198Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:2cfd2f65e591d8518e5f3f4acc51a4abfde4357f5e39d734ea18058799897365","observation_id":"6350ece8-9c43-4eb0-8cef-1e2719854e86","resolution":{"observed_at":"2026-08-07T23:58:05.236174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.222845Z","title":"Computing functions over-the-air using digital modulations,","venue":null,"work_id":"7d6e9bd3-f57c-4cac-8ef5-42b997fa8190","year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.714295Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:1e7b9d296eaad5d6451f1a5c63ce0d888016387e8a8a48c47df9c3993b023ca9","observation_id":"a78ef9ef-f56c-461d-a060-6cf5f8471672","resolution":{"observed_at":"2026-08-07T23:58:05.226499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.213293Z","title":"SumComp: Coding for digital over-the-air computation via the ring of integers,","venue":null,"work_id":"4db2e8fe-bf6d-427b-bb65-0520c3197586","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.717459Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:c11c36b96066fcfa3108064d7ce96cd7c85e7d2aca3291704fda44a90bee7a35","observation_id":"a688bd59-3cb0-440f-a95e-93f0dd264409","resolution":{"observed_at":"2026-08-07T23:58:05.216777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2404.07121","last_updated":"2024-04-10T15:59:48Z","snapshot_observed_at":"2026-08-16T14:02:01.311055Z","submitted_at":"2024-04-10T15:59:48Z","title":"Digital Over-the-Air Computation: Achieving High Reliability via Bit-Slicing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07121","snapshot_observed_at":"2026-08-07T23:58:04.720989Z","title":"Digital over-the-air compu- tation: Achieving high reliability via bit-slicing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.720989Z"},"links":{"cited_paper":"/paper/2404.07121","citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:b82bc79be6e2bc3eec13d9fa6e152f87824517bbb022c381b61abacb51f47829","observation_id":"5474615e-a0de-45db-954d-6dc7c9980731","resolution":{"observed_at":"2026-08-07T23:58:04.720989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06829","last_updated":"2023-11-12T12:55:21Z","snapshot_observed_at":"2026-08-18T05:54:54.539671Z","submitted_at":"2023-11-12T12:55:21Z","title":"Joint Design of Coding and Modulation for Digital Over-the-Air Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06829","snapshot_observed_at":"2026-08-07T23:58:04.724626Z","title":"Joint design of coding and modulation for digital over-the-air computation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.724626Z"},"links":{"cited_paper":"/paper/2311.06829","citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:8238c4d0c3e5a94288bf89f44956efb9344320ba9713549662b6e1f8324ac049","observation_id":"6d4fded1-2b91-4039-8180-45f294e4d2a9","resolution":{"observed_at":"2026-08-07T23:58:04.724626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.728193Z","title":"Optimized power control for over-the-air computation in fading channels,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.728193Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:f9a09af6ee5b8201fd9d05d3c0bebb7486e574c5afbf834dafd18b1e08f8ff0c","observation_id":"28b15b69-2135-4db6-93ff-f1f9f69d0666","resolution":{"observed_at":"2026-08-07T23:58:04.728193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.198045Z","title":"Optimal power control for over-the-air computation,","venue":null,"work_id":"6e7ce692-0118-4424-bf16-e91a4339c28e","year":2019},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.731363Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:3058f82da27706c40a9701756a0f507ebf31611245cb50b50abeece80d0ef0ca","observation_id":"1bbea5c5-1170-4ac1-9a5d-9cf0c0724c0a","resolution":{"observed_at":"2026-08-07T23:58:05.201511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.188219Z","title":"Mobile lattice-coded physical-layer network coding with practical channel alignment,","venue":null,"work_id":"2b156f57-bfaa-4dce-98da-e77b8ac32700","year":1908},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.734501Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:a1ab00a1153374d2eccdab8b20c9a3112655f5e218a5efff723f14583c60ea49","observation_id":"fac06370-e01a-476e-977c-9b7c2a687359","resolution":{"observed_at":"2026-08-07T23:58:05.191867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.178467Z","title":"Over-the-air aggregation for federated learning: Waveform superposition and prototype validation,","venue":null,"work_id":"f95a84f8-b444-4455-ac46-0012e1599f14","year":2021},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.737839Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:0ad3d4398ffd9a48aa7284b715fc7104c00494f63bc1eacf522b824dbfc6b60a","observation_id":"dce64b78-e370-4a75-97f9-0102f89272f5","resolution":{"observed_at":"2026-08-07T23:58:05.181974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.168821Z","title":"Transmit beam- forming for physical-layer multicasting,","venue":null,"work_id":"25ab5c43-8536-4b04-a94a-ecb0771e07c6","year":2006},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.740916Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:8a0570bbfac8e5955cc2093ae007bfab4028b2c24360440a67d4dbbb864c167b","observation_id":"e0e14e6a-952e-428c-bf51-5c89354f5e30","resolution":{"observed_at":"2026-08-07T23:58:05.172332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.744007Z","title":"Semidefinite programming,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.744007Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:911f1e789d002f590ad6290c409f968c7e306060b90fb139a5ec75fc43978c2a","observation_id":"e7f3fb63-2182-4a7a-9cec-3cff61e30c8b","resolution":{"observed_at":"2026-08-07T23:58:04.744007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.153492Z","title":"CVX: MATLAB software for disciplined convex programming, version 2.1,","venue":null,"work_id":"e755a045-739b-49ab-b60c-96c075b2d4b1","year":2014},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.747452Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:f49fca78756bbc2bdf7b4b4baa63773e09bb6819cf675fe9f4ae38670fe4612a","observation_id":"4dbc3f7c-afa1-4b5a-9561-cfb98921d913","resolution":{"observed_at":"2026-08-07T23:58:05.156922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.144022Z","title":"Global optimization algorithm for mixed integer quadratically constrained quadratic program,","venue":null,"work_id":"0e78ed5e-a21e-4729-9767-a2009a019259","year":2017},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.750887Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:07a66006c6bc685ed527dcad8ac8120a077b7e8907d5d74b9cfe715b3b6e8a89","observation_id":"a711850a-2bf0-4abf-ad25-38e6eaa34ddb","resolution":{"observed_at":"2026-08-07T23:58:05.147483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.134330Z","title":"A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs,","venue":null,"work_id":"85e508a9-2427-43eb-ae36-af76041b4f51","year":2005},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.754285Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:506a43fbf21bdbd6a239f3fb6aed88c8e2594a1bdf0f05e5a3258efa9ac30517","observation_id":"ce76bc04-690e-41bf-b597-1895f1463013","resolution":{"observed_at":"2026-08-07T23:58:05.137785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.124701Z","title":"Optimization with Gurobi and Python,","venue":null,"work_id":"dae144e0-121d-420d-a0b7-8569f33bd1c2","year":2011},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.757538Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:09cdcee944021226651c5bd5f5e5a4ff09305928fefa6ded2549519f0d295cb7","observation_id":"1a5152d0-cac5-47bc-b8fb-8626209f70c4","resolution":{"observed_at":"2026-08-07T23:58:05.128232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.020778Z","title":"Alternating minimizations converge to second-order optimal solutions,","venue":null,"work_id":"367bb783-30f6-4b63-b5f7-8db3a8b7acbf","year":2019},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.760813Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:43af0ab9060f798f3a73ea7a2301afa707dfa4ed77b92257246725fc8c0bfc96","observation_id":"f3e6b0f1-b53c-4d14-8505-3fd4e9ce3b24","resolution":{"observed_at":"2026-08-07T23:58:05.024440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.010565Z","title":"Ye, Interior point algorithms: theory and analysis","venue":null,"work_id":"6d7316aa-d593-4177-8f59-ee2acaca9660","year":2011},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.764092Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:b59abef10c9f5fbffd5ed68f9f2ef65a19a81f63d109a2b6bd2e90479f7ec021","observation_id":"9f67d880-d0b4-496d-b61e-7c7f2e42e3ae","resolution":{"observed_at":"2026-08-07T23:58:05.014051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:05.000951Z","title":"Antoniou and W.-S","venue":null,"work_id":"bffc8a4f-a069-40cd-886b-391378a1fb03","year":2007},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.767306Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:f103727af63fc5a6a14263737ae0979c36d0aa0d1b152b6642bf4bfadef15177","observation_id":"466a6101-8bd1-4b60-9663-5449587a14f2","resolution":{"observed_at":"2026-08-07T23:58:05.004317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.990668Z","title":null,"venue":null,"work_id":"08d0989d-ea2a-4553-ac15-6204f71d9a66","year":2022},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.770439Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:91501566acb29eeef0518826e0cec25bf1af3702faab979a303cb5ab8247ab6e","observation_id":"d0fc05af-686e-4d34-95d1-b291a126b24f","resolution":{"observed_at":"2026-08-07T23:58:04.993990Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.980815Z","title":"Zhang, Branch-and-bound search algorithms and their computa- tional complexity","venue":null,"work_id":"244e0bd9-80e7-4430-b36b-7de35b22f6b7","year":1996},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.773809Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:e00d6b99d07f7862dcbcf45d2040506987ea2829df6426519cab8acde4adb1e2","observation_id":"e382a21a-412c-4f09-8a33-de8e2faf589b","resolution":{"observed_at":"2026-08-07T23:58:04.984294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.970740Z","title":"De- terministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems,","venue":null,"work_id":"7f921517-f2c3-42c1-808c-f0fcd316b14a","year":2012},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.776969Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:aa8077b49552a32909e83aeb6e99e11c8e4e65c045d50830cff17bfa144a3165","observation_id":"f62c5d3b-a5a3-470c-b4f5-6430ad53e796","resolution":{"observed_at":"2026-08-07T23:58:04.974516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T23:58:04.780019Z","title":"On the convergence of block coordinate descent type methods,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.780019Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:0788b3266622a6681e7376b641cd80de6fc3c1525fefb7c03cdff19b9c613253","observation_id":"9ab9ddf7-b556-44a4-954d-5d9832fbcf02","resolution":{"observed_at":"2026-08-07T23:58:04.780019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.955348Z","title":"A fast minimization algorithm for the Euler elastica model based on a bilinear decomposi- tion,","venue":null,"work_id":"7ec92c0b-84ac-49fc-8b4d-55ac38a2457f","year":2024},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.783197Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:a764e4619c9b2514c61126f7e8241a30189df94f38bb43d1de2883bd999f998b","observation_id":"71557e5c-5985-4c30-887a-f8b79a09e9d9","resolution":{"observed_at":"2026-08-07T23:58:04.958900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:58:04.945195Z","title":"SDP relaxation of homogeneous quadratic optimization: approximation,","venue":null,"work_id":"07037100-bbf3-405b-9adf-fb0733e96616","year":2010},"citing_paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T23:58:04.786403Z"},"links":{"citing_paper":"/paper/2502.08734"},"observation_digest":"sha256:8baa8b98a89ec5d61f6d36833919f817a63eb4308d400cdac96a4815c6d10f1d","observation_id":"624b2eca-1f65-463c-ab3c-20bfaffcfb72","resolution":{"observed_at":"2026-08-07T23:58:04.948578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.08734","last_updated":"2025-02-12T19:17:57Z","latest_version":1,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-19T19:40:34.388375Z","submitted_at":"2025-02-12T19:17:57Z","title":"ReMAC:Digital Multiple Access Computing by Repeated Transmission"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":56},"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 21 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2502.08734."}