{"as_of":"2026-08-21T09:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b0c1739c8df7fc08725075e818630a86e70deffa85d333cfe79046a98938875","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T18:01:50.700364Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.17494/citation-record","integrity":"/paper/2607.17494/integrity","json":"/paper/2607.17494/citation-record.json","paper":"/paper/2607.17494"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T18:01:49.530337Z","title":"https://abseil.io/","venue":null,"work_id":null,"year":2020},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.530337Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:69b788db5febb4270f94790d8c7e04b2debff5f8123d3e2c9d4eb612fca06b2b","observation_id":"e4327529-6fa5-406c-931d-f290f34c08ce","resolution":{"observed_at":"2026-08-01T18:01:49.530337Z","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-01T18:01:49.578718Z","title":"Ordered hash tables","venue":null,"work_id":null,"year":1974},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.578718Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:434bfdfaffe1d5a184ef8eddd9d19d486fbe33ed4cbba26dd56321072372bad5","observation_id":"af5bf58e-1b28-4b7e-8941-6e3ce527d577","resolution":{"observed_at":"2026-08-01T18:01:49.578718Z","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-01T18:01:49.654294Z","title":"Bender, Alex Conway, Martin Farach - Colton, William Kuszmaul, and Guido Tagliavini","venue":null,"work_id":null,"year":2023},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.654294Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:122b811cbba48672892c888c28fa9f568100d71b7039ac9391efa901bf62550f","observation_id":"8955ef7e-ebab-4f3f-b94c-773718010f80","resolution":{"observed_at":"2026-08-01T18:01:49.654294Z","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-01T18:01:49.708164Z","title":"Bender, Bradley C","venue":null,"work_id":null,"year":2021},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.708164Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:288b40662adf5ce3f08dbfa2c0e34bdd44c703207b3f6a74084cc02f3b986f0a","observation_id":"81926e0a-7c76-40c3-a750-27bd554b98cf","resolution":{"observed_at":"2026-08-01T18:01:49.708164Z","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-01T18:01:49.748670Z","title":"Robin hood hashing","venue":null,"work_id":null,"year":1986},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.748670Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:c23733eb97fee1780e24b11aa329213e6aa6102d246380edd167f8787d0ff59d","observation_id":"3d8f3d93-cb3d-4649-9918-2a02b0603696","resolution":{"observed_at":"2026-08-01T18:01:49.748670Z","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-01T18:01:49.801623Z","title":"Ian Munro","venue":null,"work_id":null,"year":1985},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.801623Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:d593d4f9fc7dc7f01ef339132dcbc2399df8a57d8a2ceb36782b9bcfa62c3ba1","observation_id":"25453e10-ff9f-45a9-8272-e5199ffc3f3f","resolution":{"observed_at":"2026-08-01T18:01:49.801623Z","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-01T18:01:49.850736Z","title":"https://en.cppreference.com/w/cpp/container/unordered_map","venue":null,"work_id":null,"year":2020},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.850736Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:e5323cf663e6af511e9d146f582898d49c436096332d065cabbad3860a4a910a","observation_id":"8e55c767-4876-40c4-b014-a2debf363920","resolution":{"observed_at":"2026-08-01T18:01:49.850736Z","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-01T18:01:49.925346Z","title":"https://github.com/gcc-mirror/gcc/blob/master/libstdc\\ Accessed: 2020-11-06","venue":null,"work_id":null,"year":2020},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.925346Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:412245296a38f16f07cb0e29be6d9ed82f8d1336795c6dc3aee9215f95449f85","observation_id":"3fe164dd-3f54-44cc-827a-2d1fd853e652","resolution":{"observed_at":"2026-08-01T18:01:49.925346Z","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-01T18:01:49.986767Z","title":"De dictionariis dynamicis pauco spatio utentibus (lat","venue":null,"work_id":null,"year":2006},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:49.986767Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:fbb373ed271295ec6ad5e1b7cca68c59eda73333908a501eb4cf51e8a7df76b0","observation_id":"65de9d68-64d7-44de-85e5-9cc4aa27e037","resolution":{"observed_at":"2026-08-01T18:01:49.986767Z","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-01T18:01:50.045299Z","title":"https://engineering.fb.com/2019/04/25/developer-tools/f14/","venue":null,"work_id":null,"year":2019},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.045299Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:b6d4413e6befc05974fb7c7f001bb024c9fb6d5c10cb5fd65595189ce3d92713","observation_id":"8f999a21-d2af-4e3a-8d86-d538685cfcf3","resolution":{"observed_at":"2026-08-01T18:01:50.045299Z","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-01T18:01:50.146999Z","title":"Optimal bounds for open addressing without reordering","venue":null,"work_id":null,"year":2024},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.146999Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:062b3fa895d61db90837ebf009d9635980b0e47ef1866b023c3629a320fae9ba","observation_id":"bf68aa99-2f78-4d10-8a9d-47f2cb1b3285","resolution":{"observed_at":"2026-08-01T18:01:50.146999Z","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-01T18:01:50.304527Z","title":"Greedy open addressing revisited: Beyond yao’s lower bound","venue":null,"work_id":null,"year":2026},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.304527Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:e0233975eea9a6c639867acc16d922e86b77a1f5f4d6b14f82e99169f4a15b3e","observation_id":"7925e965-9b72-4339-a253-e3d4b0023a8c","resolution":{"observed_at":"2026-08-01T18:01:50.304527Z","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-01T18:01:50.357662Z","title":"Notes on ``open'' addressing, 1963","venue":null,"work_id":null,"year":1963},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.357662Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:85b58510f61b9b6fa44a070bb770b51f07b715964e76b440f867fa5671946cb3","observation_id":"1ca60cca-4cb2-4857-bd65-a65ec7f69348","resolution":{"observed_at":"2026-08-01T18:01:50.357662Z","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-01T18:01:50.398846Z","title":"Scalable Hash Tables","venue":null,"work_id":null,"year":2021},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.398846Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:7938fd94465bfb8ab64e4c87e4a620cd64d97883b356d066a26757a9237ca2cf","observation_id":"f41b6ddc-9f64-4272-9168-923f10a5c755","resolution":{"observed_at":"2026-08-01T18:01:50.398846Z","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-01T18:01:50.449754Z","title":"Warpspeed: A high-performance library for concurrent gpu hash tables","venue":null,"work_id":null,"year":2026},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.449754Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:46abc94c889ae2c5ae12dd9f87f562c287f9ad7d7dec227651cf6dc35b184804","observation_id":"48266e78-2a2a-4112-a218-6608ad8998ad","resolution":{"observed_at":"2026-08-01T18:01:50.449754Z","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-01T18:01:50.494769Z","title":"Bender, Alex Conway, Martin Farach - Colton, William Kuszmaul, Guido Tagliavini, and Rob Johnson","venue":null,"work_id":null,"year":2023},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.494769Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:8f52ac16bb6b70a879da67371ac283a9192b71251e45537c966afd7e89b2737f","observation_id":"bf615c4c-decb-4e42-b7b6-0a4442f96ec9","resolution":{"observed_at":"2026-08-01T18:01:50.494769Z","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-01T18:01:50.532997Z","title":"A seven-dimensional analysis of hashing methods and its implications on query processing","venue":null,"work_id":null,"year":2015},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.532997Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:af3cf42ed90328f9e7dee38e64eb38f193b384a3e470cd32d39de7e7ddac6e64","observation_id":"9178e5d9-760f-40b3-bffe-834de2fcf435","resolution":{"observed_at":"2026-08-01T18:01:50.532997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T18:01:50.645526Z","title":"Uniform hashing is optimal","venue":null,"work_id":null,"year":1985},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.645526Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:d46ffee250a702359458d81df116abb55968a4c42e6350ce300d7ca07a592458","observation_id":"d994c3e9-ca19-4110-b9b7-13f7acd9eb67","resolution":{"observed_at":"2026-08-01T18:01:50.645526Z","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-01T18:01:50.700364Z","title":"Locality in open addressing hash tables","venue":null,"work_id":null,"year":null},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-01T18:01:50.700364Z"},"links":{"citing_paper":"/paper/2607.17494"},"observation_digest":"sha256:f7fb83ba61e2a10e4005523d4e789c9fc69575aaf17bb9ca2c32bdd345ffe037","observation_id":"879a0cf9-6b23-40dd-8bd0-e95035a7c8e0","resolution":{"observed_at":"2026-08-01T18:01:50.700364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17494","last_updated":"2026-07-20T02:53:18Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T07:08:42.533000Z","submitted_at":"2026-07-20T02:53:18Z","title":"Linear Probing with Non-Greedy Insertions"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.17494."}