{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:S7V6U755QYGCBAYHL4P4ZUHJ22","short_pith_number":"pith:S7V6U755","schema_version":"1.0","canonical_sha256":"97ebea7fbd860c2083075f1fccd0e9d686c7fd34a226af90ccf70628a4d053bb","source":{"kind":"arxiv","id":"1007.4611","version":1},"attestation_state":"computed","paper":{"title":"Graph state basis for Pauli Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Li-zhen Jiang, Xiao-Yu Chen","submitted_at":"2010-07-27T03:45:49Z","abstract_excerpt":"We introduce graph state basis diagonalization to calculate the coherent information of a quantum code passing through a Pauli channel. The scheme is 5000 times faster than the best known one for some concatenated repetition codes, providing us a practical constructive way of approaching the quantum capacity of a Pauli channel. The calculation of the coherent information of non-additive quantum code can also be greatly simplified in graph state basis."},"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":"1007.4611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-27T03:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"c783b381ccd614b3f15cb58f7dc5d2f14c8e3fb83e1d89f3667b9480a5091cae","abstract_canon_sha256":"39881618f47945901492229bec660c0dea9b8e261815788fb049955de050c3c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:34.732146Z","signature_b64":"f7NHoaK8lnYsMr8NnSaDqLgki1a8nqPklQo1r7vQYtC94Gm8opmK4TQfJx1cubVZHo9YnfBUfU6oOQu4H1UYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ebea7fbd860c2083075f1fccd0e9d686c7fd34a226af90ccf70628a4d053bb","last_reissued_at":"2026-05-18T04:18:34.731545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:34.731545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph state basis for Pauli Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Li-zhen Jiang, Xiao-Yu Chen","submitted_at":"2010-07-27T03:45:49Z","abstract_excerpt":"We introduce graph state basis diagonalization to calculate the coherent information of a quantum code passing through a Pauli channel. The scheme is 5000 times faster than the best known one for some concatenated repetition codes, providing us a practical constructive way of approaching the quantum capacity of a Pauli channel. The calculation of the coherent information of non-additive quantum code can also be greatly simplified in graph state basis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4611","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":"1007.4611","created_at":"2026-05-18T04:18:34.731621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4611v1","created_at":"2026-05-18T04:18:34.731621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4611","created_at":"2026-05-18T04:18:34.731621+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7V6U755QYGC","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7V6U755QYGCBAYH","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7V6U755","created_at":"2026-05-18T12:26:13.927090+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/S7V6U755QYGCBAYHL4P4ZUHJ22","json":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22.json","graph_json":"https://pith.science/api/pith-number/S7V6U755QYGCBAYHL4P4ZUHJ22/graph.json","events_json":"https://pith.science/api/pith-number/S7V6U755QYGCBAYHL4P4ZUHJ22/events.json","paper":"https://pith.science/paper/S7V6U755"},"agent_actions":{"view_html":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22","download_json":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22.json","view_paper":"https://pith.science/paper/S7V6U755","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4611&json=true","fetch_graph":"https://pith.science/api/pith-number/S7V6U755QYGCBAYHL4P4ZUHJ22/graph.json","fetch_events":"https://pith.science/api/pith-number/S7V6U755QYGCBAYHL4P4ZUHJ22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22/action/storage_attestation","attest_author":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22/action/author_attestation","sign_citation":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22/action/citation_signature","submit_replication":"https://pith.science/pith/S7V6U755QYGCBAYHL4P4ZUHJ22/action/replication_record"}},"created_at":"2026-05-18T04:18:34.731621+00:00","updated_at":"2026-05-18T04:18:34.731621+00:00"}