{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:CXSWDSS3JNM55IXXMQMRXBMHVV","short_pith_number":"pith:CXSWDSS3","schema_version":"1.0","canonical_sha256":"15e561ca5b4b59dea2f764191b8587ad69112bbe79ed51419b22b86c5999792c","source":{"kind":"arxiv","id":"math/9705212","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Redundancies for Universal Quantum Coding","license":"","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.PR","authors_text":"Christian Krattenthaler, Paul B. Slater","submitted_at":"1997-05-02T00:00:00Z","abstract_excerpt":"Clarke and Barron have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of this result for the two-level {\\it quantum} systems. We restrict our considerations to prior probability distributions belonging to a certain one-parameter family, $q(u)$, $-\\infty < u < 1$. Within this setting, we are able to compute exact redundancy formulas, for which we find the asymptotic limits. We compare our quantum asymptotic redundancy formulas to "},"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":"math/9705212","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"1997-05-02T00:00:00Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"36b96c46390bc4272d780b6de12729a0fcb4ef46091f3d94989285a298ad2f54","abstract_canon_sha256":"f1fc93657b9e04f328ac097f32482dc27d8483a228d4f37d7e88f9c60178b4b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:05.000767Z","signature_b64":"2H7CKPJrsB+zKozv+7EIbp30ykXoUCcNvJnegn8lhNAqdHPlPtgctBH2rKXePnGG9hVrmr7IyLmKzbLQYDBFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15e561ca5b4b59dea2f764191b8587ad69112bbe79ed51419b22b86c5999792c","last_reissued_at":"2026-05-18T00:58:05.000369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:05.000369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Redundancies for Universal Quantum Coding","license":"","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.PR","authors_text":"Christian Krattenthaler, Paul B. Slater","submitted_at":"1997-05-02T00:00:00Z","abstract_excerpt":"Clarke and Barron have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of this result for the two-level {\\it quantum} systems. We restrict our considerations to prior probability distributions belonging to a certain one-parameter family, $q(u)$, $-\\infty < u < 1$. Within this setting, we are able to compute exact redundancy formulas, for which we find the asymptotic limits. We compare our quantum asymptotic redundancy formulas to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9705212","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/9705212","created_at":"2026-05-18T00:58:05.000430+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9705212v1","created_at":"2026-05-18T00:58:05.000430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9705212","created_at":"2026-05-18T00:58:05.000430+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXSWDSS3JNM5","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXSWDSS3JNM55IXX","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXSWDSS3","created_at":"2026-05-18T12:25:48.327863+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/CXSWDSS3JNM55IXXMQMRXBMHVV","json":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV.json","graph_json":"https://pith.science/api/pith-number/CXSWDSS3JNM55IXXMQMRXBMHVV/graph.json","events_json":"https://pith.science/api/pith-number/CXSWDSS3JNM55IXXMQMRXBMHVV/events.json","paper":"https://pith.science/paper/CXSWDSS3"},"agent_actions":{"view_html":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV","download_json":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV.json","view_paper":"https://pith.science/paper/CXSWDSS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9705212&json=true","fetch_graph":"https://pith.science/api/pith-number/CXSWDSS3JNM55IXXMQMRXBMHVV/graph.json","fetch_events":"https://pith.science/api/pith-number/CXSWDSS3JNM55IXXMQMRXBMHVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV/action/storage_attestation","attest_author":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV/action/author_attestation","sign_citation":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV/action/citation_signature","submit_replication":"https://pith.science/pith/CXSWDSS3JNM55IXXMQMRXBMHVV/action/replication_record"}},"created_at":"2026-05-18T00:58:05.000430+00:00","updated_at":"2026-05-18T00:58:05.000430+00:00"}