{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:6NQCMDBCKEYVI5X2BKDDPH2IQD","short_pith_number":"pith:6NQCMDBC","schema_version":"1.0","canonical_sha256":"f360260c2251315476fa0a86379f4880f217b4d3b1b3696c42243daaeff00175","source":{"kind":"arxiv","id":"quant-ph/0601043","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601043","created_at":"2026-07-04T14:52:56.926666+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601043v2","created_at":"2026-07-04T14:52:56.926666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601043","created_at":"2026-07-04T14:52:56.926666+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NQCMDBCKEYV","created_at":"2026-07-04T14:52:56.926666+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NQCMDBCKEYVI5X2","created_at":"2026-07-04T14:52:56.926666+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NQCMDBC","created_at":"2026-07-04T14:52:56.926666+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/6NQCMDBCKEYVI5X2BKDDPH2IQD","json":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD.json","graph_json":"https://pith.science/api/pith-number/6NQCMDBCKEYVI5X2BKDDPH2IQD/graph.json","events_json":"https://pith.science/api/pith-number/6NQCMDBCKEYVI5X2BKDDPH2IQD/events.json","paper":"https://pith.science/paper/6NQCMDBC"},"agent_actions":{"view_html":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD","download_json":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD.json","view_paper":"https://pith.science/paper/6NQCMDBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0601043&json=true","fetch_graph":"https://pith.science/api/pith-number/6NQCMDBCKEYVI5X2BKDDPH2IQD/graph.json","fetch_events":"https://pith.science/api/pith-number/6NQCMDBCKEYVI5X2BKDDPH2IQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/action/storage_attestation","attest_author":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/action/author_attestation","sign_citation":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/action/citation_signature","submit_replication":"https://pith.science/pith/6NQCMDBCKEYVI5X2BKDDPH2IQD/action/replication_record"}},"created_at":"2026-07-04T14:52:56.926666+00:00","updated_at":"2026-07-04T14:52:56.926666+00:00"}