{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HLE6ZPMXYYUIALWDEGDFQUONOD","short_pith_number":"pith:HLE6ZPMX","schema_version":"1.0","canonical_sha256":"3ac9ecbd97c628802ec321865851cd70ff810d46a95f09e9b94a0f0589a34471","source":{"kind":"arxiv","id":"1804.02330","version":3},"attestation_state":"computed","paper":{"title":"An Efficient I/O Architecture for RAM-based Content-Addressable Memory on FPGA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Cong-Kha Pham, Hong-Thu Nguyen, Katsumi Inoue, Trong-Thuc Hoang, Xuan-Thuan Nguyen","submitted_at":"2018-03-28T02:14:06Z","abstract_excerpt":"Despite the impressive search rate of one key per clock cycle, the update stage of a random-access-memory-based content-addressable-memory (RAM-based CAM) always suffers high latency. Two primary causes of such latency include: (1) the compulsory erasing stage along with the writing stage and (2) the major difference in data width between the RAM-based CAM (e.g., 8-bit width) and the modern systems (e.g., 256-bit width). This brief, therefore, aims for an efficient input/output (I/O) architecture of RAM-based binary CAM (RCAM) for low-latency update. To achieve this goal, three techniques, nam"},"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":"1804.02330","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-03-28T02:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"2ca5b2a689fb289b64c9dbf071b01dc16af5378dfd4904a2a0adb1be5ba68279","abstract_canon_sha256":"18d5ef2858c62ce04b39b0e50b211578aaf6b8cba383493c2da27d3ba5ced55e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:13.685681Z","signature_b64":"K6xrLaCOAp6RctIhZs1zozFok/NsxiMiq5qAe0Q6vXLhjB230IMoYjNcf9/PKotHrshQbqHj0AareXkVZ+CuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac9ecbd97c628802ec321865851cd70ff810d46a95f09e9b94a0f0589a34471","last_reissued_at":"2026-05-18T00:12:13.684990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:13.684990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient I/O Architecture for RAM-based Content-Addressable Memory on FPGA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Cong-Kha Pham, Hong-Thu Nguyen, Katsumi Inoue, Trong-Thuc Hoang, Xuan-Thuan Nguyen","submitted_at":"2018-03-28T02:14:06Z","abstract_excerpt":"Despite the impressive search rate of one key per clock cycle, the update stage of a random-access-memory-based content-addressable-memory (RAM-based CAM) always suffers high latency. Two primary causes of such latency include: (1) the compulsory erasing stage along with the writing stage and (2) the major difference in data width between the RAM-based CAM (e.g., 8-bit width) and the modern systems (e.g., 256-bit width). This brief, therefore, aims for an efficient input/output (I/O) architecture of RAM-based binary CAM (RCAM) for low-latency update. To achieve this goal, three techniques, nam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02330","kind":"arxiv","version":3},"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":"1804.02330","created_at":"2026-05-18T00:12:13.685128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02330v3","created_at":"2026-05-18T00:12:13.685128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02330","created_at":"2026-05-18T00:12:13.685128+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLE6ZPMXYYUI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLE6ZPMXYYUIALWD","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLE6ZPMX","created_at":"2026-05-18T12:32:28.185984+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/HLE6ZPMXYYUIALWDEGDFQUONOD","json":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD.json","graph_json":"https://pith.science/api/pith-number/HLE6ZPMXYYUIALWDEGDFQUONOD/graph.json","events_json":"https://pith.science/api/pith-number/HLE6ZPMXYYUIALWDEGDFQUONOD/events.json","paper":"https://pith.science/paper/HLE6ZPMX"},"agent_actions":{"view_html":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD","download_json":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD.json","view_paper":"https://pith.science/paper/HLE6ZPMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02330&json=true","fetch_graph":"https://pith.science/api/pith-number/HLE6ZPMXYYUIALWDEGDFQUONOD/graph.json","fetch_events":"https://pith.science/api/pith-number/HLE6ZPMXYYUIALWDEGDFQUONOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD/action/storage_attestation","attest_author":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD/action/author_attestation","sign_citation":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD/action/citation_signature","submit_replication":"https://pith.science/pith/HLE6ZPMXYYUIALWDEGDFQUONOD/action/replication_record"}},"created_at":"2026-05-18T00:12:13.685128+00:00","updated_at":"2026-05-18T00:12:13.685128+00:00"}