{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SNWHJ4R4WIDNV6MGHHWY4P6DLK","short_pith_number":"pith:SNWHJ4R4","schema_version":"1.0","canonical_sha256":"936c74f23cb206daf98639ed8e3fc35a97d646e998b8efa628a078bfe055ef09","source":{"kind":"arxiv","id":"1502.04221","version":1},"attestation_state":"computed","paper":{"title":"A Row-parallel 8$\\times$8 2-D DCT Architecture Using Algebraic Integer Based Exact Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NT","stat.CO","stat.ME"],"primary_cat":"cs.AR","authors_text":"A. Edirisuriya, A. Madanayake, D. Onen, L. T. Bruton, N. T. Rajapaksha, R. J. Cintra, V. S. Dimitrov","submitted_at":"2015-02-14T16:14:05Z","abstract_excerpt":"An algebraic integer (AI) based time-multiplexed row-parallel architecture and two final-reconstruction step (FRS) algorithms are proposed for the implementation of bivariate AI-encoded 2-D discrete cosine transform (DCT). The architecture directly realizes an error-free 2-D DCT without using FRSs between row-column transforms, leading to an 8$\\times$8 2-D DCT which is entirely free of quantization errors in AI basis. As a result, the user-selectable accuracy for each of the coefficients in the FRS facilitates each of the 64 coefficients to have its precision set independently of others, avoid"},"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":"1502.04221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-02-14T16:14:05Z","cross_cats_sorted":["cs.DM","math.NT","stat.CO","stat.ME"],"title_canon_sha256":"b2b5ab9974d0deddac65188a3720f32621691dbfd730e63319f0f4f04f3377c6","abstract_canon_sha256":"04ed69c067d3588a10d14f75057b6b9ee524e4ae966a816b5e8a3a5906b4a25f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:00.211494Z","signature_b64":"2nWV7+UCzyhamoHjSchUivy3JSDFQovwm7Y6By+1yu+Xx7GiABcCAcpO533TbCtW7G5MpNcl2J1yWrrBjcOiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"936c74f23cb206daf98639ed8e3fc35a97d646e998b8efa628a078bfe055ef09","last_reissued_at":"2026-05-18T02:27:00.211014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:00.211014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Row-parallel 8$\\times$8 2-D DCT Architecture Using Algebraic Integer Based Exact Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NT","stat.CO","stat.ME"],"primary_cat":"cs.AR","authors_text":"A. Edirisuriya, A. Madanayake, D. Onen, L. T. Bruton, N. T. Rajapaksha, R. J. Cintra, V. S. Dimitrov","submitted_at":"2015-02-14T16:14:05Z","abstract_excerpt":"An algebraic integer (AI) based time-multiplexed row-parallel architecture and two final-reconstruction step (FRS) algorithms are proposed for the implementation of bivariate AI-encoded 2-D discrete cosine transform (DCT). The architecture directly realizes an error-free 2-D DCT without using FRSs between row-column transforms, leading to an 8$\\times$8 2-D DCT which is entirely free of quantization errors in AI basis. As a result, the user-selectable accuracy for each of the coefficients in the FRS facilitates each of the 64 coefficients to have its precision set independently of others, avoid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04221","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":"1502.04221","created_at":"2026-05-18T02:27:00.211089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04221v1","created_at":"2026-05-18T02:27:00.211089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04221","created_at":"2026-05-18T02:27:00.211089+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNWHJ4R4WIDN","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNWHJ4R4WIDNV6MG","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNWHJ4R4","created_at":"2026-05-18T12:29:42.218222+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/SNWHJ4R4WIDNV6MGHHWY4P6DLK","json":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK.json","graph_json":"https://pith.science/api/pith-number/SNWHJ4R4WIDNV6MGHHWY4P6DLK/graph.json","events_json":"https://pith.science/api/pith-number/SNWHJ4R4WIDNV6MGHHWY4P6DLK/events.json","paper":"https://pith.science/paper/SNWHJ4R4"},"agent_actions":{"view_html":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK","download_json":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK.json","view_paper":"https://pith.science/paper/SNWHJ4R4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04221&json=true","fetch_graph":"https://pith.science/api/pith-number/SNWHJ4R4WIDNV6MGHHWY4P6DLK/graph.json","fetch_events":"https://pith.science/api/pith-number/SNWHJ4R4WIDNV6MGHHWY4P6DLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK/action/storage_attestation","attest_author":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK/action/author_attestation","sign_citation":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK/action/citation_signature","submit_replication":"https://pith.science/pith/SNWHJ4R4WIDNV6MGHHWY4P6DLK/action/replication_record"}},"created_at":"2026-05-18T02:27:00.211089+00:00","updated_at":"2026-05-18T02:27:00.211089+00:00"}