{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IIIODLNVKDWYMQ5NYEFSOIBWJD","short_pith_number":"pith:IIIODLNV","schema_version":"1.0","canonical_sha256":"4210e1adb550ed8643adc10b27203648fbd56be3365ed40f6615c31ce2ffa8d6","source":{"kind":"arxiv","id":"1302.3110","version":1},"attestation_state":"computed","paper":{"title":"Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laszlo Gyongyosi, Sandor Imre","submitted_at":"2013-02-13T14:22:36Z","abstract_excerpt":"We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacity-achieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme."},"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":"1302.3110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-13T14:22:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c83bb3148528f1d74b5dd192cdcaea5245575f102031af81ad17886e7693d152","abstract_canon_sha256":"6e553f9f0bdf49df6b836ad28558cc27cb15ac4953bbad74b5cbc00eedba5069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.708695Z","signature_b64":"S1UU3oFuJTLBopX2S3GdWvvgXdspOjRU5rW2zjBAApWIbnF2s7Zr5zznEPdMZkeyvnK6pu6G3F/O/HmvLZDwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4210e1adb550ed8643adc10b27203648fbd56be3365ed40f6615c31ce2ffa8d6","last_reissued_at":"2026-05-18T03:33:48.708036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.708036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laszlo Gyongyosi, Sandor Imre","submitted_at":"2013-02-13T14:22:36Z","abstract_excerpt":"We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacity-achieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3110","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":"1302.3110","created_at":"2026-05-18T03:33:48.708136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3110v1","created_at":"2026-05-18T03:33:48.708136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3110","created_at":"2026-05-18T03:33:48.708136+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIIODLNVKDWY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIIODLNVKDWYMQ5N","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIIODLNV","created_at":"2026-05-18T12:27:46.883200+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/IIIODLNVKDWYMQ5NYEFSOIBWJD","json":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD.json","graph_json":"https://pith.science/api/pith-number/IIIODLNVKDWYMQ5NYEFSOIBWJD/graph.json","events_json":"https://pith.science/api/pith-number/IIIODLNVKDWYMQ5NYEFSOIBWJD/events.json","paper":"https://pith.science/paper/IIIODLNV"},"agent_actions":{"view_html":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD","download_json":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD.json","view_paper":"https://pith.science/paper/IIIODLNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3110&json=true","fetch_graph":"https://pith.science/api/pith-number/IIIODLNVKDWYMQ5NYEFSOIBWJD/graph.json","fetch_events":"https://pith.science/api/pith-number/IIIODLNVKDWYMQ5NYEFSOIBWJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD/action/storage_attestation","attest_author":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD/action/author_attestation","sign_citation":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD/action/citation_signature","submit_replication":"https://pith.science/pith/IIIODLNVKDWYMQ5NYEFSOIBWJD/action/replication_record"}},"created_at":"2026-05-18T03:33:48.708136+00:00","updated_at":"2026-05-18T03:33:48.708136+00:00"}