{"as_of":"2026-08-20T23:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cbe6532cd715421b651c776d239603a6cd1cbc1a32f56931d6bc2e6352d857b","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:51:37.821916Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/1909.01802/citation-record","integrity":"/paper/1909.01802/integrity","json":"/paper/1909.01802/citation-record.json","paper":"/paper/1909.01802"},"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-14T05:51:38.552328Z","title":"Achlioptas","venue":null,"work_id":"f54dc63a-cc0e-4b86-b2fa-d0e8bcfe1add","year":2003},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.630027Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:db8d68ecff6fb9aff91912a67748432b4a924b0e0378987655bd0aa147d43ef1","observation_id":"d96fe808-b98e-4beb-886d-ac6ceebd204e","resolution":{"observed_at":"2026-08-14T05:51:38.559242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.534875Z","title":"Andoni and P","venue":null,"work_id":"b62aee6b-af74-4850-9538-03918782e33a","year":2008},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.636359Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:0b2ff428227010f3bcf3a35f90fa3faa4647dc687fbebca9167bdcf9c347f791","observation_id":"03716d36-25d7-482c-90e3-2af00b309e1d","resolution":{"observed_at":"2026-08-14T05:51:38.540028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.519200Z","title":"Bioglio, T","venue":null,"work_id":"b840dbb5-8d48-465a-acc8-e946a35d2b85","year":2015},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.641166Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:bbab21280dd38df1bdae5586cafd4514efbc8b4942d05ede5a606d550714a5a0","observation_id":"328fdce6-6659-42a0-80a9-d017baa2a35f","resolution":{"observed_at":"2026-08-14T05:51:38.523947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.496333Z","title":null,"venue":null,"work_id":"da9223fc-a948-44ac-b8d2-7ef1416eb31b","year":1970},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.646320Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:a40f13ac0646d70bc6b354f56052a6fa2b2823d835a4961faae503be19d70df6","observation_id":"2f58b4db-e364-495a-89be-9611dd7cca74","resolution":{"observed_at":"2026-08-14T05:51:38.501381Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.481423Z","title":"Boufounos and S","venue":null,"work_id":"a7fda356-844b-4178-af5f-cbc3e5e910a4","year":2011},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.651535Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:d645e77fa6fb94d465852e973fc67ef4beab8d22ac3e69c0c2e43f8b4b49e01b","observation_id":"13e40451-daa1-4be0-9b8b-9ca699b82691","resolution":{"observed_at":"2026-08-14T05:51:38.486387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.465047Z","title":null,"venue":null,"work_id":"c9228f6d-3d62-4db1-8bec-edde5566aacf","year":2013},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.657023Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:10c2357b8e7905996f496b59ff99795ff5dc611d7b428b63bcaa586a976ff7ad","observation_id":"9a03a73c-0798-40a2-9a91-af51b9b0aed5","resolution":{"observed_at":"2026-08-14T05:51:38.470922Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.449740Z","title":null,"venue":null,"work_id":"fe0f61f1-3109-4aaa-8d48-8eb22bc781bc","year":1997},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.661758Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:719656a54e1d42529776c3878e442aacf12515842d6f4cf618eb94dd79ae0961","observation_id":"f2cada17-15c6-4e28-ba28-add5826b949d","resolution":{"observed_at":"2026-08-14T05:51:38.455553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.433951Z","title":"Broder, M","venue":null,"work_id":"e44c60e9-c559-45a7-80fc-4495a292850d","year":2000},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.667071Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:cf7a1554466f437b004b79608832ba21108446c599423294059f3883fb083651","observation_id":"8ae30655-cd30-4b37-becf-bcdd7625c7e0","resolution":{"observed_at":"2026-08-14T05:51:38.439267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.416333Z","title":null,"venue":null,"work_id":"167f6860-73d6-40e5-8e79-188b572f6195","year":1997},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.671527Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:b4488700b74fe6c4fe3669f67df323ce2b906adf746ecd3b76ef11207b589342","observation_id":"e09b624f-ed4d-4319-861c-12e5d0db4d1b","resolution":{"observed_at":"2026-08-14T05:51:38.421813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.401656Z","title":null,"venue":null,"work_id":"443ae3a9-2a54-430e-a9b6-4d87adf3b67f","year":2006},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.677455Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:e0691de283187add8a0010f84b9bd3d32cfd8110944139bdf897f8cb927301a9","observation_id":"12cb3d89-714c-4152-a16b-d0b91e583572","resolution":{"observed_at":"2026-08-14T05:51:38.406763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.386091Z","title":null,"venue":null,"work_id":"2bd8b42d-638e-4d55-8d91-f1adcdf7ff63","year":1979},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.682143Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:4f6809f9110914701ddd2d9f5dd4102c5cf3d7b859aafba078f9b99e7985ee6e","observation_id":"f9f4d7c4-4c3e-40a8-992a-10e298500473","resolution":{"observed_at":"2026-08-14T05:51:38.390605Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.371058Z","title":null,"venue":null,"work_id":"071354b5-d461-4810-8324-88909a6d3e2e","year":2002},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.686649Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:9b9f1b5c69abb59f2b4a6277c248eea91a790d496d950f5ee50d675c8ad9d84b","observation_id":"6a625631-560d-40e7-b7ce-72ea9471cd77","resolution":{"observed_at":"2026-08-14T05:51:38.375947Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.353342Z","title":"Set similarity search beyond MinHash","venue":null,"work_id":"287c89cd-3790-4e62-afa8-9f49accc0e57","year":2017},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.690760Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:c98f8bd7621fa77a41b1903718826915c889a21e957bc9d635de4ffd79bcaefd","observation_id":"827d3be3-f98c-4088-834e-df3471837f4a","resolution":{"observed_at":"2026-08-14T05:51:38.358844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.337195Z","title":"Summarizing data using bottom-k sketches","venue":null,"work_id":"ff45c43c-4c3a-4ffe-8f39-e3d0ca7c6a73","year":2007},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.695007Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:d36efb50394f2fc238e3386b4c02410b06905347d05ebeec360c0c489bc347be","observation_id":"c542f7d3-52a4-4321-8aa2-6220d7273c80","resolution":{"observed_at":"2026-08-14T05:51:38.342687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04370","last_updated":"2024-05-05T08:24:03Z","snapshot_observed_at":"2026-08-14T21:06:45.228137Z","submitted_at":"2017-04-14T09:24:04Z","title":"Fast Similarity Sketching","version":4},"cited_work":{"arxiv_id":"1704.04370","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.04370","snapshot_observed_at":"2026-08-14T05:51:37.913679Z","title":"Fast Similarity Sketching","venue":"cs.DS","work_id":"3bace0bf-44eb-49c7-8a4d-6abfb6f311d6","year":2017},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.699314Z"},"links":{"cited_paper":"/paper/1704.04370","citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:88bdcd6621a4fc1aa48072be55b5f574e0b692a0025de7f9172ead67cfee8b74","observation_id":"cd57878e-9242-45bd-a5fb-bee81d501cee","resolution":{"observed_at":"2026-08-14T05:51:37.918893Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.321589Z","title":null,"venue":null,"work_id":"759c61eb-bcf8-4f01-9360-66f93d958949","year":2006},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.704532Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:b6b4e022d803f8e3fefa801f0c5cec530ee4f18a7c7aa86b13d9893adefa0ffb","observation_id":"568a2532-56f8-438c-b10b-05f8f43fd187","resolution":{"observed_at":"2026-08-14T05:51:38.326491Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.308117Z","title":"Henzinger","venue":null,"work_id":"f291ef5a-8a31-43c4-9c9e-26394abf449c","year":2006},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.708559Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:e0d2f3913eb44150ef87b5ddfd2c368ec75098b2e0ab5b418d5e6527bbecf575","observation_id":"24192030-9f86-4c5f-b0e7-559a1f855473","resolution":{"observed_at":"2026-08-14T05:51:38.313024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.291858Z","title":"Probability inequalities for sums of bounded random variables","venue":null,"work_id":"8ee8a417-a79c-43ff-9e0d-7740905926ff","year":1963},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.713359Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:e6ae340bc7096311a023310e3deff17a917256fbc970fd15026a480f679caafe","observation_id":"186c0953-cc70-4d90-a3b2-181889a684c4","resolution":{"observed_at":"2026-08-14T05:51:38.298093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.273055Z","title":"Similarity measures for text document clustering","venue":null,"work_id":"99469bd1-99d0-48a9-88fe-35d9ea18e8c2","year":2008},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.717675Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:a04b4364f325c8e2f240383d58079ea645bfbf6157ec93c022888be8c378ab99","observation_id":"35ab59b6-1b9e-4083-8774-b37b884db6fb","resolution":{"observed_at":"2026-08-14T05:51:38.279227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.257376Z","title":null,"venue":null,"work_id":"d3b74924-1620-418a-a233-9028b3c95a82","year":1999},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.723062Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:18ee6b1de4d1ae8baad6337a074188f8facee9e906a999750d32693262a7a168","observation_id":"1d649ad3-2605-48d5-8fc4-29a2412fc00f","resolution":{"observed_at":"2026-08-14T05:51:38.262014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.235968Z","title":"Improved consistent sampling, weighted minhash and l1 sketching","venue":null,"work_id":"2f0e28b6-edfd-46f7-aee9-0d42552c16f4","year":2010},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.727382Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:03a387e15ecd290ac62f4a413b6e35fa4ffb8b2fcfa5fc63f2c5324092b4d5e7","observation_id":"50651dc8-6f4d-46c2-8f0b-0e57f486bac6","resolution":{"observed_at":"2026-08-14T05:51:38.243441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.216545Z","title":"Jacques, J","venue":null,"work_id":"acabc133-224e-49f5-9630-08aa54066b2d","year":2013},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.731975Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:71768978dc5a66c600e3ca25e68e1b3b745e9648fa15aee85f1c6a1f2fe578ea","observation_id":"c00c611a-8994-463e-a65a-3b08d1a6c6ae","resolution":{"observed_at":"2026-08-14T05:51:38.223074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.196534Z","title":"Bitshred: feature hashing malware for scalable triage and semantic analysis","venue":null,"work_id":"ce95d9a8-cd14-43d9-85b5-e7e5700ff6cf","year":2011},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.736677Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:ad74b37f943b4f4f7e119268962c1f073273a98a6a52c880f632efba21d3d1f8","observation_id":"2300b7b7-062b-4103-b10d-2a50827977ce","resolution":{"observed_at":"2026-08-14T05:51:38.203064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.177431Z","title":null,"venue":null,"work_id":"44346fcc-ad48-43ce-9f14-ba376a81bbb9","year":1984},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.740665Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:0d17daca011743622a6d37f3fe01f51f0adfe00f187dcc9870e9e0d90354eda7","observation_id":"f524385b-7420-4330-b8a9-fce000ec75f1","resolution":{"observed_at":"2026-08-14T05:51:38.184564Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.161902Z","title":null,"venue":null,"work_id":"9b0fbf78-bd9f-4e7a-a924-7256e561aff8","year":2006},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.744688Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:29375063663fec53f41c58306abe6fb7b8bf9a65b2aad193295377e52ca06ddd","observation_id":"91d0fdf7-6914-48c9-b169-e00a72aa8c75","resolution":{"observed_at":"2026-08-14T05:51:38.166636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.144968Z","title":"Li and C","venue":null,"work_id":"ec19564d-e42a-4db7-bd6f-7cc0e9dc49e8","year":2010},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.749124Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:2bf44ca5cf28b8b2341d52cee9a0542007371862eab2049afc863b968183dbea","observation_id":"4a6857a7-613f-414d-a541-695a1692790f","resolution":{"observed_at":"2026-08-14T05:51:38.149800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.130520Z","title":null,"venue":null,"work_id":"9d9e0e26-2247-4aa3-a52f-8010858792af","year":2013},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.753400Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:cd9c6c39d38d5d5f77bbab1df5fe861568eae5800094b60cb1de0e9f8ec264ea","observation_id":"fd896f0b-f1f1-4239-b9b9-76927df198f0","resolution":{"observed_at":"2026-08-14T05:51:38.135349Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.04777","last_updated":"2019-01-07T01:28:14Z","snapshot_observed_at":"2026-08-16T13:22:24.289985Z","submitted_at":"2018-04-13T02:57:19Z","title":"Optimizing Bloom Filter: Challenges, Solutions, and Comparisons","version":2},"cited_work":{"arxiv_id":"1804.04777","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.04777","snapshot_observed_at":"2026-08-14T05:51:37.891780Z","title":"Optimizing Bloom Filter: Challenges, Solutions, and Comparisons","venue":"cs.DS","work_id":"d1e7aeca-6e05-4ba6-8ffa-b50680b73988","year":2018},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.757914Z"},"links":{"cited_paper":"/paper/1804.04777","citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:9c2b66ecfb95474b14a01a75292ed48c5043c0b347aa6ad3e38fcb77b36ce3a1","observation_id":"4f866fe4-7316-435b-8537-68ee1437f397","resolution":{"observed_at":"2026-08-14T05:51:37.897905Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.111970Z","title":null,"venue":null,"work_id":"d656ae57-73e9-48e9-a1e4-06b86c84d41a","year":2016},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.762418Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:cc64b4c159d804bfe7d67e76e587b926084748fa6b92c4cca9fb80866ae193ed","observation_id":"3d2c95a9-4cd8-4f07-97c0-7bdd4262b981","resolution":{"observed_at":"2026-08-14T05:51:38.117263Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.094091Z","title":"Ondov, Todd J","venue":null,"work_id":"8d3f362e-c9bb-4623-aa4a-d15cf9203ab7","year":2016},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.767057Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:316399db3ddddcbeeb2f839f620343ec531e740cacd49753898a1db047d14e10","observation_id":"2e7b0791-3201-413c-81fa-e50b3daddf02","resolution":{"observed_at":"2026-08-14T05:51:38.099210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.078671Z","title":"Ravazzi, S","venue":null,"work_id":"cc8e5e4c-a878-4b47-a298-d7cd4af448d2","year":2016},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.773555Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:9122082ebf827f87e0d1455594cc21688b915302bd2788ef2945291b916d77fb","observation_id":"7f8fdac5-ecda-4a82-80ba-48bd25876c2c","resolution":{"observed_at":"2026-08-14T05:51:38.083535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.062848Z","title":"Ravazzi, S","venue":null,"work_id":"117c0986-efed-4193-928a-8cc75608ad31","year":2018},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.778411Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:db849fee08ea3ac916f1849af9d4717de04f03e70877b9261bc756e48cea90e3","observation_id":"25bba928-eb95-4720-98b5-77888d8844fe","resolution":{"observed_at":"2026-08-14T05:51:38.067415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.08393","last_updated":"2016-02-26T16:55:08Z","snapshot_observed_at":"2026-08-14T22:08:36.011147Z","submitted_at":"2016-02-26T16:55:08Z","title":"Exact Weighted Minwise Hashing in Constant Time","version":1},"cited_work":{"arxiv_id":"1602.08393","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.08393","snapshot_observed_at":"2026-08-14T05:51:37.866225Z","title":"Exact Weighted Minwise Hashing in Constant Time","venue":"cs.DS","work_id":"c6f988d5-b695-4f93-8dd1-5348b022bce1","year":2016},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.782901Z"},"links":{"cited_paper":"/paper/1602.08393","citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:b5727bd0706ab9587f9ef4d4c87ee7a76a14663b80abc730619b8e91d8e1ede2","observation_id":"dd9f6e29-0fc6-4440-a711-736b7eb25b38","resolution":{"observed_at":"2026-08-14T05:51:37.874567Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.048862Z","title":null,"venue":null,"work_id":"4c704b3f-92c9-46cb-8028-8078924470de","year":2017},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.787793Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:58c8e2c4064c4f2e8d16d3130b4a6525d0e5932b0d5bce7736a6848b6861c546","observation_id":"81c3650c-5104-404f-bf0b-a64d7f23a6ee","resolution":{"observed_at":"2026-08-14T05:51:38.053237Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.034831Z","title":"Structure, function and di- versity of the healthy human microbiome.Nature, 486(7402):207–214, 2012","venue":null,"work_id":"7fcc5107-9510-4dcf-9c57-5a49c32179b7","year":2012},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.792353Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:fdcca65071f8b4b1d7c2fc7bb154ff651647e4d3e9a6f3850cbabd821f8d19b1","observation_id":"24aa0f7f-e44d-4bee-a2f2-31338a74d574","resolution":{"observed_at":"2026-08-14T05:51:38.039743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.022709Z","title":"Valsesia, G","venue":null,"work_id":"df2959bd-83c9-47e7-acd1-c72ecfc63a9f","year":2015},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.796865Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:618844452107b335f1d491ab6864f46370272dd5f1222bf82f43d849eeffeab0","observation_id":"9e4809f4-aff3-4c71-a8fe-de07af47133d","resolution":{"observed_at":"2026-08-14T05:51:38.026605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:38.009000Z","title":"Valsesia, S","venue":null,"work_id":"cd8ec71e-a83a-4832-94de-2b2a8046d093","year":2016},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.801533Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:298838b2773997f57cdc741d91718d24912a70392e006a4891dd0f19035625a9","observation_id":"08d16e05-2666-42f4-985b-eee2aae87613","resolution":{"observed_at":"2026-08-14T05:51:38.013370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:37.988989Z","title":"Valsesia and E","venue":null,"work_id":"75809800-aee2-46d7-9c21-c22f9988fa13","year":2017},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.806585Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:998b3c464dd1763386e93a9076c12d13e31282d4806b8b4975335b4938c7641c","observation_id":"e68903ff-624c-479d-8392-935ac1183ccf","resolution":{"observed_at":"2026-08-14T05:51:37.995296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:37.967611Z","title":null,"venue":null,"work_id":"e6b69ea8-94e4-444e-8427-d321156bf351","year":2018},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.811220Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:fbfb5da6aa6e49ecb818769ef83de46b02b2b457529eacc305df03f0d172dd16","observation_id":"93556de5-6dd0-4cd7-b0f9-7fb4d17efae9","resolution":{"observed_at":"2026-08-14T05:51:37.973690Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:37.946498Z","title":null,"venue":null,"work_id":"5810c659-7bc8-405a-b280-bc87943b1000","year":2013},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.816830Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:f3fc96cecd90b5657e507113b4197b6c154f7c8d437b563e941508f9b2a49b4b","observation_id":"9595997c-a076-407f-9541-6ea3d9d2390b","resolution":{"observed_at":"2026-08-14T05:51:37.951595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T05:51:37.929646Z","title":"and, analogously denoting µZ = (1−γ)k2, P (|Z−µZ|>ϵ )≤ 2e−2ϵ2m","venue":null,"work_id":"32be7c85-2024-4d4e-8c30-aff77796dde3","year":null},"citing_paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:37.821916Z"},"links":{"citing_paper":"/paper/1909.01802"},"observation_digest":"sha256:4999b1cc355178135394b97b8842417f7991225802a767adc4dc1a2301ef172f","observation_id":"1aad2876-c014-47eb-aa7e-39f28e2071fd","resolution":{"observed_at":"2026-08-14T05:51:37.934976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.01802","last_updated":"2019-09-02T15:41:54Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T05:34:28.621252Z","submitted_at":"2019-09-02T15:41:54Z","title":"Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":22},"total_outbound_references":41},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:1909.01802."}