{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:JQTYPRNP35JZ2VK5NFANHJ6K4K","short_pith_number":"pith:JQTYPRNP","schema_version":"1.0","canonical_sha256":"4c2787c5afdf539d555d6940d3a7cae28f6bd3d1665b8299d27d43adafc23001","source":{"kind":"arxiv","id":"cs/9809087","version":1},"attestation_state":"computed","paper":{"title":"A Comparison of Hashing Schemes for Address Lookup in Computer Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"R. Jain","submitted_at":"1998-09-24T04:46:53Z","abstract_excerpt":"Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, folding of address octets using the exclusive-or operation and bit extraction from the address. Guidelines are provided for determining the size of the hashmark required to achieve a specified level of performance."},"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":"cs/9809087","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"1998-09-24T04:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"81cd78008b77f9ae2a34123c29af068921a094451cf11ba96e73e6fb4ca982ab","abstract_canon_sha256":"c69fe6bca8ebf986a69af714439332d7a0f0869d6be0a4ac3431da436dccd0db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.042630Z","signature_b64":"SUn1TJZLbiNgSxdcNGmprFyvxeS1IxgIn+u41/UlgxGimGKjqLZWrgym1IQZUpmc10brbOPDk4xOmhBt1pttDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2787c5afdf539d555d6940d3a7cae28f6bd3d1665b8299d27d43adafc23001","last_reissued_at":"2026-05-18T00:58:56.042043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.042043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of Hashing Schemes for Address Lookup in Computer Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"R. Jain","submitted_at":"1998-09-24T04:46:53Z","abstract_excerpt":"Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, folding of address octets using the exclusive-or operation and bit extraction from the address. Guidelines are provided for determining the size of the hashmark required to achieve a specified level of performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809087","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":"cs/9809087","created_at":"2026-05-18T00:58:56.042140+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9809087v1","created_at":"2026-05-18T00:58:56.042140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809087","created_at":"2026-05-18T00:58:56.042140+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQTYPRNP35JZ","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQTYPRNP35JZ2VK5","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQTYPRNP","created_at":"2026-05-18T12:25:49.038998+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/JQTYPRNP35JZ2VK5NFANHJ6K4K","json":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K.json","graph_json":"https://pith.science/api/pith-number/JQTYPRNP35JZ2VK5NFANHJ6K4K/graph.json","events_json":"https://pith.science/api/pith-number/JQTYPRNP35JZ2VK5NFANHJ6K4K/events.json","paper":"https://pith.science/paper/JQTYPRNP"},"agent_actions":{"view_html":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K","download_json":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K.json","view_paper":"https://pith.science/paper/JQTYPRNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9809087&json=true","fetch_graph":"https://pith.science/api/pith-number/JQTYPRNP35JZ2VK5NFANHJ6K4K/graph.json","fetch_events":"https://pith.science/api/pith-number/JQTYPRNP35JZ2VK5NFANHJ6K4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K/action/storage_attestation","attest_author":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K/action/author_attestation","sign_citation":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K/action/citation_signature","submit_replication":"https://pith.science/pith/JQTYPRNP35JZ2VK5NFANHJ6K4K/action/replication_record"}},"created_at":"2026-05-18T00:58:56.042140+00:00","updated_at":"2026-05-18T00:58:56.042140+00:00"}