{"as_of":"2026-08-14T08:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c02654ba617969b1b2167c22356625b07b06691dd1ff88cd87668c0af62246b","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-05-18T13:35:47.619034Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T23:28:48.535357Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T23:28:48.720770Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":"2509.21940","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.21940","snapshot_observed_at":"2026-08-09T23:28:48.720770Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","venue":"stat.ML","work_id":"c6a59d41-e5fa-4f5d-9409-50d125f23be9","year":2025},"citing_paper":{"arxiv_id":"2501.18502","last_updated":"2026-06-23T10:26:56Z","snapshot_observed_at":"2026-08-09T23:13:05.244859Z","submitted_at":"2025-01-30T17:11:55Z","title":"One-Bit Distributed Mean Estimation with Unknown Variance","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T23:28:48.535357Z"},"links":{"cited_paper":"/paper/2509.21940","citing_paper":"/paper/2501.18502"},"observation_digest":"sha256:698a1a6ed2906851ee05571703007e95b7d08f6ac91928c150829ee5338063c9","observation_id":"403a3443-89f5-4a90-b7d4-67b1ecc6e8ef","resolution":{"observed_at":"2026-08-09T23:28:48.728356Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.21940","snapshot_observed_at":"2026-08-04T05:19:06.856345Z","title":"and Scarlett, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02538","last_updated":"2026-08-03T17:28:12Z","snapshot_observed_at":"2026-08-09T15:21:58.103219Z","submitted_at":"2026-08-03T17:28:12Z","title":"Interaction Is Not Necessary for Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T05:19:06.856345Z"},"links":{"cited_paper":"/paper/2509.21940","citing_paper":"/paper/2608.02538"},"observation_digest":"sha256:62124d7148683cbea391a1e6654da4eaff2469e4735bedbd793654ef1d97c62e","observation_id":"6de66711-8827-4935-87b9-c0c25e3a09bb","resolution":{"observed_at":"2026-08-04T05:19:06.856345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.21940/citation-record","integrity":"/paper/2509.21940/integrity","json":"/paper/2509.21940/citation-record.json","paper":"/paper/2509.21940"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9725734a-37dd-41a0-b8fd-650a88bcc576","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:dbd12d838162d6284ab6839876e2ae07b77947f58581eaf7926ec669a5b1d1a4","observation_id":"96a27c78-d99b-44d9-ab21-992934e93948","resolution":{"observed_at":"2026-05-18T13:36:25.876620Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., Liu, Y., Sun, Z., and Tyagi, H","venue":null,"work_id":"1c3e84e4-94ae-4855-b209-710592744d03","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:ec96e8063d184f1249f582eb751fd2a2384b5d21fcfa1579da793baa1e435787","observation_id":"73babe85-3885-47ee-9b43-1f61b0fca9cd","resolution":{"observed_at":"2026-05-18T13:36:25.880102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.10078","last_updated":"2021-07-21T13:43:44Z","snapshot_observed_at":"2026-08-14T07:00:45.535020Z","submitted_at":"2021-07-21T13:43:44Z","title":"Optimal Rates for Nonparametric Density Estimation under Communication Constraints","version":1},"cited_work":{"arxiv_id":"2107.10078","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.10078","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., Singh, A","venue":null,"work_id":"bf5c7049-f27f-4dfa-bdc3-841604b1d770","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"cited_paper":"/paper/2107.10078","citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:90574fa2bcdf73e5364910d4f009e54be530d96fcf0784b4ced34bb43aa2f482","observation_id":"d0cd541d-b496-4d32-8ed0-26dce75f286a","resolution":{"observed_at":"2026-05-18T13:36:24.857798Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., Sun, Z., and Tyagi, H","venue":null,"work_id":"3bdbb36c-7fa6-443a-bf26-9a9d3c7eb871","year":2023},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:52e7f5bf7b450c1355b7c4a360e4e345ecaca8c3e87ebad4371d3a399dd645b8","observation_id":"ff5a9ea6-d340-4089-a2bc-399f576c9445","resolution":{"observed_at":"2026-05-18T13:36:25.883368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., and Tyagi, H","venue":null,"work_id":"4c47e8e4-8ff2-4366-a037-d9665137dc9e","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:adf9ddbc255aaa8b221159944174095e13691748b05a9ee649524dd7ce1e2b80","observation_id":"5a5008f8-3a47-405e-b7cf-14a3f38ebdfc","resolution":{"observed_at":"2026-05-18T13:36:25.896460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., and Tyagi, H","venue":null,"work_id":"d1424814-1e1f-4986-80b2-ec59747ba9be","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:6b7116f9a804bd90ecd269db68c9947eca3f3531c70f9aa826d4f3bba56d607c","observation_id":"91811b1a-5516-4b17-942a-287d724c7e9b","resolution":{"observed_at":"2026-05-18T13:36:25.886534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8a314e16-65b1-40a6-9fa7-765e87f2601c","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:2c0da93e561cd96091341138e51ce3aea3c583ddf53ea6daa765f2bb25edf249","observation_id":"feebd43c-e7c3-473b-a633-8fd5bc1a32d3","resolution":{"observed_at":"2026-05-18T13:36:25.889926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"S., Kumar, R., and Vatedka, S","venue":null,"work_id":"b86c4c07-3ae1-444d-91cf-a21e7f0e13ef","year":2025},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:383a7777dc6900c97392258d3ad17d338181ce87c460309077a5d8e4ffcbb912","observation_id":"5ab2a14e-0bf2-493a-aa64-68fc651170fd","resolution":{"observed_at":"2026-05-18T13:36:25.892799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"P., Han, Y., and \\\" O zg \\\" u r, A","venue":null,"work_id":"83f9c6d3-1b89-491a-a9de-7c1b437ba157","year":2019},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:8301a3232b2b057d84f5971a448a845940ee1d7414690d779ced1126ff3eb7b7","observation_id":"2a30ff37-0204-41bc-9050-358971d952d0","resolution":{"observed_at":"2026-05-18T13:36:25.812756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"P., Han, Y., and \\\" O zg\\\" u r, A","venue":null,"work_id":"cbf87a64-6eac-4c23-bcca-1f47aaeb2db1","year":2020},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:ba471f9e44bb7a5b45e42bad98b43f05bda3d4af0fa93869d878f53595cca971","observation_id":"95f56e0d-9bc1-4b45-9b1f-92e6f2f7dbf4","resolution":{"observed_at":"2026-05-18T13:36:25.861347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0afee15d-e750-4a61-b336-0c99579c74fd","year":2024},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:af7cf0ae174d990f13edc3a4f2ee62cb44b9e0dba0c17188eeb3e2fda8154255","observation_id":"50a823f5-5c50-4cd1-844a-a4ba81f88df4","resolution":{"observed_at":"2026-05-18T13:36:25.800817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"247a1162-74d5-4af6-9baa-a3c71196d7c3","year":2013},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:0051bdf73b78dad6e6b10cd3803ab732571e5d070eca910a3df426ce0bf1fb98","observation_id":"53f04183-314f-49f2-948c-d88ee4a32eba","resolution":{"observed_at":"2026-05-18T13:36:25.818027Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"L., and Woodruff, D","venue":null,"work_id":"74bbd921-1e45-4e15-b178-cdaf4f5b5aaf","year":2016},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:bca86f4eeb51d70fb8b8e498c37a0489d1e692213e9fc34c839776f8ec23f658","observation_id":"799ecadb-343a-4b80-98d7-d3c8db825a84","resolution":{"observed_at":"2026-05-18T13:36:25.864193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4760cce0-d2f2-4457-89b7-a480cdc617b8","year":1992},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:e2e8eb972376b4b250ad8c3c8787f259dd145f0a51a08a9eb51b9b97877577e3","observation_id":"7bf9756b-0185-4cb1-bb3f-bf7867eb85ac","resolution":{"observed_at":"2026-05-18T13:36:25.771990Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"aeffc82a-ae51-43f9-9de1-6318cab19e7b","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:fed642753fbb59dc3aa7d31f68117f1d77fd1df29f91f485617bb2d2154ef77f","observation_id":"36a07db1-eba3-4ed6-b226-7fbab49707a4","resolution":{"observed_at":"2026-05-18T13:36:25.768530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"86804468-ce5b-481a-a2cc-fe2d31b9dd9b","year":2024},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:133fa35cd22dd394eb73ee3dfb0df7ff2f2339c9940501b93314d7b76860ad28","observation_id":"1143a22d-68b9-4765-9ed6-015623ae2116","resolution":{"observed_at":"2026-05-18T13:36:25.823301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bb4d30ac-9138-4026-a460-f122d31b0c4e","year":2022},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:011c83453112524c1b2465785fbfaa11f51f9bbbb780cb925b49552ffe3697b2","observation_id":"0a911416-c696-4a8e-9912-ee765a59e7fe","resolution":{"observed_at":"2026-05-18T13:36:25.761391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"05eae3d4-4736-406e-abcf-13f0372f66d1","year":2023},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:b0ee0a49b53761ec3f493b396b9c291f0bc5c0e0199528b8d9b7943a19dbbd62","observation_id":"98617d5e-abf2-41d8-8e62-1a834e00eaa3","resolution":{"observed_at":"2026-05-18T13:36:25.809701Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"25689091-f941-4aff-b673-fb0220157a08","year":2021},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:fd4e237513dc8669595706d2a921b3d500c02e4cb3adad03046490d64d76643e","observation_id":"8202a721-ab39-47f2-afae-62dd134cda03","resolution":{"observed_at":"2026-05-18T13:36:25.794066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"92b5c739-f275-4838-91a3-d86e5ce9518f","year":2014},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:1b9f11fea7b95a6f67fff3a70228229e132171ea7a3365e81c6f84cc145d77e7","observation_id":"8b775f5d-a3c4-4836-9471-ab367aabfb62","resolution":{"observed_at":"2026-05-18T13:36:25.720069Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Price, E","venue":null,"work_id":"c157b84f-dc42-4421-8ca0-200c035a27a0","year":2024},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:bd9415136871273d3f4770d5e8ed890aff90714ed07e8f256f0adceafab029fb","observation_id":"90aeacfe-674a-4a93-903f-8a1b7c89fb4a","resolution":{"observed_at":"2026-05-18T13:36:25.730523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a6d12d2b-f17b-4ab5-8a0b-30a5e6ac4300","year":2024},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:f9edb8f39ab3eb514e4d496c1c4b625c432e7ea37cfad66780a3803eb7676a06","observation_id":"eb5ea33d-3a39-4467-982b-4a9b5d7bedcb","resolution":{"observed_at":"2026-05-18T13:36:25.747174Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d4fd2a37-cc17-489b-8863-31107841d2d8","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:26bcb8796d2fe2d538d73a9284c1664c9d9d693f2ca47a0cc7cfeccc32072962","observation_id":"bb9cdd50-297d-45e3-8ec1-f26fbe0f439e","resolution":{"observed_at":"2026-05-18T13:36:25.740940Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"420052ed-f6c4-4c5e-999a-b0585383dc19","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:96552da3c43e11a76c545c526cec9de576d04d2bdd6653bff45a7343c432ba81","observation_id":"3e481099-a8d5-4add-8636-6be510a3a4b3","resolution":{"observed_at":"2026-05-18T13:36:25.727020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A., Yang, L., and Fragouli, C","venue":null,"work_id":"373461ac-e16b-4aca-9c86-f9fbf19de0c2","year":2022},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:a4e151fc88fa576f2c7b4c31d2e71a549dbd1bde7dc04998bd9695182f25397c","observation_id":"79beffa9-af5a-421b-ac60-9a3cb691929e","resolution":{"observed_at":"2026-05-18T13:36:25.754023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"94be56bf-cb92-4828-9fd1-c85d6b565231","year":2020},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:2d3492ac17c7dba93f42e85919c7b951567966493b26f612f2db46033de6e438","observation_id":"b6871260-1718-424c-a2aa-765aebd6a7a7","resolution":{"observed_at":"2026-05-18T13:36:25.733875Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Duchi, J","venue":null,"work_id":"8be6c84f-d6fb-4b96-a8b9-ae4cebe3cea1","year":2022},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:9b836cd1d498b9669a6fdee7f43fbe5c85baf3279168ae8f3f5d328ae862251f","observation_id":"a973438d-64de-4f47-835d-f1f6a0701793","resolution":{"observed_at":"2026-05-18T13:36:25.744248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Richt \\'a rik, P","venue":null,"work_id":"8f37e730-3f69-47dc-82c9-52ceb371ee87","year":2018},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:745b059274afb3fb562fde6764ee1779d785da10ddb566520b4e4d6f81a15014","observation_id":"4de284da-aa3a-4a8e-ad41-141778be89fe","resolution":{"observed_at":"2026-05-18T13:36:25.765123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18502","last_updated":"2026-06-23T10:26:56Z","snapshot_observed_at":"2026-08-09T23:13:05.244859Z","submitted_at":"2025-01-30T17:11:55Z","title":"One-Bit Distributed Mean Estimation with Unknown Variance","version":4},"cited_work":{"arxiv_id":"2501.18502","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18502","snapshot_observed_at":"2026-06-24T02:14:45.610286Z","title":"and Vatedka, S","venue":null,"work_id":"19d9b1b7-7016-4b3e-b715-8fd31555f30b","year":2025},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"cited_paper":"/paper/2501.18502","citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:b180fb052ed139c536c1811c67f1b6cc27ef6b66b7b2a1be91143a286dd2f41d","observation_id":"34eb5cde-f96b-445e-9491-e4b20103ebe4","resolution":{"observed_at":"2026-06-24T02:14:45.610286Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Scarlett, J","venue":null,"work_id":"728db8e0-ea2c-430b-af67-08c6fd2bc857","year":2025},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:0d9744b0de827f5dc9975f6fd2aed6d79d0e505d3cd968b21c82a4eb16f5fe01","observation_id":"5dd2e0eb-b310-4838-93b5-2eaaaa704727","resolution":{"observed_at":"2026-05-18T13:36:25.790226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"962ee6a4-2978-47c8-9782-a607f12ae233","year":2020},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:ad5604a5eb1202b30acfca3bf73b9851a7dd2f4eeaee3fb40154db29d36845db","observation_id":"eb35eac9-8715-4a4b-9b90-be1ec392f333","resolution":{"observed_at":"2026-05-18T13:36:25.785209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"80cf56c8-c0ea-4e72-a9c1-f3263f5be4c4","year":2022},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:7d8250cc04b333786809b80618d902b9c4ac2ab5d9bb230a9027918a6bbec519","observation_id":"36b74680-f3c7-44be-91d8-cbcaa00344c8","resolution":{"observed_at":"2026-05-18T13:36:25.750854Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Mendelson, S","venue":null,"work_id":"a498b893-d43f-4382-a243-8a051456772d","year":2019},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:d768f446b148827ca86e583cbb70d8ce321e4a8d863784872d3e7f261bc54121","observation_id":"599e3763-84c7-45ec-9add-e5efad9da980","resolution":{"observed_at":"2026-05-18T13:36:25.827497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"64c99326-7d54-45f2-a71e-c1b3f82c4646","year":2005},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:6f96363da89faea02a4a080c28934a0d463230b65939e15694a8615f82f10ccb","observation_id":"6cbe8c19-f244-4cf2-8db8-21b1d6f16572","resolution":{"observed_at":"2026-05-18T13:36:25.830778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"085d500a-f3af-43a4-83f0-971227fe64d4","year":2023},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:18114b57e070893b7c7971b57877068b3f5ba3e3dfa332123113c76eb714ebc8","observation_id":"41006f5a-73a4-4051-bbcd-24ff93db02ea","resolution":{"observed_at":"2026-05-18T13:36:25.723264Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"T., and Tyagi, H","venue":null,"work_id":"014d0830-9eca-4977-a121-42546c46a7fa","year":2021},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:7583e40748c24ac2dd2ea11cb215588ee665756736b5596c920d7833e4b51682","observation_id":"1f7edaf9-56d2-4e03-a11f-39535fe5bbb3","resolution":{"observed_at":"2026-05-18T13:36:25.781798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d63b77e1-1be3-4662-ac0f-3e24c2a214fc","year":2023},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:a7074116e47ab018d97477def8c9725edc9beea631f4ecce36d244368ee497f9","observation_id":"feb07a66-4fd0-4bc5-8d99-57422c2a4f13","resolution":{"observed_at":"2026-05-18T13:36:25.815152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Wu, Y","venue":null,"work_id":"ac4ab6c6-d978-46d7-a9ba-4d2a5d318138","year":2025},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:eeeacb75b5947f444951f657c141829e1189ec22097b4e2fcd5553576b286b22","observation_id":"6929beb2-0b37-456a-9607-e39e38ebf5f3","resolution":{"observed_at":"2026-05-18T13:36:25.870090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Giannakis, G","venue":null,"work_id":"9d1fc6f6-d808-4744-95db-c2771721643b","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:728f0a619d748f0ed182923ee2d54a7f4e0b39a002b1a66a18de0a51796dfaca","observation_id":"e648db37-8186-476f-a778-fbb0f2c12d85","resolution":{"observed_at":"2026-05-18T13:36:25.855863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Giannakis, G","venue":null,"work_id":"913f1fd2-4483-4f09-980a-25ec1c4af69d","year":null},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:2c572aff7037ee90e57242f4aad5f568f887fc35301b89fec9a5c29ee2527d1c","observation_id":"a315df0b-3bca-4ebe-a5cf-abb012387680","resolution":{"observed_at":"2026-05-18T13:36:25.797659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b9114829-ad3d-466f-8572-dafbcd7d52cd","year":2025},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:6e54028f8676c810aa149cb508230d7a64113c06f2f6a39afb166fda418023de","observation_id":"3988bc4b-30f4-4eab-b3b3-ac591ef18dbf","resolution":{"observed_at":"2026-05-18T13:36:25.806190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5c7609e7-6ae6-4e16-90ab-4488f7fb3e37","year":2014},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:35d594d67a2a71f87db4cadd588568f8b9b101bc92067586f0d6c6e6dccf4e6e","observation_id":"432701c4-b0cc-4935-a2af-ca0440ddd3ed","resolution":{"observed_at":"2026-05-18T13:36:25.850388Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"T., Felix, X","venue":null,"work_id":"7f97a6db-dfe1-4a1e-b60a-29c55f875973","year":2017},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:d04a2a3524233f9cdd719e9515076d6c6863f3a1c82689a769992007ce663ecc","observation_id":"2c74d953-c636-467c-86f1-8f3cc3ace53a","resolution":{"observed_at":"2026-05-18T13:36:25.858509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"T., Sun, Z., Ro, J., and Yu, F","venue":null,"work_id":"12d3b08c-39f7-42b6-ae7e-580874986917","year":2022},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:4555b7cea0b4977f424bfc8c821bd0723a5fad54a68cc9eb227949fdb828354b","observation_id":"a5871a02-75c3-434f-ad77-7cbc278b05ee","resolution":{"observed_at":"2026-05-18T13:36:25.844915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and van Zanten, H","venue":null,"work_id":"302abf16-5811-4bfe-83d9-c0f501d1bab4","year":2018},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:44c405ee8dea16b5258d84e88ebed707b988f561b3d50a28d2fab36ff91a994d","observation_id":"fcef7a6f-0cba-4201-b000-aaa4682e513e","resolution":{"observed_at":"2026-05-18T13:36:25.847772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and van Zanten, H","venue":null,"work_id":"552fb83f-ee5f-4e4c-a7fc-d03ff2e1dca7","year":2020},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:1c4913d041564540eb9fb28670d94053b877c931299db59f852017e741dd5058","observation_id":"97d300fb-da0e-493b-a771-885f5b01a3aa","resolution":{"observed_at":"2026-05-18T13:36:25.836867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"B., Portnoy, A., Mendelson, G., Itzhak, Y","venue":null,"work_id":"23497267-5441-47ee-9852-3506c3a7826c","year":2022},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:5c23848c0adbd4a821319463fc48c8a20d3df78b400986c660b2aecc07d83d9b","observation_id":"86af2727-342d-46b6-bd13-db4044318e4e","resolution":{"observed_at":"2026-05-18T13:36:25.841926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fdab435d-c80e-484d-a111-adf489507178","year":2021},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:3e6445b18d209ac920a80832d08dba77ae23d885b129abd833affb48816997da","observation_id":"45ca8006-8193-4304-aa65-366342e8fd43","resolution":{"observed_at":"2026-05-18T13:36:25.853127Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"67e6f3d1-ff42-46eb-ae9b-8f69c02255f8","year":2012},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:817849b42740693a1d01a57073575fb0e0876e829bcf7bd46da4732d27dab4be","observation_id":"1844ac14-8cbe-4c93-aaa4-96266ee6caa1","resolution":{"observed_at":"2026-05-18T13:36:25.867135Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2ec5dd74-22b9-4e96-a7c3-d22801e87ffa","year":2012},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:9e988a59d874fc281270dcdb814b71980ded8827e322377dffe7d962859efa90","observation_id":"3f4ad0f5-27d6-4f1c-a514-2afa4a632c0d","resolution":{"observed_at":"2026-05-18T13:36:25.873098Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2703967e-3281-47b1-98c1-f5d622da4538","year":2026},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:3f166a1dd10fe3172fccd71f24a155621ea35e3e7197a085094317a63739d7cf","observation_id":"5d9736bf-cd1f-4398-bf04-480064afb84e","resolution":{"observed_at":"2026-05-18T13:36:25.820592Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"45e54421-520f-40d1-891b-b453c78b448b","year":2006},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:52b699457631fa0d5886a70830afebba091b99b1f7706223d37c773646967632","observation_id":"29afd789-41c3-4fe0-af1b-880b4acfc7a6","resolution":{"observed_at":"2026-05-18T13:36:25.833992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Raginsky, M","venue":null,"work_id":"0f1f4d01-180e-4ac3-ba8b-22681eaa6271","year":2017},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:4da31f5adb69cca7494a80112f3fdc1719d4128f25c2d57148cef705cc8d0cc0","observation_id":"42869c77-6c25-4652-bd0e-8c3604f4f56b","resolution":{"observed_at":"2026-05-18T13:36:25.737421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.10373","last_updated":"2022-04-21T19:04:50Z","snapshot_observed_at":"2026-08-13T15:58:03.349492Z","submitted_at":"2022-04-21T19:04:50Z","title":"Distributed Nonparametric Estimation under Communication Constraints","version":1},"cited_work":{"arxiv_id":"2204.10373","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.10373","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"F X pL`σq ą0.49. 8For ease of analysis, we assume thatλis an integer multiple ofσ. 19 On the other hand, by the “k-moment","venue":null,"work_id":"29f3b5a7-7687-4f8e-a66d-35a52ce94eb1","year":2023},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"cited_paper":"/paper/2204.10373","citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:f1cbe28cfea92c93073277cd3cbd14d8272585d7caa76ba63c9341fe3941f1da","observation_id":"37583d08-9daa-48de-914e-7eeb031c1974","resolution":{"observed_at":"2026-05-18T13:36:24.863993Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"I., and Wainwright, M","venue":null,"work_id":"cf67d0cb-3ddb-4029-bee7-1e20f1644dce","year":2013},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:bee8f6f8b639f6337fd460e2abb2b9d43891432d6b12ff74e651efb765363f71","observation_id":"f6594971-9ce3-4ca2-b972-e817018ee638","resolution":{"observed_at":"2026-05-18T13:36:25.757370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Lafferty, J","venue":null,"work_id":"31a1fbef-34c3-42d9-9d4e-4d93e6152749","year":2018},"citing_paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-18T13:35:47.619034Z"},"links":{"citing_paper":"/paper/2509.21940"},"observation_digest":"sha256:0dcb946cc4c971d5a28b8d13685d097ba09ad17ce0939a918786bfe0b89ee8b3","observation_id":"0ccbfbd6-6c18-42b9-a008-e62201b41bd3","resolution":{"observed_at":"2026-05-18T13:36:25.778170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.21940","last_updated":"2026-04-04T17:17:18Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T02:33:22.934113Z","submitted_at":"2025-09-26T06:22:57Z","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":3,"verified_fuzzy":26},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 2 inbound Pith citation observations for arXiv:2509.21940."}