{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SMXV5URZGWBFDSRHNAFXTC3UYQ","short_pith_number":"pith:SMXV5URZ","schema_version":"1.0","canonical_sha256":"932f5ed239358251ca27680b798b74c4165dda751b997c7c6ec15073e9b9cee1","source":{"kind":"arxiv","id":"2501.11582","version":1},"attestation_state":"computed","paper":{"title":"Tight Analyses of Ordered and Unordered Linear Probing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mark Braverman, William Kuszmaul","submitted_at":"2025-01-20T16:40:18Z","abstract_excerpt":"Linear-probing hash tables have been classically believed to support insertions in time $\\Theta(x^2)$, where $1 - 1/x$ is the load factor of the hash table. Recent work by Bender, Kuszmaul, and Kuszmaul (FOCS'21), however, has added a new twist to this story: in some versions of linear probing, if the \\emph{maximum} load factor is at most $1 - 1/x$, then the \\emph{amortized} expected time per insertion will never exceed $x \\log^{O(1)} x$ (even in workloads that operate continuously at a load factor of $1 - 1/x$). Determining the exact asymptotic value for the amortized insertion time remains o"},"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":"2501.11582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-20T16:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"4b65e90180f923c56b9870c5b6d8632e9450987811d0694a7e740f228f781333","abstract_canon_sha256":"75432f98631617b64566f13ddfdbf5e570b428c404db9dc6b2232a3d5b30295a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:11.136888Z","signature_b64":"v0JCsl3Ue4ejm94SprfGar2invSvVB3VEhSzduSwsvMG03iaOLUo0x/aO1SCuWq4TCAAddkXp9nbRrj2jL+yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932f5ed239358251ca27680b798b74c4165dda751b997c7c6ec15073e9b9cee1","last_reissued_at":"2026-07-05T10:03:11.136549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:11.136549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Analyses of Ordered and Unordered Linear Probing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mark Braverman, William Kuszmaul","submitted_at":"2025-01-20T16:40:18Z","abstract_excerpt":"Linear-probing hash tables have been classically believed to support insertions in time $\\Theta(x^2)$, where $1 - 1/x$ is the load factor of the hash table. Recent work by Bender, Kuszmaul, and Kuszmaul (FOCS'21), however, has added a new twist to this story: in some versions of linear probing, if the \\emph{maximum} load factor is at most $1 - 1/x$, then the \\emph{amortized} expected time per insertion will never exceed $x \\log^{O(1)} x$ (even in workloads that operate continuously at a load factor of $1 - 1/x$). Determining the exact asymptotic value for the amortized insertion time remains o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11582","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/2501.11582/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":"2501.11582","created_at":"2026-07-05T10:03:11.136606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11582v1","created_at":"2026-07-05T10:03:11.136606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11582","created_at":"2026-07-05T10:03:11.136606+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMXV5URZGWBF","created_at":"2026-07-05T10:03:11.136606+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMXV5URZGWBFDSRH","created_at":"2026-07-05T10:03:11.136606+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMXV5URZ","created_at":"2026-07-05T10:03:11.136606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ","json":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ.json","graph_json":"https://pith.science/api/pith-number/SMXV5URZGWBFDSRHNAFXTC3UYQ/graph.json","events_json":"https://pith.science/api/pith-number/SMXV5URZGWBFDSRHNAFXTC3UYQ/events.json","paper":"https://pith.science/paper/SMXV5URZ"},"agent_actions":{"view_html":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ","download_json":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ.json","view_paper":"https://pith.science/paper/SMXV5URZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11582&json=true","fetch_graph":"https://pith.science/api/pith-number/SMXV5URZGWBFDSRHNAFXTC3UYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SMXV5URZGWBFDSRHNAFXTC3UYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ/action/storage_attestation","attest_author":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ/action/author_attestation","sign_citation":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ/action/citation_signature","submit_replication":"https://pith.science/pith/SMXV5URZGWBFDSRHNAFXTC3UYQ/action/replication_record"}},"created_at":"2026-07-05T10:03:11.136606+00:00","updated_at":"2026-07-05T10:03:11.136606+00:00"}