{"as_of":"2026-08-16T18:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c0cbc138d582535ef60c4e1fa574f84733a8ee9c1343c6060547f8e665df002","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:40:05.955617Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.08762/citation-record","integrity":"/paper/1908.08762/integrity","json":"/paper/1908.08762/citation-record.json","paper":"/paper/1908.08762"},"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-14T11:40:06.556203Z","title":"Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web","venue":null,"work_id":"04507554-d028-44d6-97a0-b0d88eb4adc5","year":1997},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.779695Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:e0b644bf96f99f09b42fd05ce002e00af0220ebf4b878d47e020f051212d3d01","observation_id":"edd14ed7-4863-4943-9b76-fda80fbe1d46","resolution":{"observed_at":"2026-08-14T11:40:06.561608Z","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-14T11:40:06.540377Z","title":"Consistent hashing with bounded loads","venue":null,"work_id":"e2dcb041-2c1f-4184-95f9-ebf940068a8e","year":2018},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.785471Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:b38bb8348c7060b35ecd44e908873f50ffc02e7079ef1ee16a227d3986026f23","observation_id":"ca431924-0ed4-475f-aa3b-2f891959780b","resolution":{"observed_at":"2026-08-14T11:40:06.545560Z","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-14T11:40:06.523478Z","title":"Chord: a scalable peer-to-peer lookup protocol for internet applications","venue":null,"work_id":"1eed19a9-be62-42cd-9919-4cecfe1cea82","year":2001},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.790539Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:13b6bfce6dd2e7045100f1605d3239d7b5b47b46889afbf0b156fab08fa09827","observation_id":"f618f95e-c936-49c0-8358-9237d042b165","resolution":{"observed_at":"2026-08-14T11:40:06.529242Z","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-14T11:40:06.506670Z","title":"Chord: a scalable peer-to-peer lookup protocol for internet applications","venue":null,"work_id":"a93cb635-d40a-4ffd-bbd6-072954b49fcd","year":2003},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.795178Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:9520d9dfbec822c0cc5c034c17382617c3cb0953629d146da5f630fb29482e98","observation_id":"46d79d85-3644-4bf9-a9f9-9344010a61f1","resolution":{"observed_at":"2026-08-14T11:40:06.512066Z","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-14T11:40:06.490405Z","title":"Semantics of caching with spoca: A stateless, proportional, optimally-consistent addressing algorithm","venue":null,"work_id":"46807efd-1ae8-4a30-ba71-690544ae5bc6","year":2011},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.800339Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:1d5b82dca3cbdec07cf37583750481bac4cefe99dd7869c7b802eb7de7735fab","observation_id":"9f924426-6b1f-4910-b712-ed6564c0ad0d","resolution":{"observed_at":"2026-08-14T11:40:06.495770Z","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-14T11:40:06.474674Z","title":"Spirakis","venue":null,"work_id":"4a6edff4-8923-42b0-8759-7442fb2626c9","year":2005},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.805566Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:2d0a2cba22614e0d3251ffb72475daafb2e8cc4f734d6ebf8e3ac9d4e4f5d721","observation_id":"528c975a-4131-4c1e-9967-5192f940ca17","resolution":{"observed_at":"2026-08-14T11:40:06.479809Z","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-14T11:40:06.458191Z","title":"Linear probing with constant independence","venue":null,"work_id":"3d3c5802-1a73-48a7-99aa-a94d70ad0c64","year":2009},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.810942Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:6be2d984300cd38ad3bb2f5d7137d620585e8af8d52e5c2504679e8b35b9a517","observation_id":"8c59ebb0-0a4e-47dc-8316-000bd19ba3c1","resolution":{"observed_at":"2026-08-14T11:40:06.463563Z","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-14T11:40:06.441218Z","title":"Cuckoo hashing","venue":null,"work_id":"99134166-a446-4182-94a4-89e5c3cc1592","year":2001},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.815719Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:53919666f1e035e08fbe5d1346d660a2b08d933503231f89cea948673ce40e57","observation_id":"bbfbf734-9d2c-481d-9b35-a29eca8743f6","resolution":{"observed_at":"2026-08-14T11:40:06.446559Z","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-14T11:40:06.425099Z","title":"Cuckoo hashing","venue":null,"work_id":"1a79af34-8531-4e45-9ea2-abf08d51f50b","year":2004},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.820500Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:42698439662c19c42190e7f0d9d5ea0684d2274a79fa7dc11dc988b38642024f","observation_id":"7be05548-27e3-4f0c-9dd8-2dfd78e60baa","resolution":{"observed_at":"2026-08-14T11:40:06.429929Z","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-14T11:40:06.409175Z","title":"Cache in-memory in asp.net core","venue":null,"work_id":"b42f9b37-41da-401d-ae3b-78a9153501c7","year":2019},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.825242Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:7ac0cc2fbf5a696167424604b0292f510d152fdff5c7b1326f2d57d4c414107e","observation_id":"8bc10d9c-ee11-4b3d-acba-a91ac7828c4a","resolution":{"observed_at":"2026-08-14T11:40:06.414011Z","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-14T11:40:06.393802Z","title":"Caching best practices","venue":null,"work_id":"ed05761b-c9f5-4d2e-9a65-0f1d800731aa","year":2017},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.830066Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:3d039a93f9782ccd5ac9778610e49962d5560b6c52243e44fdd26db15ef83c55","observation_id":"2c26342b-290d-4b3f-b7f3-b6a49e626743","resolution":{"observed_at":"2026-08-14T11:40:06.398752Z","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-14T11:40:06.378021Z","title":"Mozilla docs, 2020","venue":null,"work_id":"65c54be5-9a8c-4c07-a6d6-7b39006b9a8f","year":2020},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.834736Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:2bc2ee57ff513073c98fa52fdbdbb77346c3042a2aeac73e1d4997ab97d9856c","observation_id":"db96b0a4-d7a6-4eaa-818a-006357e57406","resolution":{"observed_at":"2026-08-14T11:40:06.382874Z","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-14T11:40:06.362339Z","title":"How discord scaled elixir to 5,000,000 concurrent users","venue":null,"work_id":"abc70192-668d-4c07-9dbf-ceef979b693f","year":2017},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.839694Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:29e7f1dc1c9eb24b331eeac0d8830de7eb3888a51e0c824de8a109384f8bc3a8","observation_id":"63c8e399-543b-4307-8aae-416aee407aa3","resolution":{"observed_at":"2026-08-14T11:40:06.367393Z","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-14T11:40:06.346136Z","title":"Dynamo: Amazon’s highly available key-value store","venue":null,"work_id":"8ce9e2c5-f972-4aa2-9bed-b5abaa8f76b6","year":2007},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.844381Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:7fcf9c6fe1c7a2acbae13bd1c13e73838ecf23302c0706d4024c025bebaaf665","observation_id":"a8ce5fca-fca6-4b92-aab2-7835bc160323","resolution":{"observed_at":"2026-08-14T11:40:06.351575Z","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-14T11:40:06.330059Z","title":"Cassandra: a decentralized structured storage system","venue":null,"work_id":"79c5a96e-5a5a-43c4-8203-57dfa229649c","year":2010},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.849325Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:916dad04e244cb8a89f600308ba7f0c7600e0136db72e0a585431f59533b7328","observation_id":"f8905653-5d0b-463c-b9fc-58bafc2fbda9","resolution":{"observed_at":"2026-08-14T11:40:06.335088Z","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-14T11:40:06.314218Z","title":"Consistent hashing with bounded loads","venue":null,"work_id":"7bb104a6-fde9-40f4-9bc9-1b6bb5be8f06","year":2017},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.854432Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:77e912f7623664e29caa964e16e0278ac90ec5666b143dba17cd1f9ab241410d","observation_id":"9499e46f-46a1-4a31-b6af-edb38bc9d415","resolution":{"observed_at":"2026-08-14T11:40:06.319264Z","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-14T11:40:06.298280Z","title":"Improving load balancing with a new consistent-hashing algorithm","venue":null,"work_id":"c54514a2-fd79-425f-95f8-3f312c38df91","year":2016},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.859542Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:24435df604a1aa33002daad120e8de4c8c4861db2f9e13a1d1ff0619b1042f37","observation_id":"4955980b-ba02-4b6b-a832-1e28ae5cb620","resolution":{"observed_at":"2026-08-14T11:40:06.303212Z","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-14T11:40:06.282734Z","title":"Information retrieval - algorithms and heuristics, second edition, volume 15 of the kluwer international series on information retrieval","venue":null,"work_id":"f8f2d484-b7f8-4c2d-b576-57fbdf8026af","year":2004},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.864379Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:88aae1873a401306339539f934bc10594b00225d84cc329c0a65d39c1a50fb5f","observation_id":"13060cd2-dc4a-4af4-b191-72c881bb1d1e","resolution":{"observed_at":"2026-08-14T11:40:06.287833Z","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-14T11:40:06.267193Z","title":"Principles of distributed database systems, third edition","venue":null,"work_id":"83889ec1-3749-43b6-b136-f933bc86b7b5","year":2011},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.869697Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:8ebad185aa80be93af7c36c2571c34819f1f4db0e9d5aa9459851dcb9ed0c848","observation_id":"51a24efc-4f43-4d3d-8065-6178b46d3076","resolution":{"observed_at":"2026-08-14T11:40:06.272261Z","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-14T11:40:06.251416Z","title":"Redis in action","venue":null,"work_id":"52053e78-decd-4835-aa81-ee3ab170b30c","year":2013},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.874357Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:1eafe80d4ccdf35448db29533209ab7d094436b35fb4d53df6fbf5319930be7f","observation_id":"03972df3-d26f-426f-8da3-e0939ac10093","resolution":{"observed_at":"2026-08-14T11:40:06.256303Z","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-14T11:40:06.236348Z","title":"Scaling memcache at facebook","venue":null,"work_id":"3e5299fa-f977-4064-abb3-53e819ffa715","year":2013},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.879362Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:0e6cc08164efebd185c252805a7373b36150de0cd410f9cbca039ebed5c8e295","observation_id":"bca498de-4d34-448f-b7ab-d3e2004c7905","resolution":{"observed_at":"2026-08-14T11:40:06.241179Z","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-14T11:40:06.220745Z","title":"Web caching with consistent hashing.Computer Networks, 1999","venue":null,"work_id":"1040e0d4-bab1-4863-a9dd-01f824a5650e","year":1999},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.884276Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:3cb8045b3b60f7677e8a949c4de4e4fc02b8ba8e5ed2ca1dbe64eee03c633b52","observation_id":"92d2e8ec-6604-4157-944c-2af9b267f715","resolution":{"observed_at":"2026-08-14T11:40:06.225934Z","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-14T11:40:06.205372Z","title":"Load balancing using consistent hashing: A real challenge for large scale distributed web crawlers","venue":null,"work_id":"47bf8da3-29cc-4237-b398-2e26e526eb4f","year":2009},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.889420Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:a623eb4e98784bfc76cf89ef7117edc64f7020d027c518eb2137dd1ed21ee203","observation_id":"212315ee-444c-465c-9da3-a8e4f4bac222","resolution":{"observed_at":"2026-08-14T11:40:06.210393Z","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-14T11:40:06.189619Z","title":"Load-balancing performance of consistent hashing: Asymp- totic analysis of random node join","venue":null,"work_id":"c7c2136c-788b-4226-8106-2d45d80f16f5","year":2007},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.894230Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:dbe994e3e3d6fa47d95b9d0e6474cacecde2e8d301688aecbcf70d4598091e5a","observation_id":"a992e079-6d35-4434-9258-868d6d564bb6","resolution":{"observed_at":"2026-08-14T11:40:06.194802Z","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-14T11:40:06.173431Z","title":"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems","venue":null,"work_id":"8be53913-66aa-4b7f-8d49-56ce57166f54","year":2001},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.898887Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:077a614acae59293401ba4afef1f5c631726e1a04c287fdc9ef91b3b57e3d752","observation_id":"1d9f6332-c823-4203-bd73-d79844f717d7","resolution":{"observed_at":"2026-08-14T11:40:06.178736Z","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-14T11:40:06.156454Z","title":"Scribe: A large- scale and decentralized application-level multicast infrastructure","venue":null,"work_id":"e490ff80-fdf1-42d3-bb37-a4ddcd8a64fb","year":2002},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.903645Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:32e5d0a2202dcf3e5a6abbcc494b14492b7ed5b8ed21c2303c4d619e3b3b5f86","observation_id":"c600fc07-41c8-4a8e-8798-4580beec6326","resolution":{"observed_at":"2026-08-14T11:40:06.162636Z","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-14T11:40:06.139286Z","title":"A scalable content-addressable network","venue":null,"work_id":"be9b8a4d-e6ff-43ce-9381-0bb60e01cdd1","year":2001},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.908302Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:dd0f9397021fe5882843ce9160852d7c8084608e73ca0aa5735f29ee6db1ddfe","observation_id":"4ca9c75f-8bff-4a02-9ac2-dcdbe6ccf8dd","resolution":{"observed_at":"2026-08-14T11:40:06.144662Z","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-14T11:40:06.122609Z","title":"Meiss, F","venue":null,"work_id":"a4079086-96c0-48f5-bf66-633f7786b522","year":2008},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.913032Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:fedf83c44cad403998a2b1a3eda178dc217faeb8417208e410043294625a49c4","observation_id":"8a25e479-ef0d-43c9-9668-2da69791924b","resolution":{"observed_at":"2026-08-14T11:40:06.127397Z","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-14T11:40:06.106019Z","title":"Optimal densification for fast and accurate minwise hashing","venue":null,"work_id":"83ced77a-e9ba-467f-ba3d-4277a6523d75","year":2017},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.918033Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:0afc0f71f05542c2312479d27163920ce6289f7b877e758e3a9ccdcabe6bbe43","observation_id":"bd5fddda-0a45-494e-8461-c4e4944da64a","resolution":{"observed_at":"2026-08-14T11:40:06.111610Z","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-14T11:40:06.089644Z","title":"Cisco docs, 2020","venue":null,"work_id":"fd6671cc-3bff-456e-afd3-20a7a5d2cfa0","year":2018},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.922768Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:a3f33347348e7c21d213edd3e2cb2ffe9e0c45baa82b879fce2e6e4e4225236b","observation_id":"d49f74ab-d5c6-430f-9a49-131bcd23f750","resolution":{"observed_at":"2026-08-14T11:40:06.094935Z","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-14T11:40:06.073605Z","title":null,"venue":null,"work_id":"5ae57dd5-66a4-4ee8-8c10-da206666b9c9","year":2002},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.927445Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:60240f67d50fc3861831d03f8fbc817dcae4de957cff485d84758b8b1efdde81","observation_id":"655e0486-4c21-4ceb-9aa6-6ce39c3c6d82","resolution":{"observed_at":"2026-08-14T11:40:06.078466Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T11:40:06.056360Z","title":"self-contained","venue":null,"work_id":"56ca37a3-8e42-49d5-b03e-ef3c9c741f5f","year":2020},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.933417Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:24174530df876cce204d2eda734c12bc9638ccfa7c4579c836ec90a1bf095712","observation_id":"466fc909-f6c6-4588-b38b-a804a36e9d27","resolution":{"observed_at":"2026-08-14T11:40:06.061357Z","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-14T11:40:06.040298Z","title":"Steps (b) and (c) switch Steps 2 and 3","venue":null,"work_id":"92a0dba3-97be-43e8-a8d1-64cc7e233284","year":null},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.938719Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:289075e2a0c047462e614f31114fda22b953f7291acf65060bf56442a673571f","observation_id":"1ad97988-74d1-4205-add8-e7048662f5f2","resolution":{"observed_at":"2026-08-14T11:40:06.045255Z","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-14T11:40:06.024266Z","title":"Set ξ1 =∑a1+a2 j=1 ∆j andξ2 =a1 +a2−ξ1","venue":null,"work_id":"d77e9961-7dd4-4007-8118-dea673729c78","year":2020},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.944233Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:dfe8bb0bb26265ceeeade867a0a244da22361dbc6ba338cba3896309e99de524","observation_id":"0040d05e-1989-497a-8053-5c6bceadc430","resolution":{"observed_at":"2026-08-14T11:40:06.029094Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-14T11:40:06.007297Z","title":"CH-BL continues to worsen with the cascading effect","venue":null,"work_id":"fed27fe8-4fe6-49bb-96cb-24b0491e33f8","year":null},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.950323Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:b8bb058e291c04f79f5a85edf3e1d2faffe9c057cd8519c1f36707fdbbf41e40","observation_id":"603d30db-ea18-42c0-8239-f7f2df7c214a","resolution":{"observed_at":"2026-08-14T11:40:06.012534Z","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-14T11:40:05.988598Z","title":"For CH-BL, the closest clockwise bin is severely affected","venue":null,"work_id":"4adf6511-e93d-4da7-ae5c-33ad3c4956d7","year":2020},"citing_paper":{"arxiv_id":"1908.08762","last_updated":"2020-06-16T15:11:37Z","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:40:05.955617Z"},"links":{"citing_paper":"/paper/1908.08762"},"observation_digest":"sha256:0533091c065d265b8cf88f3d8a826348d0f220caa77b38353cd208c0a08a4315","observation_id":"8f31bc75-dad7-4fe7-83c8-5d3e14f0ecbb","resolution":{"observed_at":"2026-08-14T11:40:05.995452Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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.08762","last_updated":"2020-06-16T15:11:37Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T08:39:20.381024Z","submitted_at":"2019-08-23T11:27:47Z","title":"Revisiting Consistent Hashing with Bounded Loads"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":33},"total_outbound_references":36},"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 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.08762."}