{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UDB372BRBLUL5IZYNY5GUCUKZH","short_pith_number":"pith:UDB372BR","schema_version":"1.0","canonical_sha256":"a0c3bfe8310ae8bea3386e3a6a0a8ac9cd882ae73cdac85e9ec9337a2de17bf6","source":{"kind":"arxiv","id":"1612.00807","version":1},"attestation_state":"computed","paper":{"title":"Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"cs.MM","authors_text":"A. Madanayake, F. M. Bayer, R. J. Cintra, S. Kulasekera, V. A. Coutinho","submitted_at":"2016-12-02T19:47:28Z","abstract_excerpt":"Due to its remarkable energy compaction properties, the discrete cosine transform (DCT) is employed in a multitude of compression standards, such as JPEG and H.265/HEVC. Several low-complexity integer approximations for the DCT have been proposed for both 1-D and 2-D signal analysis. The increasing demand for low-complexity, energy efficient methods require algorithms with even lower computational costs. In this paper, new 8-point DCT approximations with very low arithmetic complexity are presented. The new transforms are proposed based on pruning state-of-the-art DCT approximations. The propo"},"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":"1612.00807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-12-02T19:47:28Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"91cbd4f48381bdd4f1e44dbeeed6bdf757ab7de1241d32d841ca931b3eb24789","abstract_canon_sha256":"3cd7f049abfa6392845615da8a2ed12e7897481614a7df3eb333872d065bc3a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:59.026753Z","signature_b64":"F4mIza7NOPKqwQQwabYFbxfqVjKcUpGVa3bFOEj6/6FjuOjndI2SCzZrs0QUHQAv5WPSvx8Z/arLVoM4JjOAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0c3bfe8310ae8bea3386e3a6a0a8ac9cd882ae73cdac85e9ec9337a2de17bf6","last_reissued_at":"2026-05-18T00:55:59.026093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:59.026093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"cs.MM","authors_text":"A. Madanayake, F. M. Bayer, R. J. Cintra, S. Kulasekera, V. A. Coutinho","submitted_at":"2016-12-02T19:47:28Z","abstract_excerpt":"Due to its remarkable energy compaction properties, the discrete cosine transform (DCT) is employed in a multitude of compression standards, such as JPEG and H.265/HEVC. Several low-complexity integer approximations for the DCT have been proposed for both 1-D and 2-D signal analysis. The increasing demand for low-complexity, energy efficient methods require algorithms with even lower computational costs. In this paper, new 8-point DCT approximations with very low arithmetic complexity are presented. The new transforms are proposed based on pruning state-of-the-art DCT approximations. The propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00807","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":"1612.00807","created_at":"2026-05-18T00:55:59.026219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00807v1","created_at":"2026-05-18T00:55:59.026219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00807","created_at":"2026-05-18T00:55:59.026219+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDB372BRBLUL","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDB372BRBLUL5IZY","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDB372BR","created_at":"2026-05-18T12:30:46.583412+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/UDB372BRBLUL5IZYNY5GUCUKZH","json":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH.json","graph_json":"https://pith.science/api/pith-number/UDB372BRBLUL5IZYNY5GUCUKZH/graph.json","events_json":"https://pith.science/api/pith-number/UDB372BRBLUL5IZYNY5GUCUKZH/events.json","paper":"https://pith.science/paper/UDB372BR"},"agent_actions":{"view_html":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH","download_json":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH.json","view_paper":"https://pith.science/paper/UDB372BR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00807&json=true","fetch_graph":"https://pith.science/api/pith-number/UDB372BRBLUL5IZYNY5GUCUKZH/graph.json","fetch_events":"https://pith.science/api/pith-number/UDB372BRBLUL5IZYNY5GUCUKZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH/action/storage_attestation","attest_author":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH/action/author_attestation","sign_citation":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH/action/citation_signature","submit_replication":"https://pith.science/pith/UDB372BRBLUL5IZYNY5GUCUKZH/action/replication_record"}},"created_at":"2026-05-18T00:55:59.026219+00:00","updated_at":"2026-05-18T00:55:59.026219+00:00"}