{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7CQAMU6HZY5VBM7Y3OCJHG635F","short_pith_number":"pith:7CQAMU6H","canonical_record":{"source":{"id":"1111.1555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-07T12:07:52Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"03e4edec38604391f62c06a130efdb5c57e504f8b395cc62009b88da2021121e","abstract_canon_sha256":"9e7c5e614b4d88baa0eac99007cdf3671292a5510b349d6ffd371fa796249cdb"},"schema_version":"1.0"},"canonical_sha256":"f8a00653c7ce3b50b3f8db84939bdbe9524cc304fda3b747dd82914ce7800002","source":{"kind":"arxiv","id":"1111.1555","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1555","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1555v3","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1555","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"7CQAMU6HZY5V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7CQAMU6HZY5VBM7Y","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7CQAMU6H","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7CQAMU6HZY5VBM7Y3OCJHG635F","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-07T12:07:52Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"03e4edec38604391f62c06a130efdb5c57e504f8b395cc62009b88da2021121e","abstract_canon_sha256":"9e7c5e614b4d88baa0eac99007cdf3671292a5510b349d6ffd371fa796249cdb"},"schema_version":"1.0"},"canonical_sha256":"f8a00653c7ce3b50b3f8db84939bdbe9524cc304fda3b747dd82914ce7800002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:14.709672Z","signature_b64":"v5YLcUSunqMVHMpqvwf9jftOyR6B7faJebVbnjKBI0qiUXOmDu0S7bO+jg0FPtZEUf/kvCzFg2W0ZSMTkxZ7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a00653c7ce3b50b3f8db84939bdbe9524cc304fda3b747dd82914ce7800002","last_reissued_at":"2026-05-18T04:05:14.709049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:14.709049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1555","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMPdm2DN1xKk1CeHd1CBRTpUVrajuQ3/XeoAGJfDAILzdzLX8cMJ9wufM339eYYOKTqkOniiVAEIxTUUFztoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:20:53.219515Z"},"content_sha256":"f9093b7e0cdf3dc9f1c18d5dfbf3d8a8b59881d4f0f22a34b26bc584b470ad1a","schema_version":"1.0","event_id":"sha256:f9093b7e0cdf3dc9f1c18d5dfbf3d8a8b59881d4f0f22a34b26bc584b470ad1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7CQAMU6HZY5VBM7Y3OCJHG635F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A scheme to protect against multiple quantum erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Francisco M. de Assis, Gilson O. dos Santos","submitted_at":"2011-11-07T12:07:52Z","abstract_excerpt":"We present a scheme able to protect k >= 3 qubits of information against the occurrence of multiple erasures, based on the code proposed by Yang et al. (2004 JETP Letters 79 236). In this scheme redundant blocks are used and we restrict to the case that each erasure must occur in distinct blocks. We explicitly characterize the encoding operation and the restoring operation required to implement this scheme. The operators used in these operations can be adjusted to construct different quantum erasure-correcting codes. A special feature of this scheme is that no measurement is required. To illus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1555","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDwpy4cTYbW+lmnZPcd5fwa6RbE0lpZvtBtk3XGewVhwT+ogOQ4/o73ckyZuLP1zEnkob+YxGges+IKUJON9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:20:53.220226Z"},"content_sha256":"3703317b8bf1eb0e5b00f752eea17485b9a4c04ed3bc53850de8106644737e72","schema_version":"1.0","event_id":"sha256:3703317b8bf1eb0e5b00f752eea17485b9a4c04ed3bc53850de8106644737e72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CQAMU6HZY5VBM7Y3OCJHG635F/bundle.json","state_url":"https://pith.science/pith/7CQAMU6HZY5VBM7Y3OCJHG635F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CQAMU6HZY5VBM7Y3OCJHG635F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T08:20:53Z","links":{"resolver":"https://pith.science/pith/7CQAMU6HZY5VBM7Y3OCJHG635F","bundle":"https://pith.science/pith/7CQAMU6HZY5VBM7Y3OCJHG635F/bundle.json","state":"https://pith.science/pith/7CQAMU6HZY5VBM7Y3OCJHG635F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CQAMU6HZY5VBM7Y3OCJHG635F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7CQAMU6HZY5VBM7Y3OCJHG635F","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":"9e7c5e614b4d88baa0eac99007cdf3671292a5510b349d6ffd371fa796249cdb","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-07T12:07:52Z","title_canon_sha256":"03e4edec38604391f62c06a130efdb5c57e504f8b395cc62009b88da2021121e"},"schema_version":"1.0","source":{"id":"1111.1555","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1555","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1555v3","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1555","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"7CQAMU6HZY5V","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7CQAMU6HZY5VBM7Y","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7CQAMU6H","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:3703317b8bf1eb0e5b00f752eea17485b9a4c04ed3bc53850de8106644737e72","target":"graph","created_at":"2026-05-18T04:05:14Z","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"},"paper":{"abstract_excerpt":"We present a scheme able to protect k >= 3 qubits of information against the occurrence of multiple erasures, based on the code proposed by Yang et al. (2004 JETP Letters 79 236). In this scheme redundant blocks are used and we restrict to the case that each erasure must occur in distinct blocks. We explicitly characterize the encoding operation and the restoring operation required to implement this scheme. The operators used in these operations can be adjusted to construct different quantum erasure-correcting codes. A special feature of this scheme is that no measurement is required. To illus","authors_text":"Francisco M. de Assis, Gilson O. dos Santos","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-07T12:07:52Z","title":"A scheme to protect against multiple quantum erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1555","kind":"arxiv","version":3},"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:f9093b7e0cdf3dc9f1c18d5dfbf3d8a8b59881d4f0f22a34b26bc584b470ad1a","target":"record","created_at":"2026-05-18T04:05:14Z","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":"9e7c5e614b4d88baa0eac99007cdf3671292a5510b349d6ffd371fa796249cdb","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-07T12:07:52Z","title_canon_sha256":"03e4edec38604391f62c06a130efdb5c57e504f8b395cc62009b88da2021121e"},"schema_version":"1.0","source":{"id":"1111.1555","kind":"arxiv","version":3}},"canonical_sha256":"f8a00653c7ce3b50b3f8db84939bdbe9524cc304fda3b747dd82914ce7800002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8a00653c7ce3b50b3f8db84939bdbe9524cc304fda3b747dd82914ce7800002","first_computed_at":"2026-05-18T04:05:14.709049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:14.709049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5YLcUSunqMVHMpqvwf9jftOyR6B7faJebVbnjKBI0qiUXOmDu0S7bO+jg0FPtZEUf/kvCzFg2W0ZSMTkxZ7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:14.709672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1555","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9093b7e0cdf3dc9f1c18d5dfbf3d8a8b59881d4f0f22a34b26bc584b470ad1a","sha256:3703317b8bf1eb0e5b00f752eea17485b9a4c04ed3bc53850de8106644737e72"],"state_sha256":"6c8fc957dc8c3f8cc6a0224479fc6981c0581772424559abca391cbb2e627bbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40wsfOAvYTXMbnzE7STOb8sg/7iWB28/k/utixnfXV6M6GmhNkgyJRhby+oeo6/VDTSaL5yVjHEYi2FXJqzqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:20:53.224104Z","bundle_sha256":"fa01c37c62e4a171be277bce2b3f02f370bf6ac178dca633753f35a14d2377d5"}}