{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VMGC2R3Y7CGFEHMITHQDQTTCLK","short_pith_number":"pith:VMGC2R3Y","schema_version":"1.0","canonical_sha256":"ab0c2d4778f88c521d8899e0384e625abb2789c4fe24145950ee5d6f53848a9f","source":{"kind":"arxiv","id":"1710.11200","version":1},"attestation_state":"computed","paper":{"title":"VLSI Computational Architectures for the Arithmetic Cosine Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MM","math.NA","stat.ME"],"primary_cat":"cs.AR","authors_text":"A. Madanayake, J. Adikari, N. Rajapaksha, R. J. Cintra, V. S. Dimitrov","submitted_at":"2017-10-30T19:06:19Z","abstract_excerpt":"The discrete cosine transform (DCT) is a widely-used and important signal processing tool employed in a plethora of applications. Typical fast algorithms for nearly-exact computation of DCT require floating point arithmetic, are multiplier intensive, and accumulate round-off errors. Recently proposed fast algorithm arithmetic cosine transform (ACT) calculates the DCT exactly using only additions and integer constant multiplications, with very low area complexity, for null mean input sequences. The ACT can also be computed non-exactly for any input sequence, with low area complexity and low pow"},"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":"1710.11200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-10-30T19:06:19Z","cross_cats_sorted":["cs.DS","cs.MM","math.NA","stat.ME"],"title_canon_sha256":"f6c2e2046cfac34ed593bc8cd2e599a7f547ca0d3cd21d6c865f82fe23cd94f2","abstract_canon_sha256":"da3434dce63ab5521212e0967ef7ee439c3e022df7b8f52644f0a6ad6efadbf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:44.603638Z","signature_b64":"Q/sFGwmApOhVi9oi/brgRoadd+6ox+U4usNWdJD1ZCMcXS5RJ5K2Cf5QqcAIlHeD5cTkCgETW+7uhLEr3hz3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab0c2d4778f88c521d8899e0384e625abb2789c4fe24145950ee5d6f53848a9f","last_reissued_at":"2026-05-18T00:31:44.603111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:44.603111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VLSI Computational Architectures for the Arithmetic Cosine Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MM","math.NA","stat.ME"],"primary_cat":"cs.AR","authors_text":"A. Madanayake, J. Adikari, N. Rajapaksha, R. J. Cintra, V. S. Dimitrov","submitted_at":"2017-10-30T19:06:19Z","abstract_excerpt":"The discrete cosine transform (DCT) is a widely-used and important signal processing tool employed in a plethora of applications. Typical fast algorithms for nearly-exact computation of DCT require floating point arithmetic, are multiplier intensive, and accumulate round-off errors. Recently proposed fast algorithm arithmetic cosine transform (ACT) calculates the DCT exactly using only additions and integer constant multiplications, with very low area complexity, for null mean input sequences. The ACT can also be computed non-exactly for any input sequence, with low area complexity and low pow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11200","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":"1710.11200","created_at":"2026-05-18T00:31:44.603195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11200v1","created_at":"2026-05-18T00:31:44.603195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11200","created_at":"2026-05-18T00:31:44.603195+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMGC2R3Y7CGF","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMGC2R3Y7CGFEHMI","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMGC2R3Y","created_at":"2026-05-18T12:31:49.984773+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/VMGC2R3Y7CGFEHMITHQDQTTCLK","json":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK.json","graph_json":"https://pith.science/api/pith-number/VMGC2R3Y7CGFEHMITHQDQTTCLK/graph.json","events_json":"https://pith.science/api/pith-number/VMGC2R3Y7CGFEHMITHQDQTTCLK/events.json","paper":"https://pith.science/paper/VMGC2R3Y"},"agent_actions":{"view_html":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK","download_json":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK.json","view_paper":"https://pith.science/paper/VMGC2R3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11200&json=true","fetch_graph":"https://pith.science/api/pith-number/VMGC2R3Y7CGFEHMITHQDQTTCLK/graph.json","fetch_events":"https://pith.science/api/pith-number/VMGC2R3Y7CGFEHMITHQDQTTCLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK/action/storage_attestation","attest_author":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK/action/author_attestation","sign_citation":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK/action/citation_signature","submit_replication":"https://pith.science/pith/VMGC2R3Y7CGFEHMITHQDQTTCLK/action/replication_record"}},"created_at":"2026-05-18T00:31:44.603195+00:00","updated_at":"2026-05-18T00:31:44.603195+00:00"}