{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SRYM2SJ7SU5GXMG7WQBQZD5AO2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"918ffcbe8c728da4d63cf5ab2259290f53886bc214b22c113ecee30989af15d8","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-06T14:09:16Z","title_canon_sha256":"e9972f62b6bd1163ae176adfffc787ff3b227eb67ad5491e4c5a5c3c6743cffb"},"schema_version":"1.0","source":{"id":"2210.02939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.02939","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"2210.02939v2","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02939","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"SRYM2SJ7SU5G","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_16","alias_value":"SRYM2SJ7SU5GXMG7","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_8","alias_value":"SRYM2SJ7","created_at":"2026-07-05T08:07:08Z"}],"graph_snapshots":[{"event_id":"sha256:56c739886ec010ed3c53adf0ba355dc284ebe4ac64ab42453da58a42cddd15d0","target":"graph","created_at":"2026-07-05T08:07:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.02939/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly noiseless gates. In the case of communication over quantum channels, however, this assumption is widely believed to be unrealistic, even in the long-term, due to the fragility of quantum information, which is affected by the process of decoherence. Christandl and M\\\"uller-Hermes have therefore initiated the study of fault-tolerant channel coding for quantum chann","authors_text":"Alexander M\\\"uller-Hermes, Matthias Christandl, Paula Belzig","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-06T14:09:16Z","title":"Fault-tolerant Coding for Entanglement-Assisted Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02939","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7a713a2e3b45aa8f5f3dfc299e507a08151ba42228c2ad845da65cd6c057d6b","target":"record","created_at":"2026-07-05T08:07:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"918ffcbe8c728da4d63cf5ab2259290f53886bc214b22c113ecee30989af15d8","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-06T14:09:16Z","title_canon_sha256":"e9972f62b6bd1163ae176adfffc787ff3b227eb67ad5491e4c5a5c3c6743cffb"},"schema_version":"1.0","source":{"id":"2210.02939","kind":"arxiv","version":2}},"canonical_sha256":"9470cd493f953a6bb0dfb4030c8fa076a514d07505a17b622009307742869c61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9470cd493f953a6bb0dfb4030c8fa076a514d07505a17b622009307742869c61","first_computed_at":"2026-07-05T08:07:08.068880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:08.068880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7v/bWx9gUkVeFUAgDxGgFqKxJNji3KwZrYsg7jXH28MdCsJ1jT/A846SWDa2/ZtcbLxWMvTjeXDs50bRUVULAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:08.069397Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.02939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7a713a2e3b45aa8f5f3dfc299e507a08151ba42228c2ad845da65cd6c057d6b","sha256:56c739886ec010ed3c53adf0ba355dc284ebe4ac64ab42453da58a42cddd15d0"],"state_sha256":"cc1d3b64723331a185ec6d07dcabfb2aeb881369cff496c4929ac0ca9f06755c"}