{"as_of":"2026-08-15T07:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5be403bffd64334290a5fb1740e9b12fed67d063ad65b25c50c0ab8ab8c90d13","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-15T06:32:42.880941+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-11T14:46:35.407771Z","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:25e03c61e8b47c0fbeb858dec8661d8427ea6abb70da66c94878a6137361093f","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-11T14:46:35.407771Z","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:b06f77c3fb117b27dda0ee73ffa39e110bf61bfa3767a7aa42ad2f1ecf2c495d","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-11T14:46:35.407771Z","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:9bd9f8a798ecabaa84a32bc5f4940ef677b66dbb79f8f3fe197cd1ffd290d10d","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-11T14:46:35.407771Z","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:a0fc8246708e1a5d3662ff13cfe008eb43400f8dd3ef22314029c0853febe874","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-11T14:46:35.407771Z","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:93b7946f1d7a8a54ace8ef1631876c51f644a9ad7aad8a89303440334468e390","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T14:46:35.407771Z","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:bd854ac8d8131357d4789bd059d1ca34f1b74d4746db8882e41225e8e340b8d4","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-11T14:46:35.407771Z","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:a529069ee51a252fa05c4c351e175e4a330851a5e572e8c94e9bf668f144c387","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-11T14:46:35.407771Z","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:53184e43d6904db3f6b18773499e165e6c4e35a6415c4476b3f746e9a9cbeca9","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-11T14:46:35.407771Z","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:17165b2a0e5fa770c92c54a88e610f21a5b16e6c1266773cc66bd58814504be3","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-11T14:46:35.407771Z","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:774958c3eb45511d751eece081e661716338f7d21f6c92fe83a273a4b39e13d0","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-11T14:46:35.407771Z","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:a912703b06b81ed8749618db48aa35546f0896425446b79f02ecf4c34832458f","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-11T14:46:35.407771Z","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:2c3b0e9306a04c47a3398ff2552c2054134e614a81abbb04368043aec41881f6","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T14:46:35.407771Z","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:8368f7c077cf92d37ecc5dc4093d1ddabd73570375893f960d1c9cc776f1c320","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T14:46:35.407771Z","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:f317cfbe1bc655fb684c03424d308bd9125e95c7076c3f2aed144192467494ff","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-11T14:46:35.407771Z","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:2d722daf0e79fe2d1ba117b5a1ef89df71950b1ea5cd324ec1d57416f2b7db9f","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-11T14:46:35.407771Z","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:86878590010591f0971f3cedbeed15f387a938ad346f5083a1bc955001974f82","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-11T14:46:35.407771Z","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:76e6a6ab1fdeff1b90090df2a4f4574aefb6df79b73503c8d238bafc42cbcf1b","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-11T14:46:35.407771Z","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:98180f479f39e559c780af715f5093184c8738b4a99ecdef492f07048952ac02","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-11T14:46:35.407771Z","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:82f38c2894bdffb0b6be75c6bf8cf1004224ad8346697ec99fdc47313b2d6419","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-11T14:46:35.407771Z","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:4ab314ac10ec05fda01f54e294bbe0c77d22cc743f11b129b4e8feda62facd7d","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-11T14:46:35.407771Z","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:8cb6283c9715d9afdb6ca133abcc90295fbc45835ee1401f9908dc86b9884c29","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-11T14:46:23.842262Z","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-11T14:46:35.407771Z","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:09b451b2fec82f8fec79ebc11449fafeff499533a2badd4104b1245ed6584463","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-11T14:46:35.407771Z","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:12576dddca7f2f47918e55d244e18a7f586c529bb0a8f3d5f4cea971e496d322","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-11T14:46:35.407771Z","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:cc8cf9cca555226b38fb8d8d391eb1bdf206c639a7121a698461aa1bd0b65cd6","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-11T14:46:35.407771Z","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:79abe11717d5529e43bfd29033bfd2bdf728f15d443fce1af8d49ca9a6b93be4","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-11T14:46:35.407771Z","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:f08a3495781c9826accc2aee6806756fac3a9afa12c6b7e97276c2e42c0d6ffc","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-11T14:46:35.407771Z","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:72e2e574c1dad6ba466f6316cab840f295edec24c63c29f476a456cfa157352c","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-11T14:46:35.407771Z","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:8fb9bb9a3c1d627d65626f84304addac7f38c5443d34a8058f13cb0ad59c4844","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-11T14:46:35.407771Z","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:e9085da92c71120e1b54ba71d5845ee9f41e573d1112b7f52238771fcef54f2c","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-11T14:46:35.407771Z","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:dc01bcdad2c3d157798f1d5d88531bcc4e94a4053b333dc21902197b7aac54a3","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-11T14:46:35.407771Z","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:68e5d33f5a10324a53641f6034f4158bd098bb81b01e17537ccf6961c9c078b0","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-11T14:46:35.407771Z","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:25889fe43d4eedecc9adf29d62f0418a7df306fec9e7389c49d48ec691b6b1f2","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-11T14:46:35.407771Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2607.24358."}