{"as_of":"2026-08-23T05:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22eb0b6eb0ffc07ebf60357bae5afbf749e4517c0084a499b06e94744ed17733","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:00:23.070412Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2505.05842/citation-record","integrity":"/paper/2505.05842/integrity","json":"/paper/2505.05842/citation-record.json","paper":"/paper/2505.05842"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:00:23.535427Z","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data.Artificial Intelligence and Statistics, 54:273–1282,","venue":null,"work_id":"34a4ebae-10ea-41c0-af67-ce6727e98dd9","year":2017},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.919475Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:3ea7c435a0db6ae2297592c6d945da87a9ac6ecf7ab0a7125686f1cb7a4f8570","observation_id":"da1bd884-821c-40b3-9bef-d585b915df12","resolution":{"observed_at":"2026-08-15T23:00:23.539525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.500256Z","title":"The Data Value Based Asynchronous Federated Learning for UA V Swarm Under Unstable Com- munication Scenarios.IEEE Transactions on Mobile Com- puting, 23(6):7165-7179,","venue":null,"work_id":"ef1ae3c3-7ca4-4a98-8990-c534779fa483","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.932842Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:82e640c42895395438e97ddbb00061bf3aff546482a64d6690d0a5cfe019ac85","observation_id":"0e63a79e-8d30-45c9-96e6-9f0810df8112","resolution":{"observed_at":"2026-08-15T23:00:23.504332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.463882Z","title":"Dynamic Pricing and Learning with Bayesian Persuasion.Proceedings of the Advances in Neural In- formation Processing Systems, pages 1-9, New Orleans, USA, December","venue":null,"work_id":"3fa270aa-b9b6-4cb6-8d3e-61061c157dc3","year":2024},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.950625Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:6db95746a62afc3bafdc9e206e63ec8a401c003afb36f3f6a3e3a8af5065b96c","observation_id":"f39600c4-bf28-4ec2-bde6-52e4bef94344","resolution":{"observed_at":"2026-08-15T23:00:23.468492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.439514Z","title":"Enhancing Federated Learning With Spectrum Allocation Optimiza- tion and Device Selection.IEEE/ACM Transactions on Networking, 31(5):1981-1996,","venue":null,"work_id":"a57fb188-12d9-416c-9e67-a8f213046d39","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.960637Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:7a6fe785021d5663e7ad2a3cc4e3d23129e99e11fa6d8ca1ba8b0748b120eb18","observation_id":"e1baa55c-e513-477d-866b-af70ee123eef","resolution":{"observed_at":"2026-08-15T23:00:23.443895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.427650Z","title":null,"venue":null,"work_id":"b4a10b22-0f78-4bd3-be91-f4d06047ce25","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.964374Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:e4c8c04e4a3f466404f74dc7dd0d6dc66d275fab0877a2a99c4140c2bee77d96","observation_id":"eb5ff7a7-c9c3-4a46-847a-efd5fd73ba2f","resolution":{"observed_at":"2026-08-15T23:00:23.431550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.415786Z","title":"Incentivizing Federated Learning under Long- Term Energy Constraint via Online Randomized Auc- tions.IEEE Transactions on Wireless Communications, 21(7):5129 - 5144,","venue":null,"work_id":"101b0d7b-1556-40e3-939f-595834330870","year":2021},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.968276Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:3d63deb73c6076ab46d6485f80b895eac5e694cc57c662e7c5ef1dc3e6ce9d79","observation_id":"4940a78a-7fcf-4b48-b697-5a97abc9924d","resolution":{"observed_at":"2026-08-15T23:00:23.419825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.391938Z","title":"Chen, Peng Yang, and Yuezhi Zhou","venue":null,"work_id":"c97e0b55-516b-45ed-94c2-71b25eb0ee88","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.976278Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:f2e3f842bae56f35a398f5ee064b2945c22b819279c1acb3d3644d798225f9e4","observation_id":"39488ad2-2382-4734-9503-259c0ed94298","resolution":{"observed_at":"2026-08-15T23:00:23.396322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.379210Z","title":"LoMar: A Local De- fense Against Poisoning Attack on Federated Learning","venue":null,"work_id":"ebc5e411-fb18-4a13-bfa4-347775497155","year":2021},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.981531Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:a798e23fb1ba27eddb7c13c5d76ca230ef324b821ef6421e3dcd62bf03afb07a","observation_id":"1a258fdb-cc07-417d-9d3c-b963fc803f40","resolution":{"observed_at":"2026-08-15T23:00:23.383444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.367719Z","title":"A Fair Classifier Using Kernel Density Es- timation.Proceedings of the Advances in Neural Infor- mation Processing Systems, pages 1-12, December","venue":null,"work_id":"5bfea77e-529c-4805-b832-172707b24d1d","year":2020},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.986128Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:a909dac41fa1e42bc5ca639f5f0f19eeee104caa7dfe2792d73273841123e086","observation_id":"067a96e1-7fc5-4e46-85d5-6648f1c076ed","resolution":{"observed_at":"2026-08-15T23:00:23.371878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.356422Z","title":"[Zhaoet al., 2023 ] Yuxi Zhao, Xiaowen Gong, and Shiwen Mao","venue":null,"work_id":"0d0ee978-df7e-4620-93a4-d82e6850290f","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.991669Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:b4f86c7a7910e459bd0009088d5b7de05f63ca022532275088eb4cf83d553d30","observation_id":"3fc49189-fcd2-43de-bcfb-041daec2e267","resolution":{"observed_at":"2026-08-15T23:00:23.360229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.345336Z","title":"[Huanget al., 2022 ] Guangjing Huang, Xu Chen, Tao Ouyang, Qian Ma, Lin Chen, and Junshan Zhang","venue":null,"work_id":"6d131d23-76c1-432d-a3c6-83cbb8d3bbe3","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.995560Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:52cae55f6c7e18e26fb30f74b83032e6db37eb194a54651de824dc9ccd507cb2","observation_id":"a1b5d795-67b6-4be2-b693-68504f53bfdf","resolution":{"observed_at":"2026-08-15T23:00:23.349078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.333847Z","title":"Bayesian Persuasion.American Economic Review, 101(6):2590–2615,","venue":null,"work_id":"8a529085-30ec-4d07-8fff-d9dccaf3de10","year":2011},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.000546Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:580aededa4e9c19e74086c12d3b9819a654f530e9e619509dd7d1f012c1e9b8c","observation_id":"289321f0-e8f6-4a37-9242-9a0d17949b92","resolution":{"observed_at":"2026-08-15T23:00:23.337914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.312358Z","title":null,"venue":null,"work_id":"28c63449-a6ca-4653-b560-fbb90dab2c81","year":2024},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.008777Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:86fdf5d047c43e3a1000bd8d0b9079cf37b2b491a04e4704e4a3fa9585b00b65","observation_id":"f1ab2b79-d97d-4e75-a9ba-d7aca5558532","resolution":{"observed_at":"2026-08-15T23:00:23.316118Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.300949Z","title":"[Bergstromet al., 1986 ] Theodore Bergstrom, Lawrence Blume, and Hal Varian","venue":null,"work_id":"b3d9e522-04af-44af-aaf1-a05f7f7fc906","year":1986},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.012733Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:7b65e09ae77c5ccb683e35c012412862eef1875847e825206d7c28cd58e58f80","observation_id":"a89c64f4-7679-4fa3-949c-6d2b3e269688","resolution":{"observed_at":"2026-08-15T23:00:23.304470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-15T23:00:23.024088Z","title":"Fashion-mnist: a novel image dataset for bench- marking machine learning algorithms.arXiv preprint arXiv:1708.07747,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.024088Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:939af5d8de881d92acebaa4b03e46d03ab8c75465ea9dc73b527f257891090bc","observation_id":"70b42fe1-adc8-40c3-9641-6eccc9c4b136","resolution":{"observed_at":"2026-08-15T23:00:23.024088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01097","last_updated":"2019-12-09T20:02:37Z","snapshot_observed_at":"2026-08-16T19:49:29.879809Z","submitted_at":"2018-12-03T21:59:41Z","title":"LEAF: A Benchmark for Federated Settings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.01097","snapshot_observed_at":"2026-08-15T23:00:23.028307Z","title":"LEAF: A benchmark for federated settings.arXiv preprint arXiv:1812.01097,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.028307Z"},"links":{"cited_paper":"/paper/1812.01097","citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:16880b3898a1320738c39e9c27e1ad0f40f86d2dd2111a9d48d8f0944e1b9054","observation_id":"b07e54a1-7704-414d-95ce-1dba6681ee0a","resolution":{"observed_at":"2026-08-15T23:00:23.028307Z","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-15T23:00:23.238283Z","title":"Joint Participation Incentive and Network Pric- ing Design for Federated Learning.Proceedings of the IEEE Conference on Computer Communications, pages 1- 10, Rome, Italy, May","venue":null,"work_id":"5225a201-1644-444c-b248-53bc22b826c7","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.041013Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:a2f4305883c822c4768f53230439a6fecae1d2aee581a105aeec3dda657a4863","observation_id":"b55537fd-d7e6-45ab-b0ac-ef6562a8a523","resolution":{"observed_at":"2026-08-15T23:00:23.242767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.225431Z","title":"[Huet al., 2022 ] Miao Hu, Di Wu, Yipeng Zhou, Xu Chen, and Min Chen","venue":null,"work_id":"0e85b490-4ff0-4243-90d4-682401e57261","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.044918Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:8db81642c72f988cf632b6be9ca46e89bcb1358874a20f08fa5530f17791d01c","observation_id":"51b64bcc-eafd-4d1d-8997-21ab63d6073b","resolution":{"observed_at":"2026-08-15T23:00:23.229884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.209133Z","title":"Incentive Mechanism De- sign for Joint Resource Allocation in Blockchain-based Federated Learning.IEEE Transactions on Parallel and Distributed Systems, 34(5):1536-1547,","venue":null,"work_id":"fd115bf9-1d31-407c-935b-496148e2e94c","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.049111Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:eb35b63db929c357e6211a9142adda3d163ff5ce9f5e0f21b6af900fe33e3fea","observation_id":"93ac3584-0243-43a6-83cb-f0be92daa28e","resolution":{"observed_at":"2026-08-15T23:00:23.214488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.193508Z","title":"AoI-aware Incen- tive Mechanism for Mobile Crowdsensing using Stack- elberg Game.Proceedings of the IEEE Conference on Computer Communications, pages 1-10, Rome, Italy, May","venue":null,"work_id":"5204ebf3-8485-4a24-96e5-3046fbec4233","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.053221Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:f6134f222d6f5c949c0ad6d47931bdc1bb52d044bbdc88372238c376330d0a20","observation_id":"12f5761b-ee3d-452f-a3c4-6c7e1773f202","resolution":{"observed_at":"2026-08-15T23:00:23.197839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.181025Z","title":"[Mitraet al., 2021 ] Aritra Mitra, Hamed Hassani, and George J","venue":null,"work_id":"59775e92-0542-4edb-ba97-170217328c2c","year":2021},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.056956Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:c81b266685921e8e3339f7138ad283458407636f29e4491d4b6611956f85c966","observation_id":"45808a48-1b2a-45da-aed9-ae7ea4ff84af","resolution":{"observed_at":"2026-08-15T23:00:23.185390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.167957Z","title":"[Panget al., 2023 ] Jinlong Pang, Jieling Yu, Ruiting Zhou, and John C.S","venue":null,"work_id":"0ae9a121-3d82-48d0-bd01-bd4988f17813","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.061419Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:ee2fe5f880bfd37d236f3269c1865e1f37e3c4dad43439e33763d43ddf33579a","observation_id":"a0a05b51-aed4-4ba7-8a08-318ed2162e01","resolution":{"observed_at":"2026-08-15T23:00:23.172509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.155045Z","title":null,"venue":null,"work_id":"9c52b024-91ad-458d-b2fd-0ef34ef2d793","year":2020},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.065873Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:f8ee6cbf8caf4bf54d1101665f15d9fbe8c59195462eba9ea5df8ff9ce67e686","observation_id":"95a6579e-af91-4faa-ab02-5b6d4c765f1d","resolution":{"observed_at":"2026-08-15T23:00:23.159631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.139622Z","title":"[Damaskinoset al., 2022 ] Georgios Damaskinos, Rachid Guerraoui, Anne-Marie Kermarrec, Vlad Nitu, Rhicheek Patra, and Francois Taiani","venue":null,"work_id":"ffc9c66a-22e0-4f50-9ecf-9d82e862936f","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.070412Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:dc6dedd6750970e56efabf9033fbe9356a9115236b0d2c42f4363f4f2a8749d3","observation_id":"7fd5ae99-2cdb-48d0-be61-5a2f671ec330","resolution":{"observed_at":"2026-08-15T23:00:23.146061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.289681Z","title":"Convex Optimization","venue":null,"work_id":"e31b3532-3caf-492c-8430-7075a64aa5f4","year":2004},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.016497Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:a2cd45c084714076ee9cf796f722d03782be83c95a1860a19cf73c58c8606953","observation_id":"a6f95010-30fd-4bcc-abba-43fcdfc0f82e","resolution":{"observed_at":"2026-08-15T23:00:23.293616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.278220Z","title":"MNIST Hand-written Digit Database","venue":null,"work_id":"089cc06b-3260-4493-a0f0-ac751a2fd1dd","year":2021},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.020371Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:4635d4cbc7101f786c4043d6bc4d0cd0f85c5be43db98e68ffb3b2d0ebf5a9ca","observation_id":"b80650bc-d2e1-47d9-8e4b-27f505f337c4","resolution":{"observed_at":"2026-08-15T23:00:23.282118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.251698Z","title":null,"venue":null,"work_id":"7251ff5a-a764-407d-ada8-df4abda7586d","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.037041Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:ca843594dc0a1537e7a001d9009cb2a80a035df8968dc4c3eabe84a0235d0f1c","observation_id":"39387ff2-6f37-4ce8-8ffc-3f9df9f46550","resolution":{"observed_at":"2026-08-15T23:00:23.256528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.323011Z","title":"Incentiviz- ing Proportional Fairness for Multi-Task Allocation in Crowdsensing.IEEE Transactions on Services Comput- ing, 17(3):990-1000,","venue":null,"work_id":"1076d3e6-bf9b-4dae-bcf6-dccd985ae229","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.004817Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:a56f0fc750a6e913e944117067e45c8e2b6ac324c4d8005cc75c752eca9f2710","observation_id":"978b8aa7-ac01-4061-a66a-4caf460aa9d1","resolution":{"observed_at":"2026-08-15T23:00:23.326607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.523468Z","title":"Online Client Selection for Asynchronous Federated Learning With Fairness Consideration.IEEE Transactions on Wireless Communications, 22(4):2493-2506,","venue":null,"work_id":"b33c8cc6-189d-40b8-90c6-e3fdc57c639f","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.924273Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:dae08e246dec440fac7bc9a1b509ed5851d1e0ae1f0dec87b8e20721cb182798","observation_id":"b0ba7080-b4ca-4f53-859e-4d87a611e5b5","resolution":{"observed_at":"2026-08-15T23:00:23.527483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.265275Z","title":"Learning Multiple Layers of Features from Tiny Images.Technical Report,","venue":null,"work_id":"97ba8a27-8fdf-4b21-b402-6d999daad538","year":2009},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:23.032720Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:f85964c82d5c15d81d6c64c634fdf869854f6b1072c150f28ddebd03d196c071","observation_id":"ed560d06-a146-4d94-bd35-cd8f3bc2b2ee","resolution":{"observed_at":"2026-08-15T23:00:23.270278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.488340Z","title":"Asynchronous Online Federated Learning for Edge Devices with Non-IID Data.Proceed- ings of the IEEE International Conference on Big Data, pages 15–24, Atlanta, USA, December","venue":null,"work_id":"7faff846-6658-4f0d-b581-01bbc3ff53fe","year":2020},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.941864Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:e112c44243c6f1cf10cc1c2cead9dd89bb186445b29533730dc554d1d5fb5f7b","observation_id":"f26c1403-d996-41fa-a8df-fa285593d888","resolution":{"observed_at":"2026-08-15T23:00:23.492337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.475758Z","title":"[Donget al., 2023 ] Xuewen Dong, Zhichao You, Ximeng Liu, Yuanxiong Guo, Yulong Shen, and Yanmin Gong","venue":null,"work_id":"f2e2dac0-83e5-4fdb-a97d-d696a4e535f1","year":2023},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.946714Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:5c76d8ed0168432c98bddbdafbe37f807141751f15d64f8d2c2d215a683fa329","observation_id":"cf841eae-d5ce-4f44-9297-227242da26e2","resolution":{"observed_at":"2026-08-15T23:00:23.480603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.404046Z","title":"Optimal Contract Design for Efficient Fed- erated Learning With Multi-Dimensional Private Informa- tion.IEEE Journal on Selected Areas in Communications, 39(1):186-200,","venue":null,"work_id":"63d393a2-4834-455a-83c3-f2696124c319","year":2020},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.972233Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:f174ce5a7f699a97671a9f7e7fd8a56dd5c8f628a77edbdf3474426c6e07b9a7","observation_id":"b6d53f44-14c4-4d4c-ac4c-f41e91780477","resolution":{"observed_at":"2026-08-15T23:00:23.408085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T23:00:23.511783Z","title":"Power of Redundancy: Surplus Client Scheduling for Federated Learning against User Uncertainties.IEEE Transactions on Mobile Com- puting, 22(9):5449-5462,","venue":null,"work_id":"0e88a7c4-3764-4ded-8b75-88c6e5f3d612","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.928665Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:2dea86e34ee6ca5c6c9176ded7445320b00c4b7139130aaa8a179cfb733d231e","observation_id":"c31c9aa5-0c93-4831-8a27-420fc4e316af","resolution":{"observed_at":"2026-08-15T23:00:23.515953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.03934","last_updated":"2020-12-05T01:33:57Z","snapshot_observed_at":"2026-08-19T20:51:27.056831Z","submitted_at":"2019-03-10T06:19:38Z","title":"Asynchronous Federated Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.03934","snapshot_observed_at":"2026-08-15T23:00:22.937323Z","title":"Asynchronous federated optimization.arXiv preprint arXiv:1903.03934,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.937323Z"},"links":{"cited_paper":"/paper/1903.03934","citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:82e59ee3220fdd0906a855a224e12e7cfed2307b49cd6f9cb907e4878d7d2aa6","observation_id":"5d66840a-d4e4-486b-b7dc-42a20fba3fcf","resolution":{"observed_at":"2026-08-15T23:00:22.937323Z","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-15T23:00:23.451384Z","title":"[Huet al., 2022 ] Miao Hu, Wenzhuo Yang, Zhenxiao Luo, Xuezheng Liu, Yipeng Zhou, and Xu Chen","venue":null,"work_id":"c9f5e0da-dc85-41fc-9dbf-94e3355f0290","year":2022},"citing_paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T23:00:22.956802Z"},"links":{"citing_paper":"/paper/2505.05842"},"observation_digest":"sha256:92293936f0524e7a026365d5b44bf03ff6ea06f1488c3e8d689ee4f230cf45c8","observation_id":"cce83168-2d58-48ca-8d85-f0f75afd43e0","resolution":{"observed_at":"2026-08-15T23:00:23.455269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.05842","last_updated":"2025-05-09T07:24:21Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T19:51:05.538546Z","submitted_at":"2025-05-09T07:24:21Z","title":"DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":36},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2505.05842."}