{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:33RPKL255L4FNB6GGKQKL33BNB","short_pith_number":"pith:33RPKL25","schema_version":"1.0","canonical_sha256":"dee2f52f5deaf85687c632a0a5ef616853ad0d42126cd0a80cacc195f02dc184","source":{"kind":"arxiv","id":"2306.13399","version":1},"attestation_state":"computed","paper":{"title":"Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Manabu Hagiwara","submitted_at":"2023-06-23T09:32:09Z","abstract_excerpt":"This manuscript presents a construction method for quantum codes capable of correcting multiple deletion errors. By introducing two new alogorithms, the alternating sandwich mapping and the block error locator, the proposed method reduces deletion error correction to erasure error correction. Unlike previous quantum deletion error-correcting codes, our approach enables flexible code rates and eliminates the requirement of knowing the number of deletions."},"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":"2306.13399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-23T09:32:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5a74c52e5aaf9ec8c4311439c22dbd50a1be7afc50d0a7847484b0e6a94c7f92","abstract_canon_sha256":"a57d6c3ad13035ad9ffd9e1ca278bad77a0554a4a3153c27eca2d2c3462139b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:05.084118Z","signature_b64":"T78Bi6OG4IXooxhMMDj7Rg9hOsEklg1CLXSbDO8YVdPKT1ls56Qco+AMcO6GxP6fLxuSpXx4zK200QVZUXsGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee2f52f5deaf85687c632a0a5ef616853ad0d42126cd0a80cacc195f02dc184","last_reissued_at":"2026-07-05T06:24:05.083703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:05.083703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Manabu Hagiwara","submitted_at":"2023-06-23T09:32:09Z","abstract_excerpt":"This manuscript presents a construction method for quantum codes capable of correcting multiple deletion errors. By introducing two new alogorithms, the alternating sandwich mapping and the block error locator, the proposed method reduces deletion error correction to erasure error correction. Unlike previous quantum deletion error-correcting codes, our approach enables flexible code rates and eliminates the requirement of knowing the number of deletions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13399","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.13399/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.13399","created_at":"2026-07-05T06:24:05.083759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13399v1","created_at":"2026-07-05T06:24:05.083759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13399","created_at":"2026-07-05T06:24:05.083759+00:00"},{"alias_kind":"pith_short_12","alias_value":"33RPKL255L4F","created_at":"2026-07-05T06:24:05.083759+00:00"},{"alias_kind":"pith_short_16","alias_value":"33RPKL255L4FNB6G","created_at":"2026-07-05T06:24:05.083759+00:00"},{"alias_kind":"pith_short_8","alias_value":"33RPKL25","created_at":"2026-07-05T06:24:05.083759+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11510","citing_title":"Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB","json":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB.json","graph_json":"https://pith.science/api/pith-number/33RPKL255L4FNB6GGKQKL33BNB/graph.json","events_json":"https://pith.science/api/pith-number/33RPKL255L4FNB6GGKQKL33BNB/events.json","paper":"https://pith.science/paper/33RPKL25"},"agent_actions":{"view_html":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB","download_json":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB.json","view_paper":"https://pith.science/paper/33RPKL25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13399&json=true","fetch_graph":"https://pith.science/api/pith-number/33RPKL255L4FNB6GGKQKL33BNB/graph.json","fetch_events":"https://pith.science/api/pith-number/33RPKL255L4FNB6GGKQKL33BNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB/action/storage_attestation","attest_author":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB/action/author_attestation","sign_citation":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB/action/citation_signature","submit_replication":"https://pith.science/pith/33RPKL255L4FNB6GGKQKL33BNB/action/replication_record"}},"created_at":"2026-07-05T06:24:05.083759+00:00","updated_at":"2026-07-05T06:24:05.083759+00:00"}