{"as_of":"2026-08-12T04:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc2c1b2d691734ae4d33ad74241d522b7c08fd2b5720a5882c7e10b81ca8e2a5","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-06-26T01:58:23.544463Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.27298/citation-record","integrity":"/paper/2606.27298/integrity","json":"/paper/2606.27298/citation-record.json","paper":"/paper/2606.27298"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T01:58:23.544463Z","title":"and Mehrotra, Anay and Zampetakis, Manolis , TITLE =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:d7de5af2934c8bb1397262d8d3ca0f076a49123ee76453e7e660de1a1f672b2c","observation_id":"b1a4a252-3cc1-403f-b259-f57f837812d4","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:5c284f2b45317ff750dbdcb8dfd4526a0467338ae8217380cc1db98bddc411b5","observation_id":"5d50f2af-26a9-4e81-b885-1a75be8d52ac","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Course notes: http://www.sumofsquares.org/public/index.html , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:b9007691f26312c4658560ffce82567d54e52dba6c9448f3538a54eb214ad438","observation_id":"a0302f93-d1e4-47a3-8d60-881666d543c5","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:5d1c2f04f08540a1e5dc814334c2a2f23af11cce155967be98ddd08e5982b655","observation_id":"756c2eb7-8629-4c48-9971-97c739607aba","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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":"8129.380072","doi":"10.1145/3798129.3800725","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Mehrotra, Anay and Zampetakis, Manolis , title =","venue":null,"work_id":"4adf3ea3-e583-442d-9608-cba738d1921c","year":2026},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:6c223d8bf403c48219a0a6c5d4b0e8d100bdaabb79191ea03d19dc24e68780ca","observation_id":"72f0bdb2-f8e7-4491-947c-bdaf32867d07","resolution":{"observed_at":"2026-06-26T01:58:53.677578Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-26T01:58:23.544463Z","title":"Breakthroughs in statistics: Methodology and distribution , pages=","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:26fda54a418270ee08ecf027018c69b44ffa0cddbb826ff26d2817b8c1fe1bd6","observation_id":"0e27c0a2-d050-4706-88f1-b918bf8802e3","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:6a9c2e9c843f253002684a04d60090b55a64d8097ec594421d8c8ad4ff9f22a1","observation_id":"52cdcfb6-6f0a-4beb-b144-a46336daec0b","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:9a027f2b1d53227e59942343c243ef0b638a1ecaa843d6b00bbd913d5073768e","observation_id":"295800c2-b780-4f48-a4ef-d9405780ff53","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:82f89dccea2be167a6b78f0171bacc2fc94ec62b9cd2ea29c787248661197c89","observation_id":"9a148499-cd18-41c9-be02-6b21eb42d5e5","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:d295d38323245db33de342d1378bc65a0c9576cd2bd5f0f685706eb6103e2392","observation_id":"e1c54b50-6ca6-4384-9dca-eff3095e898a","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Private Statistical Estimation via Truncation , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:a6aa4cda74d1a456132aa4c7a0991797ddcab9f2fca281435acffc9e37b2bf65","observation_id":"68d0fc86-930d-4d78-b936-5251e2541ff1","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:95a338ce9d4ab7b52ab6bde1a3bcee58f36b62f5ebea7c2759b556c477025759","observation_id":"7faf4c16-e0dc-4dc0-a593-e27e9df1d137","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:2db287f1201abbd0905cf613050d155edc01ec9c671a143c39fc1a43011d2cd1","observation_id":"9fa58056-cdd8-492a-907b-726b031da8f1","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:49db7ea0bd46c5e4bf88114360f1d259b36aa9249509853676c83095aaddd9ef","observation_id":"b738c92d-56b1-4329-922c-0eae828d4f74","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:f80a9a2e837bd295cce9f90dc88f1d847c6a404a2ccdc14778c9a2cb547f4bdf","observation_id":"8b5c9cfb-368c-43c8-afb9-884daa265188","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Philosophical Transactions of the Royal Society of London","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:d4301a4f77e12407849cc4fcd7865857a8957083296e23f58aa0688b914589de","observation_id":"4f576a32-64e0-4913-92c9-67dac3a667bc","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2016 , month = dec, note =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:fef064d2552bb242ea1513794b1542319364ff7e047459409f7118e7b7fc2d66","observation_id":"322ff611-58e7-49da-ada5-e00bd05d2000","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:4db27edcb75c42d58d6c178a5e764a06c1ec664cc8e05c226a5e6c46b55a0e49","observation_id":"3ffbe967-9a10-44a1-84d7-0a2799c05a19","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"The Thirty Seventh Annual Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:11543bf8e39d798bbb6d4416068be411052f739b73bb1f1f062638367a818511","observation_id":"b3d8bcb7-4d71-491b-a4b6-da10aed1cbd7","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:d1218fd50098c4a99d0d81d3884395279a4b030e086953327080ae31c0b907a6","observation_id":"6c42c85c-4cd0-4b3f-9475-2a451a7c80ce","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:140ddf51e9a4e6c68a7cf5fa93b109a466b99ad731819911d74e3eae2b318c22","observation_id":"7b67c100-6a3d-425e-b6a0-230d7b10da79","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:7be6c9378377b1b145daf62e261350d7a2ac7d726d25c9ef04e112b19dd6d5cd","observation_id":"4911ed89-9b1a-465b-adfc-c83d83c52b6e","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:a222a8d5cab2b6fab1294670c99530d9d32982591d0ea1d0169e9efd06701a41","observation_id":"883f5d95-6ea9-4774-af95-c343bdf11763","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1942},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:39c2e0d5ec1e80a64124ff1b7bcc1abddfcd079dc2c2a7bea4014749755c5b56","observation_id":"4c60e0a5-31b7-48c9-8bd4-98af03b450cf","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2018 , publisher=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:e5616d2926305b0152c14368646293bbe74d819fecdc5b22e3b7ccb66d39528a","observation_id":"5be2b2de-ef33-4b3c-ad9d-31666060bde4","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:fb9a171851faf22bdbb67480add04b63d7417abe3db64fd1d7670ede7781f21c","observation_id":"192944dd-50fe-433b-916b-5420cba6a29a","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:533a97a86a1b4f43eacfbef7d3100234008b5b66ff440d5549e56f00037380fb","observation_id":"90a6d5f7-6563-41c8-944f-6f7bd1309927","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of the 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:6257c667ed3166991a77d95c2b14b8e1b7cf3ca929084bbcabf19c0a8a3b07a9","observation_id":"33a95949-3e33-42de-af1e-08a3eef16079","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Tony and Zhang, Cun-Hui and Zhou, Harrison H","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:89b401983ed0d44eedb1106c4c2e370e612bc4ed0471c34f42fb6ec59dd479bd","observation_id":"482b6a57-bace-43a1-9159-10d8688ceeff","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"and Lim, Lek-Heng , TITLE =","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:9df7dd716937b5bfba1961ecb8f2384fa0526cf1884b1ef228827b0797c95eaf","observation_id":"12d8a7f2-cc58-4a0d-8466-370e5da4c275","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"and Steinhardt, Jacob and Steurer, David , TITLE =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:788e837e0932327ea5c78d8e5982225882b62426772498e9466f0f655900c211","observation_id":"fa738f5b-a965-4cb9-82e6-c7e5fdb514c0","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"and Pensia, Ankit and Tiegel, Stefan , TITLE =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:0cd053cb1b9580c8c95bf49d69a950c6d24e929799fd0e114a1f55e63454562f","observation_id":"41c12fe0-e7e3-4088-9135-1bd8ed793278","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:989ad8f4e8a4ef652500b0b5f402cc06f07aef729efb8c5578748965f1f280ca","observation_id":"ebc82b8e-3e32-402b-9f01-74ea56623718","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:00f9a07ec571f12db090d89b5bce3d24ed98b205888ddc61a84689f4b95bf5d1","observation_id":"2f3f380c-d047-4fa8-bd32-ef2aa8d24e0f","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:139f0cd016cde95c1340eea4cb456a2f129b12e119204b7dade37f578d79bfd3","observation_id":"3d12dc10-50c0-46a0-8577-f2344345d701","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:93d2594bd943dcb4d0ec91662648b294e676758949776b2397d348df423178ba","observation_id":"7fdc6ae3-02ae-4fcb-9193-3a58541b4f5b","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:299d756275dcda94e72841eac7eb711c5b80e6fc48a324cfa23080751af6b7a8","observation_id":"acb1c5dd-7989-443e-a99c-c312a6de462a","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:0b2fd30ccde10aae56357894d6497fceabe1d454cd2c8a7961226e0fea9032ff","observation_id":"76880876-f169-4d3b-9c69-86df775c7fad","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Histoire de l'Acad., Roy","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:0a1044f272de89eba2f987cda976de9f96b48f5ab1fe5aaefc15d1bd7a3f364d","observation_id":"b1965024-eba0-4252-8657-6e8444e706a3","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of the Royal Society of London , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:cf93de9ca79fbc5cf8882f4aeaa9eaa0bb25e5dc84c3f61391711e5a6a6d46af","observation_id":"29b62605-d1e8-4470-b77d-c3771c5e1efc","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Biometrika , volume =","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:e6a157192573d22ecc09f63cb425ec587460a9343df0822c54cf84b358ef8c89","observation_id":"26581a4a-6929-47d1-bce6-2b2835e7e0a4","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Biometrika , volume =","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:eb50efeda6df4f7ab38d43adffb16553c7cc29128fa3eaaee116a7fc1affaef3","observation_id":"ed8ab186-be0f-435f-8415-a7ffb0acc8b8","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Biometrika , volume =","venue":null,"work_id":null,"year":1914},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:e6994652267708e95095e927af66fe0ca321f8611be7410d11ac971839294330","observation_id":"5ef1c10e-5bd9-497f-8b66-3a610dc9f9ce","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Introduction to British A.A.S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:2fe3ffaa7d98fa46fcb599045f36636bcf31dfe445f784f7a52508c6c71ef6f1","observation_id":"3ff079d9-8b0d-4710-969a-bc4840981e29","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:07a8ae97346d5a2f6ea0416ee8c3370c8533ee34d7b6363e2966fd9f9f78685a","observation_id":"64ca3998-9dc9-4670-9686-9a64efa81810","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Clifford , TITLE =","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:9b6299675d708be7b5cf395f7030d0b4f605faaabcf948f7589357a843f586b0","observation_id":"691d1da8-2bd9-4152-90ec-7f4ce01b71d1","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"Proceedings of the 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:1982db33612d41af001c43c907c71ec5a2fa52aec3e479f51514921c97c9a5d5","observation_id":"b672a2b0-6759-4985-8a84-778a1bb632c2","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"The Thirteenth International Conference on Learning Representations , YEAR =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:1a11885b4fa5c78933dda4f3f4826bd9f7d27227d6f5b66634e86bb53124fa05","observation_id":"b8d1d58c-d7fe-41c3-80f5-9b0aa6f6b087","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2023 , publisher=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:af59fa16942381c54da04282fee14e1a150682256f45acb527c5b1c5dcf1b036","observation_id":"82d2b519-f2a2-45cb-bd69-ca2ef53ecd4c","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:5921f8825e543081b036f7bb00d93a13f57fbcc1309599eb9643008b5f445397","observation_id":"640aaa39-b74a-4c1a-992b-5d40fbd34372","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"(Lecture Notes), Cambridge, MA, USA: MIT Open-CourseWare , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:779391edde9160988be9e2d5a9b355442e1e79bc9f3ca7168b21cf07c0e3d2b2","observation_id":"36dd4313-9ddf-4452-8e49-56f68135cc23","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"2023 , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:6601cb9ca9146cd05a0a7c7c2db8139da90c21edbc51287cd2b93ee5c58e842f","observation_id":"f2da530e-ee65-4058-adfe-da7d9329af0e","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"1997 , PAGES =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:6e265a1157941511086eafc75802d4af3bd34dfcd726c2a2e24b8ffcd75fa0e6","observation_id":"d40c1efa-14b8-4d9a-a864-e981efc07c44","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:99690c083b6bde236f64f9446ec37cf4631d30b8041aae88793fe5d95ccdc245","observation_id":"b66730f7-8f98-4630-a269-d7e229ad9e81","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":"explanatory","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:a6b600dd07c2679837f573589b6713bb5e527ec1989776eefe9ad121b32aedc8","observation_id":"338302ab-3d28-4ca9-9600-71f3a2037040","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","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-06-26T01:58:23.544463Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-26T01:58:23.544463Z"},"links":{"citing_paper":"/paper/2606.27298"},"observation_digest":"sha256:f4ca157caf345fcc89a4c8d46c150392c72fa89e0ff945577d0533a6d98ba7af","observation_id":"6c5e2d4f-1748-4ff6-94c7-6837d0cfd9ad","resolution":{"observed_at":"2026-06-26T01:58:23.544463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27298","last_updated":"2026-06-25T17:14:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T00:05:34.570529Z","submitted_at":"2026-06-25T17:14:57Z","title":"Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":55,"verified_exact":1,"verified_fuzzy":0},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2606.27298."}