{"as_of":"2026-08-16T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f986dcc58aaa618ec47f489c2dc0e6cbb192b130defd2ed49217b05df8487036","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:34:39.849656Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:00:17.589238Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:28:41.737159Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.05198","snapshot_observed_at":"2026-08-11T17:00:17.589238Z","title":"Frequency estimation algorithms under zipfian distribution","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2412.09773","last_updated":"2025-01-04T04:45:25Z","snapshot_observed_at":"2026-08-11T16:41:49.912671Z","submitted_at":"2024-12-13T00:44:47Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T17:00:17.589238Z"},"links":{"cited_paper":"/paper/1908.05198","citing_paper":"/paper/2412.09773"},"observation_digest":"sha256:61ebfb3751ac1e2d6b4049e7f7cfd91d61da7975957720ab2227dbc75c3729c3","observation_id":"31c11646-7487-42a9-b14e-7f7eb3a581ea","resolution":{"observed_at":"2026-08-11T17:00:17.589238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"cited_work":{"arxiv_id":"1908.05198","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.05198","snapshot_observed_at":"2026-08-07T14:28:41.737159Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","venue":"cs.DS","work_id":"58d038a4-58d3-44cc-b6ac-bc3c25354d58","year":2019},"citing_paper":{"arxiv_id":"2505.18919","last_updated":"2025-05-25T00:56:36Z","snapshot_observed_at":"2026-08-11T12:18:06.573143Z","submitted_at":"2025-05-25T00:56:36Z","title":"Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:30.827250Z"},"links":{"cited_paper":"/paper/1908.05198","citing_paper":"/paper/2505.18919"},"observation_digest":"sha256:a8042f2c541f040731e7dd4b480a0478718285e45c668def835641ff2d5d6ef3","observation_id":"8939d586-50a7-4497-a0b1-d782dfd63b86","resolution":{"observed_at":"2026-08-07T14:28:41.795558Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.05198/citation-record","integrity":"/paper/1908.05198/integrity","json":"/paper/1908.05198/citation-record.json","paper":"/paper/1908.05198"},"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-14T13:34:40.102620Z","title":"A high-performance algorithm for identifying frequent items in data streams","venue":null,"work_id":"686e2943-fb2d-4186-bb13-ccc28c748d49","year":2017},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.798052Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:88bfef631b57db83ea15f3c5fa385d4e19fcf83d48fb02e0b4e5597e3d970756","observation_id":"0219eef6-32be-4976-a5cc-d020457d7c2d","resolution":{"observed_at":"2026-08-14T13:34:40.108130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.08544","last_updated":"2020-09-29T02:50:54Z","snapshot_observed_at":"2026-08-14T17:26:19.667090Z","submitted_at":"2019-01-24T18:07:59Z","title":"Learning Space Partitions for Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.08544","snapshot_observed_at":"2026-08-14T13:34:39.827849Z","title":"Learning sublinear-time indexing for nearest neighbor search","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.827849Z"},"links":{"cited_paper":"/paper/1901.08544","citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:fb68737a95fb8f9a4f0a8c8f171bb56912f88fdd90815d8b55fbcecfee108442","observation_id":"12069d4d-d526-4704-a76d-902b71db764e","resolution":{"observed_at":"2026-08-14T13:34:39.827849Z","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-14T13:34:40.053635Z","title":"The case for learned index structures","venue":null,"work_id":"9b1692ce-24e5-43d7-a2b8-21c5677f0191","year":2018},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.832101Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:f17098ae8b01d594d389300eabbb46450bcb060872b9bc95658b9d710af84e33","observation_id":"6d26fcaf-814c-4908-8190-9d8786bb42d8","resolution":{"observed_at":"2026-08-14T13:34:40.058553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:34:40.036851Z","title":"Heavy hitters via cluster-preserving clustering","venue":null,"work_id":"2dfa223c-2603-4c03-9007-32af300f2ec2","year":2016},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.841623Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:0c36f5128a7ec70cdbc729ebba8d37cb347fdd61c6adce3500d3bcde004ea28e","observation_id":"d352d30d-3fdf-4070-bc1b-764d341b607c","resolution":{"observed_at":"2026-08-14T13:34:40.042804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:34:39.988289Z","title":"Augmented sketch: Faster and more accurate stream processing","venue":null,"work_id":"e5fd1853-99a8-421c-b424-2ba3dcaebdd3","year":2016},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.849656Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:57d134977fd81f948f8365b5356ca4b34012b8d17d765670329780b97bb2ef2d","observation_id":"fdea342b-cc59-4591-b541-8ccc4a10f21a","resolution":{"observed_at":"2026-08-14T13:34:39.995667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04772","last_updated":"2021-11-03T05:30:14Z","snapshot_observed_at":"2026-08-16T08:19:32.607058Z","submitted_at":"2020-04-09T19:00:37Z","title":"Composable Sketches for Functions of Frequencies: Beyond the Worst Case","version":3},"cited_work":{"arxiv_id":"2004.04772","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.04772","snapshot_observed_at":"2026-08-14T13:34:39.939688Z","title":"Composable Sketches for Functions of Frequencies: Beyond the Worst Case","venue":"cs.DS","work_id":"c5b70a0d-e9ae-41b5-9226-e1f8d8588a04","year":2020},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.814980Z"},"links":{"cited_paper":"/paper/2004.04772","citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:779410722e5b86ace79ee6cf58d5c8974e1d7b9b853a26d17706e1c5981bc4a9","observation_id":"79962579-014d-4a35-b255-18632ec68ee1","resolution":{"observed_at":"2026-08-14T13:34:39.945080Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:34:40.068615Z","title":"Summarizing and mining skewed data streams","venue":null,"work_id":"5f6f7c91-3976-45a7-81cc-6c124c899ee2","year":2005},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.823150Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:ca74d0e96dd7e13b2f29a02c72f55e80e3b723ad6c3f5df1cb21d44563e349fe","observation_id":"61558f85-7868-46a1-839d-4dc6668c19c1","resolution":{"observed_at":"2026-08-14T13:34:40.074752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.02144","last_updated":"2023-04-06T09:30:19Z","snapshot_observed_at":"2026-08-16T09:38:39.227754Z","submitted_at":"2020-03-04T15:48:37Z","title":"Online metric algorithms with untrusted predictions","version":3},"cited_work":{"arxiv_id":"2003.02144","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.02144","snapshot_observed_at":"2026-08-14T13:34:39.966139Z","title":"Online metric algorithms with untrusted predictions","venue":"cs.DS","work_id":"04fcf805-b6ec-4848-bc45-0f993375f32e","year":2020},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.803752Z"},"links":{"cited_paper":"/paper/2003.02144","citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:ab09a87d9d1ca5b34c273fa9551bfd9a981baaa417ef201f20575f06db355128","observation_id":"0bccc2ca-a217-4430-b4be-2d0a1a7af6c0","resolution":{"observed_at":"2026-08-14T13:34:39.973479Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:34:40.020707Z","title":"A deep learning approach to structured signal recovery","venue":null,"work_id":"36fec3dc-1b40-40bc-ba7c-d938c067e069","year":2015},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.845752Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:f84bc345c1aae6e01e109f5543636918938d66275e78bd105e3e9d44b5f00ea4","observation_id":"28675595-8ec9-47c3-a1f4-e1d4a45a54d8","resolution":{"observed_at":"2026-08-14T13:34:40.026297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.00092","last_updated":"2019-03-12T20:29:57Z","snapshot_observed_at":"2026-08-14T17:09:17.054742Z","submitted_at":"2019-02-28T22:34:46Z","title":"Optimal Algorithms for Ski Rental with Soft Machine-Learned Predictions","version":2},"cited_work":{"arxiv_id":"1903.00092","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.00092","snapshot_observed_at":"2026-08-14T13:34:39.887740Z","title":"Optimal Algorithms for Ski Rental with Soft Machine-Learned Predictions","venue":"cs.LG","work_id":"87336d9f-3a2e-44bc-a80e-814aaccac366","year":2019},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.835655Z"},"links":{"cited_paper":"/paper/1903.00092","citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:7e1a208577a23a6493580579c76293137201facadbed4dffae029b2493077f41","observation_id":"e0b96445-ebb8-4eb8-a1e4-b36d2c1fbd91","resolution":{"observed_at":"2026-08-14T13:34:39.895162Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:34:40.086643Z","title":"Dispersion for data-driven algorithm design, online learning, and private optimization","venue":null,"work_id":"da4185f9-d830-40f8-ad14-fde738043e98","year":2018},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.809553Z"},"links":{"citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:58912011a360a5147aff2134e8f3d74139b63bc0c99c2a81bb0eeb3dada6694f","observation_id":"75e47f5b-7453-4638-9fc4-e220bab42ae8","resolution":{"observed_at":"2026-08-14T13:34:40.093056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01632","last_updated":"2020-04-16T06:09:11Z","snapshot_observed_at":"2026-07-06T08:34:44.992968Z","submitted_at":"2019-11-05T05:59:01Z","title":"Pandora's Box with Correlations: Learning and Approximation","version":2},"cited_work":{"arxiv_id":"1911.01632","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.01632","snapshot_observed_at":"2026-08-14T13:34:39.922361Z","title":"Pandora's Box with Correlations: Learning and Approximation","venue":"cs.DS","work_id":"54c12126-5fd2-43d7-8fa1-cab665bbb7d5","year":2019},"citing_paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-14T13:34:39.819243Z"},"links":{"cited_paper":"/paper/1911.01632","citing_paper":"/paper/1908.05198"},"observation_digest":"sha256:0f069c80caaa244a3e8e646bd4c8e549d809f5b888a7e4582ddd836d7c08bb3c","observation_id":"d2fba67b-28e6-4b67-b449-55ca7e8ee725","resolution":{"observed_at":"2026-08-14T13:34:39.926964Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05198","last_updated":"2020-08-11T15:58:29Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T20:38:41.405838Z","submitted_at":"2019-08-14T16:17:05Z","title":"(Learned) Frequency Estimation Algorithms under Zipfian Distribution"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":3,"verified_fuzzy":7},"total_outbound_references":12},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 2 inbound Pith citation observations for arXiv:1908.05198."}