{"as_of":"2026-08-20T21:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b2827c66bd74567552eb2e79301f09bdbea93263ddbbe2ee798f0fe76ec1db4b","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:31:07.609526Z","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-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-03T01:31:45.965915Z","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":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02305","snapshot_observed_at":"2026-08-01T21:18:15.810931Z","title":"Optimal Bounds for Open Addressing Without Reordering , booktitle =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16390","last_updated":"2026-07-17T17:58:13Z","snapshot_observed_at":"2026-08-17T07:55:15.337286Z","submitted_at":"2026-07-17T17:58:13Z","title":"Locality in Open Addressing Hash Tables","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T21:18:15.810931Z"},"links":{"cited_paper":"/paper/2501.02305","citing_paper":"/paper/2607.16390"},"observation_digest":"sha256:bbcad64aa446a85cffd3c42d9cc4ef6af60ea2c2b940138156cb43a964af76a1","observation_id":"4bf871e1-8ff6-4d38-bf75-97cc2eafdb47","resolution":{"observed_at":"2026-08-01T21:18:15.810931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.02305","snapshot_observed_at":"2026-08-03T01:31:45.965915Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:45.965915Z"},"links":{"cited_paper":"/paper/2501.02305","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:8ab1b0b1c3379c9e1b99b68a6323bc821c2c3782a6e19f35e301963f2b703ad9","observation_id":"beb3d970-567f-4356-a4b3-8e057ca37624","resolution":{"observed_at":"2026-08-03T01:31:45.965915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.02305/citation-record","integrity":"/paper/2501.02305/integrity","json":"/paper/2501.02305/citation-record.json","paper":"/paper/2501.02305"},"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-10T22:31:08.220665Z","title":"There is no fast single hashing algorithm","venue":null,"work_id":"2a6bb2bb-bc80-4a16-8575-aef440552fe7","year":1978},"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":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.500155Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:3ae4bde418c2932ef72e49cb426d71e4842be134b8a4d571cc11fa2ef82e3ecf","observation_id":"37dd5441-79d4-4d8f-91fb-c63bf02316c9","resolution":{"observed_at":"2026-08-10T22:31:08.226713Z","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-10T22:31:08.204248Z","title":"Iceberg hashing: Optimizing many hash-table c riteria at once","venue":null,"work_id":"a260d203-f3b5-4e9a-b99d-a9b6cdbd3ff7","year":2023},"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":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.506737Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:afd78e1fb7af9789a33bd24f5a2d10c7cfc29716411fdda138bbc2b039999086","observation_id":"3f500f33-1ae0-4a0c-9378-894db60156e7","resolution":{"observed_at":"2026-08-10T22:31:08.209600Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:31:07.512874Z","title":"Bender, Alex Conway, Mart ´ ın Farach-Colton, William Kuszmaul, and Guido Tagliavini","venue":null,"work_id":null,"year":2023},"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":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.512874Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:7160731e73f93ab7c46e102ff6f453a16d8ac0de7785611655d74cbfbb2b2c8f","observation_id":"9ecac62f-77c3-4b13-b08a-8460e76dfd04","resolution":{"observed_at":"2026-08-10T22:31:07.512874Z","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-10T22:31:08.187638Z","title":"Bender, Martin Farach-Colton, Simai He, Brad ley C","venue":null,"work_id":"fcab5f0c-5e81-4a0e-a2d1-6c32a103e861","year":2005},"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":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.518277Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:bad459bdd88ed3ae0d5b7a06f480dab226d94c098661f96f853623464de6e1cb","observation_id":"03b8a638-040a-47ad-a962-1a1d559bdbb5","resolution":{"observed_at":"2026-08-10T22:31:08.192989Z","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":"5305.33541","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:31:07.928076Z","title":"Balanced allocations: the heavily loaded case","venue":null,"work_id":"6fdbcc24-f91a-4acb-b924-47c67848a721","year":2000},"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":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.523871Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:f7d2096ccf787a222a07403adc11cadbdb19a2a59dbb111c71717eb6d96c562a","observation_id":"5d48fd57-12d0-4c0d-866c-aaa93c185bf6","resolution":{"observed_at":"2026-08-10T22:31:07.937901Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-10T22:31:08.172558Z","title":"Reducing the retrieval time of scatter s torage techniques","venue":null,"work_id":"69a6bac0-0187-45d8-a70c-09fc6e12851e","year":1973},"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":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.529126Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:6805a18ec98e69411e15ef13927caeaa270d0df88b57b8ed6ad0cf331f1d297f","observation_id":"a87fcd9e-0ecd-4e82-841e-3ce26a18d48d","resolution":{"observed_at":"2026-08-10T22:31:08.177530Z","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-10T22:31:08.156442Z","title":"Multilevel adaptive ha shing","venue":null,"work_id":"46fb8e6b-cb11-457d-b8b6-013639306e5f","year":1990},"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":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.535134Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:875a4a16db3cc0539db0ab87d80a61469d80cade937fa470aa7e12bac77c2c3c","observation_id":"be7b2e46-c4ce-4254-a8a1-ab8c92f12b76","resolution":{"observed_at":"2026-08-10T22:31:08.162037Z","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-10T22:31:08.135591Z","title":"External double hashing with choice","venue":null,"work_id":"81c788af-0e0b-4547-80a8-4501a1eefdc4","year":2005},"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":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.540256Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:b13a083e56be86508d034020dfce38d533e2d1543ed067b4a7177385b5bf1939","observation_id":"90c3f3a0-f690-442c-956e-70d0a4f69073","resolution":{"observed_at":"2026-08-10T22:31:08.142362Z","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-10T22:31:08.119187Z","title":"Space efficient hash tables with worst case constant access time","venue":null,"work_id":"a1268e01-0942-40a7-874c-033952c1c70e","year":2005},"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":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.545394Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:c6e43d5becf0ae0e2180fb1153e613641d72a8eebb712c5d5134ae543a40de7b","observation_id":"1651c86f-1e26-4550-9c12-294fc42f78e7","resolution":{"observed_at":"2026-08-10T22:31:08.124253Z","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-10T22:31:08.104068Z","title":"Efficient ordering of hash tables","venue":null,"work_id":"78f2d615-3f8e-4527-8c18-3026307f11a7","year":1979},"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":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.550436Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:28c6528a9117996f25b5d958ee045aa6e646e1182a3fcc5c2984ac6e050a8f51","observation_id":"9cdc0fdf-7b48-4dc2-a503-2e4340c80c8e","resolution":{"observed_at":"2026-08-10T22:31:08.109170Z","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-10T22:31:08.087789Z","title":"Notes on “open” addressing","venue":null,"work_id":"9180e8a8-d8c6-4c9f-b853-e72e4320e92a","year":1963},"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":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.555717Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:4583d1bd7191174c217cfa613a67ae6b2b6b2ed7f9c1570c0742e188c34b17d9","observation_id":"03a9f995-f12c-402c-ae56-2bda55321284","resolution":{"observed_at":"2026-08-10T22:31:08.092958Z","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-10T22:31:08.071918Z","title":"Computer science and its relation to mat hematics","venue":null,"work_id":"dcddd2d1-9350-40fb-81e9-ec7ac5a41f52","year":1974},"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":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.560889Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:275b5636577c1e3935f6045c5531d96c984bafeed9b854fe7fcfa13e9b92223e","observation_id":"a86cff96-885d-4166-b664-5a8998eb2102","resolution":{"observed_at":"2026-08-10T22:31:08.077005Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:31:07.566014Z","title":"The Art of Computer Programming, Volume III: Sorting and Searchin g","venue":null,"work_id":null,"year":1998},"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":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.566014Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:f65483ebb66cd5961277f04bf08ff41532a73955df7f9a56029fd9e9a8cd12e0","observation_id":"d1aed1bc-2977-47f3-b127-485eb2abfc9a","resolution":{"observed_at":"2026-08-10T22:31:07.566014Z","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-10T22:31:08.055781Z","title":"More analysis of double hashing","venue":null,"work_id":"60ebda00-9fcb-4ab1-ba81-5e5db322f239","year":1988},"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":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.571143Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:4b4b015a18088918ad364d5395a292f57d98dab3838f9dffa4ddabae0aecb1cd","observation_id":"513e73ef-2f42-45cd-a598-4b76afc96fa0","resolution":{"observed_at":"2026-08-10T22:31:08.061148Z","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-10T22:31:08.038767Z","title":"Double hashing wit h multiple passbits","venue":null,"work_id":"1081061d-e667-4c4e-9aae-97db20f3f213","year":2003},"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":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.576069Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:d6453755512f439fd5cbf7682b0b3ec3c5c0e640bc9dd95824ff93094db48769","observation_id":"b29a2b25-bc6b-44af-a55a-0d4566c8794e","resolution":{"observed_at":"2026-08-10T22:31:08.044160Z","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-10T22:31:08.020643Z","title":"Analysis and design of algorithms: double hashing and paral lel graph searching","venue":null,"work_id":"8e64956a-a93d-4eb0-9750-ccee7d32c1d4","year":1990},"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":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.581660Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:3b3929377cb8460dca57930d42ba2150342d07e43a956dc9b6e0000f4765be3c","observation_id":"6b34e748-4a1d-433a-a0b4-e628d1a929ef","resolution":{"observed_at":"2026-08-10T22:31:08.026371Z","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-10T22:31:08.002260Z","title":"Techniques for collision re solution in hash tables with open addressing","venue":null,"work_id":"19642ac1-dc4f-456c-8a26-bb7b26b49c34","year":1986},"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":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.586372Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:090b6bc9d8dae9f4d20d3bc7031fa51e2f133e32d4c5889f90e9c96add6b7150","observation_id":"86305575-f73f-49ba-8352-0b0cffc6e1df","resolution":{"observed_at":"2026-08-10T22:31:08.008372Z","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":"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:31:07.984764Z","title":"A note on the efficiency of hashing functio ns","venue":null,"work_id":"97df8df8-fbde-4cb9-b924-4295dbf68eba","year":1972},"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":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.596800Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:f2bb5f7f71199e74ac4769d4bc4787fc60f128c838e92c4ddca9b37577f0e4c5","observation_id":"bf5f2931-ba87-45b1-a4e4-36e55d80c78c","resolution":{"observed_at":"2026-08-10T22:31:07.990911Z","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-10T22:31:07.968167Z","title":"How asymmetry helps load balancing","venue":null,"work_id":"95cdbc27-91ef-4204-a4a1-8999574c76f4","year":2003},"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":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.604480Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:f766970858b397489bf32319073e479d043718bee06e2801af9e30162a43f640","observation_id":"692866a7-0526-42d4-9903-50c7e7d91af0","resolution":{"observed_at":"2026-08-10T22:31:07.972874Z","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-10T22:31:07.951032Z","title":"Uniform hashing is optimal","venue":null,"work_id":"6e932847-1ed1-4d4f-a884-9756ebc86c1f","year":1985},"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":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:31:07.609526Z"},"links":{"citing_paper":"/paper/2501.02305"},"observation_digest":"sha256:a278ed2ed3e30203d44e2f5bca56a913e137ec0c4452e97f0b88591d52a9c61e","observation_id":"1a309487-399e-44d7-8edc-b64712e2f806","resolution":{"observed_at":"2026-08-10T22:31:07.956166Z","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":"2501.02305","last_updated":"2025-02-28T15:53:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T14:32:54.421501Z","submitted_at":"2025-01-04T14:57:12Z","title":"Optimal Bounds for Open Addressing Without Reordering"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":21},"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 21 of 21 outbound references and 2 inbound Pith citation observations for arXiv:2501.02305."}