{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4ZHB7QFFUEHOGKVHMID3BERHZH","short_pith_number":"pith:4ZHB7QFF","canonical_record":{"source":{"id":"2607.17494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-20T02:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"05e8f53c7b50cc02d85db1e17aabd5ee99c2649f30f4e5d8c2a57857cbd77301","abstract_canon_sha256":"bbdcefff06abf6ccfb0f5a86f65d104c29ce9fa6be23c6f8cc2c77e0adf2ff5b"},"schema_version":"1.0"},"canonical_sha256":"e64e1fc0a5a10ee32aa76207b09227c9e3da59abe87cd69bbddb1ab1ab521520","source":{"kind":"arxiv","id":"2607.17494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17494","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17494v1","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17494","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"pith_short_12","alias_value":"4ZHB7QFFUEHO","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"pith_short_16","alias_value":"4ZHB7QFFUEHOGKVH","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"pith_short_8","alias_value":"4ZHB7QFF","created_at":"2026-07-21T01:21:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4ZHB7QFFUEHOGKVHMID3BERHZH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.17494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-20T02:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"05e8f53c7b50cc02d85db1e17aabd5ee99c2649f30f4e5d8c2a57857cbd77301","abstract_canon_sha256":"bbdcefff06abf6ccfb0f5a86f65d104c29ce9fa6be23c6f8cc2c77e0adf2ff5b"},"schema_version":"1.0"},"canonical_sha256":"e64e1fc0a5a10ee32aa76207b09227c9e3da59abe87cd69bbddb1ab1ab521520","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:48.505428Z","signature_b64":"zWvRuxT4qUYC4sBTkzRTHnwlAlNSQA7UAWGpkD5p6nNSWUbUgfKxN3IFuZqf9nrJ+b8r2ubU4s9C4guKr0G4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e64e1fc0a5a10ee32aa76207b09227c9e3da59abe87cd69bbddb1ab1ab521520","last_reissued_at":"2026-07-21T01:21:48.504551Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:48.504551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.17494","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-21T01:21:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYWIKpNcw8mXIuw2gDHF523mYtwoYc2PprzKLnYarQCc+6V599LZKibFqeeW6CzOi6GXkC4dsnUrIiAE2jZ1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T02:36:49.249559Z"},"content_sha256":"8e141ab1ea36cfcc219cb6caf4b79beacd4e1d982426208385ea52c3a24a3247","schema_version":"1.0","event_id":"sha256:8e141ab1ea36cfcc219cb6caf4b79beacd4e1d982426208385ea52c3a24a3247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4ZHB7QFFUEHOGKVHMID3BERHZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Probing with Non-Greedy Insertions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Krapivin, Jolyne Wang, William Kuszmaul","submitted_at":"2026-07-20T02:53:18Z","abstract_excerpt":"Linear probing hash tables classically use a \\emph{greedy} insertion strategy, placing a key $u$ in the first available position out of $h(u), h(u) + 1, h(u) + 2, \\ldots$. If the hash table is filled to $1 - 1/x$ full, this results in $\\Theta(x^{2})$ worst-case expected insertion time.\n  In this note, we show that there is a simple \\emph{non-greedy} insertion strategy that does better, and without requiring elements to be reordered within the table over time. Given $x$ in advance, the strategy is able to bring the worst-case expected insertion time down to $O(x \\log x)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17494","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.17494/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-21T01:21:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAki4RPKSpM7KwxBhtFQnslJ3ypeldGbZD92ZKV6givb8U/l3K2KztyJdLhK2YpXdQx4+gMtKfn/lZvWqLlAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T02:36:49.250086Z"},"content_sha256":"e68bd9bda346f3055e8eef5ef26276513ac64c30ed454e933966233632f77033","schema_version":"1.0","event_id":"sha256:e68bd9bda346f3055e8eef5ef26276513ac64c30ed454e933966233632f77033"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZHB7QFFUEHOGKVHMID3BERHZH/bundle.json","state_url":"https://pith.science/pith/4ZHB7QFFUEHOGKVHMID3BERHZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZHB7QFFUEHOGKVHMID3BERHZH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T02:36:49Z","links":{"resolver":"https://pith.science/pith/4ZHB7QFFUEHOGKVHMID3BERHZH","bundle":"https://pith.science/pith/4ZHB7QFFUEHOGKVHMID3BERHZH/bundle.json","state":"https://pith.science/pith/4ZHB7QFFUEHOGKVHMID3BERHZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZHB7QFFUEHOGKVHMID3BERHZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4ZHB7QFFUEHOGKVHMID3BERHZH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bbdcefff06abf6ccfb0f5a86f65d104c29ce9fa6be23c6f8cc2c77e0adf2ff5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-20T02:53:18Z","title_canon_sha256":"05e8f53c7b50cc02d85db1e17aabd5ee99c2649f30f4e5d8c2a57857cbd77301"},"schema_version":"1.0","source":{"id":"2607.17494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17494","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17494v1","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17494","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"pith_short_12","alias_value":"4ZHB7QFFUEHO","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"pith_short_16","alias_value":"4ZHB7QFFUEHOGKVH","created_at":"2026-07-21T01:21:48Z"},{"alias_kind":"pith_short_8","alias_value":"4ZHB7QFF","created_at":"2026-07-21T01:21:48Z"}],"graph_snapshots":[{"event_id":"sha256:e68bd9bda346f3055e8eef5ef26276513ac64c30ed454e933966233632f77033","target":"graph","created_at":"2026-07-21T01:21:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.17494/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear probing hash tables classically use a \\emph{greedy} insertion strategy, placing a key $u$ in the first available position out of $h(u), h(u) + 1, h(u) + 2, \\ldots$. If the hash table is filled to $1 - 1/x$ full, this results in $\\Theta(x^{2})$ worst-case expected insertion time.\n  In this note, we show that there is a simple \\emph{non-greedy} insertion strategy that does better, and without requiring elements to be reordered within the table over time. Given $x$ in advance, the strategy is able to bring the worst-case expected insertion time down to $O(x \\log x)$.","authors_text":"Andrew Krapivin, Jolyne Wang, William Kuszmaul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-20T02:53:18Z","title":"Linear Probing with Non-Greedy Insertions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17494","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8e141ab1ea36cfcc219cb6caf4b79beacd4e1d982426208385ea52c3a24a3247","target":"record","created_at":"2026-07-21T01:21:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bbdcefff06abf6ccfb0f5a86f65d104c29ce9fa6be23c6f8cc2c77e0adf2ff5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-20T02:53:18Z","title_canon_sha256":"05e8f53c7b50cc02d85db1e17aabd5ee99c2649f30f4e5d8c2a57857cbd77301"},"schema_version":"1.0","source":{"id":"2607.17494","kind":"arxiv","version":1}},"canonical_sha256":"e64e1fc0a5a10ee32aa76207b09227c9e3da59abe87cd69bbddb1ab1ab521520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e64e1fc0a5a10ee32aa76207b09227c9e3da59abe87cd69bbddb1ab1ab521520","first_computed_at":"2026-07-21T01:21:48.504551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:48.504551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWvRuxT4qUYC4sBTkzRTHnwlAlNSQA7UAWGpkD5p6nNSWUbUgfKxN3IFuZqf9nrJ+b8r2ubU4s9C4guKr0G4Bg==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:48.505428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.17494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e141ab1ea36cfcc219cb6caf4b79beacd4e1d982426208385ea52c3a24a3247","sha256:e68bd9bda346f3055e8eef5ef26276513ac64c30ed454e933966233632f77033"],"state_sha256":"7b04c3d2d40b9da8c8b2cd3838bcd4d17a596ed320fe8ea1316e111358d081b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLtZz6wzjp3E9BaMCAuMnWXpIB0FScdaXHoNkOCFtVQElZztN7yly60q3yBLHH2GZ+6PFH4rj/P3gEJHEPdxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T02:36:49.255484Z","bundle_sha256":"b79db65c00af60444422e64e802ac1f2518c09d5846fa042497a2e6376de5130"}}