{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TYEG47P5DNSKMWXHRCRNGYYB6A","short_pith_number":"pith:TYEG47P5","schema_version":"1.0","canonical_sha256":"9e086e7dfd1b64a65ae788a2d36301f00495f67372a2047e5eb8cf3667f3042c","source":{"kind":"arxiv","id":"2607.13247","version":1},"attestation_state":"computed","paper":{"title":"Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Jingxun Liang, Renfei Zhou, Stefan Walzer, William Kuszmaul, Yang Hu","submitted_at":"2026-07-14T20:22:08Z","abstract_excerpt":"Quadratic probing is one of the most widely used open-addressing hash-table schemes in practice, but after more than half a century, even its most basic performance guarantees remain poorly understood. In this paper, we revisit quadratic probing through the lens of a smoothed variant in which each key follows a random probe sequence where its $k$th probe is expected at offset $\\Theta(k^2)$. This is simultaneously a toy model for better understanding regular quadratic probing and a natural hashing scheme in its own right. We analyse smoothed quadratic probing for both Robin Hood ordering and an"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.13247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-14T20:22:08Z","cross_cats_sorted":[],"title_canon_sha256":"f4bc9050c71d7b0a4d488909e841639336cefb05e3154dd6cc67b37d0aa8fabe","abstract_canon_sha256":"dde0287115d7e7a873855837bf12bd05037356c312bbee2cd0730a1b90dc6f11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:22:04.854051Z","signature_b64":"V9Ko0wqhK3He56RRzokVnefiOgB+Xq7MGGtlbPXWZPp7ejTzqz8nUs/L98aVZNTtM9cN3GErb8Ff4ostm5xEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e086e7dfd1b64a65ae788a2d36301f00495f67372a2047e5eb8cf3667f3042c","last_reissued_at":"2026-07-16T00:22:04.853215Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:22:04.853215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Jingxun Liang, Renfei Zhou, Stefan Walzer, William Kuszmaul, Yang Hu","submitted_at":"2026-07-14T20:22:08Z","abstract_excerpt":"Quadratic probing is one of the most widely used open-addressing hash-table schemes in practice, but after more than half a century, even its most basic performance guarantees remain poorly understood. In this paper, we revisit quadratic probing through the lens of a smoothed variant in which each key follows a random probe sequence where its $k$th probe is expected at offset $\\Theta(k^2)$. This is simultaneously a toy model for better understanding regular quadratic probing and a natural hashing scheme in its own right. We analyse smoothed quadratic probing for both Robin Hood ordering and an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13247","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.13247/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.13247","created_at":"2026-07-16T00:22:04.853646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.13247v1","created_at":"2026-07-16T00:22:04.853646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13247","created_at":"2026-07-16T00:22:04.853646+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYEG47P5DNSK","created_at":"2026-07-16T00:22:04.853646+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYEG47P5DNSKMWXH","created_at":"2026-07-16T00:22:04.853646+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYEG47P5","created_at":"2026-07-16T00:22:04.853646+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08013","citing_title":"A Simple Analysis of Quadratic Probing and Other Open Addressing Schemes","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A","json":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A.json","graph_json":"https://pith.science/api/pith-number/TYEG47P5DNSKMWXHRCRNGYYB6A/graph.json","events_json":"https://pith.science/api/pith-number/TYEG47P5DNSKMWXHRCRNGYYB6A/events.json","paper":"https://pith.science/paper/TYEG47P5"},"agent_actions":{"view_html":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A","download_json":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A.json","view_paper":"https://pith.science/paper/TYEG47P5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.13247&json=true","fetch_graph":"https://pith.science/api/pith-number/TYEG47P5DNSKMWXHRCRNGYYB6A/graph.json","fetch_events":"https://pith.science/api/pith-number/TYEG47P5DNSKMWXHRCRNGYYB6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A/action/storage_attestation","attest_author":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A/action/author_attestation","sign_citation":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A/action/citation_signature","submit_replication":"https://pith.science/pith/TYEG47P5DNSKMWXHRCRNGYYB6A/action/replication_record"}},"created_at":"2026-07-16T00:22:04.853646+00:00","updated_at":"2026-07-16T00:22:04.853646+00:00"}