{"as_of":"2026-08-08T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b32f741895b5583cced16a5641d86c79f0a511febab1195dec2374a6c0d451a","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T06:01:25.733455Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.22063/citation-record","integrity":"/paper/2607.22063/integrity","json":"/paper/2607.22063/citation-record.json","paper":"/paper/2607.22063"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:01:23.247932Z","title":"The space complexity of approximating the frequency moments","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.247932Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:3e1ed5c91d8354c59610a1040e99ae066e86f393fd33d5c3e21a35e22c3d92b1","observation_id":"71b04158-26c2-46dc-a775-9d13a916573c","resolution":{"observed_at":"2026-08-01T06:01:23.247932Z","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-01T06:01:23.375444Z","title":"Brands, F.W","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.375444Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:000de4234405c920046a13d3872f2b4c2b7599f40255f96e177e332b27837d88","observation_id":"5af97921-a204-4b2d-9ebb-92df0f2cc3a5","resolution":{"observed_at":"2026-08-01T06:01:23.375444Z","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-01T06:01:23.509260Z","title":"Efficient estimation of the cardinality of large data sets","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.509260Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:783dafd6a9e86a33af3d0348e8795aff76e686d994fba058de8997a5d36cecd2","observation_id":"e5a0f2bf-c1bf-4306-9908-5e679ddf0377","resolution":{"observed_at":"2026-08-01T06:01:23.509260Z","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-01T06:01:23.617335Z","title":"A statistical analysis of probabilistic counting algorithms","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.617335Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:dfc74f359de6783d2fb63da0c4c9767acda4607ec8b22b21f2685d0dcee09cd6","observation_id":"67c15e0c-d772-4c06-a6b1-5855ec541fd7","resolution":{"observed_at":"2026-08-01T06:01:23.617335Z","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-01T06:01:23.713220Z","title":"Loglog counting of large cardinalities","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.713220Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:fcb8e4580218021f94c5caccb27f6baeec9fe7592972e196a92118b81e243cde","observation_id":"1b3a5fc9-046b-416c-b97d-90c6aad080ee","resolution":{"observed_at":"2026-08-01T06:01:23.713220Z","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-01T06:01:23.807168Z","title":"Algorithms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.807168Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:007edd07ecef6193f4d4434987bb13bc4c35dc836c5e2cc35e08ea57580fe273","observation_id":"bc12168a-7981-437b-a646-b0a05a02622e","resolution":{"observed_at":"2026-08-01T06:01:23.807168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.01284","last_updated":"2017-02-23T20:30:22Z","snapshot_observed_at":"2026-07-06T05:28:47.070083Z","submitted_at":"2017-02-04T13:25:05Z","title":"New cardinality estimation algorithms for HyperLogLog sketches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.01284","snapshot_observed_at":"2026-08-01T06:01:23.893413Z","title":"New cardinality estimation algorithms for hyperloglog sketches","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:23.893413Z"},"links":{"cited_paper":"/paper/1702.01284","citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:e680857811051eec64d2cae675665cc20fd788dd5b0668f8151fec9b80b0850b","observation_id":"0fff7be2-e0b9-4f54-b61a-cce094f42e20","resolution":{"observed_at":"2026-08-01T06:01:23.893413Z","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-01T06:01:24.112482Z","title":"Counting by coin tossings","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.112482Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:4fab2d00b8cb629440bb5ce867d3ba4a441ad3551c26b48fb6c710bb9e693d54","observation_id":"6c34aac1-fe0c-4024-994a-c0509785d134","resolution":{"observed_at":"2026-08-01T06:01:24.112482Z","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-01T06:01:24.230322Z","title":"Probabilistic counting algorithms for data base applications","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.230322Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:3ef32059f6592cf86124a07699038329e99f2595b01fa6374182f723d2de03a3","observation_id":"21784343-39ac-43a4-b42c-a28eeef56c68","resolution":{"observed_at":"2026-08-01T06:01:24.230322Z","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-01T06:01:24.252802Z","title":"Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.252802Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:de7d761fd65720ab77179ca2e5ccb1a8e76d2a361087c13d6125b52d83dfed8e","observation_id":"c466c759-e449-4962-8846-4785b7e90a9b","resolution":{"observed_at":"2026-08-01T06:01:24.252802Z","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-01T06:01:24.345396Z","title":"Order statistics and estimating cardinalities of massive data sets","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.345396Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:3b6a37ec9f95e567e47e3346755e63bcb9a1794569919a24cc955d04b9d18468","observation_id":"547790fe-c611-4640-84a5-1acf50fe08cc","resolution":{"observed_at":"2026-08-01T06:01:24.345396Z","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-01T06:01:24.488833Z","title":"Cardinality estimation: An experimental survey","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.488833Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:9542bbdfc92ce25407471fe00a244d88f9a1466b9d3974933e7e23af49427229","observation_id":"6478daa2-9a24-419c-a15a-dfe53a228587","resolution":{"observed_at":"2026-08-01T06:01:24.488833Z","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-01T06:01:24.639336Z","title":"Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.639336Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:fa316fcfd58b4613100debfbadbe06da9e1396800f772969886164a3d4456bdd","observation_id":"d6caeb5a-0cf6-4cc3-b3c9-dc6a37d342b6","resolution":{"observed_at":"2026-08-01T06:01:24.639336Z","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-01T06:01:24.783176Z","title":"Tight lower bounds for the distinct elements problem","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.783176Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:883921a4bbc0d7ca68a17e1c26c425954909a3c156047a9989aa6b861a8160ae","observation_id":"37507e14-d906-4e82-849b-32f00b63a80a","resolution":{"observed_at":"2026-08-01T06:01:24.783176Z","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-01T06:01:24.934012Z","title":"An optimal algorithm for the distinct elements problem","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:24.934012Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:2fa2cee19b0ff940beef52a64870241e7479ece7620c8cde47bf1f135b89195c","observation_id":"9dd89cc6-ca14-4493-816f-17efde6bf354","resolution":{"observed_at":"2026-08-01T06:01:24.934012Z","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-01T06:01:25.038787Z","title":"Cardinality estimation using G umbel distribution","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.038787Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:0a98117f83ef18a039290a3ef8e6d78d2cd16c3f7c58376859a764f70d16e91b","observation_id":"12491a6f-d7ae-4da5-b92a-bef00f9aee18","resolution":{"observed_at":"2026-08-01T06:01:25.038787Z","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-01T06:01:25.136192Z","title":"An optimal cardinality estimation algorithm based on order statistics and its full analysis","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.136192Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:900cf34a286804c6eef79141bc57691237dcf909dd567694aa545bbd8f302190","observation_id":"707b9bd4-70e0-43f3-9835-2c2552d33738","resolution":{"observed_at":"2026-08-01T06:01:25.136192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.00612","last_updated":"2018-12-18T06:33:29Z","snapshot_observed_at":"2026-08-06T13:27:40.163196Z","submitted_at":"2018-05-02T03:47:35Z","title":"The Story of HyperLogLog: How Flajolet Processed Streams with Coin Flips","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.00612","snapshot_observed_at":"2026-08-01T06:01:25.249834Z","title":"The story of H yperloglog: How F lajolet processed streams with coin flips","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.249834Z"},"links":{"cited_paper":"/paper/1805.00612","citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:a51861cc71dd9a7a7f0e6486d310b90d74a960b045a99a902fdf6a33dc30095d","observation_id":"f49343e6-524f-4a66-b10b-3636d728a889","resolution":{"observed_at":"2026-08-01T06:01:25.249834Z","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-01T06:01:25.366733Z","title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.366733Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:f86f6dee74d3ce81129a7f19e9aad371d524be538ee3110aad490e998ed89b42","observation_id":"b2591ad5-f378-4952-b61b-19d02d59b634","resolution":{"observed_at":"2026-08-01T06:01:25.366733Z","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-01T06:01:25.462704Z","title":"Information theoretic limits of cardinality estimation: F isher meets S hannon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.462704Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:7c5cad6ae9ce30f963e9c205ce84ca204f4c564a6f648521cc34fa948932e8cd","observation_id":"5e2797b2-fa3b-4755-87e3-0ca5fb61dd81","resolution":{"observed_at":"2026-08-01T06:01:25.462704Z","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-01T06:01:25.576499Z","title":"Shaked and J.G","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.576499Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:56e890ae8c7aa83f84c1adb30d47855930b148c1e4960d55ab11636ed06d2157","observation_id":"6bdee1f9-4133-4b11-a4d6-14ae14d2ddd5","resolution":{"observed_at":"2026-08-01T06:01:25.576499Z","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-01T06:01:25.651702Z","title":"Big Q uery documentation: H yperloglog++ functions","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.651702Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:ba061c5b0ea5183c7a3273b78c8b03bd8174c195f9d94d608997e1323f5a5517","observation_id":"594958d2-edb7-4cbd-b32d-207c007c2310","resolution":{"observed_at":"2026-08-01T06:01:25.651702Z","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-01T06:01:25.733455Z","title":"Redis documentation: H yperloglog","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T06:01:25.733455Z"},"links":{"citing_paper":"/paper/2607.22063"},"observation_digest":"sha256:6dcdccd05ee40739bdae342d7d9d3ad7e5b331af104d2cb40eb2494d63d3314d","observation_id":"e93e58fd-76ff-4d5c-95a2-0898ea8b16f1","resolution":{"observed_at":"2026-08-01T06:01:25.733455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22063","last_updated":"2026-07-24T07:58:29Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T19:29:44.817898Z","submitted_at":"2026-07-24T07:58:29Z","title":"HyperLogLog for probabilists"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":23},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.22063."}