{"as_of":"2026-08-10T03:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d42622254583bec3119801bebb1f5a7a0a1704ae093032aff1072211af46ac9","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T17:22:50.314137Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T05:19:07.375389Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.24358","snapshot_observed_at":"2026-08-04T05:19:07.375389Z","title":null,"venue":null,"work_id":null,"year":2026},"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":15,"source":"pdf_text","source_observed_at":"2026-08-04T05:19:07.375389Z"},"links":{"cited_paper":"/paper/2607.24358","citing_paper":"/paper/2608.02538"},"observation_digest":"sha256:ec1650b47b4d2f514dfa0ca8d0a42d3b55eebe6a5d0d2f9be2e1984180936b82","observation_id":"263b017f-1e96-4853-892f-2734cc8762e9","resolution":{"observed_at":"2026-08-04T05:19:07.375389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.24358/citation-record","integrity":"/paper/2607.24358/integrity","json":"/paper/2607.24358/citation-record.json","paper":"/paper/2607.24358"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.171111Z","title":"Robust mean estimation under quantization","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.171111Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:da565efe1b9a3ccc372133cf52d02c88a96011738b29884cc951dacf474031d7","observation_id":"dd84465e-f517-4e22-aa10-e660a352e2af","resolution":{"observed_at":"2026-07-31T17:22:50.171111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.176323Z","title":"Canonne, Yuhan Liu, Ziteng Sun, and Himanshu Tyagi","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.176323Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:54b812ce3b3bec5f4122b249e3c0269959e091958ab059df6ec8a349926d9fcc","observation_id":"22e7c6ac-b4fb-4cba-8a34-d38fde8e7db6","resolution":{"observed_at":"2026-07-31T17:22:50.176323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.183884Z","title":"Canonne, Ziteng Sun, and Himanshu Tyagi","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.183884Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:9b1f5706d8f6ed003527c34803cc5652410bd47f20ab49ec2d2b8fd6091c9c9a","observation_id":"8cba544d-52ba-422e-aa13-946b86b90ca3","resolution":{"observed_at":"2026-07-31T17:22:50.183884Z","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":"10.52202/075280-2226","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Canonne, Ziteng Sun, and Himanshu Tyagi","venue":null,"work_id":"9fed0f72-6f60-41f2-9626-7fae18d0b781","year":2023},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.188633Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:54dd8347655ef308afbd5ff822e43eda0583f8591bcf66b3de6ae6c1522f8a86","observation_id":"7ced9ebb-747e-4dfb-ad97-3c74120a8f3c","resolution":{"observed_at":"2026-07-31T17:25:52.242342Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.193648Z","title":"Lower bounds for learning distributions under communication constraints via F isher information","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.193648Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:b4a19bbabf1b429c5f2521fbeb5397ce3791975aa597754847db881ffb88f40a","observation_id":"c61c9260-a3a5-4d5e-bc2c-6a5b635d0a62","resolution":{"observed_at":"2026-07-31T17:22:50.193648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.198560Z","title":"Boufounos","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.198560Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:92edc153cd7c0e97c17b8aab3b0ed7f2cad5cb271684efd10abb2e9aa6a5de13","observation_id":"66689d1f-c7cc-4077-a602-9e756045b18e","resolution":{"observed_at":"2026-07-31T17:22:50.198560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.204211Z","title":"Nguyen, and David P","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.204211Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:f9af83ca8b4aa8e1b7f7035956fbe0c90f83303c6024da487fd48e92125a0e7e","observation_id":"7ca909ae-a7e2-48e9-b647-affa6d7d7245","resolution":{"observed_at":"2026-07-31T17:22:50.204211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.209375Z","title":"Tony Cai and Hongji Wei","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.209375Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:8675277d109814fb79ce43c4a70b443f9274f68832546d550a3f48a36354c655","observation_id":"2e086af6-f60d-4d83-865c-4152586efa1d","resolution":{"observed_at":"2026-07-31T17:22:50.209375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.213685Z","title":"Optimal mean estimation without a variance","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.213685Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:a9a8370885246dfb16c95c9ee036346e9865ac2045a55395426ed3f75136a04a","observation_id":"e32c9126-3081-4f3c-9034-777b53f6225b","resolution":{"observed_at":"2026-07-31T17:22:50.213685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.218491Z","title":"Interaction is necessary for distributed learning with privacy or communication constraints","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.218491Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:77bbc78a3318b64b0ba79299c3f09293aae069b74cd8c846f5c81415ea588d4c","observation_id":"1dda663d-5281-426d-9517-5d738a09d408","resolution":{"observed_at":"2026-07-31T17:22:50.218491Z","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":"10.52202/075280-0182","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimality in mean estimation: Beyond worst-case, beyond sub- G aussian, and beyond 1+ moments","venue":null,"work_id":"04002c7f-8a9f-4049-924e-734c9574277f","year":2023},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.223020Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:ca53c4459bd2c23b5ab72cfcebc35c4fe42131b984ea62e181ce03b00ca3ea89","observation_id":"8a45ed24-2033-4657-8a83-d80cdbdda3f1","resolution":{"observed_at":"2026-07-31T17:25:52.139166Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/16-aos1440","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Oliveira","venue":"The Annals of Statistics","work_id":"d769f2da-cfd2-4b76-84b2-6eeaef82c8b9","year":2016},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.227326Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:ae60476526a996f998654bf3514779845f8cda356bde6bab9502c89751b18a45","observation_id":"1543ade5-c51e-439e-9f77-bdfe0dfe17f7","resolution":{"observed_at":"2026-07-31T17:25:52.022419Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.231792Z","title":"Lower bounds for locally private estimation via communication complexity","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.231792Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:9085b737f4e088be0e3cede9eb2599fa0a7cfeb1c35b91bc7745a5e336951cee","observation_id":"f9a71e85-e1c9-4711-b7af-c60281dfcd46","resolution":{"observed_at":"2026-07-31T17:22:50.231792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.236609Z","title":"Dealing with range anxiety in mean estimation via statistical queries","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.236609Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:40fe9ac22b8761eaabcd4ebcc1fc6ff587e5d98337652fdbc69ff23022f915ce","observation_id":"c93dd8b7-9130-4824-b922-cf7116662b72","resolution":{"observed_at":"2026-07-31T17:22:50.236609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.241160Z","title":"Locally private hypothesis selection","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.241160Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:482b4d3f2e4c8f246304c82903a7f3088476a0da1cb36258cce27d00fdb90649","observation_id":"5711f129-5a7f-4dc0-ae30-21757f5d4592","resolution":{"observed_at":"2026-07-31T17:22:50.241160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.245166Z","title":"Geometric lower bounds for distributed parameter estimation under communication constraints","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.245166Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:582750f7cc3045d7cc5a64f8e5accb1ab6de83747ac80be9ca9836f8546d48ef","observation_id":"8514709f-d53e-442b-bc88-2462de1aaa97","resolution":{"observed_at":"2026-07-31T17:22:50.245166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.249418Z","title":"The sample complexity of distributed simple binary hypothesis testing under information constraints","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.249418Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:8d74709759694770c644ef4115cd9ef95f1dfd223b37f1b2a54f0dc8c309fd10","observation_id":"8ed57532-a346-4658-91d1-e4f96a8d6568","resolution":{"observed_at":"2026-07-31T17:22:50.249418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.253775Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.253775Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:cd87b27b28be9f81faaf39b35c6a9d3a63b19a9295751bc16383a24480308d9d","observation_id":"1cf9b86d-89ef-47ba-9d13-c05e2a4157ee","resolution":{"observed_at":"2026-07-31T17:22:50.253775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.258136Z","title":"One-bit distributed mean estimation with unknown variance","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.258136Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:6fe4c84f1fff46a71e650ee5fa885c4e073e352ee63f217d52ace2082a150736","observation_id":"1be53e11-0fd3-41c5-944c-152cd01bc37e","resolution":{"observed_at":"2026-07-31T17:22:50.258136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.262494Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.262494Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:f4437189016e3e5d8bfb86964d1a002f8c0f95d9df410bdebdf0363ebaf7b38f","observation_id":"6452033f-b436-4ccb-b10d-0427dcf31350","resolution":{"observed_at":"2026-07-31T17:22:50.262494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.07796","last_updated":"2026-05-22T05:47:06Z","snapshot_observed_at":"2026-08-02T14:05:57.955418Z","submitted_at":"2026-04-09T04:49:21Z","title":"Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.07796","snapshot_observed_at":"2026-07-31T17:22:50.266836Z","title":"Order-optimal sequential 1-bit mean estimation in general tail regimes","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.266836Z"},"links":{"cited_paper":"/paper/2604.07796","citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:b2c4197a86bb2b41e60211991b0fec5443292fc7c21325dc0f92a41bdcb666a1","observation_id":"4cf2d10b-e08e-4528-b13a-710cf04c6969","resolution":{"observed_at":"2026-07-31T17:22:50.266836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.272466Z","title":"Sequential 1-bit mean estimation with near-optimal sample complexity","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.272466Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:1b475719090568f9873d61226646c378174208d5fd90b0d5a2740776f294ead3","observation_id":"b3ebfc19-91ae-4f99-866f-72e3b67cbdd5","resolution":{"observed_at":"2026-07-31T17:22:50.272466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.277529Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.277529Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:2e06f80498c0df9340fcd02846daa981da90b94bfa28e68a87e18db4a4b0e22b","observation_id":"243639da-cf85-4971-b20f-759a7af82dd3","resolution":{"observed_at":"2026-07-31T17:22:50.277529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.281807Z","title":"Universal decentralized estimation in a bandwidth constrained sensor network","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.281807Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:cfffb6e6d7a1602c6104f16d9e78cce72b0b8db2783fe03a6a3641ae7aa827db","observation_id":"1045f29c-3eec-4df0-a10e-964955e81352","resolution":{"observed_at":"2026-07-31T17:22:50.281807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.286387Z","title":"Wyner-- Z iv estimators: Efficient distributed mean estimation with side-information","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.286387Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:93558f32d2c3d817cf689bc7b12ac71a8ae1a0352f5ea4e5fae53aafbbdf963e","observation_id":"173982a7-ca32-49b9-8a22-220ddea5802c","resolution":{"observed_at":"2026-07-31T17:22:50.286387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.291018Z","title":"Efficient median of means estimator","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.291018Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:48ccb25bca2223ff14e7177b4773b93e05b1b54a297f95b062ca9e4093105827","observation_id":"c9ae0f36-702a-44ce-8d53-008f30d0e264","resolution":{"observed_at":"2026-07-31T17:22:50.291018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.295508Z","title":"Pour, Hassan Ashtiani, and Shahab Asoodeh","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.295508Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:7f52072dec0aa423caeffa2d9743678577e919da13eaa851944f395cd89059b3","observation_id":"b7da5f2c-642a-49bd-8ab7-66e7490964e2","resolution":{"observed_at":"2026-07-31T17:22:50.295508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.299917Z","title":"Giannakis","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.299917Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:5191a297aad7f986cd0dc56deca945cc0c1983e2ea88188b0ecb1dfb99a39429","observation_id":"e7cf791f-10e7-4c90-bf59-d9c827f88dcd","resolution":{"observed_at":"2026-07-31T17:22:50.299917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.304521Z","title":"Giannakis","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.304521Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:f0a1bfad0dc05fb976e19812441b439e4f0b1103ce4d26c85bd97d773917f18e","observation_id":"668a0ead-0754-4d7e-bee2-7ea9f13c62c1","resolution":{"observed_at":"2026-07-31T17:22:50.304521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.309515Z","title":"Fundamental limits of online and distributed algorithms for statistical learning and estimation","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.309515Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:b9048bff74aed9f04ea63e4212ab336e4b5cdbc2e16fa57f34a5e6ff3a4fb3fd","observation_id":"6ab7e867-4275-4bd0-80ff-d3f097ba16e6","resolution":{"observed_at":"2026-07-31T17:22:50.309515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T17:22:50.314137Z","title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T17:22:50.314137Z"},"links":{"citing_paper":"/paper/2607.24358"},"observation_digest":"sha256:9b2884f0628891f9b0d2ae48110288a7e0e8ae52efe37966ee4b35a996f9ff5b","observation_id":"519e8847-81a8-42c8-bf9e-1cf41e15dc80","resolution":{"observed_at":"2026-07-31T17:22:50.314137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24358","last_updated":"2026-07-27T12:35:21Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T01:05:35.783676Z","submitted_at":"2026-07-27T12:35:21Z","title":"Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":31},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2607.24358."}