{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3LSQBTQWJNUYZHFX2FUINB4XVL","short_pith_number":"pith:3LSQBTQW","schema_version":"1.0","canonical_sha256":"dae500ce164b698c9cb7d168868797aae49a2dc380cb7e2d102bc0a384c52733","source":{"kind":"arxiv","id":"1302.4463","version":1},"attestation_state":"computed","paper":{"title":"A Low-Power Content-Addressable-Memory Based on Clustered-Sparse-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hooman Jarollahi, Naoya Onizawa, Vincent Gripon, Warren J. Gross","submitted_at":"2013-02-18T21:23:54Z","abstract_excerpt":"A low-power Content-Addressable-Memory (CAM) is introduced employing a new mechanism for associativity between the input tags and the corresponding address of the output data. The proposed architecture is based on a recently developed clustered-sparse-network using binary-weighted connections that on-average will eliminate most of the parallel comparisons performed during a search. Therefore, the dynamic energy consumption of the proposed design is significantly lower compared to that of a conventional low-power CAM design. Given an input tag, the proposed architecture computes a few possibili"},"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":"1302.4463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-02-18T21:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"9a716955fbabe4c69a054e408abbf425d2d4cfc4b4449923b0f65bb1296ef5f2","abstract_canon_sha256":"1273671a2cd625f8545a993a7ce7254063bd79d9b5b8dc4b21a70b4f6d5c4e03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.638124Z","signature_b64":"PX6QzH3N0DA/Qom4kZmC/1bimYnS3yxEunai6YYsC/guaZmcOBgY1d4ot9Y5c7noYfm0hrhsZ6FQRKgfqqHWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dae500ce164b698c9cb7d168868797aae49a2dc380cb7e2d102bc0a384c52733","last_reissued_at":"2026-05-18T00:58:17.637389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.637389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Low-Power Content-Addressable-Memory Based on Clustered-Sparse-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Hooman Jarollahi, Naoya Onizawa, Vincent Gripon, Warren J. Gross","submitted_at":"2013-02-18T21:23:54Z","abstract_excerpt":"A low-power Content-Addressable-Memory (CAM) is introduced employing a new mechanism for associativity between the input tags and the corresponding address of the output data. The proposed architecture is based on a recently developed clustered-sparse-network using binary-weighted connections that on-average will eliminate most of the parallel comparisons performed during a search. Therefore, the dynamic energy consumption of the proposed design is significantly lower compared to that of a conventional low-power CAM design. Given an input tag, the proposed architecture computes a few possibili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4463","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":"1302.4463","created_at":"2026-05-18T00:58:17.637510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4463v1","created_at":"2026-05-18T00:58:17.637510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4463","created_at":"2026-05-18T00:58:17.637510+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LSQBTQWJNUY","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LSQBTQWJNUYZHFX","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LSQBTQW","created_at":"2026-05-18T12:27:32.513160+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/3LSQBTQWJNUYZHFX2FUINB4XVL","json":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL.json","graph_json":"https://pith.science/api/pith-number/3LSQBTQWJNUYZHFX2FUINB4XVL/graph.json","events_json":"https://pith.science/api/pith-number/3LSQBTQWJNUYZHFX2FUINB4XVL/events.json","paper":"https://pith.science/paper/3LSQBTQW"},"agent_actions":{"view_html":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL","download_json":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL.json","view_paper":"https://pith.science/paper/3LSQBTQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4463&json=true","fetch_graph":"https://pith.science/api/pith-number/3LSQBTQWJNUYZHFX2FUINB4XVL/graph.json","fetch_events":"https://pith.science/api/pith-number/3LSQBTQWJNUYZHFX2FUINB4XVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL/action/storage_attestation","attest_author":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL/action/author_attestation","sign_citation":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL/action/citation_signature","submit_replication":"https://pith.science/pith/3LSQBTQWJNUYZHFX2FUINB4XVL/action/replication_record"}},"created_at":"2026-05-18T00:58:17.637510+00:00","updated_at":"2026-05-18T00:58:17.637510+00:00"}