{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CGGPWBH2WCGGIIKKOACYHMFLYW","short_pith_number":"pith:CGGPWBH2","schema_version":"1.0","canonical_sha256":"118cfb04fab08c64214a700583b0abc5a5b75bc05f73b4682e99d7c72fa284b6","source":{"kind":"arxiv","id":"1712.03478","version":1},"attestation_state":"computed","paper":{"title":"A Scalable High-Performance Priority Encoder Using 1D-Array to 2D-Array Conversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Cong-Kha Pham, Hong-Thu Nguyen, Xuan-Thuan Nguyen","submitted_at":"2017-12-10T07:44:56Z","abstract_excerpt":"In our prior study of an L-bit priority encoder (PE), a so-called one-directional-array to two-directional-array conversion method is deployed to turn an L-bit input data into an MxN-bit matrix. Following this, an N-bit PE and an M-bit PE are employed to obtain a row index and column index. From those, the highest priority bit of L-bit input data is achieved. This brief extends our previous work to construct a scalable architecture of high-performance large-sized PEs. An optimum pair of (M, N) and look-ahead signal are proposed to improve the overall PE performance significantly. The evaluatio"},"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":"1712.03478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-12-10T07:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"d80e6ee79b3f72678875cb1d7a59ca91ced19f698e71257a670db719e9c174f0","abstract_canon_sha256":"52da1c4427e5ee2d5b20fef271f7a1448f4ba100b9d90e0b345e7029cd57d222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:21.152660Z","signature_b64":"haJHMP/aVwwOncpp6KYMPx7Gtf6/zZSrUTTSIH6KxDyKQjdPfc4nayT2NaY27tS5A5c/Vy7qtT2fqxQ9n4FPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118cfb04fab08c64214a700583b0abc5a5b75bc05f73b4682e99d7c72fa284b6","last_reissued_at":"2026-05-18T00:28:21.152036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:21.152036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable High-Performance Priority Encoder Using 1D-Array to 2D-Array Conversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Cong-Kha Pham, Hong-Thu Nguyen, Xuan-Thuan Nguyen","submitted_at":"2017-12-10T07:44:56Z","abstract_excerpt":"In our prior study of an L-bit priority encoder (PE), a so-called one-directional-array to two-directional-array conversion method is deployed to turn an L-bit input data into an MxN-bit matrix. Following this, an N-bit PE and an M-bit PE are employed to obtain a row index and column index. From those, the highest priority bit of L-bit input data is achieved. This brief extends our previous work to construct a scalable architecture of high-performance large-sized PEs. An optimum pair of (M, N) and look-ahead signal are proposed to improve the overall PE performance significantly. The evaluatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03478","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":"1712.03478","created_at":"2026-05-18T00:28:21.152121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03478v1","created_at":"2026-05-18T00:28:21.152121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03478","created_at":"2026-05-18T00:28:21.152121+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGGPWBH2WCGG","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGGPWBH2WCGGIIKK","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGGPWBH2","created_at":"2026-05-18T12:31:10.602751+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/CGGPWBH2WCGGIIKKOACYHMFLYW","json":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW.json","graph_json":"https://pith.science/api/pith-number/CGGPWBH2WCGGIIKKOACYHMFLYW/graph.json","events_json":"https://pith.science/api/pith-number/CGGPWBH2WCGGIIKKOACYHMFLYW/events.json","paper":"https://pith.science/paper/CGGPWBH2"},"agent_actions":{"view_html":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW","download_json":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW.json","view_paper":"https://pith.science/paper/CGGPWBH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03478&json=true","fetch_graph":"https://pith.science/api/pith-number/CGGPWBH2WCGGIIKKOACYHMFLYW/graph.json","fetch_events":"https://pith.science/api/pith-number/CGGPWBH2WCGGIIKKOACYHMFLYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/action/storage_attestation","attest_author":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/action/author_attestation","sign_citation":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/action/citation_signature","submit_replication":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/action/replication_record"}},"created_at":"2026-05-18T00:28:21.152121+00:00","updated_at":"2026-05-18T00:28:21.152121+00:00"}