{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P63V6JQVCUOYZDAFUITQAS5SMP","short_pith_number":"pith:P63V6JQV","schema_version":"1.0","canonical_sha256":"7fb75f2615151d8c8c05a227004bb263dc36bff9db54a4828b60ef9bd2e196f0","source":{"kind":"arxiv","id":"1606.02893","version":3},"attestation_state":"computed","paper":{"title":"Optimal compression for identically prepared qubit states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Giulio Chiribella, Masahito Hayashi, Yuxiang Yang","submitted_at":"2016-06-09T10:13:01Z","abstract_excerpt":"We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo's information quantity and are attained through use of the optimal universal cloning machine, which finds here a novel application to quantum Shannon theory."},"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":"1606.02893","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-06-09T10:13:01Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"ad6c43586f06c2ebcd5ae256e2e95f59a2c5e000d9f531d39be68c8f29417cd6","abstract_canon_sha256":"1bfda9627a0ff13ff252fcab4cdf378dcac60fdde88acf07544777d5ee715532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:06.336941Z","signature_b64":"q0GEtY4tcw7t9YnnfNPumQewRElzjpQ4mld7taPineBENawSw27OqZ9tJkpMFbHmUzvDXPKL+V/Wc63FY8xHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb75f2615151d8c8c05a227004bb263dc36bff9db54a4828b60ef9bd2e196f0","last_reissued_at":"2026-05-18T00:56:06.336583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:06.336583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal compression for identically prepared qubit states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Giulio Chiribella, Masahito Hayashi, Yuxiang Yang","submitted_at":"2016-06-09T10:13:01Z","abstract_excerpt":"We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo's information quantity and are attained through use of the optimal universal cloning machine, which finds here a novel application to quantum Shannon theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02893","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":""},"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":"1606.02893","created_at":"2026-05-18T00:56:06.336641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02893v3","created_at":"2026-05-18T00:56:06.336641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02893","created_at":"2026-05-18T00:56:06.336641+00:00"},{"alias_kind":"pith_short_12","alias_value":"P63V6JQVCUOY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P63V6JQVCUOYZDAF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P63V6JQV","created_at":"2026-05-18T12:30:36.002864+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/P63V6JQVCUOYZDAFUITQAS5SMP","json":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP.json","graph_json":"https://pith.science/api/pith-number/P63V6JQVCUOYZDAFUITQAS5SMP/graph.json","events_json":"https://pith.science/api/pith-number/P63V6JQVCUOYZDAFUITQAS5SMP/events.json","paper":"https://pith.science/paper/P63V6JQV"},"agent_actions":{"view_html":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP","download_json":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP.json","view_paper":"https://pith.science/paper/P63V6JQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02893&json=true","fetch_graph":"https://pith.science/api/pith-number/P63V6JQVCUOYZDAFUITQAS5SMP/graph.json","fetch_events":"https://pith.science/api/pith-number/P63V6JQVCUOYZDAFUITQAS5SMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP/action/storage_attestation","attest_author":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP/action/author_attestation","sign_citation":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP/action/citation_signature","submit_replication":"https://pith.science/pith/P63V6JQVCUOYZDAFUITQAS5SMP/action/replication_record"}},"created_at":"2026-05-18T00:56:06.336641+00:00","updated_at":"2026-05-18T00:56:06.336641+00:00"}