{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PJXHVNMUUOZL6WWCDW67TK4RZE","short_pith_number":"pith:PJXHVNMU","canonical_record":{"source":{"id":"2501.02305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-04T14:57:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"11d6e6b3ef741891eea63793b591dd17526ca4113f868fbe2ef5da03f31b40b8","abstract_canon_sha256":"d1e6544b61b09ba64386d9fac23a45b5cb25a0da64ee112567f9ba24c954c84a"},"schema_version":"1.0"},"canonical_sha256":"7a6e7ab594a3b2bf5ac21dbdf9ab91c93a02c534e9dac9f20cbce89c306a209a","source":{"kind":"arxiv","id":"2501.02305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.02305","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"2501.02305v2","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02305","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"PJXHVNMUUOZL","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"pith_short_16","alias_value":"PJXHVNMUUOZL6WWC","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"pith_short_8","alias_value":"PJXHVNMU","created_at":"2026-07-05T10:21:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PJXHVNMUUOZL6WWCDW67TK4RZE","target":"record","payload":{"canonical_record":{"source":{"id":"2501.02305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-04T14:57:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"11d6e6b3ef741891eea63793b591dd17526ca4113f868fbe2ef5da03f31b40b8","abstract_canon_sha256":"d1e6544b61b09ba64386d9fac23a45b5cb25a0da64ee112567f9ba24c954c84a"},"schema_version":"1.0"},"canonical_sha256":"7a6e7ab594a3b2bf5ac21dbdf9ab91c93a02c534e9dac9f20cbce89c306a209a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:27.853217Z","signature_b64":"euUYTcn6CElhp9FspNzZ6hABaWgTA/7++1JJZ5O0TagldCSJ/6Y3rDAKQ7+ClyWX01bJCxFFxsAZ6D8L4UVNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6e7ab594a3b2bf5ac21dbdf9ab91c93a02c534e9dac9f20cbce89c306a209a","last_reissued_at":"2026-07-05T10:21:27.852630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:27.852630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.02305","source_version":2,"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-05T10:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+Z7kG1tP2443KwiUXQmfb2//rBsmINBr7SnCxJdJCLbgAQ74qSyRDB8ejturRWYhhtr4TDR6xpNIgicOGaMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:36:51.369290Z"},"content_sha256":"901a59cb13f5a2661ba3275951fcb1760cc584227e2172e309fb1b96fc81657f","schema_version":"1.0","event_id":"sha256:901a59cb13f5a2661ba3275951fcb1760cc584227e2172e309fb1b96fc81657f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PJXHVNMUUOZL6WWCDW67TK4RZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Bounds for Open Addressing Without Reordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Andrew Krapivin, Martin Farach-Colton, William Kuszmaul","submitted_at":"2025-01-04T14:57:12Z","abstract_excerpt":"In this paper, we revisit one of the simplest problems in data structures: the task of inserting elements into an open-addressed hash table so that elements can later be retrieved with as few probes as possible. We show that, even without reordering elements over time, it is possible to construct a hash table that achieves far better expected search complexities (both amortized and worst-case) than were previously thought possible. Along the way, we disprove the central conjecture left by Yao in his seminal paper ``Uniform Hashing is Optimal''. All of our results come with matching lower bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02305","kind":"arxiv","version":2},"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.02305/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-05T10:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/tzc3hm3QYLZ9hdvIr3th1E9nFY+lK7+mMKZvYKlnay/8b91blrvtajbscQo5rcSa93bBiIFoxfQTZx/3bCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:36:51.369827Z"},"content_sha256":"75d520a02e5f3ada4e11a24599ca30a0b05a65ddcbccb843b344527f72bbe1e7","schema_version":"1.0","event_id":"sha256:75d520a02e5f3ada4e11a24599ca30a0b05a65ddcbccb843b344527f72bbe1e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJXHVNMUUOZL6WWCDW67TK4RZE/bundle.json","state_url":"https://pith.science/pith/PJXHVNMUUOZL6WWCDW67TK4RZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJXHVNMUUOZL6WWCDW67TK4RZE/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-20T23:36:51Z","links":{"resolver":"https://pith.science/pith/PJXHVNMUUOZL6WWCDW67TK4RZE","bundle":"https://pith.science/pith/PJXHVNMUUOZL6WWCDW67TK4RZE/bundle.json","state":"https://pith.science/pith/PJXHVNMUUOZL6WWCDW67TK4RZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJXHVNMUUOZL6WWCDW67TK4RZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PJXHVNMUUOZL6WWCDW67TK4RZE","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":"d1e6544b61b09ba64386d9fac23a45b5cb25a0da64ee112567f9ba24c954c84a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-04T14:57:12Z","title_canon_sha256":"11d6e6b3ef741891eea63793b591dd17526ca4113f868fbe2ef5da03f31b40b8"},"schema_version":"1.0","source":{"id":"2501.02305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.02305","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"2501.02305v2","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02305","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"PJXHVNMUUOZL","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"pith_short_16","alias_value":"PJXHVNMUUOZL6WWC","created_at":"2026-07-05T10:21:27Z"},{"alias_kind":"pith_short_8","alias_value":"PJXHVNMU","created_at":"2026-07-05T10:21:27Z"}],"graph_snapshots":[{"event_id":"sha256:75d520a02e5f3ada4e11a24599ca30a0b05a65ddcbccb843b344527f72bbe1e7","target":"graph","created_at":"2026-07-05T10:21:27Z","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/2501.02305/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we revisit one of the simplest problems in data structures: the task of inserting elements into an open-addressed hash table so that elements can later be retrieved with as few probes as possible. We show that, even without reordering elements over time, it is possible to construct a hash table that achieves far better expected search complexities (both amortized and worst-case) than were previously thought possible. Along the way, we disprove the central conjecture left by Yao in his seminal paper ``Uniform Hashing is Optimal''. All of our results come with matching lower bound","authors_text":"Andrew Krapivin, Martin Farach-Colton, William Kuszmaul","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-04T14:57:12Z","title":"Optimal Bounds for Open Addressing Without Reordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02305","kind":"arxiv","version":2},"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:901a59cb13f5a2661ba3275951fcb1760cc584227e2172e309fb1b96fc81657f","target":"record","created_at":"2026-07-05T10:21:27Z","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":"d1e6544b61b09ba64386d9fac23a45b5cb25a0da64ee112567f9ba24c954c84a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-04T14:57:12Z","title_canon_sha256":"11d6e6b3ef741891eea63793b591dd17526ca4113f868fbe2ef5da03f31b40b8"},"schema_version":"1.0","source":{"id":"2501.02305","kind":"arxiv","version":2}},"canonical_sha256":"7a6e7ab594a3b2bf5ac21dbdf9ab91c93a02c534e9dac9f20cbce89c306a209a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a6e7ab594a3b2bf5ac21dbdf9ab91c93a02c534e9dac9f20cbce89c306a209a","first_computed_at":"2026-07-05T10:21:27.852630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:21:27.852630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"euUYTcn6CElhp9FspNzZ6hABaWgTA/7++1JJZ5O0TagldCSJ/6Y3rDAKQ7+ClyWX01bJCxFFxsAZ6D8L4UVNAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:21:27.853217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.02305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:901a59cb13f5a2661ba3275951fcb1760cc584227e2172e309fb1b96fc81657f","sha256:75d520a02e5f3ada4e11a24599ca30a0b05a65ddcbccb843b344527f72bbe1e7"],"state_sha256":"074dfcdf2d4e0bfca9ec4a8800e362db99b761cdf1602b86912bc70a203c2a86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wEA+UNML/AKhYVg2avVzpwqowh3sJmKUM9b+Zz34OfZjskPAkSUWGCZdHeDWGM+uys5pGH/w+tyubieLWDbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T23:36:51.373855Z","bundle_sha256":"bdcbf740292c9f0be5190b6a63e061f94cfebf352711dfcd9b53d407705c05ec"}}