{"as_of":"2026-08-23T23:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7ca45082ebf1fbe010095a08e155e3d77a9e079943330b471f4705d3debe680","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:05:00.413847Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2504.13804/citation-record","integrity":"/paper/2504.13804/integrity","json":"/paper/2504.13804/citation-record.json","paper":"/paper/2504.13804"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.152251Z","title":"A competitive test for uniformity of monotone distributions","venue":null,"work_id":"f1fbb2cb-cc17-44e2-9ef5-2563a2580168","year":2013},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.245088Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:025c31d2336362bbcdf67c6193474b8e6595efe7b978f8d4b1e5c65a230f125d","observation_id":"718308d8-8225-4d04-b904-5217ab6fe485","resolution":{"observed_at":"2026-08-16T12:05:01.156783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.138028Z","title":"The complexity of estimating r \\'e nyi entropy","venue":null,"work_id":"6a07e090-c442-4f98-8443-c129a249aefc","year":2014},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.250171Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:085d59c910311077245ac0b1dbe2abf2d341cf4bf61d7270cfbf6203e28473e4","observation_id":"485dda04-2405-420c-9e7b-930478e78c95","resolution":{"observed_at":"2026-08-16T12:05:01.142469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.123831Z","title":"Test without trust: Optimal locally private distribution testing","venue":null,"work_id":"a4d73366-de0e-4759-86e1-89972111ed77","year":2019},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.254943Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:c3b08d898364513880b8489396aa720792d062780d2bfa6a9ad9d9a8b2b0b961","observation_id":"a11e3cb2-0982-489c-bb5c-aa21f785d734","resolution":{"observed_at":"2026-08-16T12:05:01.128531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.109701Z","title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","venue":null,"work_id":"91f966db-5d48-4c66-9f19-551c9ff78d86","year":2019},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.260067Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:444fc4723654cb128c63b3331cefb1049f4e76a09be3e2145379cef1211f18a2","observation_id":"78e3a367-1ab2-42e4-a7c3-a809fa735a73","resolution":{"observed_at":"2026-08-16T12:05:01.114207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.095580Z","title":"The space complexity of approximating the frequency moments","venue":null,"work_id":"a3599ad1-a05f-4c08-a137-b981c6f5475c","year":1999},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.264733Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:3899fb0c7bc5b8e5882df916f90944dbb15718dd9ca18b5345cec885d34b83aa","observation_id":"044a9cc0-d421-47cd-856d-747f7cbca999","resolution":{"observed_at":"2026-08-16T12:05:01.100166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.081172Z","title":null,"venue":null,"work_id":"edf87791-e271-4652-872b-e1920c107fc4","year":1995},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.269559Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:51a7f8dd9fa507cc98642266d90aa2b3272f07e5d7da36b77d99455fb21c9a96","observation_id":"cc46c75c-f8fb-406f-9958-2b615b74dd3d","resolution":{"observed_at":"2026-08-16T12:05:01.085769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07751","last_updated":"2023-05-12T20:35:10Z","snapshot_observed_at":"2026-08-21T08:48:29.039990Z","submitted_at":"2023-05-12T20:35:10Z","title":"Private and Communication-Efficient Algorithms for Entropy Estimation","version":1},"cited_work":{"arxiv_id":"2305.07751","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.07751","snapshot_observed_at":"2026-08-16T12:05:00.632773Z","title":"Private and Communication-Efficient Algorithms for Entropy Estimation","venue":"cs.LG","work_id":"a5db5d8e-beba-417f-8629-b00429be7f50","year":2023},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.274837Z"},"links":{"cited_paper":"/paper/2305.07751","citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:44aa9c001bbb48ba10774e317d216845e90c07270c5ce009b79f46be0351b39f","observation_id":"a8aa7f35-1bc9-44ae-ba32-a5b698a87411","resolution":{"observed_at":"2026-08-16T12:05:00.638492Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.066803Z","title":"Identity testing for mallows model","venue":null,"work_id":"6b1d37d0-e692-4211-ae37-e3904ac7e1f0","year":2021},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.279689Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:dc4cd42fbe095ae422dd1d811793e56fb6c8a7194d65ddf0ae2e4987ce92dabc","observation_id":"f52af7ee-675b-4fe5-b65b-3cf925cfeaa1","resolution":{"observed_at":"2026-08-16T12:05:01.071578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.052277Z","title":"Locally differentially private estimation of functionals of discrete distributions","venue":null,"work_id":"f9b49349-6e91-41b8-9cba-721c24f9d019","year":2021},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.283997Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:74265ca66be911b05d4578506b47098f38c875dd21fece31af7fd264428ff55a","observation_id":"1cba60a2-59f6-4ab9-9da6-9f94f8ac690c","resolution":{"observed_at":"2026-08-16T12:05:01.057103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0100000114","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.464952Z","title":null,"venue":null,"work_id":"41279b64-78a0-45b9-8149-00efa248bace","year":2022},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.288659Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:3f03404ee4361bbe64a4e1a73a2170acd71c936803413213138466dde4c21c52","observation_id":"650226cf-5126-4db7-913a-43caa0870b00","resolution":{"observed_at":"2026-08-16T12:05:00.470400Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.037144Z","title":"Topics and techniques in distribution testing","venue":null,"work_id":"69bc6d74-1cb2-4e54-9252-caf15592b514","year":2022},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.292979Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:9fecc09ae882dffb95604541e997abcfdda7f8520cd967386fb6c6c089a72e68","observation_id":"d10a0ea0-d88e-481b-b113-96cdaa8e7ae5","resolution":{"observed_at":"2026-08-16T12:05:01.042161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.022326Z","title":"Prediction, learning, and games","venue":null,"work_id":"c592e429-be9e-4e3f-b159-ddb49d056b5e","year":2006},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.298083Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:ca1ecf0cc8b5526979d3d9b3c81e0c424ab4d657dd63f6f83fa032efe25338bc","observation_id":"48713b12-fdee-4a9f-9be5-42372aafa36f","resolution":{"observed_at":"2026-08-16T12:05:01.027156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:01.007793Z","title":"Join sizes, frequency moments, and applications","venue":null,"work_id":"5edf68de-6df3-4314-8a5b-ba2041cedbd9","year":2016},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.302435Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:fe9d29541ed84d5b92e70701ef86c7a50804a5a36b3635eab08441d2ad2241bd","observation_id":"3ae2aeb4-237e-4488-9124-16f15ee3daca","resolution":{"observed_at":"2026-08-16T12:05:01.012594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.992177Z","title":"Frequency estimation under local differential privacy","venue":null,"work_id":"49b1e845-04d4-4cf9-b149-3c74516d5a8d","year":2021},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.306699Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:760f98bb75f515cef95c769f07baf6b3f8c3bb0e2a50717125ebdf79b0c75687","observation_id":"9489513e-c75d-483a-990c-b097e3deff27","resolution":{"observed_at":"2026-08-16T12:05:00.997631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.976150Z","title":"Stochastic streams: Sample complexity vs","venue":null,"work_id":"0f7bb538-384c-4f7c-827c-0b026e1dde2a","year":2016},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.312082Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:b23436551b100fa96d10426645ce39069307dd5b002b0004c2471fd0e676b7b8","observation_id":"052ce388-bd32-448a-a9d8-eedd1d5755cc","resolution":{"observed_at":"2026-08-16T12:05:00.980819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.961477Z","title":"Optimal Stopping Rules for Sequential Hypothesis Testing","venue":null,"work_id":"cf8665a6-f342-41bf-a9ef-cb8078c8c2cc","year":2017},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.316321Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:294d7f42ca475217dbc7e594d03dea3e633ca3303f64a017fed61e6d0a50212f","observation_id":"5b44fcfd-92ae-40be-9091-311425f26a15","resolution":{"observed_at":"2026-08-16T12:05:00.966242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.947048Z","title":"de la Pe \\ n a and E","venue":null,"work_id":"41a0df82-c560-4008-b95a-8c6869891b16","year":1999},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.321222Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:c3f99e50f47719c32c4ffc0b1a7bbfd45c4a1bef0622916fb7ad99c430c4da57","observation_id":"b8b303d9-d50a-47ff-8b0e-50479e6c09be","resolution":{"observed_at":"2026-08-16T12:05:00.951395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.932195Z","title":"Kane, and Vladimir Nikishkin","venue":null,"work_id":"5159f7ac-a09e-4f94-b54b-fa3cb512a507","year":2015},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.326019Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:52df6864d6e54e7b8fe069653fcf7bf3c7c4e75a7fdb2cee9da566e131c9b45f","observation_id":"e5a8218d-a7ec-480f-bcac-ee13deabe837","resolution":{"observed_at":"2026-08-16T12:05:00.936928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.916792Z","title":"Concentration of Measure for the Analysis of Randomized Algorithms","venue":null,"work_id":"ae87232f-864d-4660-a64a-c3cd70eb79fd","year":2009},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.330515Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:c143ebad19095a229e3cf57f5a41add2db610eff72c243a6615303e7416a6431","observation_id":"fc3a5ebe-4ea9-4f0c-a249-bbcb51d09a0d","resolution":{"observed_at":"2026-08-16T12:05:00.921750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.02390","last_updated":"2017-11-14T19:01:25Z","snapshot_observed_at":"2026-08-14T22:02:29.885918Z","submitted_at":"2016-04-08T16:24:18Z","title":"Minimax Optimal Procedures for Locally Private Estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.02390","snapshot_observed_at":"2026-08-16T12:05:00.335296Z","title":"Duchi, Martin J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.335296Z"},"links":{"cited_paper":"/paper/1604.02390","citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:0530b52d551b4c5b4e0d884397adfc06f62b3fa54d2ce5d29703de49fa8c7464","observation_id":"06b39bfd-1785-4242-b876-362195e91d6c","resolution":{"observed_at":"2026-08-16T12:05:00.335296Z","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-08-16T12:05:00.339963Z","title":"The algorithmic foundations of differential privacy","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.339963Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:c74e674826f71952a4ad0843ef18ad1272a741c3d204da3702163b3fbb646917","observation_id":"2988f019-9d99-4c30-a418-ef543ca68f93","resolution":{"observed_at":"2026-08-16T12:05:00.339963Z","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-08-16T12:05:00.344512Z","title":"Rappor: Randomized aggregatable privacy-preserving ordinal response","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.344512Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:6d0d75b8996a2ec680300d533c3430a78012c5a91220697e9b95f254c5f8b086","observation_id":"c609ed8b-883a-4575-ade0-799da5abdd4d","resolution":{"observed_at":"2026-08-16T12:05:00.344512Z","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-08-16T12:05:00.348808Z","title":"Variabilit \\`a e mutabilit \\`a : contributo allo studio delle distribuzioni e delle relazioni statistiche.[Fasc","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.348808Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:2cd1b05bfb7cab5218fe4c58b60511855ad9fadd10f9e155ac08907f0793a593","observation_id":"05ca7091-2688-4342-8da3-af2d1b6a5dc2","resolution":{"observed_at":"2026-08-16T12:05:00.348808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.875165Z","title":"On testing expansion in bounded-degree graphs","venue":null,"work_id":"32c78fbe-0ccf-484c-9c4a-5600a92716fd","year":2000},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.353083Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:2480ecbd81ef65d415850ab515f07be0c24733a27fdecc2b04a0de735755fedf","observation_id":"6f18defe-c121-4ea3-8ea6-3f5792ef3604","resolution":{"observed_at":"2026-08-16T12:05:00.879674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.860889Z","title":"Concentration in the steel industry","venue":null,"work_id":"2ff2cf60-6901-4115-a0b9-a0243ed64b0a","year":1997},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.357447Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:d2172a7c35a0a4e65014a7a784676e7a456ee03f8996a49a12cd5959e22eb9c5","observation_id":"6b9cea35-484b-43ae-99cc-be868e230eee","resolution":{"observed_at":"2026-08-16T12:05:00.865382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.846814Z","title":"Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon","venue":null,"work_id":"ad8c5e08-ea9e-4ec9-99a8-d86c61d957e3","year":2021},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.361517Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:1de73508b0213342320ca0406dfb32c6104d6e8481723201dc9470f208e5da13","observation_id":"2654b8cf-ec50-4d42-881c-000a347ff90f","resolution":{"observed_at":"2026-08-16T12:05:00.851415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-08-16T12:05:00.366352Z","title":"E ffective","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.366352Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:549c0c8e84ebc672520a72b4f6a6aef6ffee945b679f7acd27e5b8f06eb53e99","observation_id":"220d6004-6103-4f52-b4e1-b761c5876705","resolution":{"observed_at":"2026-08-16T12:05:00.366352Z","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-08-16T12:05:00.370896Z","title":"Entropy and Diversity: The Axiomatic Approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.370896Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:1481f595564e869f27d3116fece41d99886b91d3740a39710875fea420447091","observation_id":"72c44614-0ebf-4e62-a218-84b3603e9ce6","resolution":{"observed_at":"2026-08-16T12:05:00.370896Z","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-08-16T12:05:00.375341Z","title":"Mean estimation and regression under heavy-tailed distributions: A survey","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.375341Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:c5740ae33309692e5568177f2548e0cdb14bc821244437f8595e6aa3b867454e","observation_id":"e13008d6-5450-47b0-ad7a-ff584d7ff431","resolution":{"observed_at":"2026-08-16T12:05:00.375341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.718912Z","title":"Information theory of dna shotgun sequencing","venue":null,"work_id":"d2ece822-d6bb-4c24-bcc4-251afdc5a5af","year":2013},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.379675Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:a622867148f77692b9d187f8d8439fc36c2311f0760b054e845ba953f508c3f0","observation_id":"3c2b7bd2-bb15-4054-990f-94780b49a200","resolution":{"observed_at":"2026-08-16T12:05:00.723436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.704016Z","title":"Sequential algorithms for testing closeness of distributions","venue":null,"work_id":"260b23fb-0d72-44c2-93ed-a715517938ca","year":2021},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.383742Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:a4e08f9beb96ba647b6682bdf770d5c896af0fa807337e7ec1c8722beac98a51","observation_id":"a8288612-1f52-4acc-af5f-8daeb6050740","resolution":{"observed_at":"2026-08-16T12:05:00.708826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-08-16T12:05:00.387933Z","title":"Estimation of entropy and mutual information","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.387933Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:dd5e6310f65b3c9ed32268203f5d43bfdcb3e80d277145c90626ddd6d4a0115b","observation_id":"a5474d6a-edce-4353-9e66-7c3b3ac108b7","resolution":{"observed_at":"2026-08-16T12:05:00.387933Z","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-08-16T12:05:00.392106Z","title":"Moment Recurrence Relations for Binomial, Poisson and Hypergeometric Frequency Distributions","venue":null,"work_id":null,"year":1937},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.392106Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:9a8fc900e95ef1bc2c4194f76b72ec8442c886b3f11795249b35f1cac41a549a","observation_id":"bceb25b8-3bcc-4d4a-b3b4-a424cd2ab239","resolution":{"observed_at":"2026-08-16T12:05:00.392106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.678465Z","title":"Measurement of diversity","venue":null,"work_id":"06724546-8209-41c0-a638-e7f55d2392d0","year":1949},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.396234Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:ff26c632371c396f4302996f8e80fa39cfe9007b0678a6e9f1651aab2193d96a","observation_id":"c0090dea-112c-40db-a0ce-f8f9c345966d","resolution":{"observed_at":"2026-08-16T12:05:00.683050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.663492Z","title":"Evaluating entropy for true random number generators: Efficient, robust and provably secure","venue":null,"work_id":"4337e5d4-2c38-406f-89c9-909eca4362fd","year":2017},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.400711Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:12e4a78b89323c2ef1deaa0fc13e95fa0e05efe72c419a8d0f24ee088e90b923","observation_id":"6de09e0f-5254-4e30-a513-cc405c9d12c1","resolution":{"observed_at":"2026-08-16T12:05:00.668292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:05:00.648919Z","title":"Possible generalization of boltzmann-gibbs statistics","venue":null,"work_id":"61b4eead-9468-4b27-ac0b-dcac57eedf38","year":1988},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.405225Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:fc49b892722854e9b7fbd07ad9803d7abe691598c1a462d58e62eed20ea3ab46","observation_id":"ceb49369-4ae2-4dbb-8129-a98366f38736","resolution":{"observed_at":"2026-08-16T12:05:00.653412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-08-16T12:05:00.409633Z","title":"Estimating the unseen: An n/log(n)-sample estimator for entropy and support size, shown optimal via new clts","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.409633Z"},"links":{"citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:d9549941b80a313d307460ecd68d0d091dcfeecd28fcf149b4076a30e0edd432","observation_id":"b1fd633d-2006-4668-bcf8-b7bdd13bf460","resolution":{"observed_at":"2026-08-16T12:05:00.409633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09686","last_updated":"2022-08-25T18:26:51Z","snapshot_observed_at":"2026-08-21T08:48:03.365706Z","submitted_at":"2020-10-19T17:22:03Z","title":"Estimating means of bounded random variables by betting","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.09686","snapshot_observed_at":"2026-08-16T12:05:00.413847Z","title":"Estimating means of bounded random variables by betting, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T12:05:00.413847Z"},"links":{"cited_paper":"/paper/2010.09686","citing_paper":"/paper/2504.13804"},"observation_digest":"sha256:3f372a2e80ef8817a208366e1e2eb133a16307fa7f9652c6f9b5dc5a9806ad56","observation_id":"6b66ad58-0347-4ced-b1a2-fdbdeddfb0f8","resolution":{"observed_at":"2026-08-16T12:05:00.413847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.13804","last_updated":"2025-04-18T17:12:15Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-21T08:48:16.326615Z","submitted_at":"2025-04-18T17:12:15Z","title":"Near-optimal algorithms for private estimation and sequential testing of collision probability"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":24},"total_outbound_references":38},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2504.13804."}