{"as_of":"2026-08-21T06:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b28a4345cc95aa8f14389c5fc7bfabf6e17980099c9fb98721b4e29e211d8ec","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-10T22:31:07.591332Z","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-10T22:31:07.661622Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.04602","last_updated":"2018-08-14T09:57:43Z","snapshot_observed_at":"2026-08-14T18:41:26.043766Z","submitted_at":"2018-08-14T09:57:43Z","title":"Hashing with Linear Probing and Referential Integrity","version":1},"cited_work":{"arxiv_id":"1808.04602","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.04602","snapshot_observed_at":"2026-08-10T22:31:07.661622Z","title":"Hashing with Linear Probing and Referential Integrity","venue":"cs.DS","work_id":"21fd254d-40a9-4be1-8ef6-61151439b047","year":2018},"citing_paper":{"arxiv_id":"2501.02305","last_updated":"2025-02-28T15:53:43Z","snapshot_observed_at":"2026-08-11T14:32:54.421501Z","submitted_at":"2025-01-04T14:57:12Z","title":"Optimal Bounds for Open Addressing Without Reordering","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.591332Z"},"links":{"cited_paper":"/paper/1808.04602","citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:5f3ef629441bfbda36a916eee4d92ac0c5e1782f37c524a02caf63d562fa663f","observation_id":"ed00ab2f-1b5e-4ea9-a189-7e8c65725bb9","resolution":{"observed_at":"2026-08-10T22:31:07.668915Z","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":{"arxiv_id":"1808.04602","last_updated":"2018-08-14T09:57:43Z","snapshot_observed_at":"2026-08-14T18:41:26.043766Z","submitted_at":"2018-08-14T09:57:43Z","title":"Hashing with Linear Probing and Referential Integrity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.04602","snapshot_observed_at":"2026-08-01T18:01:50.571358Z","title":"Hashing with linear probing and referential integrity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17494","last_updated":"2026-07-20T02:53:18Z","snapshot_observed_at":"2026-08-11T07:08:42.533000Z","submitted_at":"2026-07-20T02:53:18Z","title":"Linear Probing with Non-Greedy Insertions","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.571358Z"},"links":{"cited_paper":"/paper/1808.04602","citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:f23a6e0e06fb5392cdbf303d889dad33b14d8c1346860b035d677fd135ca9ac2","observation_id":"be32888b-fd66-485f-9776-6d966df22831","resolution":{"observed_at":"2026-08-01T18:01:50.571358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1808.04602/citation-record","integrity":"/paper/1808.04602/integrity","json":"/paper/1808.04602/citation-record.json","paper":"/paper/1808.04602"},"outbound":[],"paper":{"arxiv_id":"1808.04602","last_updated":"2018-08-14T09:57:43Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T18:41:26.043766Z","submitted_at":"2018-08-14T09:57:43Z","title":"Hashing with Linear Probing and Referential Integrity"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1808.04602."}