{"as_of":"2026-08-17T07:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:630567cae2430becde2711c3d9c7ba294282e3c1818fc1149adf0beba435ee87","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:42:08.823290Z","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-14T05:51:37.891780Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.04777","snapshot_observed_at":"2026-08-14T13:42:08.823290Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04810","last_updated":"2019-08-13T18:21:04Z","snapshot_observed_at":"2026-08-16T15:33:14.071162Z","submitted_at":"2019-08-13T18:21:04Z","title":"On Occupancy Moments and Bloom Filter Efficiency","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:42:08.823290Z"},"links":{"cited_paper":"/paper/1804.04777","citing_paper":"/paper/1908.04810"},"observation_digest":"sha256:1ce1bbd33ff99c426afc038be92a56bd8a98248d602ff14f9d8a15f803ff1d47","observation_id":"d32ef8b6-d8bb-43fd-a3fe-b79d29b18216","resolution":{"observed_at":"2026-08-14T13:42:08.823290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.04777","snapshot_observed_at":"2026-08-14T10:44:05.036825Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10644","last_updated":"2019-08-28T11:13:03Z","snapshot_observed_at":"2026-08-16T16:50:13.651518Z","submitted_at":"2019-08-28T11:13:03Z","title":"Bloom filter variants for multiple sets: a comparative assessment","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:44:05.036825Z"},"links":{"cited_paper":"/paper/1804.04777","citing_paper":"/paper/1908.10644"},"observation_digest":"sha256:f5787ce8269204957ddd14cb8358d0e40b5c7bffb3fd0400b05d6b60341a6167","observation_id":"790e69b3-98c5-4bd6-8a1e-6592760af536","resolution":{"observed_at":"2026-08-14T10:44:05.036825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:fe3cfc4e336754b5c6deecbfb14592d1a5c4abdabbdc3ce39e11521fff9f0015","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1804.04777/citation-record","integrity":"/paper/1804.04777/integrity","json":"/paper/1804.04777/citation-record.json","paper":"/paper/1804.04777"},"outbound":[],"paper":{"arxiv_id":"1804.04777","last_updated":"2019-01-07T01:28:14Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T13:22:24.289985Z","submitted_at":"2018-04-13T02:57:19Z","title":"Optimizing Bloom Filter: Challenges, Solutions, and Comparisons"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1804.04777."}