{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ST233VEJX44ZU54LUWNIQ67EG6","short_pith_number":"pith:ST233VEJ","canonical_record":{"source":{"id":"1606.07414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T19:26:01Z","cross_cats_sorted":["cs.MM","cs.NA","stat.ME"],"title_canon_sha256":"4f61a2f4df684a1beaf35aba7c0da5e5bc262607c88fb9c34b472080de040949","abstract_canon_sha256":"58677a7c72e49c0dcb56fdd86d4e5ba5c959758d18670a6f24e8fa573ae683ab"},"schema_version":"1.0"},"canonical_sha256":"94f5bdd489bf399a778ba59a887be437a5867e5ed9d359cbc3bdf5920b9b4bb2","source":{"kind":"arxiv","id":"1606.07414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07414","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07414v1","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07414","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"ST233VEJX44Z","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"ST233VEJX44ZU54L","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"ST233VEJ","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ST233VEJX44ZU54LUWNIQ67EG6","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T19:26:01Z","cross_cats_sorted":["cs.MM","cs.NA","stat.ME"],"title_canon_sha256":"4f61a2f4df684a1beaf35aba7c0da5e5bc262607c88fb9c34b472080de040949","abstract_canon_sha256":"58677a7c72e49c0dcb56fdd86d4e5ba5c959758d18670a6f24e8fa573ae683ab"},"schema_version":"1.0"},"canonical_sha256":"94f5bdd489bf399a778ba59a887be437a5867e5ed9d359cbc3bdf5920b9b4bb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.137123Z","signature_b64":"QXiJul+SZDsQmD3ewK8YNv9waOAsfnrjmhzu3pVyvR5Gs1tANq5IzNDDxF2lnavL6ME5gZLqiiWG6VJGZ02rCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94f5bdd489bf399a778ba59a887be437a5867e5ed9d359cbc3bdf5920b9b4bb2","last_reissued_at":"2026-05-18T01:11:58.136753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.136753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07414","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-18T01:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9sC096J/GKhYL4A7csQ60DXjXaid62PBVsTOytgN9I6N1b8jG3dHHaHrrrcc0K0SQ6bMnwRleJ7XLYSEnaxwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:56:58.540953Z"},"content_sha256":"b0db8460b5d9a92009b158590b8ecc4ca041ad85764aa0eed197d8e3ac4db932","schema_version":"1.0","event_id":"sha256:b0db8460b5d9a92009b158590b8ecc4ca041ad85764aa0eed197d8e3ac4db932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ST233VEJX44ZU54LUWNIQ67EG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.NA","stat.ME"],"primary_cat":"cs.CV","authors_text":"A. Madanayake, F. M. Bayer, R. J. Cintra, R. S. Oliveira, T. L. T. Silveira","submitted_at":"2016-06-23T19:26:01Z","abstract_excerpt":"An orthogonal 16-point approximate discrete cosine transform (DCT) is introduced. The proposed transform requires neither multiplications nor bit-shifting operations. A fast algorithm based on matrix factorization is introduced, requiring only 44 additions---the lowest arithmetic cost in literature. To assess the introduced transform, computational complexity, similarity with the exact DCT, and coding performance measures are computed. Classical and state-of-the-art 16-point low-complexity transforms were used in a comparative analysis. In the context of image compression, the proposed approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07414","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-18T01:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/gBol+QmlfigW2YcDR46cqB/szP7rSl8GLoTIQKqyag94VtooBrE+tI1wABUKvK1oMeAbRR09Dh2/o6GcuLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:56:58.541570Z"},"content_sha256":"82d989c31e3c7f3e7b01a26d769a7b3a8fd6b00cb6b64bd04195034f3654bb1f","schema_version":"1.0","event_id":"sha256:82d989c31e3c7f3e7b01a26d769a7b3a8fd6b00cb6b64bd04195034f3654bb1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ST233VEJX44ZU54LUWNIQ67EG6/bundle.json","state_url":"https://pith.science/pith/ST233VEJX44ZU54LUWNIQ67EG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ST233VEJX44ZU54LUWNIQ67EG6/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-26T16:56:58Z","links":{"resolver":"https://pith.science/pith/ST233VEJX44ZU54LUWNIQ67EG6","bundle":"https://pith.science/pith/ST233VEJX44ZU54LUWNIQ67EG6/bundle.json","state":"https://pith.science/pith/ST233VEJX44ZU54LUWNIQ67EG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ST233VEJX44ZU54LUWNIQ67EG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ST233VEJX44ZU54LUWNIQ67EG6","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":"58677a7c72e49c0dcb56fdd86d4e5ba5c959758d18670a6f24e8fa573ae683ab","cross_cats_sorted":["cs.MM","cs.NA","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T19:26:01Z","title_canon_sha256":"4f61a2f4df684a1beaf35aba7c0da5e5bc262607c88fb9c34b472080de040949"},"schema_version":"1.0","source":{"id":"1606.07414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07414","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07414v1","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07414","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"ST233VEJX44Z","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"ST233VEJX44ZU54L","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"ST233VEJ","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:82d989c31e3c7f3e7b01a26d769a7b3a8fd6b00cb6b64bd04195034f3654bb1f","target":"graph","created_at":"2026-05-18T01:11:58Z","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":"An orthogonal 16-point approximate discrete cosine transform (DCT) is introduced. The proposed transform requires neither multiplications nor bit-shifting operations. A fast algorithm based on matrix factorization is introduced, requiring only 44 additions---the lowest arithmetic cost in literature. To assess the introduced transform, computational complexity, similarity with the exact DCT, and coding performance measures are computed. Classical and state-of-the-art 16-point low-complexity transforms were used in a comparative analysis. In the context of image compression, the proposed approxi","authors_text":"A. Madanayake, F. M. Bayer, R. J. Cintra, R. S. Oliveira, T. L. T. Silveira","cross_cats":["cs.MM","cs.NA","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T19:26:01Z","title":"Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07414","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:b0db8460b5d9a92009b158590b8ecc4ca041ad85764aa0eed197d8e3ac4db932","target":"record","created_at":"2026-05-18T01:11:58Z","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":"58677a7c72e49c0dcb56fdd86d4e5ba5c959758d18670a6f24e8fa573ae683ab","cross_cats_sorted":["cs.MM","cs.NA","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-23T19:26:01Z","title_canon_sha256":"4f61a2f4df684a1beaf35aba7c0da5e5bc262607c88fb9c34b472080de040949"},"schema_version":"1.0","source":{"id":"1606.07414","kind":"arxiv","version":1}},"canonical_sha256":"94f5bdd489bf399a778ba59a887be437a5867e5ed9d359cbc3bdf5920b9b4bb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94f5bdd489bf399a778ba59a887be437a5867e5ed9d359cbc3bdf5920b9b4bb2","first_computed_at":"2026-05-18T01:11:58.136753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:58.136753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QXiJul+SZDsQmD3ewK8YNv9waOAsfnrjmhzu3pVyvR5Gs1tANq5IzNDDxF2lnavL6ME5gZLqiiWG6VJGZ02rCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:58.137123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0db8460b5d9a92009b158590b8ecc4ca041ad85764aa0eed197d8e3ac4db932","sha256:82d989c31e3c7f3e7b01a26d769a7b3a8fd6b00cb6b64bd04195034f3654bb1f"],"state_sha256":"f6eff65c6bb9c43bfaa7e9f58ac9456da3cd0930e84a62748e946a0d84aa0a90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nX0iVsniqjEynPdmFSOP9hOTGHPqWKE8mtEgKqFtzO0wnaXqS87gV9xlUU1hrw3Kj38dryMR07jDdc1nuLkiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:56:58.544737Z","bundle_sha256":"e02cd867050b388a9ae8098faddb5681a82b64d95d6455b9f361790d94589661"}}