{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KK4XAY4TROGEDVVPW4CNUGQACG","short_pith_number":"pith:KK4XAY4T","schema_version":"1.0","canonical_sha256":"52b97063938b8c41d6afb704da1a00119dfebd963b58d925f9d68da29de252b5","source":{"kind":"arxiv","id":"1702.01805","version":1},"attestation_state":"computed","paper":{"title":"A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DS","cs.IT","math.IT","stat.ME"],"primary_cat":"cs.MM","authors_text":"A. Edirisuriya, A. Madanayake, F. M. Bayer, R. J. Cintra","submitted_at":"2017-02-06T22:00:34Z","abstract_excerpt":"The discrete cosine transform (DCT) is the key step in many image and video coding standards. The 8-point DCT is an important special case, possessing several low-complexity approximations widely investigated. However, 16-point DCT transform has energy compaction advantages. In this sense, this paper presents a new 16-point DCT approximation with null multiplicative complexity. The proposed transform matrix is orthogonal and contains only zeros and ones. The proposed transform outperforms the well-know Walsh-Hadamard transform and the current state-of-the-art 16-point approximation. A fast alg"},"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":"1702.01805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2017-02-06T22:00:34Z","cross_cats_sorted":["cs.AR","cs.DS","cs.IT","math.IT","stat.ME"],"title_canon_sha256":"81eaff81fd62bf281d41572778c851d282d70c0399b7cd742cdcf50a19761d19","abstract_canon_sha256":"d5e1eda3f9f56bde0a318c4b0b1c7aac92b225baebd89e16f235546645b5cdab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:11.210031Z","signature_b64":"lRenNzOLCsxHm5FotxN1p8Gyk/4GlkL3C5sZdvYZFUk0YMwWcWtfoGHrR8oMXboMqe9TCBEKdTBX8LcFAR6QDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b97063938b8c41d6afb704da1a00119dfebd963b58d925f9d68da29de252b5","last_reissued_at":"2026-05-18T00:51:11.209342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:11.209342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DS","cs.IT","math.IT","stat.ME"],"primary_cat":"cs.MM","authors_text":"A. Edirisuriya, A. Madanayake, F. M. Bayer, R. J. Cintra","submitted_at":"2017-02-06T22:00:34Z","abstract_excerpt":"The discrete cosine transform (DCT) is the key step in many image and video coding standards. The 8-point DCT is an important special case, possessing several low-complexity approximations widely investigated. However, 16-point DCT transform has energy compaction advantages. In this sense, this paper presents a new 16-point DCT approximation with null multiplicative complexity. The proposed transform matrix is orthogonal and contains only zeros and ones. The proposed transform outperforms the well-know Walsh-Hadamard transform and the current state-of-the-art 16-point approximation. A fast alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01805","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":"1702.01805","created_at":"2026-05-18T00:51:11.209453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01805v1","created_at":"2026-05-18T00:51:11.209453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01805","created_at":"2026-05-18T00:51:11.209453+00:00"},{"alias_kind":"pith_short_12","alias_value":"KK4XAY4TROGE","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KK4XAY4TROGEDVVP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KK4XAY4T","created_at":"2026-05-18T12:31:24.725408+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/KK4XAY4TROGEDVVPW4CNUGQACG","json":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG.json","graph_json":"https://pith.science/api/pith-number/KK4XAY4TROGEDVVPW4CNUGQACG/graph.json","events_json":"https://pith.science/api/pith-number/KK4XAY4TROGEDVVPW4CNUGQACG/events.json","paper":"https://pith.science/paper/KK4XAY4T"},"agent_actions":{"view_html":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG","download_json":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG.json","view_paper":"https://pith.science/paper/KK4XAY4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01805&json=true","fetch_graph":"https://pith.science/api/pith-number/KK4XAY4TROGEDVVPW4CNUGQACG/graph.json","fetch_events":"https://pith.science/api/pith-number/KK4XAY4TROGEDVVPW4CNUGQACG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/action/storage_attestation","attest_author":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/action/author_attestation","sign_citation":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/action/citation_signature","submit_replication":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/action/replication_record"}},"created_at":"2026-05-18T00:51:11.209453+00:00","updated_at":"2026-05-18T00:51:11.209453+00:00"}