{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:6NQCMDBCKEYVI5X2BKDDPH2IQD","short_pith_number":"pith:6NQCMDBC","canonical_record":{"source":{"id":"quant-ph/0601043","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-08T13:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"ac55cac7a1c1b05455b8961b6d7635e66f31407ad841d49562a92ba49a6c643f","abstract_canon_sha256":"e75e63cf421f194e9aa5939a5e6013695a9e1271bc54f4b9b4f3572d06a2a202"},"schema_version":"1.0"},"canonical_sha256":"f360260c2251315476fa0a86379f4880f217b4d3b1b3696c42243daaeff00175","source":{"kind":"arxiv","id":"quant-ph/0601043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601043","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601043v2","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601043","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"6NQCMDBCKEYV","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"pith_short_16","alias_value":"6NQCMDBCKEYVI5X2","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"pith_short_8","alias_value":"6NQCMDBC","created_at":"2026-07-04T14:52:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:6NQCMDBCKEYVI5X2BKDDPH2IQD","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0601043","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-08T13:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"ac55cac7a1c1b05455b8961b6d7635e66f31407ad841d49562a92ba49a6c643f","abstract_canon_sha256":"e75e63cf421f194e9aa5939a5e6013695a9e1271bc54f4b9b4f3572d06a2a202"},"schema_version":"1.0"},"canonical_sha256":"f360260c2251315476fa0a86379f4880f217b4d3b1b3696c42243daaeff00175","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:52:56.926963Z","signature_b64":"FmWw36TwEacIQL0G+VeLJGm/x1tjI/OZXD4FgNBerqSeEt30ieW8MY9keE9r0sk96Hz/unfAqg1DkoLn2NABDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f360260c2251315476fa0a86379f4880f217b4d3b1b3696c42243daaeff00175","last_reissued_at":"2026-07-04T14:52:56.926607Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:52:56.926607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0601043","source_version":2,"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-07-04T14:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fFf3lja43uLX1KYrc4iGBpiuSMr+oKYbRIGVXeV7yq2cInfYj8BuZLdxxIPqzAmWVwCZWzo1c7+56zJe6zrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:02:57.252087Z"},"content_sha256":"6bfc9968f45feb316fcbab6698e8754c43decda3f7e727f09f127ee8354249e0","schema_version":"1.0","event_id":"sha256:6bfc9968f45feb316fcbab6698e8754c43decda3f7e727f09f127ee8354249e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:6NQCMDBCKEYVI5X2BKDDPH2IQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Discrete Cosine Transform for Image Compression","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chao Yang Pang, Guang Can Guo, Zheng Wei Zhou","submitted_at":"2006-01-08T13:52:41Z","abstract_excerpt":"Discrete Cosine Transform (DCT) is very important in image compression. Classical 1-D DCT and 2-D DCT has time complexity O(NlogN) and O(N²logN) respectively. This paper presents a quantum DCT iteration, and constructs a quantum 1-D and 2-D DCT algorithm for image compression by using the iteration. The presented 1-D and 2-D DCT has time complexity O(sqrt(N)) and O(N) respectively. In addition, the method presented in this paper generalizes the famous Grover's algorithm to solve complex unstructured search problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0601043","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0601043/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UJf1givDgRuEBvXzRT8FYcLdARvc7u14+2c012Gh6LBZpq+tTaMOsBTq4bnhRVho4oPoPKVJQSjRw8Brp02Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:02:57.252623Z"},"content_sha256":"0d44139723a26e23b85644100f5fb8ac242654204039cf434f6d652764ef5de9","schema_version":"1.0","event_id":"sha256:0d44139723a26e23b85644100f5fb8ac242654204039cf434f6d652764ef5de9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/bundle.json","state_url":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/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-08-09T13:02:57Z","links":{"resolver":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD","bundle":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/bundle.json","state":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:6NQCMDBCKEYVI5X2BKDDPH2IQD","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":"e75e63cf421f194e9aa5939a5e6013695a9e1271bc54f4b9b4f3572d06a2a202","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-08T13:52:41Z","title_canon_sha256":"ac55cac7a1c1b05455b8961b6d7635e66f31407ad841d49562a92ba49a6c643f"},"schema_version":"1.0","source":{"id":"quant-ph/0601043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601043","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601043v2","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601043","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"6NQCMDBCKEYV","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"pith_short_16","alias_value":"6NQCMDBCKEYVI5X2","created_at":"2026-07-04T14:52:56Z"},{"alias_kind":"pith_short_8","alias_value":"6NQCMDBC","created_at":"2026-07-04T14:52:56Z"}],"graph_snapshots":[{"event_id":"sha256:0d44139723a26e23b85644100f5fb8ac242654204039cf434f6d652764ef5de9","target":"graph","created_at":"2026-07-04T14:52:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0601043/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Discrete Cosine Transform (DCT) is very important in image compression. Classical 1-D DCT and 2-D DCT has time complexity O(NlogN) and O(N²logN) respectively. This paper presents a quantum DCT iteration, and constructs a quantum 1-D and 2-D DCT algorithm for image compression by using the iteration. The presented 1-D and 2-D DCT has time complexity O(sqrt(N)) and O(N) respectively. In addition, the method presented in this paper generalizes the famous Grover's algorithm to solve complex unstructured search problem.","authors_text":"Chao Yang Pang, Guang Can Guo, Zheng Wei Zhou","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-01-08T13:52:41Z","title":"Quantum Discrete Cosine Transform for Image Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0601043","kind":"arxiv","version":2},"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:6bfc9968f45feb316fcbab6698e8754c43decda3f7e727f09f127ee8354249e0","target":"record","created_at":"2026-07-04T14:52:56Z","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":"e75e63cf421f194e9aa5939a5e6013695a9e1271bc54f4b9b4f3572d06a2a202","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-08T13:52:41Z","title_canon_sha256":"ac55cac7a1c1b05455b8961b6d7635e66f31407ad841d49562a92ba49a6c643f"},"schema_version":"1.0","source":{"id":"quant-ph/0601043","kind":"arxiv","version":2}},"canonical_sha256":"f360260c2251315476fa0a86379f4880f217b4d3b1b3696c42243daaeff00175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f360260c2251315476fa0a86379f4880f217b4d3b1b3696c42243daaeff00175","first_computed_at":"2026-07-04T14:52:56.926607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:52:56.926607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FmWw36TwEacIQL0G+VeLJGm/x1tjI/OZXD4FgNBerqSeEt30ieW8MY9keE9r0sk96Hz/unfAqg1DkoLn2NABDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:52:56.926963Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0601043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bfc9968f45feb316fcbab6698e8754c43decda3f7e727f09f127ee8354249e0","sha256:0d44139723a26e23b85644100f5fb8ac242654204039cf434f6d652764ef5de9"],"state_sha256":"8d5a0f8314f3527d86a960dbf572d487ba4a84aa6b340afa1b8d2d256fe0f5f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGirPUHlU+nFX7FhoFX/JHEXE8epeSYZgXCJW33jQhcL5P6gi09qIKulTmWeKM/lPI0Z0mFm7PD8eo+qGa58Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T13:02:57.257840Z","bundle_sha256":"cc7ec9cc164d8a0227fe793998ea11357f564559297f25f33e7eca818e80d497"}}