{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KK4XAY4TROGEDVVPW4CNUGQACG","short_pith_number":"pith:KK4XAY4T","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"},"canonical_sha256":"52b97063938b8c41d6afb704da1a00119dfebd963b58d925f9d68da29de252b5","source":{"kind":"arxiv","id":"1702.01805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01805","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01805v1","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01805","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"KK4XAY4TROGE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KK4XAY4TROGEDVVP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KK4XAY4T","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KK4XAY4TROGEDVVPW4CNUGQACG","target":"record","payload":{"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"},"canonical_sha256":"52b97063938b8c41d6afb704da1a00119dfebd963b58d925f9d68da29de252b5","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"},"source_kind":"arxiv","source_id":"1702.01805","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1HAEYt1mHun2DCxZkdH2eLR1Ew3m+0fK+Zmqj317k8kXkBCVQkXqBgMp/LXq3STUaB8niC8OM8cQGxE4nwqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:14:10.653811Z"},"content_sha256":"6aa5f930a7b254c64f271b159bfc2762fc964114602445b9a5841e91c0ef01b5","schema_version":"1.0","event_id":"sha256:6aa5f930a7b254c64f271b159bfc2762fc964114602445b9a5841e91c0ef01b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KK4XAY4TROGEDVVPW4CNUGQACG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBAurS/XRAJKX17kdVw5LjtYn5SZEKTPgAcYDRlbnBjBapwr/yLgQkrpeR489+0o50+hUn8ZSo/OPgisFMm8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:14:10.654544Z"},"content_sha256":"3f6e6aca3b3752592f293e0a36277182f3bf0429de1e0e828de5f777e5c28549","schema_version":"1.0","event_id":"sha256:3f6e6aca3b3752592f293e0a36277182f3bf0429de1e0e828de5f777e5c28549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/bundle.json","state_url":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK4XAY4TROGEDVVPW4CNUGQACG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T04:14:10Z","links":{"resolver":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG","bundle":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/bundle.json","state":"https://pith.science/pith/KK4XAY4TROGEDVVPW4CNUGQACG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK4XAY4TROGEDVVPW4CNUGQACG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KK4XAY4TROGEDVVPW4CNUGQACG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d5e1eda3f9f56bde0a318c4b0b1c7aac92b225baebd89e16f235546645b5cdab","cross_cats_sorted":["cs.AR","cs.DS","cs.IT","math.IT","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2017-02-06T22:00:34Z","title_canon_sha256":"81eaff81fd62bf281d41572778c851d282d70c0399b7cd742cdcf50a19761d19"},"schema_version":"1.0","source":{"id":"1702.01805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01805","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01805v1","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01805","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"KK4XAY4TROGE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KK4XAY4TROGEDVVP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KK4XAY4T","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:3f6e6aca3b3752592f293e0a36277182f3bf0429de1e0e828de5f777e5c28549","target":"graph","created_at":"2026-05-18T00:51:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"A. Edirisuriya, A. Madanayake, F. M. Bayer, R. J. Cintra","cross_cats":["cs.AR","cs.DS","cs.IT","math.IT","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2017-02-06T22:00:34Z","title":"A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01805","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6aa5f930a7b254c64f271b159bfc2762fc964114602445b9a5841e91c0ef01b5","target":"record","created_at":"2026-05-18T00:51:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d5e1eda3f9f56bde0a318c4b0b1c7aac92b225baebd89e16f235546645b5cdab","cross_cats_sorted":["cs.AR","cs.DS","cs.IT","math.IT","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2017-02-06T22:00:34Z","title_canon_sha256":"81eaff81fd62bf281d41572778c851d282d70c0399b7cd742cdcf50a19761d19"},"schema_version":"1.0","source":{"id":"1702.01805","kind":"arxiv","version":1}},"canonical_sha256":"52b97063938b8c41d6afb704da1a00119dfebd963b58d925f9d68da29de252b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52b97063938b8c41d6afb704da1a00119dfebd963b58d925f9d68da29de252b5","first_computed_at":"2026-05-18T00:51:11.209342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:11.209342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lRenNzOLCsxHm5FotxN1p8Gyk/4GlkL3C5sZdvYZFUk0YMwWcWtfoGHrR8oMXboMqe9TCBEKdTBX8LcFAR6QDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:11.210031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa5f930a7b254c64f271b159bfc2762fc964114602445b9a5841e91c0ef01b5","sha256:3f6e6aca3b3752592f293e0a36277182f3bf0429de1e0e828de5f777e5c28549"],"state_sha256":"1a545753ca42dd9814eed8dc1163ef5b563ba4305d56c5cc18a3769c66f7a043"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZDYxWRr2ng7hSmtY6qnFG5kp/Ch/Fyv4HEydDN/PeTYIvbbDdzSiojnuRoXKzNK+4u3fsZkRY5sWMnCMwUfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:14:10.658022Z","bundle_sha256":"0f1afbb1937f014338060b9a78bfa8a2cac1417bf80757c56447bdb9189e21f7"}}