{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CGGPWBH2WCGGIIKKOACYHMFLYW","short_pith_number":"pith:CGGPWBH2","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"},"canonical_sha256":"118cfb04fab08c64214a700583b0abc5a5b75bc05f73b4682e99d7c72fa284b6","source":{"kind":"arxiv","id":"1712.03478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03478","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03478v1","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03478","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"CGGPWBH2WCGG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CGGPWBH2WCGGIIKK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CGGPWBH2","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CGGPWBH2WCGGIIKKOACYHMFLYW","target":"record","payload":{"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"},"canonical_sha256":"118cfb04fab08c64214a700583b0abc5a5b75bc05f73b4682e99d7c72fa284b6","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"},"source_kind":"arxiv","source_id":"1712.03478","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BUe17MROd/1HzNEzWcvUZMO1FanT2SB07hD7tDvtZsTjSdt25QWZoKLyR2nZ9+0eA7UsnGmjqmxCdwzHZefAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:37:37.805915Z"},"content_sha256":"c7ee152db02fbbf2fc393955f1490c033ee51b6af3ddb8ed5a4419073fd956e4","schema_version":"1.0","event_id":"sha256:c7ee152db02fbbf2fc393955f1490c033ee51b6af3ddb8ed5a4419073fd956e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CGGPWBH2WCGGIIKKOACYHMFLYW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOFt3pxlrFBHhXkd8RzzjjPzK9+wNCMIVefPVrTR5XUcffsy7u/N0xhUZBdfBUFDp6Aem5y7cA3H1Wy6hqnFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:37:37.806268Z"},"content_sha256":"eb35fc736de051aa50a66973ac51df6302fa23b2c39de98cb14b66551e6d3d96","schema_version":"1.0","event_id":"sha256:eb35fc736de051aa50a66973ac51df6302fa23b2c39de98cb14b66551e6d3d96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/bundle.json","state_url":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T01:37:37Z","links":{"resolver":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW","bundle":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/bundle.json","state":"https://pith.science/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGGPWBH2WCGGIIKKOACYHMFLYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CGGPWBH2WCGGIIKKOACYHMFLYW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"52da1c4427e5ee2d5b20fef271f7a1448f4ba100b9d90e0b345e7029cd57d222","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-12-10T07:44:56Z","title_canon_sha256":"d80e6ee79b3f72678875cb1d7a59ca91ced19f698e71257a670db719e9c174f0"},"schema_version":"1.0","source":{"id":"1712.03478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03478","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03478v1","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03478","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"CGGPWBH2WCGG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CGGPWBH2WCGGIIKK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CGGPWBH2","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:eb35fc736de051aa50a66973ac51df6302fa23b2c39de98cb14b66551e6d3d96","target":"graph","created_at":"2026-05-18T00:28:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cong-Kha Pham, Hong-Thu Nguyen, Xuan-Thuan Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-12-10T07:44:56Z","title":"A Scalable High-Performance Priority Encoder Using 1D-Array to 2D-Array Conversion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03478","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c7ee152db02fbbf2fc393955f1490c033ee51b6af3ddb8ed5a4419073fd956e4","target":"record","created_at":"2026-05-18T00:28:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"52da1c4427e5ee2d5b20fef271f7a1448f4ba100b9d90e0b345e7029cd57d222","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-12-10T07:44:56Z","title_canon_sha256":"d80e6ee79b3f72678875cb1d7a59ca91ced19f698e71257a670db719e9c174f0"},"schema_version":"1.0","source":{"id":"1712.03478","kind":"arxiv","version":1}},"canonical_sha256":"118cfb04fab08c64214a700583b0abc5a5b75bc05f73b4682e99d7c72fa284b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"118cfb04fab08c64214a700583b0abc5a5b75bc05f73b4682e99d7c72fa284b6","first_computed_at":"2026-05-18T00:28:21.152036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:21.152036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"haJHMP/aVwwOncpp6KYMPx7Gtf6/zZSrUTTSIH6KxDyKQjdPfc4nayT2NaY27tS5A5c/Vy7qtT2fqxQ9n4FPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:21.152660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7ee152db02fbbf2fc393955f1490c033ee51b6af3ddb8ed5a4419073fd956e4","sha256:eb35fc736de051aa50a66973ac51df6302fa23b2c39de98cb14b66551e6d3d96"],"state_sha256":"84b3aa6e23d9dcf6554b19699a53b5b2e6a7ca68d72409a4b810b86916cd3269"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDAShWE2V3DROocpI8lDZjEy9X9rD1WWaGS715Mm9lZlfRMzURAlBuXporJUc8rYQ2cP1sNMkMjmXHxsMtDqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:37:37.808391Z","bundle_sha256":"ee4caee87fbb7f18999c55f0699ab7ddb02c367eb7256590a2af48caed2996c3"}}