{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NPDFIJVWFS7C3NA3IE7XG4UMGZ","short_pith_number":"pith:NPDFIJVW","schema_version":"1.0","canonical_sha256":"6bc65426b62cbe2db41b413f73728c36725aa81823d8b5591b4df1689e884e66","source":{"kind":"arxiv","id":"2106.13823","version":3},"attestation_state":"computed","paper":{"title":"Quantum Data Compression and Quantum Cross Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","cs.LG","hep-th","math.IT"],"primary_cat":"quant-ph","authors_text":"Zhou Shangnan","submitted_at":"2021-06-25T18:00:33Z","abstract_excerpt":"The emerging field of quantum machine learning has the potential of revolutionizing our perspectives of quantum computing and artificial intelligence. In the predominantly empirical realm of quantum machine learning, a theoretical void persists. This paper addresses the gap by highlighting the quantum cross entropy, a pivotal counterpart to the classical cross entropy. We establish quantum cross entropy's role in quantum data compression, a fundamental machine learning task, by demonstrating that it acts as the compression rate for sub-optimal quantum source coding. Our approach involves a nov"},"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":"2106.13823","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-25T18:00:33Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","cs.LG","hep-th","math.IT"],"title_canon_sha256":"3432d4b70734bf696aef9c5b3eea10f76620f5f794d6c42938569ad9b1c06857","abstract_canon_sha256":"c8cc6639482cfd66f2900e9498403472570bac168964db2186d30e10595ed18b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:32.250784Z","signature_b64":"o7EgJ9MLWL7MMvuB84dT/pLekBkGFjy+pF2E3/5/FIZWTrsY1BE9qZgsa3I6CTnLthXSYSkb8HZ3ghAuulE2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bc65426b62cbe2db41b413f73728c36725aa81823d8b5591b4df1689e884e66","last_reissued_at":"2026-07-05T07:11:32.250347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:32.250347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Data Compression and Quantum Cross Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","cs.LG","hep-th","math.IT"],"primary_cat":"quant-ph","authors_text":"Zhou Shangnan","submitted_at":"2021-06-25T18:00:33Z","abstract_excerpt":"The emerging field of quantum machine learning has the potential of revolutionizing our perspectives of quantum computing and artificial intelligence. In the predominantly empirical realm of quantum machine learning, a theoretical void persists. This paper addresses the gap by highlighting the quantum cross entropy, a pivotal counterpart to the classical cross entropy. We establish quantum cross entropy's role in quantum data compression, a fundamental machine learning task, by demonstrating that it acts as the compression rate for sub-optimal quantum source coding. Our approach involves a nov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13823","kind":"arxiv","version":3},"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/2106.13823/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":"2106.13823","created_at":"2026-07-05T07:11:32.250406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13823v3","created_at":"2026-07-05T07:11:32.250406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13823","created_at":"2026-07-05T07:11:32.250406+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPDFIJVWFS7C","created_at":"2026-07-05T07:11:32.250406+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPDFIJVWFS7C3NA3","created_at":"2026-07-05T07:11:32.250406+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPDFIJVW","created_at":"2026-07-05T07:11:32.250406+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.01221","citing_title":"Assessing GPT Model Uncertainty in Mathematical OCR Tasks via Entropy Analysis","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ","json":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ.json","graph_json":"https://pith.science/api/pith-number/NPDFIJVWFS7C3NA3IE7XG4UMGZ/graph.json","events_json":"https://pith.science/api/pith-number/NPDFIJVWFS7C3NA3IE7XG4UMGZ/events.json","paper":"https://pith.science/paper/NPDFIJVW"},"agent_actions":{"view_html":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ","download_json":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ.json","view_paper":"https://pith.science/paper/NPDFIJVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13823&json=true","fetch_graph":"https://pith.science/api/pith-number/NPDFIJVWFS7C3NA3IE7XG4UMGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NPDFIJVWFS7C3NA3IE7XG4UMGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ/action/storage_attestation","attest_author":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ/action/author_attestation","sign_citation":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ/action/citation_signature","submit_replication":"https://pith.science/pith/NPDFIJVWFS7C3NA3IE7XG4UMGZ/action/replication_record"}},"created_at":"2026-07-05T07:11:32.250406+00:00","updated_at":"2026-07-05T07:11:32.250406+00:00"}