{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WZXU6GL6JDTSLLFZZICZKISVQF","short_pith_number":"pith:WZXU6GL6","schema_version":"1.0","canonical_sha256":"b66f4f197e48e725acb9ca059522558147f59befdb67893c0a67805da0c38fb5","source":{"kind":"arxiv","id":"1611.07786","version":2},"attestation_state":"computed","paper":{"title":"A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avishek Anand, Megha Khosla","submitted_at":"2016-11-23T13:38:07Z","abstract_excerpt":"Hash tables are ubiquitous in computer science for efficient access to large datasets. However, there is always a need for approaches that offer compact memory utilisation without substantial degradation of lookup performance. Cuckoo hashing is an efficient technique of creating hash tables with high space utilisation and offer a guaranteed constant access time. We are given $n$ locations and $m$ items. Each item has to be placed in one of the $k\\ge2$ locations chosen by $k$ random hash functions. By allowing more than one choice for a single item, cuckoo hashing resembles multiple choice allo"},"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":"1611.07786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T13:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"96552243dd123435564f4bbadb1aaae91032fb580a74ad57fd54b61d10aa253e","abstract_canon_sha256":"0cbc60689805282bb2ba738d6ee5ca6ef8a8008f7978e8f05fc4032e0f8ed100"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:36.827874Z","signature_b64":"fwWf9IW9ZAH2/wyMVcAZgOZYnZmNLHPDZBe8nOAH61LJ+PssmSp/zgS54GpfoXdlYkaSP1WmFknZUjGDbPzsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66f4f197e48e725acb9ca059522558147f59befdb67893c0a67805da0c38fb5","last_reissued_at":"2026-05-17T23:40:36.827358Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:36.827358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avishek Anand, Megha Khosla","submitted_at":"2016-11-23T13:38:07Z","abstract_excerpt":"Hash tables are ubiquitous in computer science for efficient access to large datasets. However, there is always a need for approaches that offer compact memory utilisation without substantial degradation of lookup performance. Cuckoo hashing is an efficient technique of creating hash tables with high space utilisation and offer a guaranteed constant access time. We are given $n$ locations and $m$ items. Each item has to be placed in one of the $k\\ge2$ locations chosen by $k$ random hash functions. By allowing more than one choice for a single item, cuckoo hashing resembles multiple choice allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07786","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":""},"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":"1611.07786","created_at":"2026-05-17T23:40:36.827464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07786v2","created_at":"2026-05-17T23:40:36.827464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07786","created_at":"2026-05-17T23:40:36.827464+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZXU6GL6JDTS","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZXU6GL6JDTSLLFZ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZXU6GL6","created_at":"2026-05-18T12:30:51.357362+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/WZXU6GL6JDTSLLFZZICZKISVQF","json":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF.json","graph_json":"https://pith.science/api/pith-number/WZXU6GL6JDTSLLFZZICZKISVQF/graph.json","events_json":"https://pith.science/api/pith-number/WZXU6GL6JDTSLLFZZICZKISVQF/events.json","paper":"https://pith.science/paper/WZXU6GL6"},"agent_actions":{"view_html":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF","download_json":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF.json","view_paper":"https://pith.science/paper/WZXU6GL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07786&json=true","fetch_graph":"https://pith.science/api/pith-number/WZXU6GL6JDTSLLFZZICZKISVQF/graph.json","fetch_events":"https://pith.science/api/pith-number/WZXU6GL6JDTSLLFZZICZKISVQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF/action/storage_attestation","attest_author":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF/action/author_attestation","sign_citation":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF/action/citation_signature","submit_replication":"https://pith.science/pith/WZXU6GL6JDTSLLFZZICZKISVQF/action/replication_record"}},"created_at":"2026-05-17T23:40:36.827464+00:00","updated_at":"2026-05-17T23:40:36.827464+00:00"}