{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HFSXQ6JOKW3EHEQJEJF747ODYB","short_pith_number":"pith:HFSXQ6JO","schema_version":"1.0","canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","source":{"kind":"arxiv","id":"1502.00592","version":2},"attestation_state":"computed","paper":{"title":"A Class of DCT Approximations Based on the Feig-Winograd Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.MM","cs.NA","stat.AP"],"primary_cat":"stat.ME","authors_text":"C. J. Tablada, F. M. Bayer, R. J. Cintra","submitted_at":"2015-02-02T19:39:46Z","abstract_excerpt":"A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a comprehensive multicriteria optimization problem, we identified several new DCT approximations. Obtained solutions were sought to possess the following properties: (i) low multiplierless computational complexity, (ii) orthogonality or near orthogonality, (iii) low complexity invertibility, and (iv) close proximity and performance to the exact DCT. Proposed "},"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.00592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-02T19:39:46Z","cross_cats_sorted":["cs.CV","cs.MM","cs.NA","stat.AP"],"title_canon_sha256":"5deb1d11fe95e5efe19bc977c8ec993cc46e0c080b48e671f941b1a6bb35b02d","abstract_canon_sha256":"b2c5b612bdca2304c4dae1c2612b2571e121b569785c1b280037881b81e44b9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.252973Z","signature_b64":"Y6FvxBIGXN9BMr55sNYASJWeZdcBwz0ReHcF5lIHe+v2syc9aMuehAZs4874HxJvQbsUPIxTyd97WsaH6THGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","last_reissued_at":"2026-05-18T01:11:00.252370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.252370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Class of DCT Approximations Based on the Feig-Winograd Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.MM","cs.NA","stat.AP"],"primary_cat":"stat.ME","authors_text":"C. J. Tablada, F. M. Bayer, R. J. Cintra","submitted_at":"2015-02-02T19:39:46Z","abstract_excerpt":"A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a comprehensive multicriteria optimization problem, we identified several new DCT approximations. Obtained solutions were sought to possess the following properties: (i) low multiplierless computational complexity, (ii) orthogonality or near orthogonality, (iii) low complexity invertibility, and (iv) close proximity and performance to the exact DCT. Proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00592","kind":"arxiv","version":2},"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.00592","created_at":"2026-05-18T01:11:00.252464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00592v2","created_at":"2026-05-18T01:11:00.252464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00592","created_at":"2026-05-18T01:11:00.252464+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFSXQ6JOKW3E","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFSXQ6JOKW3EHEQJ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFSXQ6JO","created_at":"2026-05-18T12:29:25.134429+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/HFSXQ6JOKW3EHEQJEJF747ODYB","json":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB.json","graph_json":"https://pith.science/api/pith-number/HFSXQ6JOKW3EHEQJEJF747ODYB/graph.json","events_json":"https://pith.science/api/pith-number/HFSXQ6JOKW3EHEQJEJF747ODYB/events.json","paper":"https://pith.science/paper/HFSXQ6JO"},"agent_actions":{"view_html":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB","download_json":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB.json","view_paper":"https://pith.science/paper/HFSXQ6JO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00592&json=true","fetch_graph":"https://pith.science/api/pith-number/HFSXQ6JOKW3EHEQJEJF747ODYB/graph.json","fetch_events":"https://pith.science/api/pith-number/HFSXQ6JOKW3EHEQJEJF747ODYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/action/storage_attestation","attest_author":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/action/author_attestation","sign_citation":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/action/citation_signature","submit_replication":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/action/replication_record"}},"created_at":"2026-05-18T01:11:00.252464+00:00","updated_at":"2026-05-18T01:11:00.252464+00:00"}