{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BZDCF7COSX4AQ4KJ4F7UTIF7KW","short_pith_number":"pith:BZDCF7CO","schema_version":"1.0","canonical_sha256":"0e4622fc4e95f8087149e17f49a0bf55b0e82210583d0cdc5ad8df241ce6dbda","source":{"kind":"arxiv","id":"2503.03003","version":1},"attestation_state":"computed","paper":{"title":"Scaling IP Lookup to Large Databases using the CRAM Lens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andy Fingerhut, George Varghese, Pradeep Dogga, Robert Chang, Victor Rios","submitted_at":"2025-03-04T21:03:19Z","abstract_excerpt":"Wide-area scaling trends require new approaches to Internet Protocol (IP) lookup, enabled by modern networking chips such as Intel Tofino, AMD Pensando, and Nvidia BlueField, which provide substantial ternary content-addressable memory (TCAM) and static random-access memory (SRAM). However, designing and evaluating scalable algorithms for these chips is challenging due to hardware-level constraints. To address this, we introduce the CRAM (CAM+RAM) lens, a framework that combines a formal model for evaluating algorithms on modern network processors with a set of optimization idioms. We demonstr"},"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":"2503.03003","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-03-04T21:03:19Z","cross_cats_sorted":[],"title_canon_sha256":"39b1d1dc6e87aea7884140d86aca30dc757dc5f7d280a5721441342b2af6741b","abstract_canon_sha256":"dfad8320e7b3fc6477614cb65294150e8a8d17198a9c19899baf15b3752d8b94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:36.817093Z","signature_b64":"HG1q7vAEkeUie2ZitmcC3yyG4hWySKSUFs19/mqhIhtsuwmaer/dqn26f4Mylvc4BdENAXtv1CR/ti0/nfGqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e4622fc4e95f8087149e17f49a0bf55b0e82210583d0cdc5ad8df241ce6dbda","last_reissued_at":"2026-07-05T10:24:36.816615Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:36.816615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling IP Lookup to Large Databases using the CRAM Lens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andy Fingerhut, George Varghese, Pradeep Dogga, Robert Chang, Victor Rios","submitted_at":"2025-03-04T21:03:19Z","abstract_excerpt":"Wide-area scaling trends require new approaches to Internet Protocol (IP) lookup, enabled by modern networking chips such as Intel Tofino, AMD Pensando, and Nvidia BlueField, which provide substantial ternary content-addressable memory (TCAM) and static random-access memory (SRAM). However, designing and evaluating scalable algorithms for these chips is challenging due to hardware-level constraints. To address this, we introduce the CRAM (CAM+RAM) lens, a framework that combines a formal model for evaluating algorithms on modern network processors with a set of optimization idioms. We demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03003","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/2503.03003/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":"2503.03003","created_at":"2026-07-05T10:24:36.816674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03003v1","created_at":"2026-07-05T10:24:36.816674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03003","created_at":"2026-07-05T10:24:36.816674+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZDCF7COSX4A","created_at":"2026-07-05T10:24:36.816674+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZDCF7COSX4AQ4KJ","created_at":"2026-07-05T10:24:36.816674+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZDCF7CO","created_at":"2026-07-05T10:24:36.816674+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/BZDCF7COSX4AQ4KJ4F7UTIF7KW","json":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW.json","graph_json":"https://pith.science/api/pith-number/BZDCF7COSX4AQ4KJ4F7UTIF7KW/graph.json","events_json":"https://pith.science/api/pith-number/BZDCF7COSX4AQ4KJ4F7UTIF7KW/events.json","paper":"https://pith.science/paper/BZDCF7CO"},"agent_actions":{"view_html":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW","download_json":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW.json","view_paper":"https://pith.science/paper/BZDCF7CO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03003&json=true","fetch_graph":"https://pith.science/api/pith-number/BZDCF7COSX4AQ4KJ4F7UTIF7KW/graph.json","fetch_events":"https://pith.science/api/pith-number/BZDCF7COSX4AQ4KJ4F7UTIF7KW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW/action/storage_attestation","attest_author":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW/action/author_attestation","sign_citation":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW/action/citation_signature","submit_replication":"https://pith.science/pith/BZDCF7COSX4AQ4KJ4F7UTIF7KW/action/replication_record"}},"created_at":"2026-07-05T10:24:36.816674+00:00","updated_at":"2026-07-05T10:24:36.816674+00:00"}