{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JSQDR23XAH5UYR6WRJ6HN6XROZ","short_pith_number":"pith:JSQDR23X","schema_version":"1.0","canonical_sha256":"4ca038eb7701fb4c47d68a7c76faf1767dcdbf638fe6a48cbe011260b9f20911","source":{"kind":"arxiv","id":"2607.28892","version":1},"attestation_state":"computed","paper":{"title":"Succinct and Fast Tiny Pointer Hash Tables","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Conway (Cornell Tech), William Kuszmaul (Carnegie Mellon University), Xilin Tang (Cornell University), Yuqi Mai (Cornell University)","submitted_at":"2026-07-30T23:19:05Z","abstract_excerpt":"Hash tables sit on the critical path of many systems, yet modern designs still force a trade-off between fast operations and high memory overhead. We revisit this trade-off and present Tiny Pointer Hash Tables (TPHT), a family of practical hash tables that make two ideas from theory work at system scale: compressing pointers down to a byte, and encoding keys compactly so less metadata is needed. We engineer these ideas into two complementary designs. Chained-TPHT targets maximal space savings, and is to the best of our knowledge the first simple and practical succinct hash table design, achiev"},"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.28892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T23:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"3fe19e9a8721a4c6c4b5667bea1cd9089119f4f699f776efb1ca662616cd763b","abstract_canon_sha256":"0dc540b87c8e889d9ea217102cf43f9f2fee06c636fe94a6b554425b57198206"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:17:26.470195Z","signature_b64":"+ddN0XBWurbbEyAKh9XE/czNuqQM3eWXagCBIQxO65mveUICsCNoIiN/pTXmiKv/S76B/j6btrsuiuY842JwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ca038eb7701fb4c47d68a7c76faf1767dcdbf638fe6a48cbe011260b9f20911","last_reissued_at":"2026-08-03T01:17:26.468597Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:17:26.468597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct and Fast Tiny Pointer Hash Tables","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Conway (Cornell Tech), William Kuszmaul (Carnegie Mellon University), Xilin Tang (Cornell University), Yuqi Mai (Cornell University)","submitted_at":"2026-07-30T23:19:05Z","abstract_excerpt":"Hash tables sit on the critical path of many systems, yet modern designs still force a trade-off between fast operations and high memory overhead. We revisit this trade-off and present Tiny Pointer Hash Tables (TPHT), a family of practical hash tables that make two ideas from theory work at system scale: compressing pointers down to a byte, and encoding keys compactly so less metadata is needed. We engineer these ideas into two complementary designs. Chained-TPHT targets maximal space savings, and is to the best of our knowledge the first simple and practical succinct hash table design, achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28892","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.28892/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.28892","created_at":"2026-08-03T01:17:26.469580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28892v1","created_at":"2026-08-03T01:17:26.469580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28892","created_at":"2026-08-03T01:17:26.469580+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSQDR23XAH5U","created_at":"2026-08-03T01:17:26.469580+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSQDR23XAH5UYR6W","created_at":"2026-08-03T01:17:26.469580+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSQDR23X","created_at":"2026-08-03T01:17:26.469580+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/JSQDR23XAH5UYR6WRJ6HN6XROZ","json":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ.json","graph_json":"https://pith.science/api/pith-number/JSQDR23XAH5UYR6WRJ6HN6XROZ/graph.json","events_json":"https://pith.science/api/pith-number/JSQDR23XAH5UYR6WRJ6HN6XROZ/events.json","paper":"https://pith.science/paper/JSQDR23X"},"agent_actions":{"view_html":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ","download_json":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ.json","view_paper":"https://pith.science/paper/JSQDR23X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28892&json=true","fetch_graph":"https://pith.science/api/pith-number/JSQDR23XAH5UYR6WRJ6HN6XROZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JSQDR23XAH5UYR6WRJ6HN6XROZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ/action/storage_attestation","attest_author":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ/action/author_attestation","sign_citation":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ/action/citation_signature","submit_replication":"https://pith.science/pith/JSQDR23XAH5UYR6WRJ6HN6XROZ/action/replication_record"}},"created_at":"2026-08-03T01:17:26.469580+00:00","updated_at":"2026-08-03T01:17:26.469580+00:00"}