{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GAKHL4WHVBN2Y4QP2K3YAOBN6N","short_pith_number":"pith:GAKHL4WH","schema_version":"1.0","canonical_sha256":"301475f2c7a85bac720fd2b780382df37453281621c57ac18e7d650109921638","source":{"kind":"arxiv","id":"1907.02900","version":1},"attestation_state":"computed","paper":{"title":"HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.DS","authors_text":"Oded Green","submitted_at":"2019-07-05T15:44:27Z","abstract_excerpt":"Hash tables are ubiquitous and used in a wide range of applications for efficient probing of large and unsorted data. If designed properly, hash-tables can enable efficients look ups in a constant number of operations or commonly referred to as O(1) operations. As data sizes continue to grow and data becomes less structured (as is common for big-data applications), the need for efficient and scalable hash table also grows. In this paper we introduce HashGraph, a new scalable approach for building hash tables that uses concepts taken from sparse graph representations--hence the name HashGraph. "},"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":"1907.02900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T15:44:27Z","cross_cats_sorted":["cs.DB","cs.DC"],"title_canon_sha256":"4cbcb27c54aca27bebe39c01b8f39b04652ee071476d8eaa4b1d2e90cc9559b5","abstract_canon_sha256":"43317aaa3fca43f7194dd493aaa80d7e054a40a184d1e5496b40bd5f7eb2000b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.667550Z","signature_b64":"JvS4y7llP9M6BI/O9fd2UDwLwAdIDdjezD+/ItyEuHwAo/uCtBNbxB2GBk1Ovxv8BnX8ayVdQbPadDHg9TsjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"301475f2c7a85bac720fd2b780382df37453281621c57ac18e7d650109921638","last_reissued_at":"2026-05-17T23:41:22.666481Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.666481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.DS","authors_text":"Oded Green","submitted_at":"2019-07-05T15:44:27Z","abstract_excerpt":"Hash tables are ubiquitous and used in a wide range of applications for efficient probing of large and unsorted data. If designed properly, hash-tables can enable efficients look ups in a constant number of operations or commonly referred to as O(1) operations. As data sizes continue to grow and data becomes less structured (as is common for big-data applications), the need for efficient and scalable hash table also grows. In this paper we introduce HashGraph, a new scalable approach for building hash tables that uses concepts taken from sparse graph representations--hence the name HashGraph. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02900","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":""},"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":"1907.02900","created_at":"2026-05-17T23:41:22.666769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02900v1","created_at":"2026-05-17T23:41:22.666769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02900","created_at":"2026-05-17T23:41:22.666769+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAKHL4WHVBN2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAKHL4WHVBN2Y4QP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAKHL4WH","created_at":"2026-05-18T12:33:18.533446+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/GAKHL4WHVBN2Y4QP2K3YAOBN6N","json":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N.json","graph_json":"https://pith.science/api/pith-number/GAKHL4WHVBN2Y4QP2K3YAOBN6N/graph.json","events_json":"https://pith.science/api/pith-number/GAKHL4WHVBN2Y4QP2K3YAOBN6N/events.json","paper":"https://pith.science/paper/GAKHL4WH"},"agent_actions":{"view_html":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N","download_json":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N.json","view_paper":"https://pith.science/paper/GAKHL4WH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02900&json=true","fetch_graph":"https://pith.science/api/pith-number/GAKHL4WHVBN2Y4QP2K3YAOBN6N/graph.json","fetch_events":"https://pith.science/api/pith-number/GAKHL4WHVBN2Y4QP2K3YAOBN6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N/action/storage_attestation","attest_author":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N/action/author_attestation","sign_citation":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N/action/citation_signature","submit_replication":"https://pith.science/pith/GAKHL4WHVBN2Y4QP2K3YAOBN6N/action/replication_record"}},"created_at":"2026-05-17T23:41:22.666769+00:00","updated_at":"2026-05-17T23:41:22.666769+00:00"}